---
_id: '495'
abstract:
- lang: eng
text: An automaton with advice is a finite state automaton which has access to an
additional fixed infinite string called an advice tape. We refine the Myhill-Nerode
theorem to characterize the languages of finite strings that are accepted by automata
with advice. We do the same for tree automata with advice.
alternative_title:
- EPTCS
author:
- first_name: Alex
full_name: Kruckman, Alex
last_name: Kruckman
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
- first_name: John
full_name: Sheridan, John
last_name: Sheridan
- first_name: Ben
full_name: Zax, Ben
last_name: Zax
citation:
ama: 'Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata
with advice. In: Proceedings GandALF 2012. Vol 96. Open Publishing Association;
2012:238-246. doi:10.4204/EPTCS.96.18'
apa: 'Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode
theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96,
pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18'
chicago: Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode
Theorem for Automata with Advice.” In Proceedings GandALF 2012, 96:238–46.
Open Publishing Association, 2012. https://doi.org/10.4204/EPTCS.96.18.
ieee: A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for
automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012,
vol. 96, pp. 238–246.
ista: 'Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for
automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics
and Formal Verification, EPTCS, vol. 96, 238–246.'
mla: Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”
Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp.
238–46, doi:10.4204/EPTCS.96.18.
short: A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012,
Open Publishing Association, 2012, pp. 238–246.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logics and Formal Verification'
start_date: 2012-09-06
corr_author: '1'
date_created: 2018-12-11T11:46:47Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2024-10-09T20:55:00Z
day: '07'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.96.18
ec_funded: 1
file:
- access_level: open_access
checksum: 56277f95edc9d531fa3bdc5f9579fda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:31Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5152'
file_name: IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf
file_size: 97736
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
fulldoi: https://doi.org/10.4204/EPTCS.96.18
has_accepted_license: '1'
intvolume: ' 96'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 238 - 246
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'
publication: Proceedings GandALF 2012
publication_status: published
publisher: Open Publishing Association
publist_id: '7325'
pubrep_id: '944'
quality_controlled: '1'
scopus_import: 1
status: public
title: A Myhill Nerode theorem for automata with advice
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_id: '496'
abstract:
- lang: eng
text: 'We study the expressive power of logical interpretations on the class of
scattered trees, namely those with countably many infinite branches. Scattered
trees can be thought of as the tree analogue of scattered linear orders. Every
scattered tree has an ordinal rank that reflects the structure of its infinite
branches. We prove, roughly, that trees and orders of large rank cannot be interpreted
in scattered trees of small rank. We consider a quite general notion of interpretation:
each element of the interpreted structure is represented by a set of tuples of
subsets of the interpreting tree. Our trees are countable, not necessarily finitely
branching, and may have finitely many unary predicates as labellings. We also
show how to replace injective set-interpretations in (not necessarily scattered)
trees by ''finitary'' set-interpretations.'
alternative_title:
- LICS
article_number: '6280474'
article_processing_charge: No
author:
- first_name: Alexander
full_name: Rabinovich, Alexander
last_name: Rabinovich
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Rabinovich A, Rubin S. Interpretations in trees with countably many branches.
In: IEEE; 2012. doi:10.1109/LICS.2012.65'
apa: 'Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably
many branches. Presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia:
IEEE. https://doi.org/10.1109/LICS.2012.65'
chicago: Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with
Countably Many Branches.” IEEE, 2012. https://doi.org/10.1109/LICS.2012.65.
ieee: 'A. Rabinovich and S. Rubin, “Interpretations in trees with countably many
branches,” presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia,
2012.'
ista: 'Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many
branches. LICS: Logic in Computer Science, LICS, , 6280474.'
mla: Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably
Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.
short: A. Rabinovich, S. Rubin, in:, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T11:46:47Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2025-09-30T08:34:47Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.65
ec_funded: 1
external_id:
isi:
- '000309059900061'
fulldoi: https://doi.org/10.1109/LICS.2012.65
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf
month: '01'
oa: 1
oa_version: Preprint
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
publication_status: published
publisher: IEEE
publist_id: '7324'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interpretations in trees with countably many branches
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2012'
...
---
_id: '497'
abstract:
- lang: eng
text: 'One central issue in the formal design and analysis of reactive systems is
the notion of refinement that asks whether all behaviors of the implementation
is allowed by the specification. The local interpretation of behavior leads to
the notion of simulation. Alternating transition systems (ATSs) provide a general
model for composite reactive systems, and the simulation relation for ATSs is
known as alternating simulation. The simulation relation for fair transition systems
is called fair simulation. In this work our main contributions are as follows:
(1) We present an improved algorithm for fair simulation with Büchi fairness constraints;
our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time
algorithm, where n is the number of states and m is the number of transitions.
(2) We present a game based algorithm for alternating simulation that requires
O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n
is the number of states and m is the size of transition relation. (3) We present
an iterative algorithm for alternating simulation that matches the time complexity
of the game based algorithm, but is more space efficient than the game based algorithm.
© Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Pritish
full_name: Kamath, Pritish
last_name: Kamath
citation:
ama: 'Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement
relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182.
doi:10.4230/LIPIcs.CSL.2012.167'
apa: 'Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for
alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL:
European Association for Computer Science Logic, Fontainebleau, France: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167'
chicago: Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms
for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012. https://doi.org/10.4230/LIPIcs.CSL.2012.167.
ieee: 'K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating
refinement relations,” presented at the EACSL: European Association for Computer
Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.'
ista: 'Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating
refinement relations. EACSL: European Association for Computer Science Logic,
LIPIcs, vol. 16, 167–182.'
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement
Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012,
pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.
short: K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012, pp. 167–182.
conference:
end_date: 2012-09-06
location: Fontainebleau, France
name: 'EACSL: European Association for Computer Science Logic'
start_date: 2012-09-03
date_created: 2018-12-11T11:46:48Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2025-01-14T12:24:50Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2012.167
ec_funded: 1
file:
- access_level: open_access
checksum: f1b0dd99240800db2d7dbf9b5131fe5e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:50Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4712'
file_name: IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf
file_size: 471236
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
fulldoi: https://doi.org/10.4230/LIPIcs.CSL.2012.167
has_accepted_license: '1'
intvolume: ' 16'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: 167 - 182
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_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7323'
pubrep_id: '943'
quality_controlled: '1'
related_material:
record:
- id: '5378'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Faster algorithms for alternating refinement relations
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2012'
...
---
_id: '498'
abstract:
- lang: eng
text: Understanding patterns and correlates of local adaptation in heterogeneous
landscapes can provide important information in the selection of appropriate seed
sources for restoration. We assessed the extent of local adaptation of fitness
components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides
(Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance,
quantitative (QST) and neutral (FST) genetic differentiation, and size of the
local and foreign populations could predict patterns of adaptive differentiation.
Local adaptation varied among populations and fitness components. Including all
population pairs, local adaptation was observed for seedling survival, but not
for biomass, while foreign genotype advantage was observed for reproduction (number
of inflorescences). Among population pairs, local adaptation increased with QST
and local population size for biomass. QST was associated with environmental distance,
suggesting ecological selection for phenotypic divergence. However, low FST and
variation in population structure in small populations demonstrates the interaction
of gene flow and drift in constraining local adaptation in R. leptorrhynchoides.
Our study indicates that for species in heterogeneous landscapes, collecting seed
from large populations from similar environments to candidate sites is likely
to provide the most appropriate seed sources for restoration.
acknowledgement: "We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and
Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment
and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability
and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer
C. H. Barrett for comments that improved the quality of the manuscript.\r\n"
article_processing_charge: No
author:
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: David
full_name: Rowell, David
last_name: Rowell
- first_name: Andrew
full_name: Young, Andrew
last_name: Young
citation:
ama: 'Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented
plant populations: Implications for restoration genetics. Evolutionary Applications.
2012;5(8):913-924. doi:10.1111/j.1752-4571.2012.00284.x'
apa: 'Pickup, M., Field, D., Rowell, D., & Young, A. (2012). Predicting local
adaptation in fragmented plant populations: Implications for restoration genetics.
Evolutionary Applications. Wiley-Blackwell. https://doi.org/10.1111/j.1752-4571.2012.00284.x'
chicago: 'Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting
Local Adaptation in Fragmented Plant Populations: Implications for Restoration
Genetics.” Evolutionary Applications. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1752-4571.2012.00284.x.'
ieee: 'M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation
in fragmented plant populations: Implications for restoration genetics,” Evolutionary
Applications, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.'
ista: 'Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in
fragmented plant populations: Implications for restoration genetics. Evolutionary
Applications. 5(8), 913–924.'
mla: 'Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations:
Implications for Restoration Genetics.” Evolutionary Applications, vol.
5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:10.1111/j.1752-4571.2012.00284.x.'
short: M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012)
913–924.
corr_author: '1'
date_created: 2018-12-11T11:46:48Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2025-09-30T08:33:55Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1111/j.1752-4571.2012.00284.x
external_id:
isi:
- '000312808900013'
file:
- access_level: open_access
checksum: 233007138606aca5a2f75f7ae1742f43
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:33Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4821'
file_name: IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf
file_size: 396136
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
fulldoi: https://doi.org/10.1111/j.1752-4571.2012.00284.x
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 913 - 924
publication: Evolutionary Applications
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7322'
pubrep_id: '942'
quality_controlled: '1'
status: public
title: 'Predicting local adaptation in fragmented plant populations: Implications
for restoration genetics'
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: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 5
year: '2012'
...
---
_id: '5377'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis such as synthesis and verification of open systems. In this
work we consider solving recursive game graphs (or pushdown game graphs) that
can model the control flow of sequential programs with recursion. While pushdown
games have been studied before with qualitative objectives, such as reachability
and ω-regular objectives, in this work we study for the first time such games
with the most well-studied quantitative objective, namely, mean-payoff objectives.
In pushdown games two types of strategies are relevant: (1) global strategies,
that depend on the entire global history; and (2) modular strategies, that have
only local memory and thus do not depend on the context of invocation, but only
on the history of the current invocation of the module. Our main results are as
follows: (1) One-player pushdown games with mean-payoff objectives under global
strategies are decidable in polynomial time. (2) Two- player pushdown games with
mean-payoff objectives under global strategies are undecidable. (3) One-player
pushdown games with mean-payoff objectives under modular strategies are NP- hard.
(4) Two-player pushdown games with mean-payoff objectives under modular strategies
can be solved in NP (i.e., both one-player and two-player pushdown games with
mean-payoff objectives under modular strategies are NP-complete). We also establish
the optimal strategy complexity showing that global strategies for mean-payoff
objectives require infinite memory even in one-player pushdown games; and memoryless
modular strategies are sufficient in two- player pushdown games. Finally we also
show that all the problems have the same complexity if the stack boundedness condition
is added, where along with the mean-payoff objective the player must also ensure
that the stack height is bounded.'
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Velner Y. Mean-Payoff Pushdown Games. IST Austria; 2012.
doi:10.15479/AT:IST-2012-0002
apa: Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games.
IST Austria. https://doi.org/10.15479/AT:IST-2012-0002
chicago: Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games.
IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0002.
ieee: K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria,
2012.
ista: Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
mla: Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games.
IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.
short: K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
corr_author: '1'
date_created: 2018-12-12T11:38:59Z
date_published: 2012-07-02T00:00:00Z
date_updated: 2025-09-30T08:08:12Z
day: '02'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2012-0002
file:
- access_level: open_access
checksum: a03c08c1589dbb0c96183a8bcf3ab240
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:00Z
date_updated: 2020-07-14T12:46:38Z
file_id: '5522'
file_name: IST-2012-002_IST-2012-0002.pdf
file_size: 592098
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
fulldoi: https://doi.org/10.15479/AT:IST-2012-0002
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '10'
related_material:
record:
- id: '2956'
relation: later_version
status: public
status: public
title: Mean-payoff pushdown games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5378'
abstract:
- lang: eng
text: 'One central issue in the formal design and analysis of reactive systems is
the notion of refinement that asks whether all behaviors of the implementation
is allowed by the specification. The local interpretation of behavior leads to
the notion of simulation. Alternating transition systems (ATSs) provide a general
model for composite reactive systems, and the simulation relation for ATSs is
known as alternating simulation. The simulation relation for fair transition systems
is called fair simulation. In this work our main contributions are as follows:
(1) We present an improved algorithm for fair simulation with Büchi fairness constraints;
our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time
algorithm, where n is the number of states and m is the number of transitions.
(2) We present a game based algorithm for alternating simulation that requires
O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where
n is the number of states and m is the size of transition relation. (3) We present
an iterative algorithm for alternating simulation that matches the time complexity
of the game based algorithm, but is more space efficient than the game based algorithm.'
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Pritish
full_name: Kamath, Pritish
last_name: Kamath
citation:
ama: Chatterjee K, Chaubal S, Kamath P. Faster Algorithms for Alternating Refinement
Relations. IST Austria; 2012. doi:10.15479/AT:IST-2012-0001
apa: Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms
for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
chicago: Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster
Algorithms for Alternating Refinement Relations. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0001.
ieee: K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating
refinement relations. IST Austria, 2012.
ista: Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating
refinement relations, IST Austria, 21p.
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement
Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.
short: K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement
Relations, IST Austria, 2012.
corr_author: '1'
date_created: 2018-12-12T11:38:59Z
date_published: 2012-07-04T00:00:00Z
date_updated: 2025-04-15T08:12:24Z
day: '04'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2012-0001
file:
- access_level: open_access
checksum: ec8d1857cc7095d3de5107a0162ced37
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:28Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5489'
file_name: IST-2012-0001_IST-2012-0001.pdf
file_size: 394256
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
fulldoi: https://doi.org/10.15479/AT:IST-2012-0001
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '21'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '14'
related_material:
record:
- id: '497'
relation: later_version
status: public
status: public
title: Faster algorithms for alternating refinement relations
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5396'
abstract:
- lang: eng
text: We consider the problem of inference in agraphical model with binary variables.
While in theory it is arguably preferable to compute marginal probabilities, in
practice researchers often use MAP inference due to the availability of efficient
discrete optimization algorithms. We bridge the gap between the two approaches
by introducing the Discrete Marginals technique in which approximate marginals
are obtained by minimizing an objective function with unary and pair-wise terms
over a discretized domain. This allows the use of techniques originally devel-oped
for MAP-MRF inference and learning. We explore two ways to set up the objective
function - by discretizing the Bethe free energy and by learning it from training
data. Experimental results show that for certain types of graphs a learned function
can out-perform the Bethe approximation. We also establish a link between the
Bethe free energy and submodular functions.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Filip
full_name: Korc, Filip
id: 476A2FD6-F248-11E8-B48F-1D18A9856A87
last_name: Korc
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Korc F, Kolmogorov V, Lampert C. Approximating Marginals Using Discrete
Energy Minimization. IST Austria; 2012. doi:10.15479/AT:IST-2012-0003
apa: Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals
using discrete energy minimization. IST Austria. https://doi.org/10.15479/AT:IST-2012-0003
chicago: Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. Approximating
Marginals Using Discrete Energy Minimization. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0003.
ieee: F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete
energy minimization. IST Austria, 2012.
ista: Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete
energy minimization, IST Austria, 13p.
mla: Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization.
IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
short: F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete
Energy Minimization, IST Austria, 2012.
date_created: 2018-12-12T11:39:06Z
date_published: 2012-07-23T00:00:00Z
date_updated: 2024-10-09T20:54:48Z
day: '23'
ddc:
- '000'
department:
- _id: VlKo
- _id: ChLa
doi: 10.15479/AT:IST-2012-0003
file:
- access_level: open_access
checksum: 7e0ba85ad123b13223aaf6cdde2d288c
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:29Z
date_updated: 2020-07-14T12:46:44Z
file_id: '5490'
file_name: IST-2012-0003_IST-2012-0003.pdf
file_size: 618744
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
fulldoi: https://doi.org/10.15479/AT:IST-2012-0003
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '13'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '36'
related_material:
record:
- id: '3124'
relation: earlier_version
status: public
status: public
title: Approximating marginals using discrete energy minimization
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
OA_place: repository
_id: '5745'
abstract:
- lang: eng
text: Unsatisfiability proofs find many applications in verification. Today, many
SAT solvers are capable of producing resolution proofs of unsatisfiability. For
efficiency smaller proofs are preferred over bigger ones. The solvers apply proof
reduction methods to remove redundant parts of the proofs while and after generating
the proofs. One method of reducing resolution proofs is redundant resolution reduction,
i.e., removing repeated pivots in the paths of resolution proofs (aka Pivot recycle).
The known single pass algorithm only tries to remove redundancies in the parts
of the proof that are trees. In this paper, we present three modifications to
improve the algorithm such that the redundancies can be found in the parts of
the proofs that are DAGs. The first modified algorithm covers greater number of
redundancies as compared to the known algorithm without incurring any additional
cost. The second modified algorithm covers even greater number of the redundancies
but it may have longer run times. Our third modified algorithm is parametrized
and can trade off between run times and the coverage of the redundancies. We have
implemented our algorithms in OpenSMT and applied them on unsatisfiability proofs
of 198 examples from plain MUS track of SAT11 competition. The first and second
algorithm additionally remove 0.89% and 10.57% of clauses respectively as compared
to the original algorithm. For certain value of the parameter, the third algorithm
removes almost as many clauses as the second algorithm but is significantly faster.
acknowledgement: "This work was supported by the ERC Advanced Investigator grant on
Quantitative\r\nReactive Modeling (QUAREM)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
citation:
ama: 'Gupta A. Improved single pass algorithms for resolution proof reduction. In:
10th International Symposium on Automated Technology for Verification and Analysis.
Vol 7561. Springer Nature; 2012:107-121. doi:10.1007/978-3-642-33386-6_10'
apa: 'Gupta, A. (2012). Improved single pass algorithms for resolution proof reduction.
In 10th International Symposium on Automated Technology for Verification and
Analysis (Vol. 7561, pp. 107–121). Thiruvananthapuram, Kerala, India: Springer
Nature. https://doi.org/10.1007/978-3-642-33386-6_10'
chicago: Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof
Reduction.” In 10th International Symposium on Automated Technology for Verification
and Analysis, 7561:107–21. Springer Nature, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.
ieee: A. Gupta, “Improved single pass algorithms for resolution proof reduction,”
in 10th International Symposium on Automated Technology for Verification and
Analysis, Thiruvananthapuram, Kerala, India, 2012, vol. 7561, pp. 107–121.
ista: 'Gupta A. 2012. Improved single pass algorithms for resolution proof reduction.
10th International Symposium on Automated Technology for Verification and Analysis.
ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 107–121.'
mla: Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”
10th International Symposium on Automated Technology for Verification and Analysis,
vol. 7561, Springer Nature, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
short: A. Gupta, in:, 10th International Symposium on Automated Technology for Verification
and Analysis, Springer Nature, 2012, pp. 107–121.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, Kerala, India
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
corr_author: '1'
date_created: 2018-12-18T13:01:46Z
date_published: 2012-09-28T00:00:00Z
date_updated: 2025-04-15T07:56:27Z
day: '28'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33386-6_10
ec_funded: 1
file:
- access_level: open_access
checksum: 68415837a315de3cc4d120f6019d752c
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:07:35Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5746'
file_name: 2012_ATVA_Gupta.pdf
file_size: 465502
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
fulldoi: https://doi.org/10.1007/978-3-642-33386-6_10
has_accepted_license: '1'
intvolume: ' 7561'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 107-121
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: 10th International Symposium on Automated Technology for Verification
and Analysis
publication_identifier:
eisbn:
- '9783642333866'
eissn:
- 1611-3349
isbn:
- '9783642333859'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
pubrep_id: '180'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved single pass algorithms for resolution proof reduction
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7561
year: '2012'
...
---
_id: '9451'
abstract:
- lang: eng
text: The Arabidopsis thaliana central cell, the companion cell of the egg, undergoes
DNA demethylation before fertilization, but the targeting preferences, mechanism,
and biological significance of this process remain unclear. Here, we show that
active DNA demethylation mediated by the DEMETER DNA glycosylase accounts for
all of the demethylation in the central cell and preferentially targets small,
AT-rich, and nucleosome-depleted euchromatic transposable elements. The vegetative
cell, the companion cell of sperm, also undergoes DEMETER-dependent demethylation
of similar sequences, and lack of DEMETER in vegetative cells causes reduced small
RNA–directed DNA methylation of transposons in sperm. Our results demonstrate
that demethylation in companion cells reinforces transposon methylation in plant
gametes and likely contributes to stable silencing of transposable elements across
generations.
article_processing_charge: No
article_type: original
author:
- first_name: Christian A.
full_name: Ibarra, Christian A.
last_name: Ibarra
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
last_name: Feng
- first_name: Vera K.
full_name: Schoft, Vera K.
last_name: Schoft
- first_name: Tzung-Fu
full_name: Hsieh, Tzung-Fu
last_name: Hsieh
- first_name: Rie
full_name: Uzawa, Rie
last_name: Uzawa
- first_name: Jessica A.
full_name: Rodrigues, Jessica A.
last_name: Rodrigues
- first_name: Assaf
full_name: Zemach, Assaf
last_name: Zemach
- first_name: Nina
full_name: Chumak, Nina
last_name: Chumak
- first_name: Adriana
full_name: Machlicova, Adriana
last_name: Machlicova
- first_name: Toshiro
full_name: Nishimura, Toshiro
last_name: Nishimura
- first_name: Denisse
full_name: Rojas, Denisse
last_name: Rojas
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
- first_name: Hisashi
full_name: Tamaru, Hisashi
last_name: Tamaru
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion
cells reinforces transposon methylation in gametes. Science. 2012;337(6100):1360-1364.
doi:10.1126/science.1224839
apa: Ibarra, C. A., Feng, X., Schoft, V. K., Hsieh, T.-F., Uzawa, R., Rodrigues,
J. A., … Zilberman, D. (2012). Active DNA demethylation in plant companion cells
reinforces transposon methylation in gametes. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.1224839
chicago: Ibarra, Christian A., Xiaoqi Feng, Vera K. Schoft, Tzung-Fu Hsieh, Rie
Uzawa, Jessica A. Rodrigues, Assaf Zemach, et al. “Active DNA Demethylation in
Plant Companion Cells Reinforces Transposon Methylation in Gametes.” Science.
American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1224839.
ieee: C. A. Ibarra et al., “Active DNA demethylation in plant companion cells
reinforces transposon methylation in gametes,” Science, vol. 337, no. 6100.
American Association for the Advancement of Science, pp. 1360–1364, 2012.
ista: Ibarra CA, Feng X, Schoft VK, Hsieh T-F, Uzawa R, Rodrigues JA, Zemach A,
Chumak N, Machlicova A, Nishimura T, Rojas D, Fischer RL, Tamaru H, Zilberman
D. 2012. Active DNA demethylation in plant companion cells reinforces transposon
methylation in gametes. Science. 337(6100), 1360–1364.
mla: Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells
Reinforces Transposon Methylation in Gametes.” Science, vol. 337, no. 6100,
American Association for the Advancement of Science, 2012, pp. 1360–64, doi:10.1126/science.1224839.
short: C.A. Ibarra, X. Feng, V.K. Schoft, T.-F. Hsieh, R. Uzawa, J.A. Rodrigues,
A. Zemach, N. Chumak, A. Machlicova, T. Nishimura, D. Rojas, R.L. Fischer, H.
Tamaru, D. Zilberman, Science 337 (2012) 1360–1364.
date_created: 2021-06-04T07:51:31Z
date_published: 2012-09-14T00:00:00Z
date_updated: 2021-12-14T08:28:51Z
day: '14'
ddc:
- '580'
department:
- _id: DaZi
doi: 10.1126/science.1224839
extern: '1'
external_id:
pmid:
- '22984074'
fulldoi: https://doi.org/10.1126/science.1224839
has_accepted_license: '1'
intvolume: ' 337'
issue: '6100'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/
month: '09'
oa: 1
oa_version: Published Version
page: 1360-1364
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Active DNA demethylation in plant companion cells reinforces transposon methylation
in gametes
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 337
year: '2012'
...
---
_id: '9497'
abstract:
- lang: eng
text: The regulation of eukaryotic chromatin relies on interactions between many
epigenetic factors, including histone modifications, DNA methylation, and the
incorporation of histone variants. H2A.Z, one of the most conserved but enigmatic
histone variants that is enriched at the transcriptional start sites of genes,
has been implicated in a variety of chromosomal processes. Recently, we reported
a genome-wide anticorrelation between H2A.Z and DNA methylation, an epigenetic
hallmark of heterochromatin that has also been found in the bodies of active genes
in plants and animals. Here, we investigate the basis of this anticorrelation
using a novel h2a.z loss-of-function line in Arabidopsis thaliana. Through genome-wide
bisulfite sequencing, we demonstrate that loss of H2A.Z in Arabidopsis has only
a minor effect on the level or profile of DNA methylation in genes, and we propose
that the global anticorrelation between DNA methylation and H2A.Z is primarily
caused by the exclusion of H2A.Z from methylated DNA. RNA sequencing and genomic
mapping of H2A.Z show that H2A.Z enrichment across gene bodies, rather than at
the TSS, is correlated with lower transcription levels and higher measures of
gene responsiveness. Loss of H2A.Z causes misregulation of many genes that are
disproportionately associated with response to environmental and developmental
stimuli. We propose that H2A.Z deposition in gene bodies promotes variability
in levels and patterns of gene expression, and that a major function of genic
DNA methylation is to exclude H2A.Z from constitutively expressed genes.
article_number: e1002988
article_processing_charge: No
article_type: original
author:
- first_name: Devin
full_name: Coleman-Derr, Devin
last_name: Coleman-Derr
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Coleman-Derr D, Zilberman D. Deposition of histone variant H2A.Z within gene
bodies regulates responsive genes. PLoS Genetics. 2012;8(10). doi:10.1371/journal.pgen.1002988
apa: Coleman-Derr, D., & Zilberman, D. (2012). Deposition of histone variant
H2A.Z within gene bodies regulates responsive genes. PLoS Genetics. Public
Library of Science. https://doi.org/10.1371/journal.pgen.1002988
chicago: Coleman-Derr, Devin, and Daniel Zilberman. “Deposition of Histone Variant
H2A.Z within Gene Bodies Regulates Responsive Genes.” PLoS Genetics. Public
Library of Science, 2012. https://doi.org/10.1371/journal.pgen.1002988.
ieee: D. Coleman-Derr and D. Zilberman, “Deposition of histone variant H2A.Z within
gene bodies regulates responsive genes,” PLoS Genetics, vol. 8, no. 10.
Public Library of Science, 2012.
ista: Coleman-Derr D, Zilberman D. 2012. Deposition of histone variant H2A.Z within
gene bodies regulates responsive genes. PLoS Genetics. 8(10), e1002988.
mla: Coleman-Derr, Devin, and Daniel Zilberman. “Deposition of Histone Variant H2A.Z
within Gene Bodies Regulates Responsive Genes.” PLoS Genetics, vol. 8,
no. 10, e1002988, Public Library of Science, 2012, doi:10.1371/journal.pgen.1002988.
short: D. Coleman-Derr, D. Zilberman, PLoS Genetics 8 (2012).
date_created: 2021-06-07T10:55:27Z
date_published: 2012-10-11T00:00:00Z
date_updated: 2021-12-14T08:29:57Z
day: '11'
department:
- _id: DaZi
doi: 10.1371/journal.pgen.1002988
extern: '1'
external_id:
pmid:
- '23071449'
fulldoi: https://doi.org/10.1371/journal.pgen.1002988
intvolume: ' 8'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1371/journal.pgen.1002988
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Genetics
publication_identifier:
eissn:
- 1553-7404
issn:
- 1553-7390
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Deposition of histone variant H2A.Z within gene bodies regulates responsive
genes
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 8
year: '2012'
...
---
_id: '9499'
abstract:
- lang: eng
text: EMBRYONIC FLOWER1 (EMF1) is a plant-specific gene crucial to Arabidopsis vegetative
development. Loss of function mutants in the EMF1 gene mimic the phenotype caused
by mutations in Polycomb Group protein (PcG) genes, which encode epigenetic repressors
that regulate many aspects of eukaryotic development. In Arabidopsis, Polycomb
Repressor Complex 2 (PRC2), made of PcG proteins, catalyzes trimethylation of
lysine 27 on histone H3 (H3K27me3) and PRC1-like proteins catalyze H2AK119 ubiquitination.
Despite functional similarity to PcG proteins, EMF1 lacks sequence homology with
known PcG proteins; thus, its role in the PcG mechanism is unclear. To study the
EMF1 functions and its mechanism of action, we performed genome-wide mapping of
EMF1 binding and H3K27me3 modification sites in Arabidopsis seedlings. The EMF1
binding pattern is similar to that of H3K27me3 modification on the chromosomal
and genic level. ChIPOTLe peak finding and clustering analyses both show that
the highly trimethylated genes also have high enrichment levels of EMF1 binding,
termed EMF1_K27 genes. EMF1 interacts with regulatory genes, which are silenced
to allow vegetative growth, and with genes specifying cell fates during growth
and differentiation. H3K27me3 marks not only these genes but also some genes that
are involved in endosperm development and maternal effects. Transcriptome analysis,
coupled with the H3K27me3 pattern, of EMF1_K27 genes in emf1 and PRC2 mutants
showed that EMF1 represses gene activities via diverse mechanisms and plays a
novel role in the PcG mechanism.
article_number: e1002512
article_processing_charge: No
article_type: original
author:
- first_name: Sang Yeol
full_name: Kim, Sang Yeol
last_name: Kim
- first_name: Jungeun
full_name: Lee, Jungeun
last_name: Lee
- first_name: Leor
full_name: Eshed-Williams, Leor
last_name: Eshed-Williams
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Z. Renee
full_name: Sung, Z. Renee
last_name: Sung
citation:
ama: Kim SY, Lee J, Eshed-Williams L, Zilberman D, Sung ZR. EMF1 and PRC2 cooperate
to repress key regulators of Arabidopsis development. PLoS Genetics. 2012;8(3).
doi:10.1371/journal.pgen.1002512
apa: Kim, S. Y., Lee, J., Eshed-Williams, L., Zilberman, D., & Sung, Z. R. (2012).
EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development.
PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1002512
chicago: Kim, Sang Yeol, Jungeun Lee, Leor Eshed-Williams, Daniel Zilberman, and
Z. Renee Sung. “EMF1 and PRC2 Cooperate to Repress Key Regulators of Arabidopsis
Development.” PLoS Genetics. Public Library of Science, 2012. https://doi.org/10.1371/journal.pgen.1002512.
ieee: S. Y. Kim, J. Lee, L. Eshed-Williams, D. Zilberman, and Z. R. Sung, “EMF1
and PRC2 cooperate to repress key regulators of Arabidopsis development,” PLoS
Genetics, vol. 8, no. 3. Public Library of Science, 2012.
ista: Kim SY, Lee J, Eshed-Williams L, Zilberman D, Sung ZR. 2012. EMF1 and PRC2
cooperate to repress key regulators of Arabidopsis development. PLoS Genetics.
8(3), e1002512.
mla: Kim, Sang Yeol, et al. “EMF1 and PRC2 Cooperate to Repress Key Regulators of
Arabidopsis Development.” PLoS Genetics, vol. 8, no. 3, e1002512, Public
Library of Science, 2012, doi:10.1371/journal.pgen.1002512.
short: S.Y. Kim, J. Lee, L. Eshed-Williams, D. Zilberman, Z.R. Sung, PLoS Genetics
8 (2012).
date_created: 2021-06-07T11:07:56Z
date_published: 2012-03-22T00:00:00Z
date_updated: 2021-12-14T08:31:14Z
day: '22'
department:
- _id: DaZi
doi: 10.1371/journal.pgen.1002512
extern: '1'
external_id:
pmid:
- '22457632'
fulldoi: https://doi.org/10.1371/journal.pgen.1002512
intvolume: ' 8'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1371/journal.pgen.1002512
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Genetics
publication_identifier:
eissn:
- 1553-7404
issn:
- 1553-7390
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 8
year: '2012'
...
---
_id: '9528'
abstract:
- lang: eng
text: Accumulating evidence points toward diverse functions for plant chromatin.
Remarkable progress has been made over the last few years in elucidating the mechanisms
for a number of these functions. Activity of the histone demethylase IBM1 accurately
targets DNA methylation to silent repeats and transposable elements, not to genes.
A genetic screen uncovered the surprising role of H2A.Z-containing nucleosomes
in sensing precise differences in ambient temperature and consequent gene regulation.
Precise maintenance of chromosome number is assured by a histone modification
that suppresses inappropriate DNA replication and by centromeric histone H3 regulation
of chromosome segregation. Histones and noncoding RNAs regulate FLOWERING LOCUS
C, the expression of which quantitatively measures the duration of cold exposure,
functioning as memory of winter. These findings are a testament to the power of
using plants to research chromatin organization, and demonstrate examples of how
chromatin functions to achieve biological accuracy, precision, and memory.
article_processing_charge: No
article_type: review
author:
- first_name: Jason T.
full_name: Huff, Jason T.
last_name: Huff
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Huff JT, Zilberman D. Regulation of biological accuracy, precision, and memory
by plant chromatin organization. Current Opinion in Genetics and Development.
2012;22(2):132-138. doi:10.1016/j.gde.2012.01.007
apa: Huff, J. T., & Zilberman, D. (2012). Regulation of biological accuracy,
precision, and memory by plant chromatin organization. Current Opinion in Genetics
and Development. Elsevier. https://doi.org/10.1016/j.gde.2012.01.007
chicago: Huff, Jason T., and Daniel Zilberman. “Regulation of Biological Accuracy,
Precision, and Memory by Plant Chromatin Organization.” Current Opinion in
Genetics and Development. Elsevier, 2012. https://doi.org/10.1016/j.gde.2012.01.007.
ieee: J. T. Huff and D. Zilberman, “Regulation of biological accuracy, precision,
and memory by plant chromatin organization,” Current Opinion in Genetics and
Development, vol. 22, no. 2. Elsevier, pp. 132–138, 2012.
ista: Huff JT, Zilberman D. 2012. Regulation of biological accuracy, precision,
and memory by plant chromatin organization. Current Opinion in Genetics and Development.
22(2), 132–138.
mla: Huff, Jason T., and Daniel Zilberman. “Regulation of Biological Accuracy, Precision,
and Memory by Plant Chromatin Organization.” Current Opinion in Genetics and
Development, vol. 22, no. 2, Elsevier, 2012, pp. 132–38, doi:10.1016/j.gde.2012.01.007.
short: J.T. Huff, D. Zilberman, Current Opinion in Genetics and Development 22 (2012)
132–138.
date_created: 2021-06-08T08:58:52Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2021-12-14T08:32:38Z
department:
- _id: DaZi
doi: 10.1016/j.gde.2012.01.007
extern: '1'
external_id:
pmid:
- '22336527'
fulldoi: https://doi.org/10.1016/j.gde.2012.01.007
intvolume: ' 22'
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 132-138
pmid: 1
publication: Current Opinion in Genetics and Development
publication_identifier:
issn:
- 0959-437X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Regulation of biological accuracy, precision, and memory by plant chromatin
organization
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 22
year: '2012'
...
---
_id: '9535'
abstract:
- lang: eng
text: The most well-studied function of DNA methylation in eukaryotic cells is the
transcriptional silencing of genes and transposons. More recent results showed
that many eukaryotes methylate the bodies of genes as well and that this methylation
correlates with transcriptional activity rather than repression. The purpose of
gene body methylation remains mysterious, but is potentially related to the histone
variant H2A.Z. Studies in plants and animals have shown that the genome-wide distributions
of H2A.Z and DNA methylation are strikingly anticorrelated. Furthermore, we and
other investigators have shown that this relationship is likely to be the result
of an ancient but unknown mechanism by which DNA methylation prevents the incorporation
of H2A.Z. Recently, we discovered strong correlations between the presence of
H2A.Z within gene bodies, the degree to which a gene's expression varies across
tissue types or environmental conditions, and transcriptional misregulation in
an h2a.z mutant. We propose that one basal function of gene body methylation is
the establishment of constitutive expression patterns within housekeeping genes
by excluding H2A.Z from their bodies.
article_processing_charge: No
article_type: review
author:
- first_name: D.
full_name: Coleman-Derr, D.
last_name: Coleman-Derr
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Coleman-Derr D, Zilberman D. DNA methylation, H2A.Z, and the regulation of
constitutive expression. Cold Spring Harbor Symposia on Quantitative Biology.
2012;77:147-154. doi:10.1101/sqb.2012.77.014944
apa: Coleman-Derr, D., & Zilberman, D. (2012). DNA methylation, H2A.Z, and the
regulation of constitutive expression. Cold Spring Harbor Symposia on Quantitative
Biology. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/sqb.2012.77.014944
chicago: Coleman-Derr, D., and Daniel Zilberman. “DNA Methylation, H2A.Z, and the
Regulation of Constitutive Expression.” Cold Spring Harbor Symposia on Quantitative
Biology. Cold Spring Harbor Laboratory Press, 2012. https://doi.org/10.1101/sqb.2012.77.014944.
ieee: D. Coleman-Derr and D. Zilberman, “DNA methylation, H2A.Z, and the regulation
of constitutive expression,” Cold Spring Harbor Symposia on Quantitative Biology,
vol. 77. Cold Spring Harbor Laboratory Press, pp. 147–154, 2012.
ista: Coleman-Derr D, Zilberman D. 2012. DNA methylation, H2A.Z, and the regulation
of constitutive expression. Cold Spring Harbor Symposia on Quantitative Biology.
77, 147–154.
mla: Coleman-Derr, D., and Daniel Zilberman. “DNA Methylation, H2A.Z, and the Regulation
of Constitutive Expression.” Cold Spring Harbor Symposia on Quantitative Biology,
vol. 77, Cold Spring Harbor Laboratory Press, 2012, pp. 147–54, doi:10.1101/sqb.2012.77.014944.
short: D. Coleman-Derr, D. Zilberman, Cold Spring Harbor Symposia on Quantitative
Biology 77 (2012) 147–154.
date_created: 2021-06-08T13:01:23Z
date_published: 2012-12-18T00:00:00Z
date_updated: 2021-12-14T08:33:09Z
day: '18'
department:
- _id: DaZi
doi: 10.1101/sqb.2012.77.014944
extern: '1'
external_id:
pmid:
- '23250988'
fulldoi: https://doi.org/10.1101/sqb.2012.77.014944
intvolume: ' 77'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/sqb.2012.77.014944
month: '12'
oa: 1
oa_version: Published Version
page: 147-154
pmid: 1
publication: Cold Spring Harbor Symposia on Quantitative Biology
publication_identifier:
eissn:
- 1943-4456
issn:
- 0091-7451
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: DNA methylation, H2A.Z, and the regulation of constitutive expression
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 77
year: '2012'
...
---
_id: '9755'
abstract:
- lang: eng
text: Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated
disease defences at the individual and colony level. An intriguing yet little
understood phenomenon is that social contact to pathogen-exposed individuals reduces
susceptibility of previously naive nestmates to this pathogen. We tested whether
such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium
anisopliae is based on active upregulation of the immune system of nestmates following
contact to an infectious individual or passive protection via transfer of immune
effectors among group members—that is, active versus passive immunisation. We
found no evidence for involvement of passive immunisation via transfer of antimicrobials
among colony members. Instead, intensive allogrooming behaviour between naive
and pathogen-exposed ants before fungal conidia firmly attached to their cuticle
suggested passage of the pathogen from the exposed individuals to their nestmates.
By tracing fluorescence-labelled conidia we indeed detected frequent pathogen
transfer to the nestmates, where they caused low-level infections as revealed
by growth of small numbers of fungal colony forming units from their dissected
body content. These infections rarely led to death, but instead promoted an enhanced
ability to inhibit fungal growth and an active upregulation of immune genes involved
in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there
was no upregulation of the gene cathepsin L, which is associated with antibacterial
and antiviral defences, and we found no increased antibacterial activity of nestmates
of fungus-exposed ants. This indicates that social immunisation after fungal exposure
is specific, similar to recent findings for individual-level immune priming in
invertebrates. Epidemiological modeling further suggests that active social immunisation
is adaptive, as it leads to faster elimination of the disease and lower death
rates than passive immunisation. Interestingly, humans have also utilised the
protective effect of low-level infections to fight smallpox by intentional transfer
of low pathogen doses (“variolation” or “inoculation”).
article_processing_charge: No
author:
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Meghan
full_name: Vyleta, Meghan
id: 418901AA-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: Fabian
full_name: Theis, Fabian
last_name: Theis
- first_name: Miriam
full_name: Stock, Miriam
id: 42462816-F248-11E8-B48F-1D18A9856A87
last_name: Stock
- first_name: Martina
full_name: Klatt, Martina
id: E60F29C6-E9AE-11E9-AF6E-D190C7302F38
last_name: Klatt
- first_name: Verena
full_name: Drescher, Verena
last_name: Drescher
- first_name: Carsten
full_name: Marr, Carsten
last_name: Marr
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Konrad M, Vyleta M, Theis F, et al. Data from: Social transfer of pathogenic
fungus promotes active immunisation in ant colonies. 2012. doi:10.5061/dryad.sv37s'
apa: 'Konrad, M., Vyleta, M., Theis, F., Stock, M., Klatt, M., Drescher, V., … Cremer,
S. (2012). Data from: Social transfer of pathogenic fungus promotes active immunisation
in ant colonies. Dryad. https://doi.org/10.5061/dryad.sv37s'
chicago: 'Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Martina Klatt,
Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Data from:
Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.”
Dryad, 2012. https://doi.org/10.5061/dryad.sv37s.'
ieee: 'M. Konrad et al., “Data from: Social transfer of pathogenic fungus
promotes active immunisation in ant colonies.” Dryad, 2012.'
ista: 'Konrad M, Vyleta M, Theis F, Stock M, Klatt M, Drescher V, Marr C, Ugelvig
LV, Cremer S. 2012. Data from: Social transfer of pathogenic fungus promotes active
immunisation in ant colonies, Dryad, 10.5061/dryad.sv37s.'
mla: 'Konrad, Matthias, et al. Data from: Social Transfer of Pathogenic Fungus
Promotes Active Immunisation in Ant Colonies. Dryad, 2012, doi:10.5061/dryad.sv37s.'
short: M. Konrad, M. Vyleta, F. Theis, M. Stock, M. Klatt, V. Drescher, C. Marr,
L.V. Ugelvig, S. Cremer, (2012).
date_created: 2021-07-30T08:39:13Z
date_published: 2012-09-27T00:00:00Z
date_updated: 2025-09-30T07:50:00Z
day: '27'
department:
- _id: SyCr
doi: 10.5061/dryad.sv37s
fulldoi: https://doi.org/10.5061/dryad.sv37s
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.sv37s
month: '09'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '3242'
relation: used_in_publication
status: public
status: public
title: 'Data from: Social transfer of pathogenic fungus promotes active immunisation
in ant colonies'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2012'
...
---
_id: '9757'
abstract:
- lang: eng
text: To fight infectious diseases, host immune defences are employed at multiple
levels. Sanitary behaviour, such as pathogen avoidance and removal, acts as a
first line of defence to prevent infection [1] before activation of the physiological
immune system. Insect societies have evolved a wide range of collective hygiene
measures and intensive health care towards pathogen-exposed group members [2].
One of the most common behaviours is allogrooming, in which nestmates remove infectious
particles from the body surfaces of exposed individuals [3]. Here we show that,
in invasive garden ants, grooming of fungus-exposed brood is effective beyond
the sheer mechanical removal of fungal conidiospores as it also includes chemical
disinfection through the application of poison produced by the ants themselves.
Formic acid is the main active component of the poison. It inhibits fungal growth
of conidiospores remaining on the brood surface after grooming and also those
collected in the mouth of the grooming ant. This dual function is achieved by
uptake of the poison droplet into the mouth through acidopore self-grooming and
subsequent application onto the infectious brood via brood grooming. This extraordinary
behaviour extends current understanding of grooming and the establishment of social
immunity in insect societies.
article_processing_charge: No
author:
- first_name: Simon
full_name: Tragust, Simon
id: 35A7A418-F248-11E8-B48F-1D18A9856A87
last_name: Tragust
- first_name: Barbara
full_name: Mitteregger, Barbara
id: 479DDAAC-E9CD-11E9-9B5F-82450873F7A1
last_name: Mitteregger
- first_name: Vanessa
full_name: Barone, Vanessa
id: 419EECCC-F248-11E8-B48F-1D18A9856A87
last_name: Barone
orcid: 0000-0003-2676-3367
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. Data from:
Ants disinfect fungus-exposed brood by oral uptake and spread of their poison.
2012. doi:10.5061/dryad.61649'
apa: 'Tragust, S., Mitteregger, B., Barone, V., Konrad, M., Ugelvig, L. V., &
Cremer, S. (2012). Data from: Ants disinfect fungus-exposed brood by oral uptake
and spread of their poison. Dryad. https://doi.org/10.5061/dryad.61649'
chicago: 'Tragust, Simon, Barbara Mitteregger, Vanessa Barone, Matthias Konrad,
Line V Ugelvig, and Sylvia Cremer. “Data from: Ants Disinfect Fungus-Exposed Brood
by Oral Uptake and Spread of Their Poison.” Dryad, 2012. https://doi.org/10.5061/dryad.61649.'
ieee: 'S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer,
“Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their
poison.” Dryad, 2012.'
ista: 'Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2012.
Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their
poison, Dryad, 10.5061/dryad.61649.'
mla: 'Tragust, Simon, et al. Data from: Ants Disinfect Fungus-Exposed Brood by
Oral Uptake and Spread of Their Poison. Dryad, 2012, doi:10.5061/dryad.61649.'
short: S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L.V. Ugelvig, S. Cremer,
(2012).
date_created: 2021-07-30T12:31:31Z
date_published: 2012-12-14T00:00:00Z
date_updated: 2025-09-30T08:15:49Z
day: '14'
department:
- _id: SyCr
doi: 10.5061/dryad.61649
fulldoi: https://doi.org/10.5061/dryad.61649
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.61649
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2926'
relation: used_in_publication
status: public
status: public
title: 'Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of
their poison'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2012'
...
---
_id: '9758'
abstract:
- lang: eng
text: 'We propose a two-step procedure for estimating multiple migration rates in
an approximate Bayesian computation (ABC) framework, accounting for global nuisance
parameters. The approach is not limited to migration, but generally of interest
for inference problems with multiple parameters and a modular structure (e.g.
independent sets of demes or loci). We condition on a known, but complex demographic
model of a spatially subdivided population, motivated by the reintroduction of
Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters
ancestral mutation rate and male mating skew have been estimated for the whole
population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step,
we estimate in this study the migration rates independently for clusters of demes
putatively connected by migration. For large clusters (many migration rates),
ABC faces the problem of too many summary statistics. We therefore assess by simulation
if estimation per pair of demes is a valid alternative. We find that the trade-off
between reduced dimensionality for the pairwise estimation on the one hand and
lower accuracy due to the assumption of pairwise independence on the other depends
on the number of migration rates to be inferred: the accuracy of the pairwise
approach increases with the number of parameters, relative to the joint estimation
approach. To distinguish between low and zero migration, we perform ABC-type model
comparison between a model with migration and one without. Applying the approach
to microsatellite data from Alpine ibex, we find no evidence for substantial gene
flow via migration, except for one pair of demes in one direction.'
article_processing_charge: No
author:
- first_name: Simon
full_name: Aeschbacher, Simon
id: 2D35326E-F248-11E8-B48F-1D18A9856A87
last_name: Aeschbacher
- first_name: Andreas
full_name: Futschik, Andreas
last_name: Futschik
- first_name: Mark
full_name: Beaumont, Mark
last_name: Beaumont
citation:
ama: 'Aeschbacher S, Futschik A, Beaumont M. Data from: Approximate Bayesian computation
for modular inference problems with many parameters: the example of migration
rates. 2012. doi:10.5061/dryad.274b1'
apa: 'Aeschbacher, S., Futschik, A., & Beaumont, M. (2012). Data from: Approximate
Bayesian computation for modular inference problems with many parameters: the
example of migration rates. Dryad. https://doi.org/10.5061/dryad.274b1'
chicago: 'Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Data from: Approximate
Bayesian Computation for Modular Inference Problems with Many Parameters: The
Example of Migration Rates.” Dryad, 2012. https://doi.org/10.5061/dryad.274b1.'
ieee: 'S. Aeschbacher, A. Futschik, and M. Beaumont, “Data from: Approximate Bayesian
computation for modular inference problems with many parameters: the example of
migration rates.” Dryad, 2012.'
ista: 'Aeschbacher S, Futschik A, Beaumont M. 2012. Data from: Approximate Bayesian
computation for modular inference problems with many parameters: the example of
migration rates, Dryad, 10.5061/dryad.274b1.'
mla: 'Aeschbacher, Simon, et al. Data from: Approximate Bayesian Computation
for Modular Inference Problems with Many Parameters: The Example of Migration
Rates. Dryad, 2012, doi:10.5061/dryad.274b1.'
short: S. Aeschbacher, A. Futschik, M. Beaumont, (2012).
date_created: 2021-07-30T12:36:39Z
date_published: 2012-11-14T00:00:00Z
date_updated: 2025-09-29T13:25:35Z
day: '14'
department:
- _id: NiBa
doi: 10.5061/dryad.274b1
fulldoi: https://doi.org/10.5061/dryad.274b1
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.274b1
month: '11'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2944'
relation: used_in_publication
status: public
status: public
title: 'Data from: Approximate Bayesian computation for modular inference problems
with many parameters: the example of migration rates'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2012'
...
---
OA_place: publisher
_id: '6588'
abstract:
- lang: eng
text: First we note that the best polynomial approximation to vertical bar x vertical
bar on the set, which consists of an interval on the positive half-axis and a
point on the negative half-axis, can be given by means of the classical Chebyshev
polynomials. Then we explore the cases when a solution of the related problem
on two intervals can be given in elementary functions.
acknowledgement: "This work is supported by the Austrian Science Fund (FWF), Project
P22025-N18.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Pausinger F. Elementary solutions of the Bernstein problem on two intervals.
Journal of Mathematical Physics, Analysis, Geometry. 2012;8(1):63-78.
apa: Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two
intervals. Journal of Mathematical Physics, Analysis, Geometry. B. Verkin
Institute for Low Temperature Physics and Engineering.
chicago: Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two
Intervals.” Journal of Mathematical Physics, Analysis, Geometry. B. Verkin
Institute for Low Temperature Physics and Engineering, 2012.
ieee: F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,”
Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B.
Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.
ista: Pausinger F. 2012. Elementary solutions of the Bernstein problem on two intervals.
Journal of Mathematical Physics, Analysis, Geometry. 8(1), 63–78.
mla: Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.”
Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1, B.
Verkin Institute for Low Temperature Physics and Engineering, 2012, pp. 63–78.
short: F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012)
63–78.
corr_author: '1'
date_created: 2019-06-27T08:16:56Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2026-06-18T19:08:51Z
day: '01'
ddc:
- '500'
department:
- _id: HeEd
external_id:
isi:
- '000301173600004'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mathnet.ru/eng/jmag525
month: '01'
oa: 1
oa_version: Published Version
page: 63-78
publication: Journal of Mathematical Physics, Analysis, Geometry
publication_identifier:
issn:
- 1812-9471
publication_status: published
publisher: B. Verkin Institute for Low Temperature Physics and Engineering
quality_controlled: '1'
scopus_import: '1'
status: public
title: Elementary solutions of the Bernstein problem on two intervals
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2012'
...
---
_id: '3115'
abstract:
- lang: eng
text: 'We consider the offset-deconstruction problem: Given a polygonal shape Q
with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance,
as the Minkowski sum of another polygonal shape P with a disk of fixed radius?
If it does, we also seek a preferably simple-looking solution P; then, P''s offset
constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We
give an O(nlogn)-time exact decision algorithm that handles any polygonal shape,
assuming the real-RAM model of computation. A variant of the algorithm, which
we have implemented using the cgal library, is based on rational arithmetic and
answers the same deconstruction problem up to an uncertainty parameter δ its running
time additionally depends on δ. If the input shape is found to be approximable,
this algorithm also computes an approximate solution for the problem. It also
allows us to solve parameter-optimization problems induced by the offset-deconstruction
problem. For convex shapes, the complexity of the exact decision algorithm drops
to O(n), which is also the time required to compute a solution P with at most
one more vertex than a vertex-minimal one.'
acknowledgement: "We thank Eyal Flato (Plataine Ltd.) for raising the offset-deconstruction
problem in connection with wood cutting. We also thank Tim Bretl (UIUC) for suggesting
the digital-pen offset-deconstruction problem. This work has been supported in part
by the Israel Science Foundation (grant no. 1102/11), by the German–Israeli Foundation
(grant no. 969/07), by the Hermann Minkowski–Minerva Center for Geometry at Tel
Aviv University, and by the EU Project under Contract No. 255827 (CGL—Computational
Geometry Learning).\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Eric
full_name: Berberich, Eric
last_name: Berberich
- first_name: Dan
full_name: Halperin, Dan
last_name: Halperin
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Roza
full_name: Pogalnikova, Roza
last_name: Pogalnikova
citation:
ama: Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate
offsets. Discrete & Computational Geometry. 2012;48(4):964-989. doi:10.1007/s00454-012-9441-5
apa: Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2012). Deconstructing
approximate offsets. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-012-9441-5
chicago: Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing
Approximate Offsets.” Discrete & Computational Geometry. Springer,
2012. https://doi.org/10.1007/s00454-012-9441-5.
ieee: E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing
approximate offsets,” Discrete & Computational Geometry, vol. 48, no.
4. Springer, pp. 964–989, 2012.
ista: Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate
offsets. Discrete & Computational Geometry. 48(4), 964–989.
mla: Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Discrete &
Computational Geometry, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:10.1007/s00454-012-9441-5.
short: E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete & Computational
Geometry 48 (2012) 964–989.
corr_author: '1'
date_created: 2018-12-11T12:01:28Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2025-09-30T08:01:36Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-012-9441-5
external_id:
arxiv:
- '1109.2158'
isi:
- '000311503200006'
fulldoi: https://doi.org/10.1007/s00454-012-9441-5
intvolume: ' 48'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1109.2158
month: '12'
oa: 1
oa_version: Preprint
page: 964 - 989
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '3584'
quality_controlled: '1'
related_material:
record:
- id: '3329'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Deconstructing approximate offsets
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 48
year: '2012'
...
---
_id: '3117'
abstract:
- lang: eng
text: We consider the problem of minimizing a function represented as a sum of submodular
terms. We assume each term allows an efficient computation of exchange capacities.
This holds, for example, for terms depending on a small number of variables, or
for certain cardinality-dependent terms. A naive application of submodular minimization
algorithms would not exploit the existence of specialized exchange capacity subroutines
for individual terms. To overcome this, we cast the problem as a submodular flow
(SF) problem in an auxiliary graph in such a way that applying most existing SF
algorithms would rely only on these subroutines. We then explore in more detail
Iwata's capacity scaling approach for submodular flows (Iwata 1997 [19]). In particular,
we show how to improve its complexity in the case when the function contains cardinality-dependent
terms.
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Minimizing a sum of submodular functions. Discrete Applied
Mathematics. 2012;160(15):2246-2258. doi:10.1016/j.dam.2012.05.025
apa: Kolmogorov, V. (2012). Minimizing a sum of submodular functions. Discrete
Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2012.05.025
chicago: Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete
Applied Mathematics. Elsevier, 2012. https://doi.org/10.1016/j.dam.2012.05.025.
ieee: V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied
Mathematics, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012.
ista: Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied
Mathematics. 160(15), 2246–2258.
mla: Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete
Applied Mathematics, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:10.1016/j.dam.2012.05.025.
short: V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.
corr_author: '1'
date_created: 2018-12-11T12:01:29Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2025-09-30T08:01:04Z
day: '01'
department:
- _id: VlKo
doi: 10.1016/j.dam.2012.05.025
external_id:
isi:
- '000308052600017'
fulldoi: https://doi.org/10.1016/j.dam.2012.05.025
intvolume: ' 160'
isi: 1
issue: '15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1006.1990
month: '10'
oa: 1
oa_version: Preprint
page: 2246 - 2258
publication: Discrete Applied Mathematics
publication_status: published
publisher: Elsevier
publist_id: '3582'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Minimizing a sum of submodular functions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 160
year: '2012'
...
---
_id: '3118'
abstract:
- lang: eng
text: We present a method for recovering a temporally coherent, deforming triangle
mesh with arbitrarily changing topology from an incoherent sequence of static
closed surfaces. We solve this problem using the surface geometry alone, without
any prior information like surface templates or velocity fields. Our system combines
a proven strategy for triangle mesh improvement, a robust multi-resolution non-rigid
registration routine, and a reliable technique for changing surface mesh topology.
We also introduce a novel topological constraint enforcement algorithm to ensure
that the output and input always have similar topology. We apply our technique
to a series of diverse input data from video reconstructions, physics simulations,
and artistic morphs. The structured output of our algorithm allows us to efficiently
track information like colors and displacement maps, recover velocity information,
and solve PDEs on the mesh as a post process.
acknowledgement: "This work is supported by the SNF fellowship PBEZP2-134464.\r\nWe
would like to thank Xiaochen Hu for implementing mesh con- version tools, Duygu
Ceylan for helping with the rendering, and Art Tevs for the human performance data
comparison. We also thank Nils Thuerey and Christopher Batty for helpful discussions. "
alternative_title:
- SIGGRAPH
article_number: '53'
article_processing_charge: No
article_type: original
author:
- first_name: Morten
full_name: Bojsen-Hansen, Morten
id: 439F0C8C-F248-11E8-B48F-1D18A9856A87
last_name: Bojsen-Hansen
orcid: 0000-0002-4417-3224
- first_name: Hao
full_name: Li, Hao
last_name: Li
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Bojsen-Hansen M, Li H, Wojtan C. Tracking surfaces with evolving topology.
ACM Transactions on Graphics. 2012;31(4). doi:10.1145/2185520.2185549
apa: Bojsen-Hansen, M., Li, H., & Wojtan, C. (2012). Tracking surfaces with
evolving topology. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2185520.2185549
chicago: Bojsen-Hansen, Morten, Hao Li, and Chris Wojtan. “Tracking Surfaces with
Evolving Topology.” ACM Transactions on Graphics. ACM, 2012. https://doi.org/10.1145/2185520.2185549.
ieee: M. Bojsen-Hansen, H. Li, and C. Wojtan, “Tracking surfaces with evolving topology,”
ACM Transactions on Graphics, vol. 31, no. 4. ACM, 2012.
ista: Bojsen-Hansen M, Li H, Wojtan C. 2012. Tracking surfaces with evolving topology.
ACM Transactions on Graphics. 31(4), 53.
mla: Bojsen-Hansen, Morten, et al. “Tracking Surfaces with Evolving Topology.” ACM
Transactions on Graphics, vol. 31, no. 4, 53, ACM, 2012, doi:10.1145/2185520.2185549.
short: M. Bojsen-Hansen, H. Li, C. Wojtan, ACM Transactions on Graphics 31 (2012).
corr_author: '1'
date_created: 2018-12-11T12:01:29Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2025-09-30T08:00:23Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2185520.2185549
external_id:
isi:
- '000308250300029'
file:
- access_level: open_access
checksum: 1e219c5bf4e5552c1290c62eefa5cd60
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:37Z
date_updated: 2020-07-14T12:46:00Z
file_id: '5359'
file_name: IST-2016-602-v1+1_topoReg.pdf
file_size: 44538518
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
fulldoi: https://doi.org/10.1145/2185520.2185549
has_accepted_license: '1'
intvolume: ' 31'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '3581'
pubrep_id: '602'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tracking surfaces with evolving topology
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 31
year: '2012'
...