---
_id: '5455'
abstract:
- lang: eng
text: 'A fundamental algorithmic problem at the heart of static analysis is Dyck
reachability. The input is a graphwhere the edges are labeled with different types
of opening and closing parentheses, and the reachabilityinformation is computed
via paths whose parentheses are properly matched. We present new results for Dyckreachability
problems with applications to alias analysis and data-dependence analysis. Our
main contributions,that include improved upper bounds as well as lower bounds
that establish optimality guarantees, are asfollows:First, we consider Dyck reachability
on bidirected graphs, which is the standard way of performing field-sensitive
points-to analysis. Given a bidirected graph withnnodes andmedges, we present:
(i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse
Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching
lower bound that shows that our algorithm is optimalwrt to worst-case complexity;
and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously
knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence
analysis, where the task is to obtainanalysis summaries of library code in the
presence of callbacks. Our algorithm preprocesses libraries in almostlinear time,
after which the contribution of the library in the complexity of the client analysis
is only linear,and only wrt the number of call sites.Third, we prove that combinatorial
algorithms for Dyck reachability on general graphs with truly sub-cubic bounds
cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean
MatrixMultiplication, which is a long-standing open problem. Thus we establish
that the existing combinatorialalgorithms for Dyck reachability are (conditionally)
optimal for general graphs. We also show that the samehardness holds for graphs
of constant treewidth.Finally, we provide a prototype implementation of our algorithms
for both alias analysis and data-dependenceanalysis. Our experimental evaluation
demonstrates that the new algorithms significantly outperform allexisting methods
on the two problems, over real-world benchmarks.'
alternative_title:
- IST Austria Technical Report
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: Bhavya
full_name: Choudhary, Bhavya
last_name: Choudhary
- 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, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for
Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1
apa: Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck
reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
chicago: Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal
Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017.
https://doi.org/10.15479/AT:IST-2017-870-v1-1.
ieee: K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability
for data-dependence and alias analysis. IST Austria, 2017.
ista: Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability
for data-dependence and alias analysis, IST Austria, 37p.
mla: Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence
and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.
short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for
Data-Dependence and Alias Analysis, IST Austria, 2017.
date_created: 2018-12-12T11:39:26Z
date_published: 2017-10-23T00:00:00Z
date_updated: 2023-02-21T15:54:10Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-870-v1-1
file:
- access_level: open_access
checksum: 177a84a46e3ac17e87b31534ad16a4c9
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:02Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5524'
file_name: IST-2017-870-v1+1_main.pdf
file_size: 960491
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '37'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '870'
related_material:
record:
- id: '10416'
relation: later_version
status: public
status: public
title: Optimal Dyck reachability for data-dependence and alias analysis
type: technical_report
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2017'
...
---
_id: '5456'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1.
For acyclic architectures, our algorithm is guaranteed to explore exactly one
representative trace from each observation class, while spending polynomial time
per class. Hence, our algorithm is optimal wrt the observation equivalence, and
in several cases explores exponentially fewer traces than any enumerative method
based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider
an equivalence between traces which is finer than the observation equivalence;
but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially
coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
\r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based
DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show
a significant reduction in both running time and the number of explored equivalence
classes."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Marek
full_name: Chalupa, Marek
last_name: Chalupa
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Nishant
full_name: Sinha, Nishant
last_name: Sinha
- first_name: Kapil
full_name: Vaidya, Kapil
last_name: Vaidya
citation:
ama: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric
Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1
apa: Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K.
(2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1
chicago: Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha,
and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria,
2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
ieee: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric
dynamic partial order reduction. IST Austria, 2017.
ista: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric
dynamic partial order reduction, IST Austria, 36p.
mla: Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction.
IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.
short: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric
Dynamic Partial Order Reduction, IST Austria, 2017.
date_created: 2018-12-12T11:39:26Z
date_published: 2017-10-23T00:00:00Z
date_updated: 2023-02-23T12:26:54Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-872-v1-1
file:
- access_level: open_access
checksum: d2635c4cf013000f0a1b09e80f9e4ab7
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:26Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5487'
file_name: IST-2017-872-v1+1_main.pdf
file_size: 910347
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '36'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '872'
related_material:
record:
- id: '10417'
relation: later_version
status: public
- id: '5448'
relation: earlier_version
status: public
status: public
title: Data-centric dynamic partial order reduction
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '548'
abstract:
- lang: eng
text: In this work maximum entropy distributions in the space of steady states of
metabolic networks are considered upon constraining the first and second moments
of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux
distributions, emerges upon considering control on the average growth (optimization)
and its fluctuations (heterogeneity). This is applied to the carbon catabolic
core of Escherichia coli where it quantifies the metabolic activity of slow growing
phenotypes and it provides a quantitative map with metabolic fluxes, opening the
possibility to detect coexistence from flux data. A preliminary analysis on data
for E. coli cultures in standard conditions shows degeneracy for the inferred
parameters that extend in the coexistence region.
alternative_title:
- Rapid Communications
article_number: '060401'
article_processing_charge: No
author:
- first_name: Daniele
full_name: De Martino, Daniele
id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
last_name: De Martino
orcid: 0000-0002-5214-4706
citation:
ama: De Martino D. Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes. Physical Review E.
2017;96(6). doi:10.1103/PhysRevE.96.060401
apa: De Martino, D. (2017). Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes. Physical Review E.
American Physical Society. https://doi.org/10.1103/PhysRevE.96.060401
chicago: De Martino, Daniele. “Maximum Entropy Modeling of Metabolic Networks by
Constraining Growth-Rate Moments Predicts Coexistence of Phenotypes.” Physical
Review E. American Physical Society, 2017. https://doi.org/10.1103/PhysRevE.96.060401.
ieee: D. De Martino, “Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes,” Physical Review E,
vol. 96, no. 6. American Physical Society, 2017.
ista: De Martino D. 2017. Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes. Physical Review E. 96(6),
060401.
mla: De Martino, Daniele. “Maximum Entropy Modeling of Metabolic Networks by Constraining
Growth-Rate Moments Predicts Coexistence of Phenotypes.” Physical Review E,
vol. 96, no. 6, 060401, American Physical Society, 2017, doi:10.1103/PhysRevE.96.060401.
short: D. De Martino, Physical Review E 96 (2017).
date_created: 2018-12-11T11:47:06Z
date_published: 2017-12-21T00:00:00Z
date_updated: 2023-10-10T13:29:38Z
day: '21'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.96.060401
ec_funded: 1
intvolume: ' 96'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1707.00320
month: '12'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review E
publication_identifier:
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
publist_id: '7266'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maximum entropy modeling of metabolic networks by constraining growth-rate
moments predicts coexistence of phenotypes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2017'
...
---
_id: '549'
abstract:
- lang: eng
text: Model checking is usually based on a comprehensive traversal of the state
space. Causality-based model checking is a radically different approach that instead
analyzes the cause-effect relationships in a program. We give an overview on a
new class of model checking algorithms that capture the causal relationships in
a special data structure called concurrent traces. Concurrent traces identify
key events in an execution history and link them through their cause-effect relationships.
The model checker builds a tableau of concurrent traces, where the case splits
represent different causal explanations of a hypothetical error. Causality-based
model checking has been implemented in the ARCTOR tool, and applied to previously
intractable multi-threaded benchmarks.
alternative_title:
- EPTCS
article_processing_charge: No
author:
- first_name: Bernd
full_name: Finkbeiner, Bernd
last_name: Finkbeiner
- first_name: Andrey
full_name: Kupriyanov, Andrey
id: 2C311BF8-F248-11E8-B48F-1D18A9856A87
last_name: Kupriyanov
citation:
ama: 'Finkbeiner B, Kupriyanov A. Causality-based model checking. In: Electronic
Proceedings in Theoretical Computer Science. Vol 259. Open Publishing Association;
2017:31-38. doi:10.4204/EPTCS.259.3'
apa: 'Finkbeiner, B., & Kupriyanov, A. (2017). Causality-based model checking.
In Electronic Proceedings in Theoretical Computer Science (Vol. 259, pp.
31–38). Uppsala, Sweden: Open Publishing Association. https://doi.org/10.4204/EPTCS.259.3'
chicago: Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.”
In Electronic Proceedings in Theoretical Computer Science, 259:31–38. Open
Publishing Association, 2017. https://doi.org/10.4204/EPTCS.259.3.
ieee: B. Finkbeiner and A. Kupriyanov, “Causality-based model checking,” in Electronic
Proceedings in Theoretical Computer Science, Uppsala, Sweden, 2017, vol. 259,
pp. 31–38.
ista: 'Finkbeiner B, Kupriyanov A. 2017. Causality-based model checking. Electronic
Proceedings in Theoretical Computer Science. CREST: Causal Reasoning for Embedded
and Safety-Critical Systems Technologies, EPTCS, vol. 259, 31–38.'
mla: Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.”
Electronic Proceedings in Theoretical Computer Science, vol. 259, Open
Publishing Association, 2017, pp. 31–38, doi:10.4204/EPTCS.259.3.
short: B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical
Computer Science, Open Publishing Association, 2017, pp. 31–38.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies'
start_date: 2017-04-29
date_created: 2018-12-11T11:47:07Z
date_published: 2017-10-10T00:00:00Z
date_updated: 2023-10-17T12:02:46Z
day: '10'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4204/EPTCS.259.3
file:
- access_level: open_access
checksum: 6274f6c0da3376a7b079180d81568518
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:21Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4939'
file_name: IST-2018-925-v1+1_1710.03391v1.pdf
file_size: 209294
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 259'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1710.03391v1
month: '10'
oa: 1
oa_version: Submitted Version
page: 31 - 38
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Electronic Proceedings in Theoretical Computer Science
publication_identifier:
issn:
- 2075-2180
publication_status: published
publisher: Open Publishing Association
publist_id: '7264'
pubrep_id: '925'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Causality-based model checking
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 259
year: '2017'
...
---
_id: '550'
abstract:
- lang: eng
text: For large random matrices X with independent, centered entries but not necessarily
identical variances, the eigenvalue density of XX* is well-approximated by a deterministic
measure on ℝ. We show that the density of this measure has only square and cubic-root
singularities away from zero. We also extend the bulk local law in [5] to the
vicinity of these singularities.
article_number: '63'
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
citation:
ama: Alt J. Singularities of the density of states of random Gram matrices. Electronic
Communications in Probability. 2017;22. doi:10.1214/17-ECP97
apa: Alt, J. (2017). Singularities of the density of states of random Gram matrices.
Electronic Communications in Probability. Institute of Mathematical Statistics.
https://doi.org/10.1214/17-ECP97
chicago: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.”
Electronic Communications in Probability. Institute of Mathematical Statistics,
2017. https://doi.org/10.1214/17-ECP97.
ieee: J. Alt, “Singularities of the density of states of random Gram matrices,”
Electronic Communications in Probability, vol. 22. Institute of Mathematical
Statistics, 2017.
ista: Alt J. 2017. Singularities of the density of states of random Gram matrices.
Electronic Communications in Probability. 22, 63.
mla: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.”
Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical
Statistics, 2017, doi:10.1214/17-ECP97.
short: J. Alt, Electronic Communications in Probability 22 (2017).
date_created: 2018-12-11T11:47:07Z
date_published: 2017-11-21T00:00:00Z
date_updated: 2023-09-07T12:38:08Z
day: '21'
ddc:
- '539'
department:
- _id: LaEr
doi: 10.1214/17-ECP97
ec_funded: 1
file:
- access_level: open_access
checksum: 0ec05303a0de190de145654237984c79
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:04Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4663'
file_name: IST-2018-926-v1+1_euclid.ecp.1511233247.pdf
file_size: 470876
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Communications in Probability
publication_identifier:
issn:
- 1083589X
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '7265'
pubrep_id: '926'
quality_controlled: '1'
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Singularities of the density of states of random Gram matrices
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: 22
year: '2017'
...
---
_id: '551'
abstract:
- lang: eng
text: 'Evolutionary graph theory studies the evolutionary dynamics in a population
structure given as a connected graph. Each node of the graph represents an individual
of the population, and edges determine how offspring are placed. We consider the
classical birth-death Moran process where there are two types of individuals,
namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates
the reproductive strength. The evolutionary dynamics happens as follows: in the
initial step, in a population of all resident individuals a mutant is introduced,
and then at each step, an individual is chosen proportional to the fitness of
its type to reproduce, and the offspring replaces a neighbor uniformly at random.
The process stops when all individuals are either residents or mutants. The probability
that all individuals in the end are mutants is called the fixation probability,
which is a key factor in the rate of evolution. We consider the problem of approximating
the fixation probability. The class of algorithms that is extremely relevant for
approximation of the fixation probabilities is the Monte-Carlo simulation of the
process. Previous results present a polynomial-time Monte-Carlo algorithm for
undirected graphs when r is given in unary. First, we present a simple modification:
instead of simulating each step, we discard ineffective steps, where no node changes
type (i.e., either residents replace residents, or mutants replace mutants). Using
the above simple modification and our result that the number of effective steps
is concentrated around the expected number of effective steps, we present faster
polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are
always at least a factor O(n2/ log n) faster as compared to the previous algorithms,
where n is the number of nodes, and is polynomial even if r is given in binary.
We also present lower bounds showing that the upper bound on the expected number
of effective steps we present is asymptotically tight for undirected graphs. '
alternative_title:
- LIPIcs
article_number: '61'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation
probability of the Moran process on undirected graphs. In: Leibniz International
Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo
algorithms for fixation probability of the Moran process on undirected graphs.
In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg,
Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster
Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected
Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms
for fixation probability of the Moran process on undirected graphs,” in Leibniz
International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
ista: 'Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms
for fixation probability of the Moran process on undirected graphs. Leibniz International
Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science
(SG), LIPIcs, vol. 83, 61.'
mla: Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation
Probability of the Moran Process on Undirected Graphs.” Leibniz International
Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings
in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2017-08-21
date_created: 2018-12-11T11:47:08Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2021-01-12T08:02:34Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2017.61
file:
- access_level: open_access
checksum: 2eed5224c0e4e259484a1d71acb8ba6a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:04Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5322'
file_name: IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf
file_size: 535077
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- 978-395977046-0
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7263'
pubrep_id: '924'
quality_controlled: '1'
scopus_import: 1
status: public
title: Faster Monte Carlo algorithms for fixation probability of the Moran process
on undirected graphs
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '552'
abstract:
- lang: eng
text: 'Graph games provide the foundation for modeling and synthesis of reactive
processes. Such games are played over graphs where the vertices are controlled
by two adversarial players. We consider graph games where the objective of the
first player is the conjunction of a qualitative objective (specified as a parity
condition) and a quantitative objective (specified as a meanpayoff condition).
There are two variants of the problem, namely, the threshold problem where the
quantitative goal is to ensure that the mean-payoff value is above a threshold,
and the value problem where the quantitative goal is to ensure the optimal mean-payoff
value; in both cases ensuring the qualitative parity objective. The previous best-known
algorithms for game graphs with n vertices, m edges, parity objectives with d
priorities, and maximal absolute reward value W for mean-payoff objectives, are
as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for
the value problem. Our main contributions are faster algorithms, and the running
times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem,
and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives
with two priorities, our algorithms match the best-known bounds of the algorithms
for mean-payoff games (without conjunction with parity objectives). Our results
are relevant in synthesis of reactive systems with both functional requirement
(given as a qualitative objective) and performance requirement (given as a quantitative
objective).'
alternative_title:
- LIPIcs
article_number: '39'
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: 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, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity
games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39'
apa: 'Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms
for mean-payoff parity games. In Leibniz International Proceedings in Informatics
(Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2017.39'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster
Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings
in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
ieee: K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff
parity games,” in Leibniz International Proceedings in Informatics, Aalborg,
Denmark, 2017, vol. 83.
ista: 'Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff
parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical
Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.”
Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.
short: K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings
in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2017-08-21
date_created: 2018-12-11T11:47:08Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2023-02-14T10:06:46Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2017.39
ec_funded: 1
file:
- access_level: open_access
checksum: c67f4866ddbfd555afef1f63ae9a8fc7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:57Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5248'
file_name: IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf
file_size: 610339
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '11'
oa: 1
oa_version: Published Version
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: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- 978-395977046-0
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7262'
pubrep_id: '923'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for mean-payoff parity games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '553'
abstract:
- lang: eng
text: 'We consider two player, zero-sum, finite-state concurrent reachability games,
played for an infinite number of rounds, where in every round, each player simultaneously
and independently of the other players chooses an action, whereafter the successor
state is determined by a probability distribution given by the current state and
the chosen actions. Player 1 wins iff a designated goal state is eventually visited.
We are interested in the complexity of stationary strategies measured by their
patience, which is defined as the inverse of the smallest non-zero probability
employed. Our main results are as follows: We show that: (i) the optimal bound
on the patience of optimal and -optimal strategies, for both players is doubly
exponential; and (ii) even in games with a single non-absorbing state exponential
(in the number of actions) patience is necessary. '
alternative_title:
- LIPIcs
article_number: '55'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Kristofer
full_name: Hansen, Kristofer
last_name: Hansen
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent
safety games. In: Leibniz International Proceedings in Informatics. Vol
83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55'
apa: 'Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity
of concurrent safety games. In Leibniz International Proceedings in Informatics
(Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2017.55'
chicago: Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy
Complexity of Concurrent Safety Games.” In Leibniz International Proceedings
in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
ieee: K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent
safety games,” in Leibniz International Proceedings in Informatics, Aalborg,
Denmark, 2017, vol. 83.
ista: 'Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent
safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical
Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.'
mla: Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.”
Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.
short: K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings
in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2017-08-21
date_created: 2018-12-11T11:47:08Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2021-01-12T08:02:35Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2017.55
file:
- access_level: open_access
checksum: 7101facb56ade363205c695d72dbd173
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:29Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4753'
file_name: IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf
file_size: 549967
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.02434
month: '11'
oa: 1
oa_version: Published Version
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- 978-395977046-0
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7261'
pubrep_id: '922'
quality_controlled: '1'
scopus_import: 1
status: public
title: Strategy complexity of concurrent safety games
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '5559'
abstract:
- lang: eng
text: Strong amplifiers of natural selection
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak , Martin
last_name: 'Nowak '
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong amplifiers of natural
selection. 2017. doi:10.15479/AT:ISTA:51
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong
amplifiers of natural selection. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:51
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology
Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers
of natural selection.” Institute of Science and Technology Austria, 2017.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers
of natural selection, Institute of Science and Technology Austria, 10.15479/AT:ISTA:51.
mla: Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:51.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).
datarep_id: '51'
date_created: 2018-12-12T12:31:32Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2024-02-21T13:48:42Z
day: '02'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:ISTA:51
ec_funded: 1
file:
- access_level: open_access
checksum: b427dd46a30096a1911b245640c47af8
content_type: video/mp4
creator: system
date_created: 2018-12-12T13:05:18Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5644'
file_name: IST-2017-51-v1+2_illustration.mp4
file_size: 32987015
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
keyword:
- natural selection
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5452'
relation: research_paper
status: public
- id: '5751'
relation: research_paper
status: public
status: public
title: Strong amplifiers of natural selection
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5560'
abstract:
- lang: eng
text: "This repository contains the data collected for the manuscript \"Biased partitioning
of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity\".\r\nThe
data is compressed into a single archive. Within the archive, different folders
correspond to figures of the main text and the SI of the related publication.\r\nData
is saved as plain text, with each folder containing a separate readme file describing
the format. Typically, the data is from fluorescence microscopy measurements of
single cells growing in a microfluidic \"mother machine\" device, and consists
of relevant values (primarily arbitrary unit or normalized fluorescence measurements,
and division times / growth rates) after raw microscopy images have been processed,
segmented, and their features extracted, as described in the methods section of
the related publication."
article_processing_charge: No
author:
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Anna M
full_name: Andersson, Anna M
id: 2B8A40DA-F248-11E8-B48F-1D18A9856A87
last_name: Andersson
orcid: 0000-0003-2912-6769
- first_name: Kathrin
full_name: Tomasek, Kathrin
id: 3AEC8556-F248-11E8-B48F-1D18A9856A87
last_name: Tomasek
orcid: 0000-0003-3768-877X
- first_name: Enrique
full_name: Balleza, Enrique
last_name: Balleza
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Bergmiller T, Andersson AM, Tomasek K, et al. Biased partitioning of the multi-drug
efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. 2017. doi:10.15479/AT:ISTA:53
apa: Bergmiller, T., Andersson, A. M., Tomasek, K., Balleza, E., Kiviet, D., Hauschild,
R., … Guet, C. C. (2017). Biased partitioning of the multi-drug efflux pump AcrAB-TolC
underlies long-lived phenotypic heterogeneity. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:53
chicago: Bergmiller, Tobias, Anna M Andersson, Kathrin Tomasek, Enrique Balleza,
Daniel Kiviet, Robert Hauschild, Gašper Tkačik, and Calin C Guet. “Biased Partitioning
of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:53.
ieee: T. Bergmiller et al., “Biased partitioning of the multi-drug efflux
pump AcrAB-TolC underlies long-lived phenotypic heterogeneity.” Institute of Science
and Technology Austria, 2017.
ista: Bergmiller T, Andersson AM, Tomasek K, Balleza E, Kiviet D, Hauschild R, Tkačik
G, Guet CC. 2017. Biased partitioning of the multi-drug efflux pump AcrAB-TolC
underlies long-lived phenotypic heterogeneity, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:53.
mla: Bergmiller, Tobias, et al. Biased Partitioning of the Multi-Drug Efflux
Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:53.
short: T. Bergmiller, A.M. Andersson, K. Tomasek, E. Balleza, D. Kiviet, R. Hauschild,
G. Tkačik, C.C. Guet, (2017).
datarep_id: '53'
date_created: 2018-12-12T12:31:32Z
date_published: 2017-03-10T00:00:00Z
date_updated: 2024-02-21T13:49:00Z
day: '10'
ddc:
- '571'
department:
- _id: CaGu
- _id: GaTk
- _id: Bio
doi: 10.15479/AT:ISTA:53
file:
- access_level: open_access
checksum: d77859af757ac8025c50c7b12b52eaf3
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:38Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5603'
file_name: IST-2017-53-v1+1_Data_MDE.zip
file_size: 6773204
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
keyword:
- single cell microscopy
- mother machine microfluidic device
- AcrAB-TolC pump
- multi-drug efflux
- Escherichia coli
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '03'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '665'
relation: research_paper
status: public
status: public
title: Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived
phenotypic heterogeneity
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5561'
abstract:
- lang: eng
text: 'Graph matching problems as described in "Active Graph Matching for Automatic
Joint Segmentation and Annotation of C. Elegans." by Kainmueller, Dagmar and Jug,
Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2
hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text
format used by the feature matching solver described in "Feature Correspondence
via Graph Matching: Models and Global Optimization." by Lorenzo Torresani, Vladimir
Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip. '
acknowledgement: We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions.
article_processing_charge: No
author:
- first_name: Dagmar
full_name: Kainmueller, Dagmar
last_name: Kainmueller
- first_name: Florian
full_name: Jug, Florian
last_name: Jug
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Gene
full_name: Meyers, Gene
last_name: Meyers
citation:
ama: Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating
C. Elegans. 2017. doi:10.15479/AT:ISTA:57
apa: Kainmueller, D., Jug, F., Rother, C., & Meyers, G. (2017). Graph matching
problems for annotating C. Elegans. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:57
chicago: Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph
Matching Problems for Annotating C. Elegans.” Institute of Science and Technology
Austria, 2017. https://doi.org/10.15479/AT:ISTA:57.
ieee: D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems
for annotating C. Elegans.” Institute of Science and Technology Austria, 2017.
ista: Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for
annotating C. Elegans, Institute of Science and Technology Austria, 10.15479/AT:ISTA:57.
mla: Kainmueller, Dagmar, et al. Graph Matching Problems for Annotating C. Elegans.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:57.
short: D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).
datarep_id: '57'
date_created: 2018-12-12T12:31:32Z
date_published: 2017-02-13T00:00:00Z
date_updated: 2024-02-21T13:46:31Z
day: '13'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:57
file:
- access_level: open_access
checksum: 3dc3e1306a66028a34181ebef2923139
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:54Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5614'
file_name: IST-2017-57-v1+1_wormMatchingProblems.zip
file_size: 327042819
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
keyword:
- graph matching
- feature matching
- QAP
- MAP-inference
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Graph matching problems for annotating C. Elegans
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5562'
abstract:
- lang: eng
text: "This data was collected as part of the study [1]. It consists of preprocessed
multi-electrode array recording from 160 salamander retinal ganglion cells responding
to 297 repeats of a 19 s natural movie. The data is available in two formats:
(1) a .mat file containing an array with dimensions “number of repeats” x “number
of neurons” x “time in a repeat”; (2) a zipped .txt file containing the same data
represented as an array with dimensions “number of neurons” x “number of samples”,
where the number of samples is equal to the product of the number of repeats and
timebins within a repeat. The time dimension is divided into 20 ms time windows,
and the array is binary indicating whether a given cell elicited at least one
spike in a given time window during a particular repeat. See the reference below
for details regarding collection and preprocessing:\r\n\r\n[1] Tkačik G, Marre
O, Amodei D, Schneidman E, Bialek W, Berry MJ II. Searching for Collective Behavior
in a Large Network of Sensory Neurons. PLoS Comput Biol. 2014;10(1):e1003408."
article_processing_charge: No
author:
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Dario
full_name: Amodei, Dario
last_name: Amodei
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: William
full_name: Bialek, William
last_name: Bialek
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: Marre O, Tkačik G, Amodei D, Schneidman E, Bialek W, Berry M. Multi-electrode
array recording from salamander retinal ganglion cells. 2017. doi:10.15479/AT:ISTA:61
apa: Marre, O., Tkačik, G., Amodei, D., Schneidman, E., Bialek, W., & Berry,
M. (2017). Multi-electrode array recording from salamander retinal ganglion cells.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:61
chicago: Marre, Olivier, Gašper Tkačik, Dario Amodei, Elad Schneidman, William Bialek,
and Michael Berry. “Multi-Electrode Array Recording from Salamander Retinal Ganglion
Cells.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:61.
ieee: O. Marre, G. Tkačik, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Multi-electrode
array recording from salamander retinal ganglion cells.” Institute of Science
and Technology Austria, 2017.
ista: Marre O, Tkačik G, Amodei D, Schneidman E, Bialek W, Berry M. 2017. Multi-electrode
array recording from salamander retinal ganglion cells, Institute of Science and
Technology Austria, 10.15479/AT:ISTA:61.
mla: Marre, Olivier, et al. Multi-Electrode Array Recording from Salamander Retinal
Ganglion Cells. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:61.
short: O. Marre, G. Tkačik, D. Amodei, E. Schneidman, W. Bialek, M. Berry, (2017).
datarep_id: '61'
date_created: 2018-12-12T12:31:33Z
date_published: 2017-02-27T00:00:00Z
date_updated: 2024-02-21T13:46:14Z
day: '27'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.15479/AT:ISTA:61
file:
- access_level: open_access
checksum: e620eff260646f57b479a69492c8b765
content_type: application/octet-stream
creator: system
date_created: 2018-12-12T13:03:04Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5622'
file_name: IST-2017-61-v1+1_bint_fishmovie32_100.mat
file_size: 1336936
relation: main_file
- access_level: open_access
checksum: de83f9b81ea0aae3cddfc3ed982e0759
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:05Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5623'
file_name: IST-2017-61-v1+2_bint_fishmovie32_100.zip
file_size: 1897543
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
keyword:
- multi-electrode recording
- retinal ganglion cells
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '2257'
relation: research_paper
status: public
status: public
title: Multi-electrode array recording from salamander retinal ganglion cells
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5563'
abstract:
- lang: eng
text: "MATLAB code and processed datasets available for reproducing the results
in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.\r\n*equal contributions"
article_processing_charge: No
author:
- first_name: Martin
full_name: Lukacisin, Martin
id: 298FFE8C-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisin
orcid: 0000-0001-6549-4177
citation:
ama: Lukacisin M. MATLAB analysis code for “Sequence-Specific Thermodynamic Properties
of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.”
2017. doi:10.15479/AT:ISTA:64
apa: Lukacisin, M. (2017). MATLAB analysis code for “Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:64
chicago: Lukacisin, Martin. “MATLAB Analysis Code for ‘Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.’” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:64.
ieee: M. Lukacisin, “MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties
of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’”
Institute of Science and Technology Austria, 2017.
ista: Lukacisin M. 2017. MATLAB analysis code for ‘Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:64.
mla: Lukacisin, Martin. MATLAB Analysis Code for “Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.” Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:64.
short: M. Lukacisin, (2017).
datarep_id: '64'
date_created: 2018-12-12T12:31:33Z
date_published: 2017-03-20T00:00:00Z
date_updated: 2024-02-21T13:46:47Z
day: '20'
ddc:
- '571'
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:64
file:
- access_level: open_access
checksum: ee697f2b1ade4dc14d6ac0334dd832ab
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:37Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5602'
file_name: IST-2016-45-v1+1_PaperCode.zip
file_size: 296722548
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '03'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic
Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5564'
abstract:
- lang: eng
text: Compressed Fastq files with whole-genome sequencing data of IS-wt strain D
and clones from four evolved populations (A11, C08, C10, D08). Information on
this data collection is available in the Methods Section of the primary publication.
article_processing_charge: No
author:
- first_name: Magdalena
full_name: Steinrück, Magdalena
id: 2C023F40-F248-11E8-B48F-1D18A9856A87
last_name: Steinrück
orcid: 0000-0003-1229-9719
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Steinrück M, Guet CC. Fastq files for “Complex chromosomal neighborhood effects
determine the adaptive potential of a gene under selection.” 2017. doi:10.15479/AT:ISTA:65
apa: Steinrück, M., & Guet, C. C. (2017). Fastq files for “Complex chromosomal
neighborhood effects determine the adaptive potential of a gene under selection.”
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:65
chicago: Steinrück, Magdalena, and Calin C Guet. “Fastq Files for ‘Complex Chromosomal
Neighborhood Effects Determine the Adaptive Potential of a Gene under Selection.’”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:65.
ieee: M. Steinrück and C. C. Guet, “Fastq files for ‘Complex chromosomal neighborhood
effects determine the adaptive potential of a gene under selection.’” Institute
of Science and Technology Austria, 2017.
ista: Steinrück M, Guet CC. 2017. Fastq files for ‘Complex chromosomal neighborhood
effects determine the adaptive potential of a gene under selection’, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:65.
mla: Steinrück, Magdalena, and Calin C. Guet. Fastq Files for “Complex Chromosomal
Neighborhood Effects Determine the Adaptive Potential of a Gene under Selection.”
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:65.
short: M. Steinrück, C.C. Guet, (2017).
datarep_id: '65'
date_created: 2018-12-12T12:31:33Z
date_published: 2017-04-11T00:00:00Z
date_updated: 2024-02-21T13:47:28Z
day: '11'
ddc:
- '576'
department:
- _id: CaGu
doi: 10.15479/AT:ISTA:65
file:
- access_level: open_access
checksum: 31a0c01d022721073241a23d192cc37e
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:18Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5627'
file_name: IST-2017-65-v1+1_D_anc_1.fastq.zip
file_size: 1225959109
relation: main_file
- access_level: open_access
checksum: d8f26f83ce7e7e45436121f9c6cd9b83
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:30Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5628'
file_name: IST-2017-65-v1+1_D_anc_2.fastq.zip
file_size: 1422656107
relation: main_file
- access_level: open_access
checksum: e07b99bcfe55b5f132ca03b8b48c8cbc
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:33Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5629'
file_name: IST-2017-65-v1+2_D_A11_1.fastq.zip
file_size: 565014975
relation: main_file
- access_level: open_access
checksum: eda86143d5f32d844b54f8530041e32b
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:42Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5630'
file_name: IST-2017-65-v1+3_D_A11_2.fastq.zip
file_size: 564490030
relation: main_file
- access_level: open_access
checksum: 906d44f950c1626d9b99f34fbf89cb12
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:46Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5631'
file_name: IST-2017-65-v1+4_D_C10_1.fastq.zip
file_size: 875430169
relation: main_file
- access_level: open_access
checksum: 6ca14a032a79e0c787106bdf635725c9
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:54Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5632'
file_name: IST-2017-65-v1+6_D_C08_2.fastq.zip
file_size: 638298201
relation: main_file
- access_level: open_access
checksum: 66ab16ddb5ba64b2e263ef746ebf2893
content_type: application/zip
creator: system
date_created: 2018-12-12T13:04:01Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5633'
file_name: IST-2017-65-v1+5_D_C10_2.fastq.zip
file_size: 894702866
relation: main_file
- access_level: open_access
checksum: 82607970174f8d37773b7d3acc712195
content_type: application/zip
creator: system
date_created: 2018-12-12T13:04:07Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5634'
file_name: IST-2017-65-v1+7_D_C08_1.fastq.zip
file_size: 623648989
relation: main_file
- access_level: open_access
checksum: 225c30b243268c7dda9d6f8327933252
content_type: application/zip
creator: system
date_created: 2018-12-12T13:04:11Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5635'
file_name: IST-2017-65-v1+8_D_D08_1.fastq.zip
file_size: 259359583
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
month: '04'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '704'
relation: research_paper
status: public
status: public
title: Fastq files for "Complex chromosomal neighborhood effects determine the adaptive
potential of a gene under selection"
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5565'
abstract:
- lang: eng
text: "One of the key questions in understanding plant development is how single
cells behave in a larger context of the tissue. Therefore, it requires the observation
of the whole organ with a high spatial- as well as temporal resolution over prolonged
periods of time, which may cause photo-toxic effects. This protocol shows a plant
sample preparation method for light-sheet microscopy, which is characterized by
mounting the plant vertically on the surface of a gel. The plant is mounted in
such a way that the roots are submerged in a liquid medium while the leaves remain
in the air. In order to ensure photosynthetic activity of the plant, a custom-made
lighting system illuminates the leaves. To keep the roots in darkness the water
surface is covered with sheets of black plastic foil. This method allows long-term
imaging of plant organ development in standardized conditions. \r\nThe Video is
licensed under a CC BY NC ND license. "
acknowledgement: 'fund: FP7-ERC 0101109'
article_processing_charge: No
author:
- first_name: Daniel
full_name: Von Wangenheim, Daniel
id: 49E91952-F248-11E8-B48F-1D18A9856A87
last_name: Von Wangenheim
orcid: 0000-0002-6862-1247
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: von Wangenheim D, Hauschild R, Friml J. Light Sheet Fluorescence microscopy
of plant roots growing on the surface of a gel. 2017. doi:10.15479/AT:ISTA:66
apa: von Wangenheim, D., Hauschild, R., & Friml, J. (2017). Light Sheet Fluorescence
microscopy of plant roots growing on the surface of a gel. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:66
chicago: Wangenheim, Daniel von, Robert Hauschild, and Jiří Friml. “Light Sheet
Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” Institute
of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:66.
ieee: D. von Wangenheim, R. Hauschild, and J. Friml, “Light Sheet Fluorescence microscopy
of plant roots growing on the surface of a gel.” Institute of Science and Technology
Austria, 2017.
ista: von Wangenheim D, Hauschild R, Friml J. 2017. Light Sheet Fluorescence microscopy
of plant roots growing on the surface of a gel, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:66.
mla: von Wangenheim, Daniel, et al. Light Sheet Fluorescence Microscopy of Plant
Roots Growing on the Surface of a Gel. Institute of Science and Technology
Austria, 2017, doi:10.15479/AT:ISTA:66.
short: D. von Wangenheim, R. Hauschild, J. Friml, (2017).
datarep_id: '66'
date_created: 2018-12-12T12:31:34Z
date_published: 2017-04-10T00:00:00Z
date_updated: 2025-05-07T11:12:33Z
day: '10'
ddc:
- '580'
department:
- _id: JiFr
- _id: Bio
doi: 10.15479/AT:ISTA:66
ec_funded: 1
file:
- access_level: open_access
checksum: b7552fc23540a85dc5a22fd4484eae71
content_type: video/mp4
creator: system
date_created: 2018-12-12T13:02:33Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5599'
file_name: IST-2017-66-v1+1_WangenheimHighResolution55044-NEW_1.mp4
file_size: 101497758
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publisher: Institute of Science and Technology Austria
publist_id: '6302'
related_material:
record:
- id: '1078'
relation: research_paper
status: public
status: public
title: Light Sheet Fluorescence microscopy of plant roots growing on the surface of
a gel
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5566'
abstract:
- lang: eng
text: Current minimal version of TipTracker
article_processing_charge: No
author:
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
citation:
ama: Hauschild R. Live tracking of moving samples in confocal microscopy for vertically
grown roots. 2017. doi:10.15479/AT:ISTA:69
apa: Hauschild, R. (2017). Live tracking of moving samples in confocal microscopy
for vertically grown roots. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:69
chicago: Hauschild, Robert. “Live Tracking of Moving Samples in Confocal Microscopy
for Vertically Grown Roots.” Institute of Science and Technology Austria, 2017.
https://doi.org/10.15479/AT:ISTA:69.
ieee: R. Hauschild, “Live tracking of moving samples in confocal microscopy for
vertically grown roots.” Institute of Science and Technology Austria, 2017.
ista: Hauschild R. 2017. Live tracking of moving samples in confocal microscopy
for vertically grown roots, Institute of Science and Technology Austria, 10.15479/AT:ISTA:69.
mla: Hauschild, Robert. Live Tracking of Moving Samples in Confocal Microscopy
for Vertically Grown Roots. Institute of Science and Technology Austria, 2017,
doi:10.15479/AT:ISTA:69.
short: R. Hauschild, (2017).
datarep_id: '69'
date_created: 2018-12-12T12:31:34Z
date_published: 2017-07-21T00:00:00Z
date_updated: 2025-05-07T11:12:32Z
day: '21'
ddc:
- '570'
department:
- _id: Bio
doi: 10.15479/AT:ISTA:69
file:
- access_level: open_access
checksum: a976000e6715106724a271cc9422be4a
content_type: application/zip
creator: system
date_created: 2018-12-12T13:04:12Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5636'
file_name: IST-2017-69-v1+2_TipTrackerZeissLSM700.zip
file_size: 1587986
relation: main_file
file_date_updated: 2020-07-14T12:47:04Z
has_accepted_license: '1'
keyword:
- tool
- tracking
- confocal microscopy
month: '07'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '946'
relation: research_paper
status: public
status: public
title: Live tracking of moving samples in confocal microscopy for vertically grown
roots
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5567'
abstract:
- lang: eng
text: Immunological synapse DC-Tcells
article_processing_charge: No
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
citation:
ama: Leithner AF. Immunological synapse DC-Tcells. 2017. doi:10.15479/AT:ISTA:71
apa: Leithner, A. F. (2017). Immunological synapse DC-Tcells. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:71
chicago: Leithner, Alexander F. “Immunological Synapse DC-Tcells.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:71.
ieee: A. F. Leithner, “Immunological synapse DC-Tcells.” Institute of Science and
Technology Austria, 2017.
ista: Leithner AF. 2017. Immunological synapse DC-Tcells, Institute of Science and
Technology Austria, 10.15479/AT:ISTA:71.
mla: Leithner, Alexander F. Immunological Synapse DC-Tcells. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:71.
short: A.F. Leithner, (2017).
datarep_id: '71'
date_created: 2018-12-12T12:31:34Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2024-02-21T13:47:00Z
day: '09'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:71
file:
- access_level: open_access
checksum: 3d6942d47d0737d064706b5728c4d8c8
content_type: video/x-msvideo
creator: system
date_created: 2018-12-12T13:02:47Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5612'
file_name: IST-2017-71-v1+1_Synapse_1.avi
file_size: 236204020
relation: main_file
- access_level: open_access
checksum: 4850006c047b0147a9e85b3c2f6f0af4
content_type: video/x-msvideo
creator: system
date_created: 2018-12-12T13:02:51Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5613'
file_name: IST-2017-71-v1+2_Synapse_2.avi
file_size: 226232496
relation: main_file
file_date_updated: 2020-07-14T12:47:04Z
has_accepted_license: '1'
keyword:
- Immunological synapse
month: '08'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Immunological synapse DC-Tcells
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5568'
abstract:
- lang: eng
text: Includes source codes, test cases, and example data used in the thesis Brittle
Fracture Simulation with Boundary Elements for Computer Graphics. Also includes
pre-built binaries of the HyENA library, but not sources - please contact the
HyENA authors to obtain these sources if required (https://mech.tugraz.at/hyena)
article_processing_charge: No
author:
- first_name: David
full_name: Hahn, David
id: 357A6A66-F248-11E8-B48F-1D18A9856A87
last_name: Hahn
citation:
ama: 'Hahn D. Source codes: Brittle fracture simulation with boundary elements for
computer graphics. 2017. doi:10.15479/AT:ISTA:73'
apa: 'Hahn, D. (2017). Source codes: Brittle fracture simulation with boundary elements
for computer graphics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:73'
chicago: 'Hahn, David. “Source Codes: Brittle Fracture Simulation with Boundary
Elements for Computer Graphics.” Institute of Science and Technology Austria,
2017. https://doi.org/10.15479/AT:ISTA:73.'
ieee: 'D. Hahn, “Source codes: Brittle fracture simulation with boundary elements
for computer graphics.” Institute of Science and Technology Austria, 2017.'
ista: 'Hahn D. 2017. Source codes: Brittle fracture simulation with boundary elements
for computer graphics, Institute of Science and Technology Austria, 10.15479/AT:ISTA:73.'
mla: 'Hahn, David. Source Codes: Brittle Fracture Simulation with Boundary Elements
for Computer Graphics. Institute of Science and Technology Austria, 2017,
doi:10.15479/AT:ISTA:73.'
short: D. Hahn, (2017).
datarep_id: '73'
date_created: 2018-12-12T12:31:35Z
date_published: 2017-08-16T00:00:00Z
date_updated: 2024-02-21T13:48:02Z
day: '16'
ddc:
- '004'
department:
- _id: ChWo
doi: 10.15479/AT:ISTA:73
ec_funded: 1
file:
- access_level: open_access
checksum: 2323a755842a3399cbc47d76545fc9a0
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:57Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5615'
file_name: IST-2017-73-v1+1_FractureRB_v1.1_2017_07_20_final_public.zip
file_size: 199353471
relation: main_file
file_date_updated: 2020-07-14T12:47:04Z
has_accepted_license: '1'
keyword:
- Boundary elements
- brittle fracture
- computer graphics
- fracture simulation
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '839'
relation: research_paper
status: public
status: public
title: 'Source codes: Brittle fracture simulation with boundary elements for computer
graphics'
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '557'
abstract:
- lang: eng
text: PURPOSE. Gene therapy of retinal ganglion cells (RGCs) has promise as a powerful
therapeutic for the rescue and regeneration of these cells after optic nerve damage.
However, early after damage, RGCs undergo atrophic changes, including gene silencing.
It is not known if these changes will deleteriously affect transduction and transgene
expression, or if the therapeutic protein can influence reactivation of the endogenous
genome. METHODS. Double-transgenic mice carrying a Rosa26-(LoxP)-tdTomato reporter,
and a mutant allele for the proapoptotic Bax gene were reared. The Bax mutant
blocks apoptosis, but RGCs still exhibit nuclear atrophy and gene silencing. At
times ranging from 1 hour to 4 weeks after optic nerve crush (ONC), eyes received
an intravitreal injection of AAV2 virus carrying the Cre recombinase. Successful
transduction was monitored by expression of the tdTomato reporter. Immunostaining
was used to localize tdTomato expression in select cell types. RESULTS. Successful
transduction of RGCs was achieved at all time points after ONC using AAV2 expressing
Cre from the phosphoglycerate kinase (Pgk) promoter, but not the CMV promoter.
ONC promoted an increase in the transduction of cell types in the inner nuclear
layer, including Müller cells and rod bipolar neurons. There was minimal evidence
of transduction of amacrine cells and astrocytes in the inner retina or optic
nerve. CONCLUSIONS. Damaged RGCs can be transduced and at least some endogenous
genes can be subsequently activated. Optic nerve damage may change retinal architecture
to allow greater penetration of an AAV2 virus to transduce several additional
cell types in the inner nuclear layer.
article_processing_charge: No
author:
- first_name: Robert
full_name: Nickells, Robert
last_name: Nickells
- first_name: Heather
full_name: Schmitt, Heather
last_name: Schmitt
- first_name: Margaret E
full_name: Maes, Margaret E
id: 3838F452-F248-11E8-B48F-1D18A9856A87
last_name: Maes
orcid: 0000-0001-9642-1085
- first_name: Cassandra
full_name: Schlamp, Cassandra
last_name: Schlamp
citation:
ama: Nickells R, Schmitt H, Maes ME, Schlamp C. AAV2 mediated transduction of the
mouse retina after optic nerve injury. Investigative Ophthalmology and Visual
Science. 2017;58(14):6091-6104. doi:10.1167/iovs.17-22634
apa: Nickells, R., Schmitt, H., Maes, M. E., & Schlamp, C. (2017). AAV2 mediated
transduction of the mouse retina after optic nerve injury. Investigative Ophthalmology
and Visual Science. Association for Research in Vision and Ophthalmology.
https://doi.org/10.1167/iovs.17-22634
chicago: Nickells, Robert, Heather Schmitt, Margaret E Maes, and Cassandra Schlamp.
“AAV2 Mediated Transduction of the Mouse Retina after Optic Nerve Injury.” Investigative
Ophthalmology and Visual Science. Association for Research in Vision and Ophthalmology,
2017. https://doi.org/10.1167/iovs.17-22634.
ieee: R. Nickells, H. Schmitt, M. E. Maes, and C. Schlamp, “AAV2 mediated transduction
of the mouse retina after optic nerve injury,” Investigative Ophthalmology
and Visual Science, vol. 58, no. 14. Association for Research in Vision and
Ophthalmology, pp. 6091–6104, 2017.
ista: Nickells R, Schmitt H, Maes ME, Schlamp C. 2017. AAV2 mediated transduction
of the mouse retina after optic nerve injury. Investigative Ophthalmology and
Visual Science. 58(14), 6091–6104.
mla: Nickells, Robert, et al. “AAV2 Mediated Transduction of the Mouse Retina after
Optic Nerve Injury.” Investigative Ophthalmology and Visual Science, vol.
58, no. 14, Association for Research in Vision and Ophthalmology, 2017, pp. 6091–104,
doi:10.1167/iovs.17-22634.
short: R. Nickells, H. Schmitt, M.E. Maes, C. Schlamp, Investigative Ophthalmology
and Visual Science 58 (2017) 6091–6104.
date_created: 2018-12-11T11:47:10Z
date_published: 2017-12-14T00:00:00Z
date_updated: 2023-10-10T14:06:18Z
day: '14'
ddc:
- '576'
department:
- _id: SaSi
doi: 10.1167/iovs.17-22634
file:
- access_level: open_access
checksum: d7a7b6f1fa9211a04e5e65634a0265d9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:53Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5311'
file_name: IST-2018-920-v1+1_i1552-5783-58-14-6091.pdf
file_size: 2955559
relation: main_file
file_date_updated: 2020-07-14T12:47:04Z
has_accepted_license: '1'
intvolume: ' 58'
issue: '14'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 6091 - 6104
publication: Investigative Ophthalmology and Visual Science
publication_identifier:
issn:
- '01460404'
publication_status: published
publisher: Association for Research in Vision and Ophthalmology
publist_id: '7254'
pubrep_id: '920'
quality_controlled: '1'
scopus_import: '1'
status: public
title: AAV2 mediated transduction of the mouse retina after optic nerve injury
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2017'
...
---
_id: '5570'
abstract:
- lang: eng
text: Matlab script to calculate the forward migration indexes (/) from
TrackMate spot-statistics files.
article_processing_charge: No
author:
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
citation:
ama: Hauschild R. Forward migration indexes. 2017. doi:10.15479/AT:ISTA:75
apa: Hauschild, R. (2017). Forward migration indexes. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:75
chicago: Hauschild, Robert. “Forward Migration Indexes.” Institute of Science and
Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:75.
ieee: R. Hauschild, “Forward migration indexes.” Institute of Science and Technology
Austria, 2017.
ista: Hauschild R. 2017. Forward migration indexes, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:75.
mla: Hauschild, Robert. Forward Migration Indexes. Institute of Science and
Technology Austria, 2017, doi:10.15479/AT:ISTA:75.
short: R. Hauschild, (2017).
datarep_id: '75'
date_created: 2018-12-12T12:31:35Z
date_published: 2017-10-04T00:00:00Z
date_updated: 2024-02-21T13:47:14Z
day: '04'
ddc:
- '570'
department:
- _id: Bio
doi: 10.15479/AT:ISTA:75
file:
- access_level: open_access
checksum: cb7a2fa622460eca6231d659ce590e32
content_type: application/octet-stream
creator: system
date_created: 2018-12-12T13:02:29Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5596'
file_name: IST-2017-75-v1+1_FMI.m
file_size: 799
relation: main_file
file_date_updated: 2020-07-14T12:47:04Z
has_accepted_license: '1'
keyword:
- Cell migration
- tracking
- forward migration index
- FMI
month: '10'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Forward migration indexes
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...