---
_id: '1476'
abstract:
- lang: eng
text: The dynamic assembly and disassembly of actin filaments is essential for the
formation and transport of vesicles during endocytosis. In yeast, two types of
actin structures, namely cortical patches and cytoplasmic cables, play a direct
role in endocytosis, but how their interaction is regulated remains unclear. Here,
we show that Srv2/CAP, an evolutionarily conserved actin regulator, is required
for efficient endocytosis owing to its role in the formation of the actin patches
that aid initial vesicle invagination and of the actin cables that these move
along. Deletion of the SRV2 gene resulted in the appearance of aberrant fragmented
actin cables that frequently moved past actin patches, the sites of endocytosis.
We find that the C-terminal CARP domain of Srv2p is vitally important for the
proper assembly of actin patches and cables; we also demonstrate that the N-terminal
helical folded domain of Srv2 is required for its localization to actin patches,
specifically to the ADP-actin rich region through an interaction with cofilin.
These results demonstrate the in vivo roles of Srv2p in the regulation of the
actin cytoskeleton during clathrin-mediated endocytosis
acknowledgement: We are grateful to Anthony Bretscher (Cornell University, NY) for
providing the bni1-12 bnr1Δ (Y4135) strain. J.Y.T. was supported by a Japan Society
for the Promotion of Science (JSPS) KAKENHI grant [grant number 26440067]; the Takeda
Science Foundation; and the Novartis Foundation (Japan). J.T. was supported by a
JSPS KAKENHI grant [grant number 25440054]; the Takeda Science Foundation; and the
Kurata Memorial Hitachi Science and Technology Foundation. D.E.S. was supported
by the European Union [grant number PCIG12-GA-2012-334077].
author:
- first_name: Junko
full_name: Toshima, Junko
last_name: Toshima
- first_name: Chika
full_name: Horikomi, Chika
last_name: Horikomi
- first_name: Asuka
full_name: Okada, Asuka
last_name: Okada
- first_name: Makiko
full_name: Hatori, Makiko
last_name: Hatori
- first_name: Makoto
full_name: Nagano, Makoto
last_name: Nagano
- first_name: Atsushi
full_name: Masuda, Atsushi
last_name: Masuda
- first_name: Wataru
full_name: Yamamoto, Wataru
last_name: Yamamoto
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Jiro
full_name: Toshima, Jiro
last_name: Toshima
citation:
ama: Toshima J, Horikomi C, Okada A, et al. Srv2/CAP is required for polarized actin
cable assembly and patch internalization during clathrin-mediated endocytosis.
Journal of Cell Science. 2016;129(2):367-379. doi:10.1242/jcs.176651
apa: Toshima, J., Horikomi, C., Okada, A., Hatori, M., Nagano, M., Masuda, A., …
Toshima, J. (2016). Srv2/CAP is required for polarized actin cable assembly and
patch internalization during clathrin-mediated endocytosis. Journal of Cell
Science. Company of Biologists. https://doi.org/10.1242/jcs.176651
chicago: Toshima, Junko, Chika Horikomi, Asuka Okada, Makiko Hatori, Makoto Nagano,
Atsushi Masuda, Wataru Yamamoto, Daria E Siekhaus, and Jiro Toshima. “Srv2/CAP
Is Required for Polarized Actin Cable Assembly and Patch Internalization during
Clathrin-Mediated Endocytosis.” Journal of Cell Science. Company of Biologists,
2016. https://doi.org/10.1242/jcs.176651.
ieee: J. Toshima et al., “Srv2/CAP is required for polarized actin cable
assembly and patch internalization during clathrin-mediated endocytosis,” Journal
of Cell Science, vol. 129, no. 2. Company of Biologists, pp. 367–379, 2016.
ista: Toshima J, Horikomi C, Okada A, Hatori M, Nagano M, Masuda A, Yamamoto W,
Siekhaus DE, Toshima J. 2016. Srv2/CAP is required for polarized actin cable assembly
and patch internalization during clathrin-mediated endocytosis. Journal of Cell
Science. 129(2), 367–379.
mla: Toshima, Junko, et al. “Srv2/CAP Is Required for Polarized Actin Cable Assembly
and Patch Internalization during Clathrin-Mediated Endocytosis.” Journal of
Cell Science, vol. 129, no. 2, Company of Biologists, 2016, pp. 367–79, doi:10.1242/jcs.176651.
short: J. Toshima, C. Horikomi, A. Okada, M. Hatori, M. Nagano, A. Masuda, W. Yamamoto,
D.E. Siekhaus, J. Toshima, Journal of Cell Science 129 (2016) 367–379.
date_created: 2018-12-11T11:52:14Z
date_published: 2016-01-15T00:00:00Z
date_updated: 2021-01-12T06:51:00Z
day: '15'
ddc:
- '570'
- '576'
department:
- _id: DaSi
doi: 10.1242/jcs.176651
ec_funded: 1
file:
- access_level: open_access
checksum: 2da0a09149a9ed956cdf79a95c17f08a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:08Z
date_updated: 2020-07-14T12:44:56Z
file_id: '4861'
file_name: IST-2017-767-v1+1_367.full.pdf
file_size: 7176912
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 129'
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 367 - 379
project:
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: Journal of Cell Science
publication_status: published
publisher: Company of Biologists
publist_id: '5720'
pubrep_id: '767'
quality_controlled: '1'
scopus_import: 1
status: public
title: Srv2/CAP is required for polarized actin cable assembly and patch internalization
during clathrin-mediated endocytosis
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2016'
...
---
_id: '1477'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs) with ω-regular
conditions specified as parity objectives. The class of ω-regular languages provides
a robust specification language to express properties in verification, and parity
objectives are canonical forms to express them. The qualitative analysis problem
given a POMDP and a parity objective asks whether there is a strategy to ensure
that the objective is satisfied with probability 1 (resp. positive probability).
While the qualitative analysis problems are undecidable even for special cases
of parity objectives, we establish decidability (with optimal complexity) for
POMDPs with all parity objectives under finite-memory strategies. We establish
optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative
analysis problems under finite-memory strategies for POMDPs with parity objectives.
We also present a practical approach, where we design heuristics to deal with
the exponential complexity, and have applied our implementation on a number of
POMDP examples.
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable
Markov decision processes with ω-regular objectives. Journal of Computer and
System Sciences. 2016;82(5):878-911. doi:10.1016/j.jcss.2016.02.009
apa: Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about
partially observable Markov decision processes with ω-regular objectives. Journal
of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.02.009
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable
about Partially Observable Markov Decision Processes with ω-Regular Objectives.”
Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.
ieee: K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially
observable Markov decision processes with ω-regular objectives,” Journal of
Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.
ista: Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially
observable Markov decision processes with ω-regular objectives. Journal of Computer
and System Sciences. 82(5), 878–911.
mla: Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable
Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and
System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009.
short: K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences
82 (2016) 878–911.
date_created: 2018-12-11T11:52:15Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-02-23T12:24:38Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.jcss.2016.02.009
ec_funded: 1
external_id:
arxiv:
- '1309.2802'
intvolume: ' 82'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2802
month: '08'
oa: 1
oa_version: Preprint
page: 878 - 911
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of Computer and System Sciences
publication_status: published
publisher: Elsevier
publist_id: '5718'
quality_controlled: '1'
related_material:
record:
- id: '2295'
relation: earlier_version
status: public
- id: '5400'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: What is decidable about partially observable Markov decision processes with
ω-regular objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2016'
...
---
_id: '1478'
abstract:
- lang: eng
text: We consider the Tonks-Girardeau gas subject to a random external potential.
If the disorder is such that the underlying one-particle Hamiltonian displays
localization (which is known to be generically the case), we show that there is
exponential decay of correlations in the many-body eigenstates. Moreover, there
is no Bose-Einstein condensation and no superfluidity, even at zero temperature.
article_number: '035002'
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Simone
full_name: Warzel, Simone
last_name: Warzel
citation:
ama: Seiringer R, Warzel S. Decay of correlations and absence of superfluidity in
the disordered Tonks-Girardeau gas. New Journal of Physics. 2016;18(3).
doi:10.1088/1367-2630/18/3/035002
apa: Seiringer, R., & Warzel, S. (2016). Decay of correlations and absence of
superfluidity in the disordered Tonks-Girardeau gas. New Journal of Physics.
IOP Publishing Ltd. https://doi.org/10.1088/1367-2630/18/3/035002
chicago: Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence
of Superfluidity in the Disordered Tonks-Girardeau Gas.” New Journal of Physics.
IOP Publishing Ltd., 2016. https://doi.org/10.1088/1367-2630/18/3/035002.
ieee: R. Seiringer and S. Warzel, “Decay of correlations and absence of superfluidity
in the disordered Tonks-Girardeau gas,” New Journal of Physics, vol. 18,
no. 3. IOP Publishing Ltd., 2016.
ista: Seiringer R, Warzel S. 2016. Decay of correlations and absence of superfluidity
in the disordered Tonks-Girardeau gas. New Journal of Physics. 18(3), 035002.
mla: Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence of
Superfluidity in the Disordered Tonks-Girardeau Gas.” New Journal of Physics,
vol. 18, no. 3, 035002, IOP Publishing Ltd., 2016, doi:10.1088/1367-2630/18/3/035002.
short: R. Seiringer, S. Warzel, New Journal of Physics 18 (2016).
date_created: 2018-12-11T11:52:15Z
date_published: 2016-02-29T00:00:00Z
date_updated: 2021-01-12T06:51:01Z
day: '29'
ddc:
- '510'
- '530'
department:
- _id: RoSe
doi: 10.1088/1367-2630/18/3/035002
file:
- access_level: open_access
checksum: 4f959eabc19d2a2f518318a450a4d424
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:22Z
date_updated: 2020-07-14T12:44:56Z
file_id: '5276'
file_name: IST-2016-579-v1+1_njp_18_3_035002.pdf
file_size: 965607
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 18'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: New Journal of Physics
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '5716'
pubrep_id: '579'
quality_controlled: '1'
scopus_import: 1
status: public
title: Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau
gas
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2016'
...
---
_id: '5445'
abstract:
- lang: eng
text: 'We consider the quantitative analysis problem for interprocedural control-flow
graphs (ICFGs). The input consists of an ICFG, a positive weight function that
assigns every transition a positive integer-valued number, and a labelling of
the transitions (events) as good, bad, and neutral events. The weight function
assigns to each transition a numerical value that represents ameasure of how good
or bad an event is. The quantitative analysis problem asks whether there is a
run of the ICFG where the ratio of the sum of the numerical weights of good events
versus the sum of weights of bad events in the long-run is at least a given threshold
(or equivalently, to compute the maximal ratio among all valid paths in the ICFG).
The quantitative analysis problem for ICFGs can be solved in polynomial time,
and we present an efficient and practical algorithm for the problem. We show that
several problems relevant for static program analysis, such as estimating the
worst-case execution time of a program or the average energy consumption of a
mobile application, can be modeled in our framework. We have implemented our algorithm
as a tool in the Java Soot framework. We demonstrate the effectiveness of our
approach with two case studies. First, we show that our framework provides a sound
approach (no false positives) for the analysis of inefficiently-used containers.
Second, we show that our approach can also be used for static profiling of programs
which reasons about methods that are frequently invoked. Our experimental results
show that our tool scales to relatively large benchmarks, and discovers relevant
and useful information that can be used to optimize performance of the programs. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis.
IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
apa: Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative
interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative
Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
ieee: K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural
analysis. IST Austria, 2016.
ista: Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural
analysis, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis.
IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.
short: K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis,
IST Austria, 2016.
date_created: 2018-12-12T11:39:22Z
date_published: 2016-03-31T00:00:00Z
date_updated: 2023-02-23T10:06:22Z
day: '31'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-523-v1-1
file:
- access_level: open_access
checksum: cef516fa091925b5868813e355268fb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:52Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5513'
file_name: IST-2016-523-v1+1_main.pdf
file_size: 1012204
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '523'
related_material:
record:
- id: '1604'
relation: later_version
status: public
status: public
title: Quantitative interprocedural analysis
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5446'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving termination
of recursive programs with one-dimensional arrays. Ranking functions serve as
a sound and complete approach for proving termination of non-recursive programs
without array operations. First, we generalize ranking functions to the notion
of measure functions, and prove that measure functions (i) provide a sound method
to prove termination of recursive programs (with one-dimensional arrays), and
(ii) is both sound and complete over recursive programs without array operations.
Our second contribution is the synthesis of measure functions of specific forms
in polynomial time. More precisely, we prove that (i) polynomial measure functions
over recursive programs can be synthesized in polynomial time through Farkas’
Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm
and exponentiation can be synthesized in polynomial time through abstraction of
logarithmic or exponential terms and Handelman’s Theorem. A key application of
our method is the worst-case analysis of recursive programs. While previous methods
obtain worst-case polynomial bounds of the form O(n^k), where k is an integer,
our polynomial time methods can synthesize bounds of the form O(n log n), as well
as O(n^x), where x is not an integer. We show the applicability of our automated
technique to obtain worst-case complexity of classical recursive algorithms such
as (i) Merge-Sort, the divideand-\r\nconquer algorithm for the Closest-Pair problem,
where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for
polynomial multiplication and Strassen’s algorithm for matrix multiplication,
where we obtain O(n^x) bound, where x is not an integer and close to the best-known
bounds for the respective algorithms. Finally, we present experimental results
to demonstrate the\r\neffectiveness of our approach."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3. Termination and Worst-Case Analysis
of Recursive Programs. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Termination and
worst-case analysis of recursive programs. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, and 3 Anonymous. Termination and Worst-Case
Analysis of Recursive Programs. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, and 3 Anonymous, Termination and worst-case analysis
of recursive programs. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3. 2016. Termination and worst-case analysis
of recursive programs, IST Austria, 26p.
mla: Anonymous, 1, et al. Termination and Worst-Case Analysis of Recursive Programs.
IST Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis
of Recursive Programs, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:05Z
day: '15'
ddc:
- '000'
file:
- access_level: open_access
checksum: 689069a7abbb34b21516164cbee9e0df
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:27:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6403'
file_name: popl2017a.pdf
file_size: 686241
relation: main_file
- access_level: closed
checksum: fc08022bfbaac07bac047a9407c0bbb3
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:27:31Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6404'
file_name: author_names.txt
file_size: 258
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '26'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '618'
status: public
title: Termination and worst-case analysis of recursive programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5447'
abstract:
- lang: eng
text: "We consider the problem of developing automated techniques to aid the average-case
complexity analysis of programs. Several classical textbook algorithms have quite
efficient average-case complexity, whereas the corresponding worst-case bounds
are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR).
Since the main focus of average-case analysis is to obtain efficient bounds, we
consider bounds that are either logarithmic,\r\nlinear, or almost-linear (O(log
n), O(n), O(n · log n),\r\nrespectively, where n represents the size of the input).
Our main contribution is a sound approach for deriving such average-case bounds
for randomized recursive programs. Our approach is efficient (a simple linear-time
algorithm), and it is based on (a) the analysis of recurrence relations induced
by randomized algorithms, and (b) a guess-and-check technique. Our approach can
infer the asymptotically optimal average-case bounds for classical randomized
algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR,
where the worstcase\r\nbounds are either inefficient (such as linear as compared
to logarithmic of average-case, or quadratic as compared to linear or almost-linear
of average-case), or ineffective. We have implemented our approach, and the experimental
results show that we obtain the bounds efficiently for various classical algorithms."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: 'Anonymous 1, Anonymous 2, Anonymous 3. Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria; 2016.'
apa: 'Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Average-case analysis
of programs: Automated recurrence analysis for almost-linear bounds. IST Austria.'
chicago: 'Anonymous, 1, 2 Anonymous, and 3 Anonymous. Average-Case Analysis of
Programs: Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria,
2016.'
ieee: '1 Anonymous, 2 Anonymous, and 3 Anonymous, Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds. IST Austria, 2016.'
ista: 'Anonymous 1, Anonymous 2, Anonymous 3. 2016. Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds, IST Austria, 20p.'
mla: 'Anonymous, 1, et al. Average-Case Analysis of Programs: Automated Recurrence
Analysis for Almost-Linear Bounds. IST Austria, 2016.'
short: '1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.'
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:06Z
day: '15'
ddc:
- '000'
file:
- access_level: closed
checksum: cf53cdb6d092e68db0b4a0a1506ef8fb
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6406'
file_name: listofauthors.txt
file_size: 281
relation: main_file
- access_level: open_access
checksum: 7bdd94ba13aa0dec9c46887fcf13870b
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6407'
file_name: popl2017b.pdf
file_size: 563642
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '619'
status: public
title: 'Average-case analysis of programs: Automated recurrence analysis for almost-linear
bounds'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5448'
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
arxiv: 1
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Data-Centric Dynamic
Partial Order Reduction. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2016). Data-centric
dynamic partial order reduction. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Data-Centric
Dynamic Partial Order Reduction. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Data-centric dynamic
partial order reduction. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2016. Data-centric dynamic
partial order reduction, IST Austria, 20p.
mla: Anonymous, 1, et al. Data-Centric Dynamic Partial Order Reduction. IST
Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic
Partial Order Reduction, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2023-02-23T12:27:16Z
day: '15'
ddc:
- '000'
external_id:
arxiv:
- '1610.01188'
file:
- access_level: open_access
checksum: 1d69252d66bcdf782615ddfb911d2957
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:45Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5506'
file_name: IST-2016-620-v1+1_main.pdf
file_size: 538881
relation: main_file
- access_level: closed
checksum: deabb0eb8f237cae4f9542b28b0b6eb2
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:30:40Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6405'
file_name: authornames.txt
file_size: 121
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '620'
related_material:
record:
- id: '10417'
relation: later_version
status: public
- id: '5456'
relation: later_version
status: public
status: public
title: Data-centric dynamic partial order reduction
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5449'
abstract:
- lang: eng
text: "The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population.\r\nThe
fixation probability is a fundamental quantity of natural selection, and known
to depend on the population structure.\r\nAmplifiers of natural selection are
population structures which increase the fixation probability of advantageous
mutants, as compared to the baseline case of well-mixed populations. In this work
we focus on symmetric population structures represented as undirected graphs.
In the regime of undirected graphs, the strongest amplifier known has been the
Star graph, and the existence of undirected graphs with stronger amplification
properties has remained open for over a decade.\r\nIn this work we present the
Comet and Comet-swarm families of undirected graphs. We show that for a range
of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation
probability strictly larger than the fixation probability of the Star graph, for
fixed population size and at the limit of large populations, respectively."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected
Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification
on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Amplification on Undirected Population Structures: Comets Beat Stars.
IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification
on undirected population structures: Comets beat stars. IST Austria, 2016.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on
undirected population structures: Comets beat stars, IST Austria, 22p.'
mla: 'Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures:
Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.'
short: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected
Population Structures: Comets Beat Stars, IST Austria, 2016.'
date_created: 2018-12-12T11:39:24Z
date_published: 2016-11-09T00:00:00Z
date_updated: 2023-02-23T12:22:21Z
day: '09'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-648-v1-1
file:
- access_level: open_access
checksum: 8345a8c1e7d7f0cd92516d182b7fc59e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:07Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5529'
file_name: IST-2016-648-v1+1_tr.pdf
file_size: 1264221
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Updated Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '648'
related_material:
record:
- id: '512'
relation: later_version
status: public
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5451'
alternative_title:
- IST Austria Technical Report
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. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong
amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers
of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers
of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2016-728-v1-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of
Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:24Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2023-02-23T12:27:05Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-728-v1-1
file:
- access_level: open_access
checksum: 7b8bb17c322c0556acba6ac169fa71c1
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:04Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5465'
file_name: IST-2016-728-v1+1_main.pdf
file_size: 1014732
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '728'
status: public
title: Strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5452'
alternative_title:
- IST Austria Technical Report
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. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 32p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2024-02-21T13:48:42Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-728-v2-1
ec_funded: 1
file:
- access_level: open_access
checksum: 58e895f26c82f560c0f0989bf8b08599
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:59Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5460'
file_name: IST-2017-728-v2+1_main.pdf
file_size: 811558
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '32'
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '750'
related_material:
record:
- id: '5453'
relation: later_version
status: public
- id: '5559'
relation: popular_science
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5453'
alternative_title:
- IST Austria Technical Report
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. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-749-v3-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2023-02-23T12:27:07Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-749-v3-1
file:
- access_level: open_access
checksum: 83b0313dab3bff4bdb6ac38695026fda
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:13Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5474'
file_name: IST-2017-749-v3+1_main.pdf
file_size: 1015647
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '755'
related_material:
record:
- id: '5452'
relation: earlier_version
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5550'
abstract:
- lang: eng
text: "We collected flower colour information on species in the tribe Antirrhineae
from taxonomic literature. We also retreived molecular data from GenBank for as
many of these species as possible to estimate phylogenetic relationships among
these taxa. We then used the R package 'diversitree' to examine patterns of evolutionary
transitions between anthocyanin and yellow pigmentation across the phylogeny.\r\n\r\nFor
full details of the methods see:\r\nEllis TJ and Field DL \"Repeated gains in
yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae”,
Annals of Botany (in press)"
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: Ellis T, Field D. Flower colour data and phylogeny (NEXUS) files. 2016. doi:10.15479/AT:ISTA:34
apa: Ellis, T., & Field, D. (2016). Flower colour data and phylogeny (NEXUS)
files. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:34
chicago: Ellis, Thomas, and David Field. “Flower Colour Data and Phylogeny (NEXUS)
Files.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:34.
ieee: T. Ellis and D. Field, “Flower colour data and phylogeny (NEXUS) files.” Institute
of Science and Technology Austria, 2016.
ista: Ellis T, Field D. 2016. Flower colour data and phylogeny (NEXUS) files, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:34.
mla: Ellis, Thomas, and David Field. Flower Colour Data and Phylogeny (NEXUS)
Files. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:34.
short: T. Ellis, D. Field, (2016).
datarep_id: '34'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:49:54Z
day: '19'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:34
file:
- access_level: open_access
checksum: 950f85b80427d357bfeff09608ba02e9
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:27Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5594'
file_name: IST-2016-34-v1+1_tellis_flower_colour_data.zip
file_size: 4468543
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
publist_id: '5828'
related_material:
record:
- id: '1382'
relation: research_paper
status: public
status: public
title: Flower colour data and phylogeny (NEXUS) files
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: '2016'
...
---
_id: '5551'
abstract:
- lang: eng
text: "Data from array experiments investigating pollinator behaviour on snapdragons
in controlled conditions, and their effect on plant mating. Data were collected
as part of Tom Ellis' PhD thesis , submitted February 2016.\r\n\r\nWe placed a
total of 36 plants in a grid inside a closed organza tent, with a single hive
of commercially bred bumblebees (Bombus hortorum). We used only the yellow-flowered
Antirrhinum majus striatum and the magenta-flowered Antirrhinum majus pseudomajus,
at ratios of 6:36, 12:24, 18:18, 24:12 and 30:6.\r\n\r\nAfter 24 hours to learn
how to deal with snapdragons, I observed pollinators foraging on plants, and recorded
the transitions between plants. Thereafter seeds on plants were allowed to develops.
A sample of these were grown to maturity when their flower colour could be determined,
and they were scored as yellow, magenta, or hybrid."
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Ellis T. Data on pollinator observations and offpsring phenotypes. 2016. doi:10.15479/AT:ISTA:35
apa: Ellis, T. (2016). Data on pollinator observations and offpsring phenotypes.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:35
chicago: Ellis, Thomas. “Data on Pollinator Observations and Offpsring Phenotypes.”
Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:35.
ieee: T. Ellis, “Data on pollinator observations and offpsring phenotypes.” Institute
of Science and Technology Austria, 2016.
ista: Ellis T. 2016. Data on pollinator observations and offpsring phenotypes, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:35.
mla: Ellis, Thomas. Data on Pollinator Observations and Offpsring Phenotypes.
Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:35.
short: T. Ellis, (2016).
contributor:
- first_name: David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
- first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
datarep_id: '35'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:51:27Z
day: '19'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:35
file:
- access_level: open_access
checksum: aa3eb85d52b110cd192aa23147c4d4f3
content_type: application/zip
creator: system
date_created: 2018-12-12T13:05:12Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5640'
file_name: IST-2016-35-v1+1_array_data.zip
file_size: 32775
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1398'
relation: research_paper
status: public
status: public
title: Data on pollinator observations and offpsring phenotypes
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: '2016'
...
---
_id: '5552'
abstract:
- lang: eng
text: "Data on pollinator visitation to wild snapdragons in a natural hybrid zone,
collected as part of Tom Ellis' PhD thesis (submitted February 2016).\r\n\r\nSnapdragon
flowers have a mouth-like structure which pollinators must open to access nectar.
We placed 5mm cellophane tags in these mouths, which are held in place by the
pressure of the flower until a pollinator visits. When she opens the flower, the
tag drops out, and one can infer a visit. We surveyed plants over multiple days
in 2010, 2011 and 2012.\r\n\r\nAlso included are data on phenotypic and demographic
variables which may be explanatory variables for pollinator visitation."
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Ellis T. Pollinator visitation data for wild Antirrhinum majus plants, with
phenotypic and frequency data. 2016. doi:10.15479/AT:ISTA:36
apa: Ellis, T. (2016). Pollinator visitation data for wild Antirrhinum majus plants,
with phenotypic and frequency data. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:36
chicago: Ellis, Thomas. “Pollinator Visitation Data for Wild Antirrhinum Majus Plants,
with Phenotypic and Frequency Data.” Institute of Science and Technology Austria,
2016. https://doi.org/10.15479/AT:ISTA:36.
ieee: T. Ellis, “Pollinator visitation data for wild Antirrhinum majus plants, with
phenotypic and frequency data.” Institute of Science and Technology Austria, 2016.
ista: Ellis T. 2016. Pollinator visitation data for wild Antirrhinum majus plants,
with phenotypic and frequency data., Institute of Science and Technology Austria,
10.15479/AT:ISTA:36.
mla: Ellis, Thomas. Pollinator Visitation Data for Wild Antirrhinum Majus Plants,
with Phenotypic and Frequency Data. Institute of Science and Technology Austria,
2016, doi:10.15479/AT:ISTA:36.
short: T. Ellis, (2016).
contributor:
- first_name: David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
- first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
datarep_id: '36'
date_created: 2018-12-12T12:31:30Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:51:40Z
day: '19'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:36
file:
- access_level: open_access
checksum: cbc61b523d4d475a04a737d50dc470ef
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:07Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5625'
file_name: IST-2016-36-v1+1_tag_assay_archive.zip
file_size: 44905
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1398'
relation: research_paper
status: public
status: public
title: Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic
and frequency data.
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5553'
abstract:
- lang: eng
text: "Genotypic, phenotypic and demographic data for 2128 wild snapdragons and
1127 open-pollinated progeny from a natural hybrid zone, collected as part of
Tom Ellis' PhD thesis (submitted) February 2016).\r\n\r\nTissue samples were sent
to LGC Genomics in Berlin for DNA extraction, and genotyping at 70 SNP markers
by KASPR genotyping. 29 of these SNPs failed to amplify reliably, and have been
removed from this dataset.\r\n\r\nOther data were retreived from an online database
of this population at www.antspec.org."
article_processing_charge: No
author:
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Field D, Ellis T. Inference of mating patterns among wild snapdragons in a
natural hybrid zone in 2012. 2016. doi:10.15479/AT:ISTA:37
apa: Field, D., & Ellis, T. (2016). Inference of mating patterns among wild
snapdragons in a natural hybrid zone in 2012. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:37
chicago: Field, David, and Thomas Ellis. “Inference of Mating Patterns among Wild
Snapdragons in a Natural Hybrid Zone in 2012.” Institute of Science and Technology
Austria, 2016. https://doi.org/10.15479/AT:ISTA:37.
ieee: D. Field and T. Ellis, “Inference of mating patterns among wild snapdragons
in a natural hybrid zone in 2012.” Institute of Science and Technology Austria,
2016.
ista: Field D, Ellis T. 2016. Inference of mating patterns among wild snapdragons
in a natural hybrid zone in 2012, Institute of Science and Technology Austria,
10.15479/AT:ISTA:37.
mla: Field, David, and Thomas Ellis. Inference of Mating Patterns among Wild
Snapdragons in a Natural Hybrid Zone in 2012. Institute of Science and Technology
Austria, 2016, doi:10.15479/AT:ISTA:37.
short: D. Field, T. Ellis, (2016).
contributor:
- contributor_type: project_manager
first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
datarep_id: '37'
date_created: 2018-12-12T12:31:30Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:51:14Z
day: '19'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:37
file:
- access_level: open_access
checksum: 4ae751b1fa4897fa216241f975a57313
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:02Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5620'
file_name: IST-2016-37-v1+1_paternity_archive.zip
file_size: 132808
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
keyword:
- paternity assignment
- pedigree
- matting patterns
- assortative mating
- Antirrhinum majus
- frequency-dependent selection
- plant-pollinator interaction
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1398'
relation: research_paper
status: public
status: public
title: Inference of mating patterns among wild snapdragons in a natural hybrid zone
in 2012
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: '2016'
...
---
_id: '5554'
abstract:
- lang: eng
text: "The data stored here is used in Murat Tugrul's PhD thesis (Chapter 3), which
is related to the evolution of bacterial RNA polymerase binding.\r\nMagdalena
Steinrueck (PhD Student in Calin Guet's group at IST Austria) performed the experiments
and created the data on de novo promoter evolution. Fabienne Jesse (PhD Student
in Jon Bollback's group at IST Austria) performed the experiments and created
the data on lac promoter evolution."
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
citation:
ama: Tugrul M. Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.
2016. doi:10.15479/AT:ISTA:43
apa: Tugrul, M. (2016). Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:43
chicago: Tugrul, Murat. “Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:43.
ieee: M. Tugrul, “Experimental Data for Binding Site Evolution of Bacterial RNA
Polymerase.” Institute of Science and Technology Austria, 2016.
ista: Tugrul M. 2016. Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase, Institute of Science and Technology Austria, 10.15479/AT:ISTA:43.
mla: Tugrul, Murat. Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:43.
short: M. Tugrul, (2016).
contributor:
- contributor_type: researcher
first_name: Magdalena
id: 2C023F40-F248-11E8-B48F-1D18A9856A87
last_name: Steinrück
- contributor_type: researcher
first_name: Fabienne
id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87
last_name: Jesse
datarep_id: '43'
date_created: 2018-12-12T12:31:30Z
date_published: 2016-05-12T00:00:00Z
date_updated: 2024-02-21T13:50:34Z
day: '12'
department:
- _id: NiBa
- _id: JoBo
doi: 10.15479/AT:ISTA:43
file:
- access_level: open_access
checksum: 1fc0a10bb7ce110fcb5e1fbe3cf0c4e2
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:08Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5626'
file_name: IST-2016-43-v1+1_DATA_MTugrul_PhDThesis_Chapter3.zip
file_size: 1123495
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
keyword:
- RNAP binding
- de novo promoter evolution
- lac promoter
month: '05'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1131'
relation: used_in_publication
status: public
status: public
title: Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase
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: '2016'
...
---
_id: '5555'
abstract:
- lang: eng
text: This FIJI script calculates the population average of the migration speed
as a function of time of all cells from wide field microscopy movies.
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. Fiji script to determine average speed and direction of migration
of cells. 2016. doi:10.15479/AT:ISTA:44
apa: Hauschild, R. (2016). Fiji script to determine average speed and direction
of migration of cells. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:44
chicago: Hauschild, Robert. “Fiji Script to Determine Average Speed and Direction
of Migration of Cells.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:44.
ieee: R. Hauschild, “Fiji script to determine average speed and direction of migration
of cells.” Institute of Science and Technology Austria, 2016.
ista: Hauschild R. 2016. Fiji script to determine average speed and direction of
migration of cells, Institute of Science and Technology Austria, 10.15479/AT:ISTA:44.
mla: Hauschild, Robert. Fiji Script to Determine Average Speed and Direction
of Migration of Cells. Institute of Science and Technology Austria, 2016,
doi:10.15479/AT:ISTA:44.
short: R. Hauschild, (2016).
datarep_id: '44'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-07-08T00:00:00Z
date_updated: 2024-02-21T13:50:06Z
day: '08'
ddc:
- '570'
department:
- _id: Bio
doi: 10.15479/AT:ISTA:44
file:
- access_level: open_access
checksum: 9f96cddbcd4ed689f48712ffe234d5e5
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:03Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5621'
file_name: IST-2016-44-v1+1_migrationAnalyzer.zip
file_size: 20692
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
keyword:
- cell migration
- wide field microscopy
- FIJI
month: '07'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Fiji script to determine average speed and direction of migration of 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: '2016'
...
---
_id: '5556'
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
- first_name: Matthieu
full_name: Landon, Matthieu
last_name: Landon
- first_name: Rishi
full_name: Jajoo, Rishi
last_name: Jajoo
citation:
ama: Lukacisin M, Landon M, Jajoo R. MATLAB analysis code for “Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast.” 2016. doi:10.15479/AT:ISTA:45
apa: Lukacisin, M., Landon, M., & Jajoo, R. (2016). 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:45
chicago: Lukacisin, Martin, Matthieu Landon, and Rishi Jajoo. “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, 2016. https://doi.org/10.15479/AT:ISTA:45.
ieee: M. Lukacisin, M. Landon, and R. Jajoo, “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, 2016.
ista: Lukacisin M, Landon M, Jajoo R. 2016. 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:45.
mla: Lukacisin, Martin, et al. 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, 2016, doi:10.15479/AT:ISTA:45.
short: M. Lukacisin, M. Landon, R. Jajoo, (2016).
datarep_id: '45'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-08-25T00:00:00Z
date_updated: 2024-02-21T13:51:53Z
day: '25'
ddc:
- '571'
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:45
file:
- access_level: open_access
checksum: ee697f2b1ade4dc14d6ac0334dd832ab
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:58Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5616'
file_name: IST-2016-45-v1+1_PaperCode.zip
file_size: 296722548
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
keyword:
- transcription
- pausing
- backtracking
- polymerase
- RNA
- NET-seq
- nucleosome
- basepairing
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8431'
relation: used_in_publication
status: deleted
- id: '1029'
relation: research_paper
status: public
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: '2016'
...
---
_id: '5557'
abstract:
- lang: eng
text: "Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and
256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5."
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
citation:
ama: Swoboda P. Synthetic discrete tomography problems. 2016. doi:10.15479/AT:ISTA:46
apa: Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:46
chicago: Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science
and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:46.
ieee: P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science
and Technology Austria, 2016.
ista: Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science
and Technology Austria, 10.15479/AT:ISTA:46.
mla: Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of
Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:46.
short: P. Swoboda, (2016).
contributor:
- contributor_type: data_collector
first_name: Jan
last_name: Kuske
datarep_id: '46'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-09-20T00:00:00Z
date_updated: 2024-02-21T13:50:21Z
day: '20'
ddc:
- '006'
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:46
file:
- access_level: open_access
checksum: aa5a16a0dc888da7186fb8fc45e88439
content_type: application/zip
creator: system
date_created: 2018-12-12T13:05:19Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5645'
file_name: IST-2016-46-v1+1_discrete_tomography_synthetic.zip
file_size: 36058401
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
keyword:
- discrete tomography
month: '09'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Synthetic discrete tomography problems
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: '2016'
...
---
_id: '5558'
abstract:
- lang: eng
text: PhD thesis LaTeX source code
article_processing_charge: No
author:
- first_name: Morten
full_name: Bojsen-Hansen, Morten
id: 439F0C8C-F248-11E8-B48F-1D18A9856A87
last_name: Bojsen-Hansen
orcid: 0000-0002-4417-3224
citation:
ama: Bojsen-Hansen M. Tracking, Correcting and Absorbing Water Surface Waves. 2016.
doi:10.15479/AT:ISTA:48
apa: Bojsen-Hansen, M. (2016). Tracking, Correcting and Absorbing Water Surface
Waves. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:48
chicago: Bojsen-Hansen, Morten. “Tracking, Correcting and Absorbing Water Surface
Waves.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:48.
ieee: M. Bojsen-Hansen, “Tracking, Correcting and Absorbing Water Surface Waves.”
Institute of Science and Technology Austria, 2016.
ista: Bojsen-Hansen M. 2016. Tracking, Correcting and Absorbing Water Surface Waves,
Institute of Science and Technology Austria, 10.15479/AT:ISTA:48.
mla: Bojsen-Hansen, Morten. Tracking, Correcting and Absorbing Water Surface
Waves. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:48.
short: M. Bojsen-Hansen, (2016).
datarep_id: '48'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-09-23T00:00:00Z
date_updated: 2024-02-21T13:50:48Z
day: '23'
ddc:
- '004'
department:
- _id: ChWo
doi: 10.15479/AT:ISTA:48
file:
- access_level: open_access
checksum: 5b1b256ad796fbddb4b7729f5e45e444
content_type: application/x-bzip2
creator: system
date_created: 2018-12-12T13:02:18Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5589'
file_name: IST-2016-48-v1+1_2016_Bojsen-Hansen_TCaAWSW.tar.bz2
file_size: 55237885
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
month: '09'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
publist_id: '6238'
pubrep_id: '640'
related_material:
record:
- id: '1122'
relation: other
status: public
status: public
title: Tracking, Correcting and Absorbing Water Surface Waves
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...