---
_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'
...
---
_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
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: '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'
...
---
_id: '3119'
abstract:
- lang: eng
text: "We present an approach for artist-directed animation of liquids using multiple
levels of control over the simulation, ranging from the overall tracking of desired
shapes to highly detailed secondary effects such as dripping streams, separating
sheets of fluid, surface waves and ripples. The first portion of our technique
is a volume preserving morph that allows the animator to produce a plausible fluid-like
motion from a sparse set of control meshes. By rasterizing the resulting control
meshes onto the simulation grid, the mesh velocities act as boundary conditions
during the projection step of the fluid simulation. We can then blend this motion
together with uncontrolled fluid velocities to achieve a more relaxed control
over the fluid that captures natural inertial effects. Our method can produce
highly detailed liquid surfaces with control over sub-grid details by using a
mesh-based surface tracker on top of a coarse grid-based fluid simulation. We
can create ripples and waves on the fluid surface attracting the surface mesh
to the control mesh with spring-like forces and also by running a wave simulation
over the surface mesh. Our video results demonstrate how our control scheme can
be used to create animated characters and shapes that are made of water.\r\n"
acknowledgement: This work was partially funded by NSF grants CCF-0811485 and IIS-1130934.
We would like to thank Scanline VFX for additional funding. We would like to thank
Jie Tan as well as our anonymous reviewers for their useful suggestions and feedback.
author:
- first_name: Karthik
full_name: Raveendran, Karthik
last_name: Raveendran
- first_name: Nils
full_name: Thuerey, Nils
last_name: Thuerey
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Greg
full_name: Turk, Greg
last_name: Turk
citation:
ama: 'Raveendran K, Thuerey N, Wojtan C, Turk G. Controlling liquids using meshes.
In: Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation.
ACM; 2012:255-264.'
apa: 'Raveendran, K., Thuerey, N., Wojtan, C., & Turk, G. (2012). Controlling
liquids using meshes. In Proceedings of the ACM SIGGRAPH/Eurographics Symposium
on Computer Animation (pp. 255–264). Aire-la-Ville, Switzerland: ACM.'
chicago: Raveendran, Karthik, Nils Thuerey, Chris Wojtan, and Greg Turk. “Controlling
Liquids Using Meshes.” In Proceedings of the ACM SIGGRAPH/Eurographics Symposium
on Computer Animation, 255–64. ACM, 2012.
ieee: K. Raveendran, N. Thuerey, C. Wojtan, and G. Turk, “Controlling liquids using
meshes,” in Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer
Animation, Aire-la-Ville, Switzerland, 2012, pp. 255–264.
ista: 'Raveendran K, Thuerey N, Wojtan C, Turk G. 2012. Controlling liquids using
meshes. Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation.
SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 255–264.'
mla: Raveendran, Karthik, et al. “Controlling Liquids Using Meshes.” Proceedings
of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation, ACM, 2012,
pp. 255–64.
short: K. Raveendran, N. Thuerey, C. Wojtan, G. Turk, in:, Proceedings of the ACM
SIGGRAPH/Eurographics Symposium on Computer Animation, ACM, 2012, pp. 255–264.
conference:
end_date: 2012-07-31
location: Aire-la-Ville, Switzerland
name: 'SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation'
start_date: 2012-07-29
date_created: 2018-12-11T12:01:30Z
date_published: 2012-07-29T00:00:00Z
date_updated: 2023-02-23T11:13:07Z
day: '29'
ddc:
- '000'
department:
- _id: ChWo
file:
- access_level: open_access
checksum: babda64c24cf90a4d05ae86d712bed08
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:23Z
date_updated: 2020-07-14T12:46:00Z
file_id: '4877'
file_name: IST-2016-600-v1+1_ControllingLiquids_Preprint.pdf
file_size: 4939370
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 255 - 264
publication: Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation
publication_status: published
publisher: ACM
publist_id: '3580'
pubrep_id: '600'
quality_controlled: '1'
related_material:
link:
- relation: table_of_contents
url: http://dl.acm.org/citation.cfm?id=2422393
scopus_import: 1
status: public
title: Controlling liquids using meshes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3120'
abstract:
- lang: eng
text: We introduce a strategy based on Kustin-Miller unprojection that allows us
to construct many hundreds of Gorenstein codimension 4 ideals with 9 × 16 resolutions
(that is, nine equations and sixteen first syzygies). Our two basic games are
called Tom and Jerry; the main application is the biregular construction of most
of the anticanonically polarised Mori Fano 3-folds of Altinok's thesis. There
are 115 cases whose numerical data (in effect, the Hilbert series) allow a Type
I projection. In every case, at least one Tom and one Jerry construction works,
providing at least two deformation families of quasismooth Fano 3-folds having
the same numerics but different topology. © 2012 Copyright Foundation Compositio
Mathematica.
acknowledgement: This research is supported by the Korean Government WCU Grant R33-2008-000-10101-0.
article_processing_charge: No
arxiv: 1
author:
- first_name: Gavin
full_name: Brown, Gavin
last_name: Brown
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Miles
full_name: Reid, Miles
last_name: Reid
citation:
ama: Brown G, Kerber M, Reid M. Fano 3 folds in codimension 4 Tom and Jerry Part
I. Compositio Mathematica. 2012;148(4):1171-1194. doi:10.1112/S0010437X11007226
apa: Brown, G., Kerber, M., & Reid, M. (2012). Fano 3 folds in codimension 4
Tom and Jerry Part I. Compositio Mathematica. Cambridge University Press.
https://doi.org/10.1112/S0010437X11007226
chicago: Brown, Gavin, Michael Kerber, and Miles Reid. “Fano 3 Folds in Codimension
4 Tom and Jerry Part I.” Compositio Mathematica. Cambridge University Press,
2012. https://doi.org/10.1112/S0010437X11007226.
ieee: G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry
Part I,” Compositio Mathematica, vol. 148, no. 4. Cambridge University
Press, pp. 1171–1194, 2012.
ista: Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry
Part I. Compositio Mathematica. 148(4), 1171–1194.
mla: Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.”
Compositio Mathematica, vol. 148, no. 4, Cambridge University Press, 2012,
pp. 1171–94, doi:10.1112/S0010437X11007226.
short: G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194.
date_created: 2018-12-11T12:01:30Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2025-09-30T07:59:55Z
day: '01'
department:
- _id: HeEd
doi: 10.1112/S0010437X11007226
external_id:
arxiv:
- '1009.4313'
isi:
- '000307176400007'
fulldoi: https://doi.org/10.1112/S0010437X11007226
intvolume: ' 148'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1009.4313
month: '07'
oa: 1
oa_version: Preprint
page: 1171 - 1194
publication: Compositio Mathematica
publication_status: published
publisher: Cambridge University Press
publist_id: '3579'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fano 3 folds in codimension 4 Tom and Jerry Part I
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 148
year: '2012'
...
---
_id: '3121'
abstract:
- lang: eng
text: Voltage-activated Ca(2+) channels (VACCs) mediate Ca(2+) influx to trigger
action potential-evoked neurotransmitter release, but the mechanism by which Ca(2+)
regulates spontaneous transmission is unclear. We found that VACCs are the major
physiological triggers for spontaneous release at mouse neocortical inhibitory
synapses. Moreover, despite the absence of a synchronizing action potential, we
found that spontaneous fusion of a GABA-containing vesicle required the activation
of multiple tightly coupled VACCs of variable type.
acknowledgement: "The work was supported by the US National Institutes of Health (DA027110
and GM097433) and OCTRI. C.W. and N.P.V. were supported by a grant from the National
Heart, Lung, and Blood Institute (T32HL033808).\r\nWe thank M. Andresen and K. Khodakhah
for helpful comments. "
article_processing_charge: No
author:
- first_name: Courtney
full_name: Williams, Courtney
last_name: Williams
- first_name: Wenyan
full_name: Chen, Wenyan
last_name: Chen
- first_name: Chia
full_name: Lee, Chia
last_name: Lee
- first_name: Daniel
full_name: Yaeger, Daniel
last_name: Yaeger
- first_name: Nicholas
full_name: Vyleta, Nicholas
id: 36C4978E-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: Stephen
full_name: Smith, Stephen
last_name: Smith
citation:
ama: Williams C, Chen W, Lee C, Yaeger D, Vyleta N, Smith S. Coactivation of multiple
tightly coupled calcium channels triggers spontaneous release of GABA. Nature
Neuroscience. 2012;15(9):1195-1197. doi:10.1038/nn.3162
apa: Williams, C., Chen, W., Lee, C., Yaeger, D., Vyleta, N., & Smith, S. (2012).
Coactivation of multiple tightly coupled calcium channels triggers spontaneous
release of GABA. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3162
chicago: Williams, Courtney, Wenyan Chen, Chia Lee, Daniel Yaeger, Nicholas Vyleta,
and Stephen Smith. “Coactivation of Multiple Tightly Coupled Calcium Channels
Triggers Spontaneous Release of GABA.” Nature Neuroscience. Nature Publishing
Group, 2012. https://doi.org/10.1038/nn.3162.
ieee: C. Williams, W. Chen, C. Lee, D. Yaeger, N. Vyleta, and S. Smith, “Coactivation
of multiple tightly coupled calcium channels triggers spontaneous release of GABA,”
Nature Neuroscience, vol. 15, no. 9. Nature Publishing Group, pp. 1195–1197,
2012.
ista: Williams C, Chen W, Lee C, Yaeger D, Vyleta N, Smith S. 2012. Coactivation
of multiple tightly coupled calcium channels triggers spontaneous release of GABA.
Nature Neuroscience. 15(9), 1195–1197.
mla: Williams, Courtney, et al. “Coactivation of Multiple Tightly Coupled Calcium
Channels Triggers Spontaneous Release of GABA.” Nature Neuroscience, vol.
15, no. 9, Nature Publishing Group, 2012, pp. 1195–97, doi:10.1038/nn.3162.
short: C. Williams, W. Chen, C. Lee, D. Yaeger, N. Vyleta, S. Smith, Nature Neuroscience
15 (2012) 1195–1197.
date_created: 2018-12-11T12:01:30Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2025-09-30T07:59:27Z
day: '01'
department:
- _id: PeJo
doi: 10.1038/nn.3162
external_id:
isi:
- '000308072600008'
pmid:
- '22842148'
fulldoi: https://doi.org/10.1038/nn.3162
intvolume: ' 15'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3431448/
month: '09'
oa: 1
oa_version: Submitted Version
page: 1195 - 1197
pmid: 1
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '3578'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coactivation of multiple tightly coupled calcium channels triggers spontaneous
release of GABA
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15
year: '2012'
...
---
_id: '3122'
abstract:
- lang: eng
text: 'Since Darwin''s pioneering research on plant reproductive biology (e.g. Darwin
1877), understanding the mechanisms maintaining the diverse sexual strategies
of plants has remained an important challenge for evolutionary biologists. In
some species, populations are sexually polymorphic and contain two or more mating
morphs (sex phenotypes). Differences in morphology or phenology among the morphs
influence patterns of non-random mating. In these populations, negative frequency-dependent
selection arising from disassortative (intermorph) mating is usually required
for the evolutionary maintenance of sexual polymorphism, but few studies have
demonstrated the required patterns of non-random mating. In the current issue
of Molecular Ecology, Shang (2012) make an important contribution to our understanding
of how disassortative mating influences sex phenotype ratios in Acer pictum subsp.
mono (painted maple), a heterodichogamous, deciduous tree of eastern China. They
monitored sex expression in 97 adults and used paternity analysis of open-pollinated
seed to examine disassortative mating among three sex phenotypes. Using a deterministic
''pollen transfer'' model, Shang et al. present convincing evidence that differences
in the degree of disassortative mating in progeny arrays of the sex phenotypes
can explain their uneven frequencies in the adult population. This study provides
a useful example of how the deployment of genetic markers, demographic monitoring
and modelling can be integrated to investigate the maintenance of sexual diversity
in plants. '
article_processing_charge: No
author:
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Spencer
full_name: Barrett, Spencer
last_name: Barrett
citation:
ama: Field D, Barrett S. Disassortative mating and the maintenance of sexual polymorphism
in painted maple. Molecular Ecology. 2012;21(15):3640-3643. doi:10.1111/j.1365-294X.2012.05643.x
apa: Field, D., & Barrett, S. (2012). Disassortative mating and the maintenance
of sexual polymorphism in painted maple. Molecular Ecology. Wiley-Blackwell.
https://doi.org/10.1111/j.1365-294X.2012.05643.x
chicago: Field, David, and Spencer Barrett. “Disassortative Mating and the Maintenance
of Sexual Polymorphism in Painted Maple.” Molecular Ecology. Wiley-Blackwell,
2012. https://doi.org/10.1111/j.1365-294X.2012.05643.x.
ieee: D. Field and S. Barrett, “Disassortative mating and the maintenance of sexual
polymorphism in painted maple,” Molecular Ecology, vol. 21, no. 15. Wiley-Blackwell,
pp. 3640–3643, 2012.
ista: Field D, Barrett S. 2012. Disassortative mating and the maintenance of sexual
polymorphism in painted maple. Molecular Ecology. 21(15), 3640–3643.
mla: Field, David, and Spencer Barrett. “Disassortative Mating and the Maintenance
of Sexual Polymorphism in Painted Maple.” Molecular Ecology, vol. 21, no.
15, Wiley-Blackwell, 2012, pp. 3640–43, doi:10.1111/j.1365-294X.2012.05643.x.
short: D. Field, S. Barrett, Molecular Ecology 21 (2012) 3640–3643.
corr_author: '1'
date_created: 2018-12-11T12:01:31Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2025-09-30T07:58:59Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/j.1365-294X.2012.05643.x
external_id:
isi:
- '000306478800002'
fulldoi: https://doi.org/10.1111/j.1365-294X.2012.05643.x
intvolume: ' 21'
isi: 1
issue: '15'
language:
- iso: eng
month: '08'
oa_version: None
page: 3640 - 3643
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3577'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Disassortative mating and the maintenance of sexual polymorphism in painted
maple
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 21
year: '2012'
...
---
_id: '3123'
abstract:
- lang: eng
text: We introduce the idea of using an explicit triangle mesh to track the air/fluid
interface in a smoothed particle hydrodynamics (SPH) simulator. Once an initial
surface mesh is created, this mesh is carried forward in time using nearby particle
velocities to advect the mesh vertices. The mesh connectivity remains mostly unchanged
across time-steps; it is only modified locally for topology change events or for
the improvement of triangle quality. In order to ensure that the surface mesh
does not diverge from the underlying particle simulation, we periodically project
the mesh surface onto an implicit surface defined by the physics simulation. The
mesh surface gives us several advantages over previous SPH surface tracking techniques.
We demonstrate a new method for surface tension calculations that clearly outperforms
the state of the art in SPH surface tension for computer graphics. We also demonstrate
a method for tracking detailed surface information (like colors) that is less
susceptible to numerical diffusion than competing techniques. Finally, our temporally-coherent
surface mesh allows us to simulate high-resolution surface wave dynamics without
being limited by the particle resolution of the SPH simulation.
acknowledgement: This work was funded by NSF grant IIS-1017014 and CCF- 0917093.
alternative_title:
- Eurographics
article_processing_charge: No
author:
- first_name: Jihun
full_name: Yu, Jihun
last_name: Yu
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Greg
full_name: Turk, Greg
last_name: Turk
- first_name: Chee
full_name: Yap, Chee
last_name: Yap
citation:
ama: 'Yu J, Wojtan C, Turk G, Yap C. Explicit mesh surfaces for particle based fluids.
In: Computer Graphics Forum. Vol 31. Wiley; 2012:815-824. doi:10.1111/j.1467-8659.2012.03062.x'
apa: 'Yu, J., Wojtan, C., Turk, G., & Yap, C. (2012). Explicit mesh surfaces
for particle based fluids. In Computer Graphics Forum (Vol. 31, pp. 815–824).
Cagliari, Sardinia, Italy: Wiley. https://doi.org/10.1111/j.1467-8659.2012.03062.x'
chicago: Yu, Jihun, Chris Wojtan, Greg Turk, and Chee Yap. “Explicit Mesh Surfaces
for Particle Based Fluids.” In Computer Graphics Forum, 31:815–24. Wiley,
2012. https://doi.org/10.1111/j.1467-8659.2012.03062.x.
ieee: J. Yu, C. Wojtan, G. Turk, and C. Yap, “Explicit mesh surfaces for particle
based fluids,” in Computer Graphics Forum, Cagliari, Sardinia, Italy, 2012,
vol. 31, no. 2, pp. 815–824.
ista: 'Yu J, Wojtan C, Turk G, Yap C. 2012. Explicit mesh surfaces for particle
based fluids. Computer Graphics Forum. EUROGRAPHICS: Conference on European Association
for Computer Graphics, Eurographics, vol. 31, 815–824.'
mla: Yu, Jihun, et al. “Explicit Mesh Surfaces for Particle Based Fluids.” Computer
Graphics Forum, vol. 31, no. 2, Wiley, 2012, pp. 815–24, doi:10.1111/j.1467-8659.2012.03062.x.
short: J. Yu, C. Wojtan, G. Turk, C. Yap, in:, Computer Graphics Forum, Wiley, 2012,
pp. 815–824.
conference:
end_date: 2012-05-18
location: Cagliari, Sardinia, Italy
name: 'EUROGRAPHICS: Conference on European Association for Computer Graphics'
start_date: 2012-05-13
date_created: 2018-12-11T12:01:31Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2025-09-30T07:58:32Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/j.1467-8659.2012.03062.x
external_id:
isi:
- '000306182500009'
file:
- access_level: open_access
checksum: acb325dd1e31859bedd30e013f61d0b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:39Z
date_updated: 2020-07-14T12:46:00Z
file_id: '5092'
file_name: IST-2016-601-v1+1_meshSPH.pdf
file_size: 5740527
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
fulldoi: https://doi.org/10.1111/j.1467-8659.2012.03062.x
has_accepted_license: '1'
intvolume: ' 31'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 815 - 824
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
publist_id: '3576'
pubrep_id: '601'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Explicit mesh surfaces for particle based fluids
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 31
year: '2012'
...
---
_id: '3124'
abstract:
- lang: eng
text: "We consider the problem of inference in a graphical 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 pairwise terms
over a discretized domain. This allows the use of techniques originally developed
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 outperform the Bethe approximation. We also establish a link between the Bethe
free energy and submodular functions.\r\n"
alternative_title:
- Inferning 2012
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. In: ICML; 2012.'
apa: 'Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals
using discrete energy minimization. Presented at the ICML: International Conference
on Machine Learning, Edinburgh, Scotland: ICML.'
chicago: Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. “Approximating
Marginals Using Discrete Energy Minimization.” ICML, 2012.
ieee: 'F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete
energy minimization,” presented at the ICML: International Conference on Machine
Learning, Edinburgh, Scotland, 2012.'
ista: 'Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete
energy minimization. ICML: International Conference on Machine Learning, Inferning
2012, .'
mla: Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization.
ICML, 2012.
short: F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.
conference:
end_date: 2012-07-01
location: Edinburgh, Scotland
name: 'ICML: International Conference on Machine Learning'
start_date: 2012-06-26
corr_author: '1'
date_created: 2018-12-11T12:01:31Z
date_published: 2012-06-30T00:00:00Z
date_updated: 2024-10-09T20:54:48Z
day: '30'
ddc:
- '000'
department:
- _id: ChLa
- _id: VlKo
file:
- access_level: open_access
checksum: 3d0d4246548c736857302aadb2ff5d15
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:34Z
date_updated: 2020-07-14T12:46:00Z
file_id: '4889'
file_name: IST-2016-565-v1+1_DM-inferning2012.pdf
file_size: 305836
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
publication_status: published
publisher: ICML
publist_id: '3575'
pubrep_id: '565'
quality_controlled: '1'
related_material:
record:
- id: '5396'
relation: later_version
status: public
status: public
title: Approximating marginals using discrete energy minimization
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...