---
_id: '5441'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A.
(2015). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady,
and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,
IST Austria, 24p.
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015,
doi:10.15479/AT:IST-2015-340-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,
IST Austria, 2015.
date_created: 2018-12-12T11:39:21Z
date_published: 2015-07-11T00:00:00Z
date_updated: 2023-09-19T14:36:19Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-340-v1-1
file:
- access_level: open_access
checksum: df383dc62c94d7b2ea639aba088a76c6
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:09Z
date_updated: 2020-07-14T12:46:56Z
file_id: '5531'
file_name: IST-2015-340-v1+1_main.pdf
file_size: 861396
relation: main_file
file_date_updated: 2020-07-14T12:46:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '24'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '340'
related_material:
record:
- id: '1437'
relation: later_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '6009'
relation: later_version
status: public
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5442'
abstract:
- lang: eng
text: "We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural properties that arise
in program analysis.\r\nWe consider that each component of the concurrent system
is a graph with constant treewidth, and it is known that the controlflow graphs
of most programs have constant treewidth. We allow for multiple possible queries,
which arise naturally in demand driven dataflow analysis problems (e.g., alias
analysis). The study of multiple queries allows us to consider the tradeoff between
the resource usage of the \\emph{one-time} preprocessing and for \\emph{each individual}
query. The traditional approaches construct the product graph of all components
and apply the best-known graph algorithm on the product. In the traditional approach,
even the answer to a single query requires the transitive closure computation
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time.\r\n\r\nOur main contributions are algorithms
that significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
\r\neach subsequent query can be answered in at most linear time, and even the
transitive closure can be computed in almost quartic time. Furthermore, we establish
conditional optimality results that show that the worst-case running times of
our algorithms cannot be improved without achieving major breakthroughs in graph
algorithms (such as improving \r\nthe worst-case bounds for the shortest path
problem in general graphs whose current best-known bound has not been improved
in five decades). Finally, we provide a prototype implementation of our algorithms
which significantly outperforms the existing algorithmic methods on several benchmarks."
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
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Algorithms for Algebraic
Path Properties in Concurrent Systems of Constant Treewidth Components. IST
Austria; 2015.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2015). Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
IST Austria, 2015.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Algorithms for
algebraic path properties in concurrent systems of constant treewidth components.
IST Austria, 2015.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic
path properties in concurrent systems of constant treewidth components, IST Austria,
22p.
mla: Anonymous, 1, et al. Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components. IST Austria, 2015.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic
Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria,
2015.
date_created: 2018-12-12T11:39:21Z
date_published: 2015-07-14T00:00:00Z
date_updated: 2023-09-19T14:36:19Z
day: '14'
ddc:
- '000'
file:
- access_level: open_access
checksum: 98fd936102f3e057fc321ef6d316001d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:37Z
date_updated: 2020-07-14T12:46:57Z
file_id: '5498'
file_name: IST-2015-343-v2+1_main.pdf
file_size: 658747
relation: main_file
- access_level: closed
checksum: b31d09b1241b59c75e1f42dadf09d258
content_type: text/plain
creator: dernst
date_created: 2019-04-16T12:36:08Z
date_updated: 2020-07-14T12:46:57Z
file_id: '6316'
file_name: IST-2015-343-v2+2_anonymous.txt
file_size: 139
relation: main_file
file_date_updated: 2020-07-14T12:46:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '344'
related_material:
record:
- id: '1437'
relation: later_version
status: public
- id: '5441'
relation: later_version
status: public
- id: '6009'
relation: later_version
status: public
scopus_import: 1
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5443'
abstract:
- lang: eng
text: POMDPs are standard models for probabilistic planning problems, where an agent
interacts with an uncertain environment. We study the problem of almost-sure reachability,
where given a set of target states, the question is to decide whether there is
a policy to ensure that the target set is reached with probability 1 (almost-surely).
While in general the problem is EXPTIME-complete, in many practical cases policies
with a small amount of memory suffice. Moreover, the existing solution to the
problem is explicit, which first requires to construct explicitly an exponential
reduction to a belief-support MDP. In this work, we first study the existence
of observation-stationary strategies, which is NP-complete, and then small-memory
strategies. We present a symbolic algorithm by an efficient encoding to SAT and
using a SAT solver for the problem. We report experimental results demonstrating
the scalability of our symbolic (SAT-based) approach.
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Jessica
full_name: Davies, Jessica
id: 378E0060-F248-11E8-B48F-1D18A9856A87
last_name: Davies
citation:
ama: Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure
Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1
apa: Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based
algorithm for almost-sure reachability with small strategies in POMDPs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic
SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
ieee: K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm
for almost-sure reachability with small strategies in POMDPs. IST Austria,
2015.
ista: Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for
almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
mla: Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure
Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.
short: K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for
Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
date_created: 2018-12-12T11:39:22Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2023-02-21T16:24:05Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-325-v2-1
file:
- access_level: open_access
checksum: f0fa31ad8161ed655137e94012123ef9
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:05Z
date_updated: 2020-07-14T12:46:57Z
file_id: '5466'
file_name: IST-2015-325-v2+1_main.pdf
file_size: 412379
relation: main_file
file_date_updated: 2020-07-14T12:46:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '23'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '362'
related_material:
record:
- id: '1166'
relation: later_version
status: public
status: public
title: A symbolic SAT-based algorithm for almost-sure reachability with small strategies
in POMDPs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5444'
abstract:
- lang: eng
text: A comprehensive understanding of the clonal evolution of cancer is critical
for understanding neoplasia. Genome-wide sequencing data enables evolutionary
studies at unprecedented depth. However, classical phylogenetic methods often
struggle with noisy sequencing data of impure DNA samples and fail to detect subclones
that have different evolutionary trajectories. We have developed a tool, called
Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly
available sequencing technologies. Using Bayesian inference and Integer Linear
Programming, robust phylogenies consistent with the biological processes underlying
cancer evolution were obtained for pancreatic, ovarian, and prostate cancers.
Furthermore, Treeomics correctly identified sequencing artifacts such as those
resulting from low statistical power; nearly 7% of variants were misclassified
by conventional statistical methods. These artifacts can skew phylogenies by creating
illusory tumor heterogeneity among distinct samples. Importantly, we show that
the evolutionary trees generated with Treeomics are mathematically optimal.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Alvin
full_name: Makohon-Moore, Alvin
last_name: Makohon-Moore
- first_name: Jeffrey
full_name: Gerold, Jeffrey
last_name: Gerold
- first_name: Ivana
full_name: Bozic, Ivana
last_name: Bozic
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Christine
full_name: Iacobuzio-Donahue, Christine
last_name: Iacobuzio-Donahue
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Makohon-Moore A, Gerold J, et al. Reconstructing Robust Phylogenies
of Metastatic Cancers. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1
apa: Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue,
C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers.
IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1
chicago: Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu
Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing
Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.
ieee: J. Reiter et al., Reconstructing robust phylogenies of metastatic
cancers. IST Austria, 2015.
ista: Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue
C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic
cancers, IST Austria, 25p.
mla: Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic
Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.
short: J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue,
B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers,
IST Austria, 2015.
date_created: 2018-12-12T11:39:22Z
date_published: 2015-12-30T00:00:00Z
date_updated: 2020-07-14T23:05:07Z
day: '30'
ddc:
- '000'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-399-v1-1
file:
- access_level: open_access
checksum: c47d33bdda06181753c0af36f16e7b5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5485'
file_name: IST-2015-399-v1+1_treeomics.pdf
file_size: 3533200
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '399'
status: public
title: Reconstructing robust phylogenies of metastatic cancers
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5549'
abstract:
- lang: eng
text: "This repository contains the experimental part of the CAV 2015 publication
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe
extended the probabilistic model checker PRISM to represent strategies of Markov
Decision Processes as Decision Trees.\r\nThe archive contains a java executable
version of the extended tool (prism_dectree.jar) together with a few examples
of the PRISM benchmark library.\r\nTo execute the program, please have a look
at the README.txt, which provides instructions and further information on the
archive.\r\nThe archive contains scripts that (if run often enough) reproduces
the data presented in the publication."
article_processing_charge: No
author:
- first_name: Andreas
full_name: Fellner, Andreas
id: 42BABFB4-F248-11E8-B48F-1D18A9856A87
last_name: Fellner
citation:
ama: 'Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28'
apa: 'Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28'
chicago: 'Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes.” Institute
of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.'
ieee: 'A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes.” Institute of Science
and Technology Austria, 2015.'
ista: 'Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:28.'
mla: 'Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.'
short: A. Fellner, (2015).
contributor:
- first_name: Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
datarep_id: '28'
date_created: 2018-12-12T12:31:29Z
date_published: 2015-08-13T00:00:00Z
date_updated: 2024-02-21T13:52:07Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:ISTA:28
ec_funded: 1
file:
- access_level: open_access
checksum: b8bcb43c0893023cda66c1b69c16ac62
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:31Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5597'
file_name: IST-2015-28-v1+2_Fellner_DataRep.zip
file_size: 49557109
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
keyword:
- Markov Decision Process
- Decision Tree
- Probabilistic Verification
- Counterexample Explanation
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publisher: Institute of Science and Technology Austria
publist_id: '5564'
related_material:
record:
- id: '1603'
relation: popular_science
status: public
status: public
title: 'Experimental part of CAV 2015 publication: Counterexample Explanation by Learning
Small Strategies in Markov Decision Processes'
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: '2015'
...
---
_id: '5804'
abstract:
- lang: eng
text: We present here the first integer-based algorithm for constructing a well-defined
lattice sphere specified by integer radius and integer center. The algorithm evolves
from a unique correspondence between the lattice points comprising the sphere
and the distribution of sum of three square numbers in integer intervals. We characterize
these intervals to derive a useful set of recurrences, which, in turn, aids in
efficient computation. Each point of the lattice sphere is determined by resorting
to only a few primitive operations in the integer domain. The symmetry of its
quadraginta octants provides an added advantage by confining the computation to
its prima quadraginta octant. Detailed theoretical analysis and experimental results
have been furnished to demonstrate its simplicity and elegance.
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: Biswas R, Bhowmick P. From prima quadraginta octant to lattice sphere through
primitive integer operations. Theoretical Computer Science. 2015;624(4):56-72.
doi:10.1016/j.tcs.2015.11.018
apa: Biswas, R., & Bhowmick, P. (2015). From prima quadraginta octant to lattice
sphere through primitive integer operations. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2015.11.018
chicago: Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to
Lattice Sphere through Primitive Integer Operations.” Theoretical Computer
Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.11.018.
ieee: R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere
through primitive integer operations,” Theoretical Computer Science, vol.
624, no. 4. Elsevier, pp. 56–72, 2015.
ista: Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere
through primitive integer operations. Theoretical Computer Science. 624(4), 56–72.
mla: Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice
Sphere through Primitive Integer Operations.” Theoretical Computer Science,
vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi:10.1016/j.tcs.2015.11.018.
short: R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.
date_created: 2019-01-08T20:44:06Z
date_published: 2015-04-18T00:00:00Z
date_updated: 2021-01-12T08:03:36Z
day: '18'
doi: 10.1016/j.tcs.2015.11.018
extern: '1'
intvolume: ' 624'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 56-72
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: From prima quadraginta octant to lattice sphere through primitive integer operations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 624
year: '2015'
...
---
_id: '5807'
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: Biswas R, Bhowmick P. On different topological classes of spherical geodesic
paths and circles inZ3. Theoretical Computer Science. 2015;605(11):146-163.
doi:10.1016/j.tcs.2015.09.003
apa: Biswas, R., & Bhowmick, P. (2015). On different topological classes of
spherical geodesic paths and circles inZ3. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2015.09.003
chicago: Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes
of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science.
Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.09.003.
ieee: R. Biswas and P. Bhowmick, “On different topological classes of spherical
geodesic paths and circles inZ3,” Theoretical Computer Science, vol. 605,
no. 11. Elsevier, pp. 146–163, 2015.
ista: Biswas R, Bhowmick P. 2015. On different topological classes of spherical
geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.
mla: Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical
Geodesic Paths and Circles InZ3.” Theoretical Computer Science, vol. 605,
no. 11, Elsevier, 2015, pp. 146–63, doi:10.1016/j.tcs.2015.09.003.
short: R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163.
date_created: 2019-01-08T20:44:52Z
date_published: 2015-11-09T00:00:00Z
date_updated: 2021-01-12T08:03:37Z
day: '09'
doi: 10.1016/j.tcs.2015.09.003
extern: '1'
intvolume: ' 605'
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 146-163
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: On different topological classes of spherical geodesic paths and circles inZ3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 605
year: '2015'
...
---
_id: '5808'
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: Biswas R, Bhowmick P. Layer the sphere. The Visual Computer. 2015;31(6-8):787-797.
doi:10.1007/s00371-015-1101-3
apa: Biswas, R., & Bhowmick, P. (2015). Layer the sphere. The Visual Computer.
Springer Nature. https://doi.org/10.1007/s00371-015-1101-3
chicago: Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual
Computer. Springer Nature, 2015. https://doi.org/10.1007/s00371-015-1101-3.
ieee: R. Biswas and P. Bhowmick, “Layer the sphere,” The Visual Computer,
vol. 31, no. 6–8. Springer Nature, pp. 787–797, 2015.
ista: Biswas R, Bhowmick P. 2015. Layer the sphere. The Visual Computer. 31(6–8),
787–797.
mla: Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer,
vol. 31, no. 6–8, Springer Nature, 2015, pp. 787–97, doi:10.1007/s00371-015-1101-3.
short: R. Biswas, P. Bhowmick, The Visual Computer 31 (2015) 787–797.
date_created: 2019-01-08T20:45:05Z
date_published: 2015-05-08T00:00:00Z
date_updated: 2021-01-12T08:03:37Z
day: '08'
doi: 10.1007/s00371-015-1101-3
extern: '1'
intvolume: ' 31'
issue: 6-8
language:
- iso: eng
month: '05'
oa_version: None
page: 787-797
publication: The Visual Computer
publication_identifier:
issn:
- 0178-2789
- 1432-2315
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Layer the sphere
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2015'
...
---
_id: '594'
abstract:
- lang: eng
text: Transcription of eukaryotic protein-coding genes commences with the assembly
of a conserved initiation complex, which consists of RNA polymerase II (Pol II)
and the general transcription factors, at promoter DNA. After two decades of research,
the structural basis of transcription initiation is emerging. Crystal structures
of many components of the initiation complex have been resolved, and structural
information on Pol II complexes with general transcription factors has recently
been obtained. Although mechanistic details await elucidation, available data
outline how Pol II cooperates with the general transcription factors to bind to
and open promoter DNA, and how Pol II directs RNA synthesis and escapes from the
promoter.
article_processing_charge: No
author:
- first_name: Sarah
full_name: Sainsbury, Sarah
last_name: Sainsbury
- first_name: Carrie A
full_name: Bernecky, Carrie A
id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87
last_name: Bernecky
orcid: 0000-0003-0893-7036
- first_name: Patrick
full_name: Cramer, Patrick
last_name: Cramer
citation:
ama: Sainsbury S, Bernecky C, Cramer P. Structural basis of transcription initiation
by RNA polymerase II. Nature Reviews Molecular Cell Biology. 2015;16(3):129-143.
doi:10.1038/nrm3952
apa: Sainsbury, S., Bernecky, C., & Cramer, P. (2015). Structural basis of transcription
initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology.
Nature Publishing Group. https://doi.org/10.1038/nrm3952
chicago: Sainsbury, Sarah, Carrie Bernecky, and Patrick Cramer. “Structural Basis
of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular
Cell Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nrm3952.
ieee: S. Sainsbury, C. Bernecky, and P. Cramer, “Structural basis of transcription
initiation by RNA polymerase II,” Nature Reviews Molecular Cell Biology,
vol. 16, no. 3. Nature Publishing Group, pp. 129–143, 2015.
ista: Sainsbury S, Bernecky C, Cramer P. 2015. Structural basis of transcription
initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 16(3),
129–143.
mla: Sainsbury, Sarah, et al. “Structural Basis of Transcription Initiation by RNA
Polymerase II.” Nature Reviews Molecular Cell Biology, vol. 16, no. 3,
Nature Publishing Group, 2015, pp. 129–43, doi:10.1038/nrm3952.
short: S. Sainsbury, C. Bernecky, P. Cramer, Nature Reviews Molecular Cell Biology
16 (2015) 129–143.
date_created: 2018-12-11T11:47:23Z
date_published: 2015-03-26T00:00:00Z
date_updated: 2021-01-12T08:05:16Z
day: '26'
doi: 10.1038/nrm3952
extern: '1'
intvolume: ' 16'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 129 - 143
publication: Nature Reviews Molecular Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7206'
status: public
title: Structural basis of transcription initiation by RNA polymerase II
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2015'
...
---
_id: '6118'
abstract:
- lang: eng
text: 'Carbon dioxide (CO2) gradients are ubiquitous and provide animals with information
about their environment, such as the potential presence of prey or predators.
The nematode Caenorhabditis elegans avoids elevated CO2, and previous work identified
three neuron pairs called “BAG,” “AFD,” and “ASE” that respond to CO2 stimuli.
Using in vivo Ca2+ imaging and behavioral analysis, we show that C. elegans can
detect CO2 independently of these sensory pathways. Many of the C. elegans sensory
neurons we examined, including the AWC olfactory neurons, the ASJ and ASK gustatory
neurons, and the ASH and ADL nociceptors, respond to a rise in CO2 with a rise
in Ca2+. In contrast, glial sheath cells harboring the sensory endings of C. elegans’
major chemosensory neurons exhibit strong and sustained decreases in Ca2+ in response
to high CO2. Some of these CO2 responses appear to be cell intrinsic. Worms therefore
may couple detection of CO2 to that of other cues at the earliest stages of sensory
processing. We show that C. elegans persistently suppresses oviposition at high
CO2. Hermaphrodite-specific neurons (HSNs), the executive neurons driving egg-laying,
are tonically inhibited when CO2 is elevated. CO2 modulates the egg-laying system
partly through the AWC olfactory neurons: High CO2 tonically activates AWC by
a cGMP-dependent mechanism, and AWC output inhibits the HSNs. Our work shows that
CO2 is a more complex sensory cue for C. elegans than previously thought, both
in terms of behavior and neural circuitry.'
author:
- first_name: Lorenz A.
full_name: Fenk, Lorenz A.
last_name: Fenk
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Fenk LA, de Bono M. Environmental CO2 inhibits Caenorhabditis elegans egg-laying
by modulating olfactory neurons and evokes widespread changes in neural activity.
Proceedings of the National Academy of Sciences. 2015;112(27):E3525-E3534.
doi:10.1073/pnas.1423808112
apa: Fenk, L. A., & de Bono, M. (2015). Environmental CO2 inhibits Caenorhabditis
elegans egg-laying by modulating olfactory neurons and evokes widespread changes
in neural activity. Proceedings of the National Academy of Sciences. National
Academy of Sciences. https://doi.org/10.1073/pnas.1423808112
chicago: Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis
Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes
in Neural Activity.” Proceedings of the National Academy of Sciences. National
Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1423808112.
ieee: L. A. Fenk and M. de Bono, “Environmental CO2 inhibits Caenorhabditis elegans
egg-laying by modulating olfactory neurons and evokes widespread changes in neural
activity,” Proceedings of the National Academy of Sciences, vol. 112, no.
27. National Academy of Sciences, pp. E3525–E3534, 2015.
ista: Fenk LA, de Bono M. 2015. Environmental CO2 inhibits Caenorhabditis elegans
egg-laying by modulating olfactory neurons and evokes widespread changes in neural
activity. Proceedings of the National Academy of Sciences. 112(27), E3525–E3534.
mla: Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis
Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes
in Neural Activity.” Proceedings of the National Academy of Sciences, vol.
112, no. 27, National Academy of Sciences, 2015, pp. E3525–34, doi:10.1073/pnas.1423808112.
short: L.A. Fenk, M. de Bono, Proceedings of the National Academy of Sciences 112
(2015) E3525–E3534.
date_created: 2019-03-19T14:15:50Z
date_published: 2015-07-07T00:00:00Z
date_updated: 2021-01-12T08:06:12Z
day: '07'
ddc:
- '570'
doi: 10.1073/pnas.1423808112
extern: '1'
external_id:
pmid:
- '26100886'
file:
- access_level: open_access
checksum: 3d2da5af8d72467e382a565abc2e003d
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:21:07Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6119'
file_name: 2015_PNAS_Fenk.pdf
file_size: 2822681
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 112'
issue: '27'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: E3525-E3534
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
issn:
- 0027-8424
- 1091-6490
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
status: public
title: Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating
olfactory neurons and evokes widespread changes in neural activity
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '6120'
abstract:
- lang: eng
text: Brains organize behavior and physiology to optimize the response to threats
or opportunities. We dissect how 21% O2, an indicator of surface exposure, reprograms
C. elegans' global state, inducing sustained locomotory arousal and altering expression
of neuropeptides, metabolic enzymes, and other non-neural genes. The URX O2-sensing
neurons drive arousal at 21% O2 by tonically activating the RMG interneurons.
Stimulating RMG is sufficient to switch behavioral state. Ablating the ASH, ADL,
or ASK sensory neurons connected to RMG by gap junctions does not disrupt arousal.
However, disrupting cation currents in these neurons curtails RMG neurosecretion
and arousal. RMG signals high O2 by peptidergic secretion. Neuropeptide reporters
reveal neural circuit state, as neurosecretion stimulates neuropeptide expression.
Neural imaging in unrestrained animals shows that URX and RMG encode O2 concentration
rather than behavior, while the activity of downstream interneurons such as AVB
and AIY reflect both O2 levels and the behavior being executed.
article_number: e04241
author:
- first_name: Patrick
full_name: Laurent, Patrick
last_name: Laurent
- first_name: Zoltan
full_name: Soltesz, Zoltan
last_name: Soltesz
- first_name: Geoffrey M
full_name: Nelson, Geoffrey M
last_name: Nelson
- first_name: Changchun
full_name: Chen, Changchun
last_name: Chen
- first_name: Fausto
full_name: Arellano-Carbajal, Fausto
last_name: Arellano-Carbajal
- first_name: Emmanuel
full_name: Levy, Emmanuel
last_name: Levy
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Laurent P, Soltesz Z, Nelson GM, et al. Decoding a neural circuit controlling
global animal state in C. elegans. eLife. 2015;4. doi:10.7554/elife.04241
apa: Laurent, P., Soltesz, Z., Nelson, G. M., Chen, C., Arellano-Carbajal, F., Levy,
E., & de Bono, M. (2015). Decoding a neural circuit controlling global animal
state in C. elegans. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.04241
chicago: Laurent, Patrick, Zoltan Soltesz, Geoffrey M Nelson, Changchun Chen, Fausto
Arellano-Carbajal, Emmanuel Levy, and Mario de Bono. “Decoding a Neural Circuit
Controlling Global Animal State in C. Elegans.” ELife. eLife Sciences Publications,
2015. https://doi.org/10.7554/elife.04241.
ieee: P. Laurent et al., “Decoding a neural circuit controlling global animal
state in C. elegans,” eLife, vol. 4. eLife Sciences Publications, 2015.
ista: Laurent P, Soltesz Z, Nelson GM, Chen C, Arellano-Carbajal F, Levy E, de Bono
M. 2015. Decoding a neural circuit controlling global animal state in C. elegans.
eLife. 4, e04241.
mla: Laurent, Patrick, et al. “Decoding a Neural Circuit Controlling Global Animal
State in C. Elegans.” ELife, vol. 4, e04241, eLife Sciences Publications,
2015, doi:10.7554/elife.04241.
short: P. Laurent, Z. Soltesz, G.M. Nelson, C. Chen, F. Arellano-Carbajal, E. Levy,
M. de Bono, ELife 4 (2015).
date_created: 2019-03-19T14:23:51Z
date_published: 2015-03-11T00:00:00Z
date_updated: 2021-01-12T08:06:13Z
day: '11'
ddc:
- '570'
doi: 10.7554/elife.04241
extern: '1'
external_id:
pmid:
- '25760081'
file:
- access_level: open_access
checksum: cf641b7a363aecd0a101755d23dee7e0
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:29:43Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6121'
file_name: 2015_elife_Laurent.pdf
file_size: 6723528
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 4'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
status: public
title: Decoding a neural circuit controlling global animal state in C. elegans
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: 4
year: '2015'
...
---
_id: '6507'
abstract:
- lang: eng
text: The osteoclast-associated receptor (OSCAR) is a collagen-binding immune receptor
with important roles in dendritic cell maturation and activation of inflammatory
monocytes as well as in osteoclastogenesis. The crystal structure of the OSCAR
ectodomain is presented, both free and in complex with a consensus triple-helical
peptide (THP). The structures revealed a collagen-binding site in each immunoglobulin-like
domain (D1 and D2). The THP binds near a predicted collagen-binding groove in
D1, but a more extensive interaction with D2 is facilitated by the unusually wide
D1-D2 interdomain angle in OSCAR. Direct binding assays, combined with site-directed
mutagenesis, confirm that the primary collagen-binding site in OSCAR resides in
D2, in marked contrast to the related collagen receptors, glycoprotein VI (GPVI)
and leukocyte-associated immunoglobulin-like receptor-1 (LAIR-1). Monomeric OSCAR
D1D2 binds to the consensus THP with a KD of 28 µM measured in solution, but shows
a higher affinity (KD 1.5 μM) when binding to a solid-phase THP, most likely due
to an avidity effect. These data suggest a 2-stage model for the interaction of
OSCAR with a collagen fibril, with transient, low-affinity interactions initiated
by the membrane-distal D1, followed by firm adhesion to the primary binding site
in D2.
author:
- first_name: Long
full_name: Zhou, Long
id: 3E751364-F248-11E8-B48F-1D18A9856A87
last_name: Zhou
orcid: 0000-0002-1864-8951
- first_name: J. M.
full_name: Hinerman, J. M.
last_name: Hinerman
- first_name: M.
full_name: Blaszczyk, M.
last_name: Blaszczyk
- first_name: J. L. C.
full_name: Miller, J. L. C.
last_name: Miller
- first_name: D. G.
full_name: Conrady, D. G.
last_name: Conrady
- first_name: A. D.
full_name: Barrow, A. D.
last_name: Barrow
- first_name: D. Y.
full_name: Chirgadze, D. Y.
last_name: Chirgadze
- first_name: D.
full_name: Bihan, D.
last_name: Bihan
- first_name: R. W.
full_name: Farndale, R. W.
last_name: Farndale
- first_name: A. B.
full_name: Herr, A. B.
last_name: Herr
citation:
ama: Zhou L, Hinerman JM, Blaszczyk M, et al. Structural basis for collagen recognition
by the immune receptor OSCAR. Blood. 2015;127(5):529-537. doi:10.1182/blood-2015-08-667055
apa: Zhou, L., Hinerman, J. M., Blaszczyk, M., Miller, J. L. C., Conrady, D. G.,
Barrow, A. D., … Herr, A. B. (2015). Structural basis for collagen recognition
by the immune receptor OSCAR. Blood. American Society of Hematology. https://doi.org/10.1182/blood-2015-08-667055
chicago: Zhou, Long, J. M. Hinerman, M. Blaszczyk, J. L. C. Miller, D. G. Conrady,
A. D. Barrow, D. Y. Chirgadze, D. Bihan, R. W. Farndale, and A. B. Herr. “Structural
Basis for Collagen Recognition by the Immune Receptor OSCAR.” Blood. American
Society of Hematology, 2015. https://doi.org/10.1182/blood-2015-08-667055.
ieee: L. Zhou et al., “Structural basis for collagen recognition by the immune
receptor OSCAR,” Blood, vol. 127, no. 5. American Society of Hematology,
pp. 529–537, 2015.
ista: Zhou L, Hinerman JM, Blaszczyk M, Miller JLC, Conrady DG, Barrow AD, Chirgadze
DY, Bihan D, Farndale RW, Herr AB. 2015. Structural basis for collagen recognition
by the immune receptor OSCAR. Blood. 127(5), 529–537.
mla: Zhou, Long, et al. “Structural Basis for Collagen Recognition by the Immune
Receptor OSCAR.” Blood, vol. 127, no. 5, American Society of Hematology,
2015, pp. 529–37, doi:10.1182/blood-2015-08-667055.
short: L. Zhou, J.M. Hinerman, M. Blaszczyk, J.L.C. Miller, D.G. Conrady, A.D. Barrow,
D.Y. Chirgadze, D. Bihan, R.W. Farndale, A.B. Herr, Blood 127 (2015) 529–537.
date_created: 2019-05-31T09:38:50Z
date_published: 2015-11-02T00:00:00Z
date_updated: 2021-01-12T08:07:47Z
day: '02'
doi: 10.1182/blood-2015-08-667055
extern: '1'
external_id:
pmid:
- '26552697'
intvolume: ' 127'
issue: '5'
language:
- iso: eng
month: '11'
oa_version: None
page: 529-537
pmid: 1
publication: Blood
publication_identifier:
issn:
- 0006-4971
- 1528-0020
publication_status: published
publisher: American Society of Hematology
quality_controlled: '1'
status: public
title: Structural basis for collagen recognition by the immune receptor OSCAR
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 127
year: '2015'
...
---
_id: '1473'
abstract:
- lang: eng
text: In this paper we survey geometric and arithmetic techniques to study the cohomology
of semiprojective hyperkähler manifolds including toric hyperkähler varieties,
Nakajima quiver varieties and moduli spaces of Higgs bundles on Riemann surfaces.
The resulting formulae for their Poincaré polynomials are combinatorial and representation
theoretical in nature. In particular we will look at their Betti numbers and will
establish some results and state some expectations on their asymptotic shape.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: Hausel T, Rodríguez Villegas F. Cohomology of large semiprojective hyperkähler
varieties. Asterisque. 2015;2015(370):113-156.
apa: Hausel, T., & Rodríguez Villegas, F. (2015). Cohomology of large semiprojective
hyperkähler varieties. Asterisque. Societe Mathematique de France.
chicago: Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective
Hyperkähler Varieties.” Asterisque. Societe Mathematique de France, 2015.
ieee: T. Hausel and F. Rodríguez Villegas, “Cohomology of large semiprojective hyperkähler
varieties,” Asterisque, vol. 2015, no. 370. Societe Mathematique de France,
pp. 113–156, 2015.
ista: Hausel T, Rodríguez Villegas F. 2015. Cohomology of large semiprojective hyperkähler
varieties. Asterisque. 2015(370), 113–156.
mla: Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective
Hyperkähler Varieties.” Asterisque, vol. 2015, no. 370, Societe Mathematique
de France, 2015, pp. 113–56.
short: T. Hausel, F. Rodríguez Villegas, Asterisque 2015 (2015) 113–156.
date_created: 2018-12-11T11:52:13Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '01'
extern: 1
intvolume: ' 2015'
issue: '370'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.4914
month: '01'
oa: 1
page: 113 - 156
publication: Asterisque
publication_status: published
publisher: Societe Mathematique de France
publist_id: '5723'
quality_controlled: 0
status: public
title: Cohomology of large semiprojective hyperkähler varieties
type: review
volume: 2015
year: '2015'
...
---
_id: '1474'
abstract:
- lang: eng
text: Cryptographic access control offers selective access to encrypted data via
a combination of key management and functionality-rich cryptographic schemes,
such as attribute-based encryption. Using this approach, publicly available meta-data
may inadvertently leak information on the access policy that is enforced by cryptography,
which renders cryptographic access control unusable in settings where this information
is highly sensitive. We begin to address this problem by presenting rigorous definitions
for policy privacy in cryptographic access control. For concreteness we set our
results in the model of Role-Based Access Control (RBAC), where we identify and
formalize several different flavors of privacy, however, our framework should
serve as inspiration for other models of access control. Based on our insights
we propose a new system which significantly improves on the privacy properties
of state-of-the-art constructions. Our design is based on a novel type of privacy-preserving
attribute-based encryption, which we introduce and show how to instantiate. We
present our results in the context of a cryptographic RBAC system by Ferrara et
al. (CSF'13), which uses cryptography to control read access to files, while write
access is still delegated to trusted monitors. We give an extension of the construction
that permits cryptographic control over write access. Our construction assumes
that key management uses out-of-band channels between the policy enforcer and
the users but eliminates completely the need for monitoring read/write access
to the data.
article_processing_charge: No
author:
- first_name: Anna
full_name: Ferrara, Anna
last_name: Ferrara
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Bin
full_name: Liu, Bin
last_name: Liu
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic
access control. In: IEEE; 2015:46-60. doi:10.1109/CSF.2015.11'
apa: 'Ferrara, A., Fuchsbauer, G., Liu, B., & Warinschi, B. (2015). Policy privacy
in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security
Foundations, Verona, Italy: IEEE. https://doi.org/10.1109/CSF.2015.11'
chicago: Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy
Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. https://doi.org/10.1109/CSF.2015.11.
ieee: 'A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic
access control,” presented at the CSF: Computer Security Foundations, Verona,
Italy, 2015, pp. 46–60.'
ista: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic
access control. CSF: Computer Security Foundations, 46–60.'
mla: Ferrara, Anna, et al. Policy Privacy in Cryptographic Access Control.
IEEE, 2015, pp. 46–60, doi:10.1109/CSF.2015.11.
short: A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.
conference:
end_date: 2015-07-17
location: Verona, Italy
name: 'CSF: Computer Security Foundations'
start_date: 2015-07-13
date_created: 2018-12-11T11:52:14Z
date_published: 2015-09-04T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '04'
department:
- _id: KrPi
doi: 10.1109/CSF.2015.11
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://epubs.surrey.ac.uk/808055/
month: '09'
oa: 1
oa_version: Submitted Version
page: 46-60
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: IEEE
publist_id: '5722'
quality_controlled: '1'
status: public
title: Policy privacy in cryptographic access control
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1481'
abstract:
- lang: eng
text: 'Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role
not only in the development of mathematical and logical skills, but also in the
emotional and social development. In this paper, we address the problem of generating
targeted starting positions for such games. This can facilitate new approaches
for bringing novice players to mastery, and also leads to discovery of interesting
game variants. We present an approach that generates starting states of varying
hardness levels for player 1 in a two-player board game, given rules of the board
game, the desired number of steps required for player 1 to win, and the expertise
levels of the two players. Our approach leverages symbolic methods and iterative
simulation to efficiently search the extremely large state space. We present experimental
results that include discovery of states of varying hardness levels for several
simple grid-based board games. The presence of such states for standard game variants
like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played
as the default start state is heavily biased. '
acknowledgement: "A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n"
article_processing_charge: No
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: 'Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting
positions for simple traditional board games. In: Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.'
apa: 'Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation
of alternative starting positions for simple traditional board games. In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp.
745–752). Austin, TX, USA: AAAI Press.'
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation
of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52.
AAAI Press, 2015.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative
starting positions for simple traditional board games,” in Proceedings of the
Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA,
2015, vol. 2, pp. 745–752.
ista: 'Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative
starting positions for simple traditional board games. Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 2, 745–752.'
mla: Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions
for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference
on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.
short: U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.
conference:
end_date: 2015-01-30
location: Austin, TX, USA
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2015-01-25
date_created: 2018-12-11T11:52:16Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:07Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
intvolume: ' 2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300
month: '01'
oa: 1
oa_version: None
page: 745 - 752
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '5713'
quality_controlled: '1'
related_material:
record:
- id: '5410'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Automatic generation of alternative starting positions for simple traditional
board games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '1483'
abstract:
- lang: eng
text: Topological data analysis offers a rich source of valuable information to
study vision problems. Yet, so far we lack a theoretically sound connection to
popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In
this work, we establish such a connection by designing a multi-scale kernel for
persistence diagrams, a stable summary representation of topological features
in data. We show that this kernel is positive definite and prove its stability
with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets
for 3D shape classification/retrieval and texture recognition show considerable
performance gains of the proposed method compared to an alternative approach that
is based on the recently introduced persistence landscapes.
author:
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
citation:
ama: 'Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for
topological machine learning. In: IEEE; 2015:4741-4748. doi:10.1109/CVPR.2015.7299106'
apa: 'Reininghaus, J., Huber, S., Bauer, U., & Kwitt, R. (2015). A stable multi-scale
kernel for topological machine learning (pp. 4741–4748). Presented at the CVPR:
Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7299106'
chicago: Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable
Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299106.
ieee: 'J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel
for topological machine learning,” presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.'
ista: 'Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel
for topological machine learning. CVPR: Computer Vision and Pattern Recognition,
4741–4748.'
mla: Reininghaus, Jan, et al. A Stable Multi-Scale Kernel for Topological Machine
Learning. IEEE, 2015, pp. 4741–48, doi:10.1109/CVPR.2015.7299106.
short: J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.
conference:
end_date: 2015-06-12
location: Boston, MA, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:52:17Z
date_published: 2015-10-14T00:00:00Z
date_updated: 2021-01-12T06:51:03Z
day: '14'
department:
- _id: HeEd
doi: 10.1109/CVPR.2015.7299106
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.6821
month: '10'
oa: 1
oa_version: Preprint
page: 4741 - 4748
publication_identifier:
eisbn:
- '978-1-4673-6964-0 '
publication_status: published
publisher: IEEE
publist_id: '5709'
scopus_import: 1
status: public
title: A stable multi-scale kernel for topological machine learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1495'
abstract:
- lang: eng
text: 'Motivated by biological questions, we study configurations of equal-sized
disks in the Euclidean plane that neither pack nor cover. Measuring the quality
by the probability that a random point lies in exactly one disk, we show that
the regular hexagonal grid gives the maximum among lattice configurations. '
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
- first_name: Vitaliy
full_name: Kurlin, Vitaliy
last_name: Kurlin
citation:
ama: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: Proceedings
of the 27th Canadian Conference on Computational Geometry. Vol 2015-August.
Queen’s University; 2015:128-135.'
apa: 'Edelsbrunner, H., Iglesias Ham, M., & Kurlin, V. (2015). Relaxed disk
packing. In Proceedings of the 27th Canadian Conference on Computational Geometry
(Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.'
chicago: Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed
Disk Packing.” In Proceedings of the 27th Canadian Conference on Computational
Geometry, 2015–August:128–35. Queen’s University, 2015.
ieee: H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in
Proceedings of the 27th Canadian Conference on Computational Geometry,
Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.
ista: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings
of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference
on Computational Geometry vol. 2015–August, 128–135.'
mla: Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the
27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s
University, 2015, pp. 128–35.
short: H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th
Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.
conference:
end_date: 2015-08-12
location: Ontario, Canada
name: 'CCCG: Canadian Conference on Computational Geometry'
start_date: 2015-08-10
date_created: 2018-12-11T11:52:21Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:09Z
day: '01'
department:
- _id: HeEd
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1505.03402
month: '08'
oa: 1
oa_version: Submitted Version
page: 128-135
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the 27th Canadian Conference on Computational Geometry
publication_status: published
publisher: Queen's University
publist_id: '5684'
quality_controlled: '1'
scopus_import: 1
status: public
title: Relaxed disk packing
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2015-August
year: '2015'
...
---
_id: '1497'
abstract:
- lang: eng
text: Detecting allelic biases from high-throughput sequencing data requires an
approach that maximises sensitivity while minimizing false positives. Here, we
present Allelome.PRO, an automated user-friendly bioinformatics pipeline, which
uses high-throughput sequencing data from reciprocal crosses of two genetically
distinct mouse strains to detect allele-specific expression and chromatin modifications.
Allelome.PRO extends approaches used in previous studies that exclusively analyzed
imprinted expression to give a complete picture of the ‘allelome’ by automatically
categorising the allelic expression of all genes in a given cell type into imprinted,
strain-biased, biallelic or non-informative. Allelome.PRO offers increased sensitivity
to analyze lowly expressed transcripts, together with a robust false discovery
rate empirically calculated from variation in the sequencing data. We used RNA-seq
data from mouse embryonic fibroblasts from F1 reciprocal crosses to determine
a biologically relevant allelic ratio cutoff, and define for the first time an
entire allelome. Furthermore, we show that Allelome.PRO detects differential enrichment
of H3K4me3 over promoters from ChIP-seq data validating the RNA-seq results. This
approach can be easily extended to analyze histone marks of active enhancers,
or transcription factor binding sites and therefore provides a powerful tool to
identify candidate cis regulatory elements genome wide.
acknowledgement: "Austrian Science Fund [FWF P25185-B22, FWF F4302- B09, FWFW1207-B09].
Funding for open access charge: Austrian Science Fund.\r\nWe thank Florian Breitwieser
for advice during the early stages of this project. High-throughput sequencing was
conducted by the Biomedical Sequencing Facility (BSF) at CeMM in Vienna."
article_number: e146
author:
- first_name: Daniel
full_name: Andergassen, Daniel
last_name: Andergassen
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
- first_name: Tomasz
full_name: Kulinski, Tomasz
last_name: Kulinski
- first_name: Philipp
full_name: Guenzl, Philipp
last_name: Guenzl
- first_name: Philipp
full_name: Bammer, Philipp
last_name: Bammer
- first_name: Denise
full_name: Barlow, Denise
last_name: Barlow
- first_name: Florian
full_name: Pauler, Florian
last_name: Pauler
- first_name: Quanah
full_name: Hudson, Quanah
last_name: Hudson
citation:
ama: Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define
allele-specific genomic features from high-throughput sequencing data. Nucleic
Acids Research. 2015;43(21). doi:10.1093/nar/gkv727
apa: Andergassen, D., Dotter, C., Kulinski, T., Guenzl, P., Bammer, P., Barlow,
D., … Hudson, Q. (2015). Allelome.PRO, a pipeline to define allele-specific genomic
features from high-throughput sequencing data. Nucleic Acids Research.
Oxford University Press. https://doi.org/10.1093/nar/gkv727
chicago: Andergassen, Daniel, Christoph Dotter, Tomasz Kulinski, Philipp Guenzl,
Philipp Bammer, Denise Barlow, Florian Pauler, and Quanah Hudson. “Allelome.PRO,
a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing
Data.” Nucleic Acids Research. Oxford University Press, 2015. https://doi.org/10.1093/nar/gkv727.
ieee: D. Andergassen et al., “Allelome.PRO, a pipeline to define allele-specific
genomic features from high-throughput sequencing data,” Nucleic Acids Research,
vol. 43, no. 21. Oxford University Press, 2015.
ista: Andergassen D, Dotter C, Kulinski T, Guenzl P, Bammer P, Barlow D, Pauler
F, Hudson Q. 2015. Allelome.PRO, a pipeline to define allele-specific genomic
features from high-throughput sequencing data. Nucleic Acids Research. 43(21),
e146.
mla: Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific
Genomic Features from High-Throughput Sequencing Data.” Nucleic Acids Research,
vol. 43, no. 21, e146, Oxford University Press, 2015, doi:10.1093/nar/gkv727.
short: D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow,
F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).
date_created: 2018-12-11T11:52:22Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2021-01-12T06:51:09Z
day: '21'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.1093/nar/gkv727
file:
- access_level: open_access
checksum: 385b83854fd0eb2e4f386867da2823e2
content_type: application/pdf
creator: dernst
date_created: 2018-12-20T14:18:57Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5768'
file_name: 2015_NucleicAcidsRes_Andergassen.pdf
file_size: 6863297
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 43'
issue: '21'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '5682'
quality_controlled: '1'
scopus_import: 1
status: public
title: Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput
sequencing data
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2015'
...
---
_id: '1498'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly,
due to asynchronous communication and the occurrence of faults, such as the network
dropping messages or computers crashing. Nonetheless there is surprisingly little
language and verification support to build distributed systems based on fault-tolerant
algorithms. In this paper, we present some of the challenges that a designer has
to overcome to implement a fault-tolerant distributed system. Then we review different
models that have been proposed to reason about distributed algorithms and sketch
how such a model can form the basis for a domain-specific programming language.
Adopting a high-level programming model can simplify the programmer's life and
make the code amenable to automated verification, while still compiling to efficiently
executable code. We conclude by summarizing the current status of an ongoing language
design and implementation project that is based on this idea.
alternative_title:
- LIPIcs
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant
distributed systems. 2015;32:90-102. doi:10.4230/LIPIcs.SNAPL.2015.90
apa: 'Dragoi, C., Henzinger, T. A., & Zufferey, D. (2015). The need for language
support for fault-tolerant distributed systems. Presented at the SNAPL: Summit
oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90'
chicago: Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for
Language Support for Fault-Tolerant Distributed Systems.” Leibniz International
Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90.
ieee: C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support
for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, pp. 90–102, 2015.
ista: Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for
fault-tolerant distributed systems. 32, 90–102.
mla: Dragoi, Cezara, et al. The Need for Language Support for Fault-Tolerant
Distributed Systems. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015, pp. 90–102, doi:10.4230/LIPIcs.SNAPL.2015.90.
short: C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.
conference:
end_date: 2015-05-06
location: Asilomar, CA, United States
name: 'SNAPL: Summit oN Advances in Programming Languages'
start_date: 2015-05-03
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2020-08-11T10:09:14Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.SNAPL.2015.90
ec_funded: 1
file:
- access_level: open_access
checksum: cf5e94baa89a2dc4c5de01abc676eda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:02Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5050'
file_name: IST-2016-499-v1+1_9.pdf
file_size: 489362
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 32'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 90 - 102
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- '978-3-939897-80-4 '
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5681'
pubrep_id: '499'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: The need for language support for fault-tolerant distributed systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2015'
...
---
_id: '1499'
abstract:
- lang: eng
text: "We consider weighted automata with both positive and negative integer weights
on edges and\r\nstudy the problem of synchronization using adaptive strategies
that may only observe whether\r\nthe current weight-level is negative or nonnegative.
We show that the synchronization problem is decidable in polynomial time for deterministic
weighted automata."
acknowledgement: "The research leading to these results has received funding from
the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement
601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center
IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM),
the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein
Award), the Czech Science Foundation under grant agreement P202/12/G061, and People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme
(FP7/2007-2013) REA Grant No 291734."
alternative_title:
- LIPIcs
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Kim
full_name: Larsen, Kim
last_name: Larsen
- first_name: Simon
full_name: Laursen, Simon
last_name: Laursen
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: 'Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of
weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2015:142-154. doi:10.4230/LIPIcs.CONCUR.2015.142'
apa: 'Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial
time decidability of weighted synchronization under partial observability (Vol.
42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142'
chicago: Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time
Decidability of Weighted Synchronization under Partial Observability,” 42:142–54.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.
ieee: 'J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability
of weighted synchronization under partial observability,” presented at the CONCUR:
Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.'
ista: 'Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability
of weighted synchronization under partial observability. CONCUR: Concurrency Theory,
LIPIcs, vol. 42, 142–154.'
mla: Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization
under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.
short: J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2015, pp. 142–154.
conference:
end_date: 2015-09-04
location: Madrid, Spain
name: 'CONCUR: Concurrency Theory'
start_date: 2015-09-01
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:10Z
day: '01'
ddc:
- '000'
- '003'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2015.142
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:12Z
date_updated: 2020-07-14T12:44:58Z
file_id: '4672'
file_name: IST-2016-498-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 42'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 142 - 154
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5680'
pubrep_id: '498'
quality_controlled: '1'
scopus_import: 1
status: public
title: Polynomial time decidability of weighted synchronization under partial observability
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2015'
...