---
_id: '2128'
abstract:
- lang: eng
text: We introduce a technique for handling Whitney decompositions in Gaussian harmonic
analysis and apply it to the study of Gaussian analogues of the classical tent
spaces T 1,q of Coifman–Meyer–Stein.
acknowledgement: J. Maas was supported by Rubicon subsidy 680-50-0901 of the Netherlands
Organisation for Scientific Research (NWO). J. van Neerven was supported by VICI
subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO).
author:
- first_name: Jan
full_name: Jan Maas
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Jan
full_name: van Neerven, Jan M
last_name: Van Neerven
- first_name: Pierre
full_name: Portal, Pierre
last_name: Portal
citation:
ama: Maas J, Van Neerven J, Portal P. Whitney coverings and the tent spaces T 1,q
(γ) for the Gaussian measure. Arkiv för Matematik. 2012;50(2):379-395.
doi:10.1007/s11512-010-0143-z
apa: Maas, J., Van Neerven, J., & Portal, P. (2012). Whitney coverings and the
tent spaces T 1,q (γ) for the Gaussian measure. Arkiv För Matematik. Springer.
https://doi.org/10.1007/s11512-010-0143-z
chicago: Maas, Jan, Jan Van Neerven, and Pierre Portal. “Whitney Coverings and the
Tent Spaces T 1,q (γ) for the Gaussian Measure.” Arkiv För Matematik. Springer,
2012. https://doi.org/10.1007/s11512-010-0143-z.
ieee: J. Maas, J. Van Neerven, and P. Portal, “Whitney coverings and the tent spaces
T 1,q (γ) for the Gaussian measure,” Arkiv för Matematik, vol. 50, no.
2. Springer, pp. 379–395, 2012.
ista: Maas J, Van Neerven J, Portal P. 2012. Whitney coverings and the tent spaces
T 1,q (γ) for the Gaussian measure. Arkiv för Matematik. 50(2), 379–395.
mla: Maas, Jan, et al. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the
Gaussian Measure.” Arkiv För Matematik, vol. 50, no. 2, Springer, 2012,
pp. 379–95, doi:10.1007/s11512-010-0143-z.
short: J. Maas, J. Van Neerven, P. Portal, Arkiv För Matematik 50 (2012) 379–395.
date_created: 2018-12-11T11:55:52Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:28Z
day: '01'
doi: 10.1007/s11512-010-0143-z
extern: 1
intvolume: ' 50'
issue: '2'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1002.4911
month: '10'
oa: 1
page: 379 - 395
publication: Arkiv för Matematik
publication_status: published
publisher: Springer
publist_id: '4907'
quality_controlled: 0
status: public
title: Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure
type: journal_article
volume: 50
year: '2012'
...
---
_id: '13407'
abstract:
- lang: eng
text: We show that diamagnetic particles can be remotely manipulated by a magnet
by the reversible adsorption of dual-responsive, light-switchable/superparamagnetic
nanoparticles down to their surface. Adsorption occurs upon exposure to UV light,
and can be reversed thermally or by ambient light. The dynamic self-assembly of
thin films of the dual-responsive nanoparticles induces attractive interactions
between diamagnetic particles. We demonstrate that catalytic amounts of the dual-responsive
nanoparticles are sufficient to magnetically guide and deliver the diamagnetic
particles to desired locations, where they can then be released by disassembling
the dynamic layers of superparamagnetic nanoparticles with visible light.
article_processing_charge: No
article_type: original
author:
- first_name: Olga
full_name: Chovnik, Olga
last_name: Chovnik
- first_name: Renata
full_name: Balgley, Renata
last_name: Balgley
- first_name: Joel R.
full_name: Goldman, Joel R.
last_name: Goldman
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Chovnik O, Balgley R, Goldman JR, Klajn R. Dynamically self-assembling carriers
enable guiding of diamagnetic particles by weak magnets. Journal of the American
Chemical Society. 2012;134(48):19564-19567. doi:10.1021/ja309633v
apa: Chovnik, O., Balgley, R., Goldman, J. R., & Klajn, R. (2012). Dynamically
self-assembling carriers enable guiding of diamagnetic particles by weak magnets.
Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/ja309633v
chicago: Chovnik, Olga, Renata Balgley, Joel R. Goldman, and Rafal Klajn. “Dynamically
Self-Assembling Carriers Enable Guiding of Diamagnetic Particles by Weak Magnets.”
Journal of the American Chemical Society. American Chemical Society, 2012.
https://doi.org/10.1021/ja309633v.
ieee: O. Chovnik, R. Balgley, J. R. Goldman, and R. Klajn, “Dynamically self-assembling
carriers enable guiding of diamagnetic particles by weak magnets,” Journal
of the American Chemical Society, vol. 134, no. 48. American Chemical Society,
pp. 19564–19567, 2012.
ista: Chovnik O, Balgley R, Goldman JR, Klajn R. 2012. Dynamically self-assembling
carriers enable guiding of diamagnetic particles by weak magnets. Journal of the
American Chemical Society. 134(48), 19564–19567.
mla: Chovnik, Olga, et al. “Dynamically Self-Assembling Carriers Enable Guiding
of Diamagnetic Particles by Weak Magnets.” Journal of the American Chemical
Society, vol. 134, no. 48, American Chemical Society, 2012, pp. 19564–67,
doi:10.1021/ja309633v.
short: O. Chovnik, R. Balgley, J.R. Goldman, R. Klajn, Journal of the American Chemical
Society 134 (2012) 19564–19567.
date_created: 2023-08-01T09:47:42Z
date_published: 2012-11-26T00:00:00Z
date_updated: 2024-10-14T12:21:27Z
day: '26'
doi: 10.1021/ja309633v
extern: '1'
external_id:
pmid:
- '23181449'
intvolume: ' 134'
issue: '48'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '11'
oa_version: Published Version
page: 19564-19567
pmid: 1
publication: Journal of the American Chemical Society
publication_identifier:
eissn:
- 1520-5126
issn:
- 0002-7863
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamically self-assembling carriers enable guiding of diamagnetic particles
by weak magnets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 134
year: '2012'
...
---
_id: '13408'
abstract:
- lang: eng
text: Well-defined metallic nanobowls can be prepared by extending the concept of
a protecting group to colloidal synthesis. Magnetic nanoparticles are employed
as “protecting groups” during the galvanic replacement of silver with gold. The
replacement reaction is accompanied by spontantous dissociation of the protecting
groups, leaving behind metallic nanobowls.
article_processing_charge: No
article_type: original
author:
- first_name: Yonatan
full_name: Ridelman, Yonatan
last_name: Ridelman
- first_name: Gurvinder
full_name: Singh, Gurvinder
last_name: Singh
- first_name: Ronit
full_name: Popovitz-Biro, Ronit
last_name: Popovitz-Biro
- first_name: Sharon G.
full_name: Wolf, Sharon G.
last_name: Wolf
- first_name: Sanjib
full_name: Das, Sanjib
last_name: Das
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Ridelman Y, Singh G, Popovitz-Biro R, Wolf SG, Das S, Klajn R. Metallic nanobowls
by galvanic replacement reaction on heterodimeric nanoparticles. Small.
2012;8(5):654-660. doi:10.1002/smll.201101882
apa: Ridelman, Y., Singh, G., Popovitz-Biro, R., Wolf, S. G., Das, S., & Klajn,
R. (2012). Metallic nanobowls by galvanic replacement reaction on heterodimeric
nanoparticles. Small. Wiley. https://doi.org/10.1002/smll.201101882
chicago: Ridelman, Yonatan, Gurvinder Singh, Ronit Popovitz-Biro, Sharon G. Wolf,
Sanjib Das, and Rafal Klajn. “Metallic Nanobowls by Galvanic Replacement Reaction
on Heterodimeric Nanoparticles.” Small. Wiley, 2012. https://doi.org/10.1002/smll.201101882.
ieee: Y. Ridelman, G. Singh, R. Popovitz-Biro, S. G. Wolf, S. Das, and R. Klajn,
“Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles,”
Small, vol. 8, no. 5. Wiley, pp. 654–660, 2012.
ista: Ridelman Y, Singh G, Popovitz-Biro R, Wolf SG, Das S, Klajn R. 2012. Metallic
nanobowls by galvanic replacement reaction on heterodimeric nanoparticles. Small.
8(5), 654–660.
mla: Ridelman, Yonatan, et al. “Metallic Nanobowls by Galvanic Replacement Reaction
on Heterodimeric Nanoparticles.” Small, vol. 8, no. 5, Wiley, 2012, pp.
654–60, doi:10.1002/smll.201101882.
short: Y. Ridelman, G. Singh, R. Popovitz-Biro, S.G. Wolf, S. Das, R. Klajn, Small
8 (2012) 654–660.
date_created: 2023-08-01T09:47:55Z
date_published: 2012-03-12T00:00:00Z
date_updated: 2024-10-14T12:21:38Z
day: '12'
doi: 10.1002/smll.201101882
extern: '1'
external_id:
pmid:
- '22392681'
intvolume: ' 8'
issue: '5'
keyword:
- Biomaterials
- Biotechnology
- General Materials Science
- General Chemistry
language:
- iso: eng
month: '03'
oa_version: None
page: 654-660
pmid: 1
publication: Small
publication_identifier:
eissn:
- 1613-6829
issn:
- 1613-6810
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2012'
...
---
_id: '1384'
abstract:
- lang: eng
text: 'Software model checking, as an undecidable problem, has three possible outcomes:
(1) the program satisfies the specification, (2) the program does not satisfy
the specification, and (3) the model checker fails. The third outcome usually
manifests itself in a space-out, time-out, or one component of the verification
tool giving up; in all of these failing cases, significant computation is performed
by the verification tool before the failure, but no result is reported. We propose
to reformulate the model-checking problem as follows, in order to have the verification
tool report a summary of the performed work even in case of failure: given a program
and a specification, the model checker returns a condition Ψ - usually a state
predicate - such that the program satisfies the specification under the condition
Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied.
In our experiments, we investigated as one major application of conditional model
checking the sequential combination of model checkers with information passing.
We give the condition that one model checker produces, as input to a second conditional
model checker, such that the verification problem for the second is restricted
to the part of the state space that is not covered by the condition, i.e., the
second model checker works on the problems that the first model checker could
not solve. Our experiments demonstrate that repeated application of conditional
model checkers, passing information from one model checker to the next, can significantly
improve the verification results and performance, i.e., we can now verify programs
that we could not verify before.'
acknowledgement: This research was supported by the Canadian NSERC grant RGPIN 341819-07, the ERC Advanced Grant
QUAREM, and the Austrian Science Fund NFN RiSE.
article_number: '57'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- 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: Mehmet
full_name: Keremoglu, Mehmet
last_name: Keremoglu
- first_name: Philipp
full_name: Wendler, Philipp
last_name: Wendler
citation:
ama: 'Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking:
A technique to pass information between verifiers. In: Proceedings of the ACM
SIGSOFT 20th International Symposium on the Foundations of Software Engineering.
ACM; 2012. doi:10.1145/2393596.2393664'
apa: 'Beyer, D., Henzinger, T. A., Keremoglu, M., & Wendler, P. (2012). Conditional
model checking: A technique to pass information between verifiers. In Proceedings
of the ACM SIGSOFT 20th International Symposium on the Foundations of Software
Engineering. Cary, NC, USA: ACM. https://doi.org/10.1145/2393596.2393664'
chicago: 'Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler.
“Conditional Model Checking: A Technique to Pass Information between Verifiers.”
In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations
of Software Engineering. ACM, 2012. https://doi.org/10.1145/2393596.2393664.'
ieee: 'D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model
checking: A technique to pass information between verifiers,” in Proceedings
of the ACM SIGSOFT 20th International Symposium on the Foundations of Software
Engineering, Cary, NC, USA, 2012.'
ista: 'Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking:
A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT
20th International Symposium on the Foundations of Software Engineering. FSE:
Foundations of Software Engineering, 57.'
mla: 'Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information
between Verifiers.” Proceedings of the ACM SIGSOFT 20th International Symposium
on the Foundations of Software Engineering, 57, ACM, 2012, doi:10.1145/2393596.2393664.'
short: D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the
ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering,
ACM, 2012.
conference:
end_date: 2012-11-16
location: Cary, NC, USA
name: 'FSE: Foundations of Software Engineering'
start_date: 2012-11-11
date_created: 2018-12-11T11:51:42Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2025-06-11T08:07:37Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2393596.2393664
ec_funded: 1
external_id:
arxiv:
- '1109.6926'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1109.6926
month: '11'
oa: 1
oa_version: Preprint
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
publication: Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations
of Software Engineering
publication_status: published
publisher: ACM
publist_id: '5826'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Conditional model checking: A technique to pass information between verifiers'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '1471'
abstract:
- lang: eng
text: 'Given a possibly reducible and non-reduced spectral cover π: X → C over a
smooth projective complex curve C we determine the group of connected components
of the Prym variety Prym(X/C). As an immediate application we show that the finite
group of n-torsion points of the Jacobian of C acts trivially on the cohomology
of the twisted SL n-Higgs moduli space up to the degree which is predicted by
topological mirror symmetry. In particular this yields a new proof of a result
of Harder-Narasimhan, showing that this finite group acts trivially on the cohomology
of the twisted SL n stable bundle moduli space.'
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Christian
full_name: Pauly, Christian
last_name: Pauly
citation:
ama: Hausel T, Pauly C. Prym varieties of spectral covers. Geometry and Topology.
2012;16(3):1609-1638. doi:10.2140/gt.2012.16.1609
apa: Hausel, T., & Pauly, C. (2012). Prym varieties of spectral covers. Geometry
and Topology. University of Warwick. https://doi.org/10.2140/gt.2012.16.1609
chicago: Hausel, Tamás, and Christian Pauly. “Prym Varieties of Spectral Covers.”
Geometry and Topology. University of Warwick, 2012. https://doi.org/10.2140/gt.2012.16.1609.
ieee: T. Hausel and C. Pauly, “Prym varieties of spectral covers,” Geometry and
Topology, vol. 16, no. 3. University of Warwick, pp. 1609–1638, 2012.
ista: Hausel T, Pauly C. 2012. Prym varieties of spectral covers. Geometry and Topology.
16(3), 1609–1638.
mla: Hausel, Tamás, and Christian Pauly. “Prym Varieties of Spectral Covers.” Geometry
and Topology, vol. 16, no. 3, University of Warwick, 2012, pp. 1609–38, doi:10.2140/gt.2012.16.1609.
short: T. Hausel, C. Pauly, Geometry and Topology 16 (2012) 1609–1638.
date_created: 2018-12-11T11:52:13Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T06:50:58Z
day: '01'
doi: 10.2140/gt.2012.16.1609
extern: 1
intvolume: ' 16'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1012.4748
month: '08'
oa: 1
page: 1609 - 1638
publication: Geometry and Topology
publication_status: published
publisher: University of Warwick
publist_id: '5726'
quality_controlled: 0
status: public
title: Prym varieties of spectral covers
type: journal_article
volume: 16
year: '2012'
...
---
_id: '1472'
abstract:
- lang: eng
text: For G = GL 2, PGL 2, SL 2 we prove that the perverse filtration associated
with the Hitchin map on the rational cohomology of the moduli space of twisted
G-Higgs bundles on a compact Riemann surface C agrees with the weight filtration
on the rational cohomology of the twisted G character variety of C when the cohomologies
are identified via non-Abelian Hodge theory. The proof is accomplished by means
of a study of the topology of the Hitchin map over the locus of integral spectral
curves.
acknowledgement: Mark Andrea A. de Cataldo was partially supported by N.S.A. and N.S.F.
Tamás Hausel was supported by a Royal Society University Research Fellowship. Luca
Migliorini was partially supported by PRIN 2007 project "Spazi di moduli e teoria
di Lie"
author:
- first_name: Mark
full_name: De Cataldo, Mark A
last_name: De Cataldo
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Luca
full_name: Migliorini, Luca
last_name: Migliorini
citation:
ama: 'De Cataldo M, Hausel T, Migliorini L. Topology of hitchin systems and Hodge
theory of character varieties: The case A 1. Annals of Mathematics. 2012;175(3):1329-1407.
doi:10.4007/annals.2012.175.3.7'
apa: 'De Cataldo, M., Hausel, T., & Migliorini, L. (2012). Topology of hitchin
systems and Hodge theory of character varieties: The case A 1. Annals of Mathematics.
Princeton University Press. https://doi.org/10.4007/annals.2012.175.3.7'
chicago: 'De Cataldo, Mark, Tamás Hausel, and Luca Migliorini. “Topology of Hitchin
Systems and Hodge Theory of Character Varieties: The Case A 1.” Annals of Mathematics.
Princeton University Press, 2012. https://doi.org/10.4007/annals.2012.175.3.7.'
ieee: 'M. De Cataldo, T. Hausel, and L. Migliorini, “Topology of hitchin systems
and Hodge theory of character varieties: The case A 1,” Annals of Mathematics,
vol. 175, no. 3. Princeton University Press, pp. 1329–1407, 2012.'
ista: 'De Cataldo M, Hausel T, Migliorini L. 2012. Topology of hitchin systems and
Hodge theory of character varieties: The case A 1. Annals of Mathematics. 175(3),
1329–1407.'
mla: 'De Cataldo, Mark, et al. “Topology of Hitchin Systems and Hodge Theory of
Character Varieties: The Case A 1.” Annals of Mathematics, vol. 175, no.
3, Princeton University Press, 2012, pp. 1329–407, doi:10.4007/annals.2012.175.3.7.'
short: M. De Cataldo, T. Hausel, L. Migliorini, Annals of Mathematics 175 (2012)
1329–1407.
date_created: 2018-12-11T11:52:13Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '01'
doi: 10.4007/annals.2012.175.3.7
extern: 1
intvolume: ' 175'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1004.1420
month: '05'
oa: 1
page: 1329 - 1407
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University Press
publist_id: '5727'
quality_controlled: 0
status: public
title: 'Topology of hitchin systems and Hodge theory of character varieties: The case
A 1'
type: journal_article
volume: 175
year: '2012'
...
---
OA_place: repository
OA_type: green
_id: '18737'
abstract:
- lang: eng
text: Supermassive black holes (SMBHs) are common in local galactic nuclei, and
SMBHs as massive as several billion solar masses already exist at redshift z =
6. These earliest SMBHs may grow by the combination of radiation-pressure-limited
accretion and mergers of stellar-mass seed BHs, left behind by the first generation
of metal-free stars, or may be formed by more rapid direct collapse of gas in
rare special environments where dense gas can accumulate without first fragmenting
into stars. This chapter offers a review of these two competing scenarios, as
well as some more exotic alternative ideas. It also briefly discusses how the
different models may be distinguished in the future by observations with JWST,
LISA and other instruments.
alternative_title:
- Astrophysics and Space Science Library
article_processing_charge: No
arxiv: 1
author:
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
orcid: 0000-0003-3633-5403
citation:
ama: 'Haiman Z. The Formation of the First Massive Black Holes. In: Wiklind T, Mobasher
B, Brumm V, eds. The First Galaxies. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2012:293-341. doi:10.1007/978-3-642-32362-1_6'
apa: 'Haiman, Z. (2012). The Formation of the First Massive Black Holes. In T. Wiklind,
B. Mobasher, & V. Brumm (Eds.), The First Galaxies (pp. 293–341). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-32362-1_6'
chicago: 'Haiman, Zoltán. “The Formation of the First Massive Black Holes.” In The
First Galaxies, edited by Tommy Wiklind, Bahram Mobasher, and Volker Brumm,
293–341. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-32362-1_6.'
ieee: 'Z. Haiman, “The Formation of the First Massive Black Holes,” in The First
Galaxies, T. Wiklind, B. Mobasher, and V. Brumm, Eds. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2012, pp. 293–341.'
ista: 'Haiman Z. 2012.The Formation of the First Massive Black Holes. In: The First
Galaxies. Astrophysics and Space Science Library, , 293–341.'
mla: Haiman, Zoltán. “The Formation of the First Massive Black Holes.” The First
Galaxies, edited by Tommy Wiklind et al., Springer Berlin Heidelberg, 2012,
pp. 293–341, doi:10.1007/978-3-642-32362-1_6.
short: Z. Haiman, in:, T. Wiklind, B. Mobasher, V. Brumm (Eds.), The First Galaxies,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 293–341.
date_created: 2025-01-03T12:30:53Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2025-01-07T13:01:05Z
day: '01'
doi: 10.1007/978-3-642-32362-1_6
editor:
- first_name: Tommy
full_name: Wiklind, Tommy
last_name: Wiklind
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
- first_name: Volker
full_name: Brumm, Volker
last_name: Brumm
extern: '1'
external_id:
arxiv:
- '1203.6075'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1203.6075
month: '01'
oa: 1
oa_version: Preprint
page: 293-341
place: Berlin, Heidelberg
publication: The First Galaxies
publication_identifier:
eisbn:
- '9783642323621'
eissn:
- 2214-7985
isbn:
- '9783642323614'
issn:
- 0067-0057
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Formation of the First Massive Black Holes
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '1972'
abstract:
- lang: eng
text: Outer membrane protein F, a major component of the Escherichia coli outer
membrane, was crystallized for the first time in lipidic mesophase of monoolein
in novel space groups, P1 and H32. Due to ease of its purification and crystallization
OmpF can be used as a benchmark protein for establishing membrane protein crystallization
in meso, as a "membrane lyzozyme" The packing of porin trimers in the
crystals of space group H32 is similar to natural outer membranes, providing the
first high-resolution insight into the close to native packing of OmpF. Surprisingly,
interaction between trimers is mediated exclusively by lipids, without direct
protein-protein contacts. Multiple ordered lipids are observed and many of them
occupy identical positions independently of the space group, identifying preferential
interaction sites of lipid acyl chains. Presence of ordered aliphatic chains close
to a positively charged area on the porin surface suggests a position for a lipopolysaccharide
binding site on the surface of the major E. coli porins.
acknowledgement: This work was funded by the Medical Research Council.
author:
- first_name: Rouslan
full_name: Efremov, Rouslan G
last_name: Efremov
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Efremov R, Sazanov LA. Structure of Escherichia coli OmpF porin from lipidic
mesophase. Journal of Structural Biology. 2012;178(3):311-318. doi:10.1016/j.jsb.2012.03.005
apa: Efremov, R., & Sazanov, L. A. (2012). Structure of Escherichia coli OmpF
porin from lipidic mesophase. Journal of Structural Biology. Academic Press.
https://doi.org/10.1016/j.jsb.2012.03.005
chicago: Efremov, Rouslan, and Leonid A Sazanov. “Structure of Escherichia Coli
OmpF Porin from Lipidic Mesophase.” Journal of Structural Biology. Academic
Press, 2012. https://doi.org/10.1016/j.jsb.2012.03.005.
ieee: R. Efremov and L. A. Sazanov, “Structure of Escherichia coli OmpF porin from
lipidic mesophase,” Journal of Structural Biology, vol. 178, no. 3. Academic
Press, pp. 311–318, 2012.
ista: Efremov R, Sazanov LA. 2012. Structure of Escherichia coli OmpF porin from
lipidic mesophase. Journal of Structural Biology. 178(3), 311–318.
mla: Efremov, Rouslan, and Leonid A. Sazanov. “Structure of Escherichia Coli OmpF
Porin from Lipidic Mesophase.” Journal of Structural Biology, vol. 178,
no. 3, Academic Press, 2012, pp. 311–18, doi:10.1016/j.jsb.2012.03.005.
short: R. Efremov, L.A. Sazanov, Journal of Structural Biology 178 (2012) 311–318.
date_created: 2018-12-11T11:54:59Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T06:54:26Z
day: '01'
doi: 10.1016/j.jsb.2012.03.005
extern: 1
intvolume: ' 178'
issue: '3'
month: '06'
page: 311 - 318
publication: Journal of Structural Biology
publication_status: published
publisher: Academic Press
publist_id: '5109'
quality_controlled: 0
status: public
title: Structure of Escherichia coli OmpF porin from lipidic mesophase
type: journal_article
volume: 178
year: '2012'
...
---
_id: '1976'
abstract:
- lang: eng
text: 'Complex I is a key enzyme of the respiratory chain in many organisms. This
multi-protein complex with an intricate evolutionary history originated from the
unification of prebuilt modules of hydrogenases and transporters. Using recently
determined crystallographic structures of complex I we reanalyzed evolutionarily
related complexes that couple oxidoreduction to trans-membrane ion translocation.
Our analysis points to the previously unnoticed structural homology of the electron
input module of formate dehydrogenlyases and subunit NuoG of complex I. We also
show that all related to complex I hydrogenases likely operate via a conformation
driven mechanism with structural changes generated in the conserved coupling site
located at the interface of subunits NuoB/D/H. The coupling apparently originated
once in evolutionary history, together with subunit NuoH joining hydrogenase and
transport modules. Analysis of quinone oxidoreduction properties and the structure
of complex I allows us to suggest a fully reversible coupling mechanism. Our model
predicts that: 1) proton access to the ketone groups of the bound quinone is rigorously
controlled by the protein, 2) the negative electric charge of the anionic ubiquinol
head group is a major driving force for conformational changes.'
acknowledgement: The work in authors' laboratory was funded by the Medical Research
Council.
author:
- first_name: Rouslan
full_name: Efremov, Rouslan G
last_name: Efremov
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Efremov R, Sazanov LA. The coupling mechanism of respiratory complex i - A
structural and evolutionary perspective. Biochimica et Biophysica Acta - Bioenergetics.
2012;1817(10):1785-1795. doi:10.1016/j.bbabio.2012.02.015
apa: Efremov, R., & Sazanov, L. A. (2012). The coupling mechanism of respiratory
complex i - A structural and evolutionary perspective. Biochimica et Biophysica
Acta - Bioenergetics. Elsevier. https://doi.org/10.1016/j.bbabio.2012.02.015
chicago: Efremov, Rouslan, and Leonid A Sazanov. “The Coupling Mechanism of Respiratory
Complex i - A Structural and Evolutionary Perspective.” Biochimica et Biophysica
Acta - Bioenergetics. Elsevier, 2012. https://doi.org/10.1016/j.bbabio.2012.02.015.
ieee: R. Efremov and L. A. Sazanov, “The coupling mechanism of respiratory complex
i - A structural and evolutionary perspective,” Biochimica et Biophysica Acta
- Bioenergetics, vol. 1817, no. 10. Elsevier, pp. 1785–1795, 2012.
ista: Efremov R, Sazanov LA. 2012. The coupling mechanism of respiratory complex
i - A structural and evolutionary perspective. Biochimica et Biophysica Acta -
Bioenergetics. 1817(10), 1785–1795.
mla: Efremov, Rouslan, and Leonid A. Sazanov. “The Coupling Mechanism of Respiratory
Complex i - A Structural and Evolutionary Perspective.” Biochimica et Biophysica
Acta - Bioenergetics, vol. 1817, no. 10, Elsevier, 2012, pp. 1785–95, doi:10.1016/j.bbabio.2012.02.015.
short: R. Efremov, L.A. Sazanov, Biochimica et Biophysica Acta - Bioenergetics 1817
(2012) 1785–1795.
date_created: 2018-12-11T11:55:00Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2019-04-26T07:22:06Z
day: '01'
doi: 10.1016/j.bbabio.2012.02.015
extern: 1
intvolume: ' 1817'
issue: '10'
month: '10'
page: 1785 - 1795
publication: Biochimica et Biophysica Acta - Bioenergetics
publication_status: published
publisher: Elsevier
publist_id: '5108'
quality_controlled: 0
status: public
title: The coupling mechanism of respiratory complex i - A structural and evolutionary
perspective
type: review
volume: 1817
year: '2012'
...
---
_id: '492'
abstract:
- lang: eng
text: 'Background: Characterizing root system architecture (RSA) is essential to
understanding the development and function of vascular plants. Identifying RSA-associated
genes also represents an underexplored opportunity for crop improvement. Software
tools are needed to accelerate the pace at which quantitative traits of RSA are
estimated from images of root networks.Results: We have developed GiA Roots (General
Image Analysis of Roots), a semi-automated software tool designed specifically
for the high-throughput analysis of root system images. GiA Roots includes user-assisted
algorithms to distinguish root from background and a fully automated pipeline
that extracts dozens of root system phenotypes. Quantitative information on each
phenotype, along with intermediate steps for full reproducibility, is returned
to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line
interface for interweaving the software into large-scale workflows. GiA Roots
can also be extended to estimate novel phenotypes specified by the end-user.Conclusions:
We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing
12 genotypes from the species Oryza sativa. We validate trait measurements against
prior analyses of this image set that demonstrated that RSA traits are likely
heritable and associated with genotypic differences. Moreover, we demonstrate
that GiA Roots is extensible and an end-user can add functionality so that GiA
Roots can estimate novel RSA traits. In summary, we show that the software can
function as an efficient tool as part of a workflow to move from large numbers
of root images to downstream analysis.'
article_number: '116'
article_processing_charge: No
author:
- first_name: Taras
full_name: Galkovskyi, Taras
last_name: Galkovskyi
- first_name: Yuriy
full_name: Mileyko, Yuriy
last_name: Mileyko
- first_name: Alexander
full_name: Bucksch, Alexander
last_name: Bucksch
- first_name: Brad
full_name: Moore, Brad
last_name: Moore
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
- first_name: Charles
full_name: Price, Charles
last_name: Price
- first_name: Chrostopher
full_name: Topp, Chrostopher
last_name: Topp
- first_name: Anjali
full_name: Iyer Pascuzzi, Anjali
last_name: Iyer Pascuzzi
- first_name: Paul
full_name: Zurek, Paul
last_name: Zurek
- first_name: Suqin
full_name: Fang, Suqin
last_name: Fang
- first_name: John
full_name: Harer, John
last_name: Harer
- first_name: Philip
full_name: Benfey, Philip
last_name: Benfey
- first_name: Joshua
full_name: Weitz, Joshua
last_name: Weitz
citation:
ama: 'Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high
throughput analysis of plant root system architecture. BMC Plant Biology.
2012;12. doi:10.1186/1471-2229-12-116'
apa: 'Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price,
C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of
plant root system architecture. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-12-116'
chicago: 'Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga
Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the
High Throughput Analysis of Plant Root System Architecture.” BMC Plant Biology.
BioMed Central, 2012. https://doi.org/10.1186/1471-2229-12-116.'
ieee: 'T. Galkovskyi et al., “GiA Roots: Software for the high throughput
analysis of plant root system architecture,” BMC Plant Biology, vol. 12.
BioMed Central, 2012.'
ista: 'Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C,
Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots:
Software for the high throughput analysis of plant root system architecture. BMC
Plant Biology. 12, 116.'
mla: 'Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis
of Plant Root System Architecture.” BMC Plant Biology, vol. 12, 116, BioMed
Central, 2012, doi:10.1186/1471-2229-12-116.'
short: T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C.
Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC
Plant Biology 12 (2012).
date_created: 2018-12-11T11:46:46Z
date_published: 2012-07-26T00:00:00Z
date_updated: 2025-09-30T08:36:34Z
day: '26'
ddc:
- '005'
- '514'
- '516'
doi: 10.1186/1471-2229-12-116
extern: '1'
external_id:
isi:
- '000309114300001'
file:
- access_level: open_access
checksum: 0c629e36acd5f2878ff7dd088d67d494
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:35Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4953'
file_name: IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf
file_size: 1691436
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
publication: BMC Plant Biology
publication_status: published
publisher: BioMed Central
publist_id: '7328'
pubrep_id: '946'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'GiA Roots: Software for the high throughput analysis of plant root system
architecture'
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 12
year: '2012'
...
---
_id: '493'
abstract:
- lang: eng
text: 'The BCI competition IV stands in the tradition of prior BCI competitions
that aim to provide high quality neuroscientific data for open access to the scientific
community. As experienced already in prior competitions not only scientists from
the narrow field of BCI compete, but scholars with a broad variety of backgrounds
and nationalities. They include high specialists as well as students.The goals
of all BCI competitions have always been to challenge with respect to novel paradigms
and complex data. We report on the following challenges: (1) asynchronous data,
(2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer,
(5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after
past competitions, our hope is that winning entries may enhance the analysis methods
of future BCIs.'
acknowledgement: "The studies were in part or completely supported by the Bundesministerium
für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science
Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631
and 216886, the World Class University Program through the National Research Foundation
of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008),
the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415
(Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk),
the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal
Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830,
German Research Foundation grants 550/B5 and C6, and by a scholarship from the German
National Academic Foundation. This paper only reflects the authors’ views and funding
agencies are not liable for any use that may be made of the information contained
herein.\r\n"
article_number: '55'
article_processing_charge: No
author:
- first_name: Michael
full_name: Tangermann, Michael
last_name: Tangermann
- first_name: Klaus
full_name: Müller, Klaus
last_name: Müller
- first_name: Ad
full_name: Aertsen, Ad
last_name: Aertsen
- first_name: Niels
full_name: Birbaumer, Niels
last_name: Birbaumer
- first_name: Christoph
full_name: Braun, Christoph
last_name: Braun
- first_name: Clemens
full_name: Brunner, Clemens
last_name: Brunner
- first_name: Robert
full_name: Leeb, Robert
last_name: Leeb
- first_name: Carsten
full_name: Mehring, Carsten
last_name: Mehring
- first_name: Kai
full_name: Miller, Kai
last_name: Miller
- first_name: Gernot
full_name: Müller Putz, Gernot
last_name: Müller Putz
- first_name: Guido
full_name: Nolte, Guido
last_name: Nolte
- first_name: Gert
full_name: Pfurtscheller, Gert
last_name: Pfurtscheller
- first_name: Hubert
full_name: Preissl, Hubert
last_name: Preissl
- first_name: Gerwin
full_name: Schalk, Gerwin
last_name: Schalk
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Carmen
full_name: Vidaurre, Carmen
last_name: Vidaurre
- first_name: Stephan
full_name: Waldert, Stephan
last_name: Waldert
- first_name: Benjamin
full_name: Blankertz, Benjamin
last_name: Blankertz
citation:
ama: Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV.
Frontiers in Neuroscience. 2012;6. doi:10.3389/fnins.2012.00055
apa: Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner,
C., … Blankertz, B. (2012). Review of the BCI competition IV. Frontiers in
Neuroscience. Frontiers Research Foundation. https://doi.org/10.3389/fnins.2012.00055
chicago: Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph
Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.”
Frontiers in Neuroscience. Frontiers Research Foundation, 2012. https://doi.org/10.3389/fnins.2012.00055.
ieee: M. Tangermann et al., “Review of the BCI competition IV,” Frontiers
in Neuroscience, vol. 6. Frontiers Research Foundation, 2012.
ista: Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R,
Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk
G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition
IV. Frontiers in Neuroscience. 6, 55.
mla: Tangermann, Michael, et al. “Review of the BCI Competition IV.” Frontiers
in Neuroscience, vol. 6, 55, Frontiers Research Foundation, 2012, doi:10.3389/fnins.2012.00055.
short: M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner,
R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H.
Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers
in Neuroscience 6 (2012).
date_created: 2018-12-11T11:46:46Z
date_published: 2012-07-13T00:00:00Z
date_updated: 2025-09-30T08:35:59Z
day: '13'
ddc:
- '004'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.3389/fnins.2012.00055
external_id:
isi:
- '000209165300066'
file:
- access_level: open_access
checksum: 195238221c4b0b0f4035f6f6c16ea17c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:34Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5356'
file_name: IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf
file_size: 2693701
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Frontiers in Neuroscience
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '7327'
pubrep_id: '945'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Review of the BCI competition IV
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6
year: '2012'
...
---
_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
has_accepted_license: '1'
intvolume: ' 96'
language:
- iso: eng
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'
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
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
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
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
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
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'
...
---
_id: '5398'
abstract:
- lang: eng
text: This document is created as a part of the project “Repository for Research
Data on IST Austria”. It summarises the actual state of research data at IST Austria,
based on survey results. It supports the choice of appropriate software, which
would best fit the requirements of their users, the researchers.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Actual State of Research Data @ ISTAustria. IST Austria;
2012.
apa: Porsche, J. (2012). Actual state of research data @ ISTAustria. IST
Austria.
chicago: Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria,
2012.
ieee: J. Porsche, Actual state of research data @ ISTAustria. IST Austria,
2012.
ista: Porsche J. 2012. Actual state of research data @ ISTAustria, IST Austria,p.
mla: Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria,
2012.
short: J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012.
date_created: 2018-12-12T11:39:06Z
date_published: 2012-11-12T00:00:00Z
date_updated: 2020-07-14T23:04:49Z
day: '12'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: e0a7c041eea1ca4b70ab6f9ec5177f4e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:11Z
date_updated: 2020-07-14T12:46:44Z
file_id: '5472'
file_name: IST-2012-103-v1+1_Actual_state_of_research_data_@_IST_Austria.pdf
file_size: 238544
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
pubrep_id: '103'
status: public
title: Actual state of research data @ ISTAustria
type: 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
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'
...