---
_id: '1707'
abstract:
- lang: eng
text: "Volunteer supporters play an important role in modern crisis and disaster
management. In the times of mobile Internet devices, help from thousands of volunteers
can be requested within a short time span, thus relieving professional helpers
from minor chores or geographically spread-out tasks. However, the simultaneous
availability of many volunteers also poses new problems. In particular, the volunteer
efforts must be well coordinated, or otherwise situations might emerge in which
too many idle volunteers at one location become more of a burden than a relief
to the professionals.\r\nIn this work, we study the task of optimally assigning
volunteers to selected locations, e.g. in order to perform regular measurements,
to report on damage, or to distribute information or resources to the population
in a crisis situation. We formulate the assignment tasks as an optimization problem
and propose an effective and efficient solution procedure. Experiments on real
data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show
the effectiveness and efficiency of our approach."
acknowledgement: The DRIVER FP7 project has received funding from the European Unions
Seventh Framework Programme for research, technological development and demonstration
under grant agreement no 607798. RE-ACTA was funded within the framework of the
Austrian Security Research Programme KIRAS by the Federal Ministry for Transport,
Innovation and Technology.
article_number: '7402041'
author:
- first_name: Jasmin
full_name: Pielorz, Jasmin
id: 49BC895A-F248-11E8-B48F-1D18A9856A87
last_name: Pielorz
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis
management. In: IEEE; 2016. doi:10.1109/ICT-DM.2015.7402041'
apa: 'Pielorz, J., & Lampert, C. (2016). Optimal geospatial allocation of volunteers
for crisis management. Presented at the ICT-DM: Information and Communication
Technologies for Disaster Management, Rennes, France: IEEE. https://doi.org/10.1109/ICT-DM.2015.7402041'
chicago: Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation
of Volunteers for Crisis Management.” IEEE, 2016. https://doi.org/10.1109/ICT-DM.2015.7402041.
ieee: 'J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for
crisis management,” presented at the ICT-DM: Information and Communication Technologies
for Disaster Management, Rennes, France, 2016.'
ista: 'Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for
crisis management. ICT-DM: Information and Communication Technologies for Disaster
Management, 7402041.'
mla: Pielorz, Jasmin, and Christoph Lampert. Optimal Geospatial Allocation of
Volunteers for Crisis Management. 7402041, IEEE, 2016, doi:10.1109/ICT-DM.2015.7402041.
short: J. Pielorz, C. Lampert, in:, IEEE, 2016.
conference:
end_date: 2015-12-02
location: Rennes, France
name: 'ICT-DM: Information and Communication Technologies for Disaster Management'
start_date: 2015-11-30
date_created: 2018-12-11T11:53:35Z
date_published: 2016-02-11T00:00:00Z
date_updated: 2021-01-12T06:52:39Z
day: '11'
department:
- _id: ChLa
doi: 10.1109/ICT-DM.2015.7402041
language:
- iso: eng
month: '02'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '5429'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal geospatial allocation of volunteers for crisis management
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1794'
abstract:
- lang: eng
text: We consider Conditional random fields (CRFs) with pattern-based potentials
defined on a chain. In this model the energy of a string (labeling) (Formula presented.)
is the sum of terms over intervals [i, j] where each term is non-zero only if
the substring (Formula presented.) equals a prespecified pattern w. Such CRFs
can be naturally applied to many sequence tagging problems. We present efficient
algorithms for the three standard inference tasks in a CRF, namely computing (i)
the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities
are respectively (Formula presented.), (Formula presented.) and (Formula presented.)
where L is the combined length of input patterns, (Formula presented.) is the
maximum length of a pattern, and D is the input alphabet. This improves on the
previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively
(Formula presented.), (Formula presented.) and (Formula presented.), where (Formula
presented.) is the number of input patterns. In addition, we give an efficient
algorithm for sampling, and revisit the case of MAP with non-positive weights.
acknowledgement: This work has been partially supported by the European Research Council
under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant
agreement no. 616160.
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Rustem
full_name: Takhanov, Rustem
id: 2CCAC26C-F248-11E8-B48F-1D18A9856A87
last_name: Takhanov
citation:
ama: Kolmogorov V, Takhanov R. Inference algorithms for pattern-based CRFs on sequence
data. Algorithmica. 2016;76(1):17-46. doi:10.1007/s00453-015-0017-7
apa: Kolmogorov, V., & Takhanov, R. (2016). Inference algorithms for pattern-based
CRFs on sequence data. Algorithmica. Springer. https://doi.org/10.1007/s00453-015-0017-7
chicago: Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based
CRFs on Sequence Data.” Algorithmica. Springer, 2016. https://doi.org/10.1007/s00453-015-0017-7.
ieee: V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs
on sequence data,” Algorithmica, vol. 76, no. 1. Springer, pp. 17–46, 2016.
ista: Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs
on sequence data. Algorithmica. 76(1), 17–46.
mla: Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based
CRFs on Sequence Data.” Algorithmica, vol. 76, no. 1, Springer, 2016, pp.
17–46, doi:10.1007/s00453-015-0017-7.
short: V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.
date_created: 2018-12-11T11:54:02Z
date_published: 2016-09-01T00:00:00Z
date_updated: 2023-10-17T09:51:31Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/s00453-015-0017-7
ec_funded: 1
external_id:
arxiv:
- '1210.0508'
intvolume: ' 76'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.0508
month: '09'
oa: 1
oa_version: Preprint
page: 17 - 46
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '5316'
quality_controlled: '1'
related_material:
record:
- id: '2272'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Inference algorithms for pattern-based CRFs on sequence data
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 76
year: '2016'
...
---
_id: '1833'
abstract:
- lang: eng
text: 'Relational models for contingency tables are generalizations of log-linear
models, allowing effects associated with arbitrary subsets of cells in the table,
and not necessarily containing the overall effect, that is, a common parameter
in every cell. Similarly to log-linear models, relational models can be extended
to non-negative distributions, but the extension requires more complex methods.
An extended relational model is defined as an algebraic variety, and it turns
out to be the closure of the original model with respect to the Bregman divergence.
In the extended relational model, the MLE of the cell parameters always exists
and is unique, but some of its properties may be different from those of the MLE
under log-linear models. The MLE can be computed using a generalized iterative
scaling procedure based on Bregman projections. '
author:
- first_name: Anna
full_name: Klimova, Anna
id: 31934120-F248-11E8-B48F-1D18A9856A87
last_name: Klimova
- first_name: Tamás
full_name: Rudas, Tamás
last_name: Rudas
citation:
ama: Klimova A, Rudas T. On the closure of relational models. Journal of Multivariate
Analysis. 2016;143:440-452. doi:10.1016/j.jmva.2015.10.005
apa: Klimova, A., & Rudas, T. (2016). On the closure of relational models. Journal
of Multivariate Analysis. Elsevier. https://doi.org/10.1016/j.jmva.2015.10.005
chicago: Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.”
Journal of Multivariate Analysis. Elsevier, 2016. https://doi.org/10.1016/j.jmva.2015.10.005.
ieee: A. Klimova and T. Rudas, “On the closure of relational models,” Journal
of Multivariate Analysis, vol. 143. Elsevier, pp. 440–452, 2016.
ista: Klimova A, Rudas T. 2016. On the closure of relational models. Journal of
Multivariate Analysis. 143, 440–452.
mla: Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” Journal
of Multivariate Analysis, vol. 143, Elsevier, 2016, pp. 440–52, doi:10.1016/j.jmva.2015.10.005.
short: A. Klimova, T. Rudas, Journal of Multivariate Analysis 143 (2016) 440–452.
date_created: 2018-12-11T11:54:15Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:30Z
day: '01'
department:
- _id: CaUh
doi: 10.1016/j.jmva.2015.10.005
intvolume: ' 143'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.00600
month: '01'
oa: 1
oa_version: Preprint
page: 440 - 452
publication: Journal of Multivariate Analysis
publication_status: published
publisher: Elsevier
publist_id: '5270'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the closure of relational models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 143
year: '2016'
...
---
_id: '1881'
abstract:
- lang: eng
text: 'We consider random matrices of the form H=W+λV, λ∈ℝ+, where W is a real symmetric
or complex Hermitian Wigner matrix of size N and V is a real bounded diagonal
random matrix of size N with i.i.d.\ entries that are independent of W. We assume
subexponential decay for the matrix entries of W and we choose λ∼1, so that the
eigenvalues of W and λV are typically of the same order. Further, we assume that
the density of the entries of V is supported on a single interval and is convex
near the edges of its support. In this paper we prove that there is λ+∈ℝ+ such
that the largest eigenvalues of H are in the limit of large N determined by the
order statistics of V for λ>λ+. In particular, the largest eigenvalue of H
has a Weibull distribution in the limit N→∞ if λ>λ+. Moreover, for N sufficiently
large, we show that the eigenvectors associated to the largest eigenvalues are
partially localized for λ>λ+, while they are completely delocalized for λ<λ+.
Similar results hold for the lowest eigenvalues. '
acknowledgement: "Most of the presented work was obtained while Kevin Schnelli was
staying at the IAS with the support of\r\nThe Fund For Math."
author:
- first_name: Jioon
full_name: Lee, Jioon
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Extremal eigenvalues and eigenvectors of deformed Wigner
matrices. Probability Theory and Related Fields. 2016;164(1-2):165-241.
doi:10.1007/s00440-014-0610-8
apa: Lee, J., & Schnelli, K. (2016). Extremal eigenvalues and eigenvectors of
deformed Wigner matrices. Probability Theory and Related Fields. Springer.
https://doi.org/10.1007/s00440-014-0610-8
chicago: Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors
of Deformed Wigner Matrices.” Probability Theory and Related Fields. Springer,
2016. https://doi.org/10.1007/s00440-014-0610-8.
ieee: J. Lee and K. Schnelli, “Extremal eigenvalues and eigenvectors of deformed
Wigner matrices,” Probability Theory and Related Fields, vol. 164, no.
1–2. Springer, pp. 165–241, 2016.
ista: Lee J, Schnelli K. 2016. Extremal eigenvalues and eigenvectors of deformed
Wigner matrices. Probability Theory and Related Fields. 164(1–2), 165–241.
mla: Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors of Deformed
Wigner Matrices.” Probability Theory and Related Fields, vol. 164, no.
1–2, Springer, 2016, pp. 165–241, doi:10.1007/s00440-014-0610-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 164 (2016) 165–241.
date_created: 2018-12-11T11:54:31Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2021-01-12T06:53:49Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00440-014-0610-8
ec_funded: 1
intvolume: ' 164'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1310.7057
month: '02'
oa: 1
oa_version: Preprint
page: 165 - 241
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '5215'
quality_controlled: '1'
scopus_import: 1
status: public
title: Extremal eigenvalues and eigenvectors of deformed Wigner matrices
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2016'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Magic: the Gathering is a game about magical combat for any number of players.
Formally it is a zero-sum, imperfect information stochastic game that consists
of a potentially unbounded number of steps. We consider the problem of deciding
if a move is legal in a given single step of Magic. We show that the problem is
(a) coNP-complete in general; and (b) in P if either of two small sets of cards
are not used. Our lower bound holds even for single-player Magic games. The significant
aspects of our results are as follows: First, in most real-life game problems,
the task of deciding whether a given move is legal in a single step is trivial,
and the computationally hard task is to find the best sequence of legal moves
in the presence of multiple players. In contrast, quite uniquely our hardness
result holds for single step and with only one-player. Second, we establish efficient
algorithms for important special cases of Magic.'
alternative_title:
- Frontiers in Artificial Intelligence and Applications
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
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single
step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:10.3233/978-1-61499-672-9-1432'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding
legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented
at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands:
IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432'
chicago: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016.
https://doi.org/10.3233/978-1-61499-672-9-1432.'
ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of
a single step of magic: The gathering,” presented at the ECAI: European Conference
on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.'
ista: 'Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of
a single step of magic: The gathering. ECAI: European Conference on Artificial
Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285,
1432–1439.'
mla: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016,
pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.'
short: K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
conference:
end_date: 2016-09-02
location: The Hague, Netherlands
name: 'ECAI: European Conference on Artificial Intelligence'
start_date: 2016-08-29
date_created: 2018-12-11T11:46:41Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T08:00:54Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.3233/978-1-61499-672-9-1432
file:
- access_level: open_access
checksum: 848043c812ace05e459579c923f3d3cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:59Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4658'
file_name: IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf
file_size: 2116225
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 285'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 1432 - 1439
publication_status: published
publisher: IOS Press
publist_id: '7342'
pubrep_id: '950'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The complexity of deciding legality of a single step of magic: The gathering'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 285
year: '2016'
...
---
_id: '479'
abstract:
- lang: eng
text: Clinical guidelines and decision support systems (DSS) play an important role
in daily practices of medicine. Many text-based guidelines have been encoded for
work-flow simulation of DSS to automate health care. During the collaboration
with Carle hospital to develop a DSS, we identify that, for some complex and life-critical
diseases, it is highly desirable to automatically rigorously verify some complex
temporal properties in guidelines, which brings new challenges to current simulation
based DSS with limited support of automatical formal verification and real-time
data analysis. In this paper, we conduct the first study on applying runtime verification
to cooperate with current DSS based on real-time data. Within the proposed technique,
a user-friendly domain specific language, named DRTV, is designed to specify vital
real-time data sampled by medical devices and temporal properties originated from
clinical guidelines. Some interfaces are developed for data acquisition and communication.
Then, for medical practice scenarios described in DRTV model, we will automatically
generate event sequences and runtime property verifier automata. If a temporal
property violates, real-time warnings will be produced by the formal verifier
and passed to medical DSS. We have used DRTV to specify different kinds of medical
care scenarios, and applied the proposed technique to assist existing DSS. As
presented in experiment results, in terms of warning detection, it outperforms
the only use of DSS or human inspection, and improves the quality of clinical
health care of hospital
acknowledgement: "This work is supported by NSF CNS 13-30077, NSF CNS 13-29886, NSF
CNS 15-45002, and NSFC 61303014.\r\nThe authors thank Dr. Bobby and Dr. Hill at
Carle Hospital, Urbana, IL for their help with the discussion on medical knowledge.\r\n\r\n"
alternative_title:
- Proceedings International Conference on Software Engineering
author:
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Han
full_name: Liu, Han
last_name: Liu
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Rui
full_name: Wang, Rui
last_name: Wang
- first_name: Mohamad
full_name: Hosseini, Mohamad
last_name: Hosseini
- first_name: Jiaguang
full_name: Sun, Jiaguang
last_name: Sun
- first_name: Lui
full_name: Sha, Lui
last_name: Sha
citation:
ama: 'Jiang Y, Liu H, Kong H, et al. Use runtime verification to improve the quality
of medical care practice. In: Proceedings of the 38th International Conference
on Software Engineering Companion . IEEE; 2016:112-121. doi:10.1145/2889160.2889233'
apa: 'Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., & Sha,
L. (2016). Use runtime verification to improve the quality of medical care practice.
In Proceedings of the 38th International Conference on Software Engineering
Companion (pp. 112–121). Austin, TX, USA: IEEE. https://doi.org/10.1145/2889160.2889233'
chicago: Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun,
and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care
Practice.” In Proceedings of the 38th International Conference on Software
Engineering Companion , 112–21. IEEE, 2016. https://doi.org/10.1145/2889160.2889233.
ieee: Y. Jiang et al., “Use runtime verification to improve the quality of
medical care practice,” in Proceedings of the 38th International Conference
on Software Engineering Companion , Austin, TX, USA, 2016, pp. 112–121.
ista: 'Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime
verification to improve the quality of medical care practice. Proceedings of the
38th International Conference on Software Engineering Companion . ICSE: International
Conference on Software Engineering, Proceedings International Conference on Software
Engineering, , 112–121.'
mla: Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical
Care Practice.” Proceedings of the 38th International Conference on Software
Engineering Companion , IEEE, 2016, pp. 112–21, doi:10.1145/2889160.2889233.
short: Y. Jiang, H. Liu, H. Kong, R. Wang, M. Hosseini, J. Sun, L. Sha, in:, Proceedings
of the 38th International Conference on Software Engineering Companion , IEEE,
2016, pp. 112–121.
conference:
end_date: 2016-05-22
location: Austin, TX, USA
name: 'ICSE: International Conference on Software Engineering'
start_date: 2016-05-14
date_created: 2018-12-11T11:46:42Z
date_published: 2016-05-14T00:00:00Z
date_updated: 2021-01-12T08:00:55Z
day: '14'
department:
- _id: ToHe
doi: 10.1145/2889160.2889233
language:
- iso: eng
month: '05'
oa_version: None
page: 112 - 121
publication: 'Proceedings of the 38th International Conference on Software Engineering
Companion '
publication_status: published
publisher: IEEE
publist_id: '7341'
quality_controlled: '1'
scopus_import: 1
status: public
title: Use runtime verification to improve the quality of medical care practice
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '480'
abstract:
- lang: eng
text: Graph games provide the foundation for modeling and synthesizing reactive
processes. In the synthesis of stochastic reactive processes, the traditional
model is perfect-information stochastic games, where some transitions of the game
graph are controlled by two adversarial players, and the other transitions are
executed probabilistically. We consider such games where the objective is the
conjunction of several quantitative objectives (specified as mean-payoff conditions),
which we refer to as generalized mean-payoff objectives. The basic decision problem
asks for the existence of a finite-memory strategy for a player that ensures the
generalized mean-payoff objective be satisfied with a desired probability against
all strategies of the opponent. A special case of the decision problem is the
almost-sure problem where the desired probability is 1. Previous results presented
a semi-decision procedure for -approximations of the almost-sure problem. In this
work, we show that both the almost-sure problem as well as the general basic decision
problem are coNP-complete, significantly improving the previous results. Moreover,
we show that in the case of 1-player stochastic games, randomized memoryless strategies
are sufficient and the problem can be solved in polynomial time. In contrast,
in two-player stochastic games, we show that even with randomized strategies exponential
memory is required in general, and present a matching exponential upper bound.
We also study the basic decision problem with infinite-memory strategies and present
computational complexity results for the problem. Our results are relevant in
the synthesis of stochastic reactive systems with multiple quantitative requirements.
alternative_title:
- Proceedings Symposium on Logic in Computer Science
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Perfect-information stochastic games with generalized
mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:10.1145/2933575.2934513'
apa: 'Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games
with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented
at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE,
2016. https://doi.org/10.1145/2933575.2934513.
ieee: 'K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized
mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New
York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.'
ista: 'Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized
mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium
on Logic in Computer Science, vol. 05-08-July-2016, 247–256.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE,
2016, pp. 247–56, doi:10.1145/2933575.2934513.
short: K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
conference:
end_date: 2016-07-08
location: New York, NY, USA
name: 'LICS: Logic in Computer Science'
start_date: 2016-07-05
date_created: 2018-12-11T11:46:42Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2021-01-12T08:00:56Z
day: '05'
department:
- _id: KrCh
doi: 10.1145/2933575.2934513
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.06376
month: '07'
oa: 1
oa_version: Preprint
page: 247 - 256
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: IEEE
publist_id: '7340'
quality_controlled: '1'
scopus_import: 1
status: public
title: Perfect-information stochastic games with generalized mean-payoff objectives
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 05-08-July-2016
year: '2016'
...
---
_id: '482'
abstract:
- lang: eng
text: Nonlinear electro-optical conversion of microwave radiation into the optical
telecommunication band is achieved within a crystalline whispering gallery mode
resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.
alternative_title:
- Optics InfoBase Conference Papers
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Rueda, Alfredo
last_name: Rueda
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Michele
full_name: Collodo, Michele
last_name: Collodo
- first_name: Ulrich
full_name: Vogl, Ulrich
last_name: Vogl
- first_name: Birgit
full_name: Stiller, Birgit
last_name: Stiller
- first_name: Gerhard
full_name: Schunk, Gerhard
last_name: Schunk
- first_name: Dmitry
full_name: Strekalov, Dmitry
last_name: Strekalov
- first_name: Christoph
full_name: Marquardt, Christoph
last_name: Marquardt
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
citation:
ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave
to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing
Group; 2016. doi:10.1364/NP.2016.NTh3A.6'
apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., …
Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion
using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics,
Sydney, Australia: Optica Publishing Group. https://doi.org/10.1364/NP.2016.NTh3A.6'
chicago: Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit
Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave
to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing
Group, 2016. https://doi.org/10.1364/NP.2016.NTh3A.6.
ieee: 'A. Rueda et al., “Nonlinear single sideband microwave to optical conversion
using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics,
Sydney, Australia, 2016.'
ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D,
Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single
sideband microwave to optical conversion using an electro-optic WGM-resonator.
NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .'
mla: Rueda, Alfredo, et al. Nonlinear Single Sideband Microwave to Optical Conversion
Using an Electro-Optic WGM-Resonator. Optica Publishing Group, 2016, doi:10.1364/NP.2016.NTh3A.6.
short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov,
C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing
Group, 2016.
conference:
end_date: 2016-09-08
location: Sydney, Australia
name: 'NP: Nonlinear Photonics'
start_date: 2016-09-05
date_created: 2018-12-11T11:46:43Z
date_published: 2016-08-29T00:00:00Z
date_updated: 2023-10-17T12:16:43Z
day: '29'
department:
- _id: JoFi
doi: 10.1364/NP.2016.NTh3A.6
language:
- iso: eng
month: '08'
oa_version: None
publication_status: published
publisher: Optica Publishing Group
publist_id: '7339'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonlinear single sideband microwave to optical conversion using an electro-optic
WGM-resonator
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '510'
abstract:
- lang: eng
text: 'The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted
signaling peptides that are primarily involved in the regulation of stem cell
homeostasis in different plant meristems. Particularly, the characterization of
the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on
the potential roles of CLE peptides in vascular development and wood formation.
Nevertheless, our knowledge on this gene family in a tree species is limited.
In a recent study, we reported on a systematically investigation of the CLE gene
family in Populus trichocarpa . The potential roles of PtCLE genes were studied
by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members,
many PtCLE proteins share identical CLE motifs or contain the same CLE motif as
that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression
patterns comparing to their Arabidopsis counterparts. These fi ndings indicate
the existence of both functional conservation and functional divergence between
PtCLEs and their AtCLE orthologues. Our results provide valuable resources for
future functional investigations of these critical signaling molecules in woody
plants. '
acknowledgement: 'We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement
des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading
of the article. Work in our group is supported by the National Natural Science Foundation
of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ
ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of
Higher Education from the Ministry of Education of China (20120202120009), the Scientific
Research Foundation for the Returned Overseas Chinese Scholars, State Education
Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China
(2014JM3064). '
article_number: e1191734
article_processing_charge: No
author:
- first_name: Zhijun
full_name: Liu, Zhijun
last_name: Liu
- first_name: 'Nan'
full_name: Yang, Nan
last_name: Yang
- first_name: Yanting
full_name: Lv, Yanting
last_name: Lv
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. Plant
Signaling & Behavior. 2016;11(6). doi:10.1080/15592324.2016.1191734
apa: Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., & Wang, G. (2016).
The CLE gene family in Populus trichocarpa. Plant Signaling & Behavior.
Taylor & Francis. https://doi.org/10.1080/15592324.2016.1191734
chicago: Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and
Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” Plant Signaling
& Behavior. Taylor & Francis, 2016. https://doi.org/10.1080/15592324.2016.1191734.
ieee: Z. Liu et al., “The CLE gene family in Populus trichocarpa,” Plant
Signaling & Behavior, vol. 11, no. 6. Taylor & Francis, 2016.
ista: Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family
in Populus trichocarpa. Plant Signaling & Behavior. 11(6), e1191734.
mla: Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” Plant
Signaling & Behavior, vol. 11, no. 6, e1191734, Taylor & Francis,
2016, doi:10.1080/15592324.2016.1191734.
short: Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &
Behavior 11 (2016).
date_created: 2018-12-11T11:46:53Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2023-10-17T11:13:40Z
day: '02'
department:
- _id: JiFr
doi: 10.1080/15592324.2016.1191734
intvolume: ' 11'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/
month: '06'
oa: 1
oa_version: Submitted Version
publication: Plant Signaling & Behavior
publication_status: published
publisher: Taylor & Francis
publist_id: '7308'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The CLE gene family in Populus trichocarpa
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
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: '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'
...