---
_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.
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: 2021-01-12T07:41:12Z
day: '01'
department:
- _id: HeEd
doi: 10.1112/S0010437X11007226
intvolume: ' 148'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
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. "
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: 2021-01-12T07:41:12Z
day: '01'
department:
- _id: PeJo
doi: 10.1038/nn.3162
external_id:
pmid:
- '22842148'
intvolume: ' 15'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
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. '
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.
date_created: 2018-12-11T12:01:31Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:41:13Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/j.1365-294X.2012.05643.x
intvolume: ' 21'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
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: 2023-10-16T09:54:40Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/j.1467-8659.2012.03062.x
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
has_accepted_license: '1'
intvolume: ' 31'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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
date_created: 2018-12-11T12:01:31Z
date_published: 2012-06-30T00:00:00Z
date_updated: 2023-02-23T12:24:24Z
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'
...
---
_id: '3125'
abstract:
- lang: eng
text: We propose a new learning method to infer a mid-level feature representation
that combines the advantage of semantic attribute representations with the higher
expressive power of non-semantic features. The idea lies in augmenting an existing
attribute-based representation with additional dimensions for which an autoencoder
model is coupled with a large-margin principle. This construction allows a smooth
transition between the zero-shot regime with no training example, the unsupervised
regime with training examples but without class labels, and the supervised regime
with training examples and with class labels. The resulting optimization problem
can be solved efficiently, because several of the necessity steps have closed-form
solutions. Through extensive experiments we show that the augmented representation
achieves better results in terms of object categorization accuracy than the semantic
representation alone.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sharmanska V, Quadrianto N, Lampert C. Augmented attribute representations.
In: Vol 7576. Springer; 2012:242-255. doi:10.1007/978-3-642-33715-4_18'
apa: 'Sharmanska, V., Quadrianto, N., & Lampert, C. (2012). Augmented attribute
representations (Vol. 7576, pp. 242–255). Presented at the ECCV: European Conference
on Computer Vision, Florence, Italy: Springer. https://doi.org/10.1007/978-3-642-33715-4_18'
chicago: Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Augmented
Attribute Representations,” 7576:242–55. Springer, 2012. https://doi.org/10.1007/978-3-642-33715-4_18.
ieee: 'V. Sharmanska, N. Quadrianto, and C. Lampert, “Augmented attribute representations,”
presented at the ECCV: European Conference on Computer Vision, Florence, Italy,
2012, vol. 7576, no. PART 5, pp. 242–255.'
ista: 'Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations.
ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 242–255.'
mla: Sharmanska, Viktoriia, et al. Augmented Attribute Representations. Vol.
7576, no. PART 5, Springer, 2012, pp. 242–55, doi:10.1007/978-3-642-33715-4_18.
short: V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255.
conference:
end_date: 2012-10-13
location: Florence, Italy
name: 'ECCV: European Conference on Computer Vision'
start_date: 2012-10-07
date_created: 2018-12-11T12:01:32Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2023-02-23T11:13:25Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1007/978-3-642-33715-4_18
file:
- access_level: open_access
checksum: bccdbe0663780d25a1e0524002b2d896
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T12:29:04Z
date_updated: 2020-07-14T12:46:00Z
file_id: '7861'
file_name: 2012_ECCV_Sharmanska.pdf
file_size: 6073897
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 7576'
issue: PART 5
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 242 - 255
publication_status: published
publisher: Springer
publist_id: '3574'
quality_controlled: '1'
scopus_import: 1
status: public
title: Augmented attribute representations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7576
year: '2012'
...
---
_id: '3126'
abstract:
- lang: eng
text: "In this work we propose a new information-theoretic clustering algorithm
that infers cluster memberships by direct optimization of a non-parametric mutual
information estimate between data distribution and cluster assignment. Although
the optimization objective has a solid theoretical foundation it is hard to optimize.
We propose an approximate optimization formulation that leads to an efficient
algorithm with low runtime complexity. The algorithm has a single free parameter,
the number of clusters to find. We demonstrate superior performance on several
synthetic and real datasets.\r\n"
alternative_title:
- LNCS
author:
- first_name: Andreas
full_name: Müller, Andreas
last_name: Müller
- first_name: Sebastian
full_name: Nowozin, Sebastian
last_name: Nowozin
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Müller A, Nowozin S, Lampert C. Information theoretic clustering using minimal
spanning trees. In: Vol 7476. Springer; 2012:205-215. doi:10.1007/978-3-642-32717-9_21'
apa: 'Müller, A., Nowozin, S., & Lampert, C. (2012). Information theoretic clustering
using minimal spanning trees (Vol. 7476, pp. 205–215). Presented at the DAGM:
German Association For Pattern Recognition, Graz, Austria: Springer. https://doi.org/10.1007/978-3-642-32717-9_21'
chicago: Müller, Andreas, Sebastian Nowozin, and Christoph Lampert. “Information
Theoretic Clustering Using Minimal Spanning Trees,” 7476:205–15. Springer, 2012.
https://doi.org/10.1007/978-3-642-32717-9_21.
ieee: 'A. Müller, S. Nowozin, and C. Lampert, “Information theoretic clustering
using minimal spanning trees,” presented at the DAGM: German Association For Pattern
Recognition, Graz, Austria, 2012, vol. 7476, pp. 205–215.'
ista: 'Müller A, Nowozin S, Lampert C. 2012. Information theoretic clustering using
minimal spanning trees. DAGM: German Association For Pattern Recognition, LNCS,
vol. 7476, 205–215.'
mla: Müller, Andreas, et al. Information Theoretic Clustering Using Minimal Spanning
Trees. Vol. 7476, Springer, 2012, pp. 205–15, doi:10.1007/978-3-642-32717-9_21.
short: A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215.
conference:
end_date: 2012-08-31
location: Graz, Austria
name: 'DAGM: German Association For Pattern Recognition'
start_date: 2012-08-28
date_created: 2018-12-11T12:01:32Z
date_published: 2012-08-14T00:00:00Z
date_updated: 2021-01-12T07:41:14Z
day: '14'
department:
- _id: ChLa
doi: 10.1007/978-3-642-32717-9_21
intvolume: ' 7476'
language:
- iso: eng
month: '08'
oa_version: None
page: 205 - 215
publication_status: published
publisher: Springer
publist_id: '3573'
quality_controlled: '1'
scopus_import: 1
status: public
title: Information theoretic clustering using minimal spanning trees
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7476
year: '2012'
...
---
_id: '3127'
abstract:
- lang: eng
text: "When searching for characteristic subpatterns in potentially noisy graph
data, it appears self-evident that having multiple observations would be better
than having just one. However, it turns out that the inconsistencies introduced
when different graph instances have different edge sets pose a serious challenge.
In this work we address this challenge for the problem of finding maximum weighted
cliques.\r\n We introduce the concept of most persistent soft-clique. This
is subset of vertices, that 1) is almost fully or at least densely connected,
2) occurs in all or almost all graph instances, and 3) has the maximum weight.
We present a measure of clique-ness, that essentially counts the number of edge
missing to make a subset of vertices into a clique. With this measure, we show
that the problem of finding the most persistent soft-clique problem can be cast
either as: a) a max-min two person game optimization problem, or b) a min-min
soft margin optimization problem. Both formulations lead to the same solution
when using a partial Lagrangian method to solve the optimization problems. By
experiments on synthetic data and on real social network data, we show that the
proposed method is able to reliably find soft cliques in graph data, even if that
is distorted by random noise or unreliable observations."
article_processing_charge: No
author:
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
citation:
ama: 'Quadrianto N, Lampert C, Chen C. The most persistent soft-clique in a set
of sampled graphs. In: Proceedings of the 29th International Conference on
Machine Learning. ML Research Press; 2012:211-218.'
apa: 'Quadrianto, N., Lampert, C., & Chen, C. (2012). The most persistent soft-clique
in a set of sampled graphs. In Proceedings of the 29th International Conference
on Machine Learning (pp. 211–218). Edinburgh, United Kingdom: ML Research
Press.'
chicago: Quadrianto, Novi, Christoph Lampert, and Chao Chen. “The Most Persistent
Soft-Clique in a Set of Sampled Graphs.” In Proceedings of the 29th International
Conference on Machine Learning, 211–18. ML Research Press, 2012.
ieee: N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in
a set of sampled graphs,” in Proceedings of the 29th International Conference
on Machine Learning, Edinburgh, United Kingdom, 2012, pp. 211–218.
ista: 'Quadrianto N, Lampert C, Chen C. 2012. The most persistent soft-clique in
a set of sampled graphs. Proceedings of the 29th International Conference on Machine
Learning. ICML: International Conference on Machine Learning, 211–218.'
mla: Quadrianto, Novi, et al. “The Most Persistent Soft-Clique in a Set of Sampled
Graphs.” Proceedings of the 29th International Conference on Machine Learning,
ML Research Press, 2012, pp. 211–18.
short: N. Quadrianto, C. Lampert, C. Chen, in:, Proceedings of the 29th International
Conference on Machine Learning, ML Research Press, 2012, pp. 211–218.
conference:
end_date: 2012-07-01
location: Edinburgh, United Kingdom
name: 'ICML: International Conference on Machine Learning'
start_date: 2012-06-26
date_created: 2018-12-11T12:01:33Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2023-10-17T11:55:06Z
day: '01'
department:
- _id: ChLa
- _id: HeEd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1206.4652
month: '06'
oa: 1
oa_version: Preprint
page: 211-218
publication: Proceedings of the 29th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
publist_id: '3572'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The most persistent soft-clique in a set of sampled graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3128'
abstract:
- lang: eng
text: 'We consider two-player zero-sum stochastic games on graphs with ω-regular
winning conditions specified as parity objectives. These games have applications
in the design and control of reactive systems. We survey the complexity results
for the problem of deciding the winner in such games, and in classes of interest
obtained as special cases, based on the information and the power of randomization
available to the players, on the class of objectives and on the winning mode.
On the basis of information, these games can be classified as follows: (a) partial-observation
(both players have partial view of the game); (b) one-sided partial-observation
(one player has partial-observation and the other player has complete-observation);
and (c) complete-observation (both players have complete view of the game). The
one-sided partial-observation games have two important subclasses: the one-player
games, known as partial-observation Markov decision processes (POMDPs), and the
blind one-player games, known as probabilistic automata. On the basis of randomization,
(a) the players may not be allowed to use randomization (pure strategies), or
(b) they may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) they
may use full randomization. Finally, various classes of games are obtained by
restricting the parity objective to a reachability, safety, Büchi, or coBüchi
condition. We also consider several winning modes, such as sure-winning (i.e.,
all outcomes of a strategy have to satisfy the winning condition), almost-sure
winning (i.e., winning with probability 1), limit-sure winning (i.e., winning
with probability arbitrarily close to 1), and value-threshold winning (i.e., winning
with probability at least ν, where ν is a given rational). '
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No. P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF
NFN Grant No. S11407-N23(RiSE), ERC Start grant (279307: Graph Games), Microsoft
faculty fellows award, ERC Advanced grant QUAREM, and FWF Grant No. S11403-N23 (RiSE).'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic
parity games. Formal Methods in System Design. 2012;43(2):268-284. doi:10.1007/s10703-012-0164-2
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation
stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey
of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design.
Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation
stochastic parity games,” Formal Methods in System Design, vol. 43, no.
2. Springer, pp. 268–284, 2012.
ista: Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation
stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
mla: Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic
Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer,
2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design
43 (2012) 268–284.
date_created: 2018-12-11T12:01:33Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:41:15Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-012-0164-2
ec_funded: 1
file:
- access_level: open_access
checksum: dd3d590f383bb2ac6cfda1489ac1c42a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:27Z
date_updated: 2020-07-14T12:46:00Z
file_id: '4882'
file_name: IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf
file_size: 163983
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 43'
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 268 - 284
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '3570'
pubrep_id: '303'
quality_controlled: '1'
scopus_import: 1
status: public
title: A survey of partial-observation stochastic parity games
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2012'
...
---
_id: '3129'
abstract:
- lang: eng
text: "Let K be a simplicial complex and g the rank of its p-th homology group Hp(K)
defined with ℤ2 coefficients. We show that we can compute a basis H of Hp(K) and
annotate each p-simplex of K with a binary vector of length g with the following
property: the annotations, summed over all p-simplices in any p-cycle z, provide
the coordinate vector of the homology class [z] in the basis H. The basis and
the annotations for all simplices can be computed in O(n ω ) time, where n is
the size of K and ω < 2.376 is a quantity so that two n×n matrices can be multiplied
in O(n ω ) time. The precomputed annotations permit answering queries about the
independence or the triviality of p-cycles efficiently.\r\n\r\nUsing annotations
of edges in 2-complexes, we derive better algorithms for computing optimal basis
and optimal homologous cycles in 1 - dimensional homology. Specifically, for computing
an optimal basis of H1(K) , we improve the previously known time complexity from
O(n 4) to O(n ω + n 2 g ω − 1). Here n denotes the size of the 2-skeleton of
K and g the rank of H1(K) . Computing an optimal cycle homologous to a given 1-cycle
is NP-hard even for surfaces and an algorithm taking 2 O(g) nlogn time is known
for surfaces. We extend this algorithm to work with arbitrary 2-complexes in O(n
ω ) + 2 O(g) n 2logn time using annotations.\r\n"
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Oleksiy
full_name: Busaryev, Oleksiy
last_name: Busaryev
- first_name: Sergio
full_name: Cabello, Sergio
last_name: Cabello
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Tamal
full_name: Dey, Tamal
last_name: Dey
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: 'Busaryev O, Cabello S, Chen C, Dey T, Wang Y. Annotating simplices with a
homology basis and its applications. In: Vol 7357. Springer; 2012:189-200. doi:10.1007/978-3-642-31155-0_17'
apa: 'Busaryev, O., Cabello, S., Chen, C., Dey, T., & Wang, Y. (2012). Annotating
simplices with a homology basis and its applications (Vol. 7357, pp. 189–200).
Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki,
Finland: Springer. https://doi.org/10.1007/978-3-642-31155-0_17'
chicago: Busaryev, Oleksiy, Sergio Cabello, Chao Chen, Tamal Dey, and Yusu Wang.
“Annotating Simplices with a Homology Basis and Its Applications,” 7357:189–200.
Springer, 2012. https://doi.org/10.1007/978-3-642-31155-0_17.
ieee: 'O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices
with a homology basis and its applications,” presented at the SWAT: Symposium
and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.'
ista: 'Busaryev O, Cabello S, Chen C, Dey T, Wang Y. 2012. Annotating simplices
with a homology basis and its applications. SWAT: Symposium and Workshops on Algorithm
Theory, LNCS, vol. 7357, 189–200.'
mla: Busaryev, Oleksiy, et al. Annotating Simplices with a Homology Basis and
Its Applications. Vol. 7357, Springer, 2012, pp. 189–200, doi:10.1007/978-3-642-31155-0_17.
short: O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp.
189–200.
conference:
end_date: 2012-07-06
location: Helsinki, Finland
name: 'SWAT: Symposium and Workshops on Algorithm Theory'
start_date: 2012-07-04
date_created: 2018-12-11T12:01:33Z
date_published: 2012-06-19T00:00:00Z
date_updated: 2021-01-12T07:41:15Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-642-31155-0_17
external_id:
arxiv:
- '1107.3793'
intvolume: ' 7357'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.3793
month: '06'
oa: 1
oa_version: Preprint
page: 189 - 200
publication_status: published
publisher: Springer
publist_id: '3569'
quality_controlled: '1'
scopus_import: 1
status: public
title: Annotating simplices with a homology basis and its applications
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7357
year: '2012'
...
---
_id: '3130'
abstract:
- lang: eng
text: 'Essential genes code for fundamental cellular functions required for the
viability of an organism. For this reason, essential genes are often highly conserved
across organisms. However, this is not always the case: orthologues of genes that
are essential in one organism are sometimes not essential in other organisms or
are absent from their genomes. This suggests that, in the course of evolution,
essential genes can be rendered nonessential. How can a gene become non-essential?
Here we used genetic manipulation to deplete the products of 26 different essential
genes in Escherichia coli. This depletion results in a lethal phenotype, which
could often be rescued by the overexpression of a non-homologous, non-essential
gene, most likely through replacement of the essential function. We also show
that, in a smaller number of cases, the essential genes can be fully deleted from
the genome, suggesting that complete functional replacement is possible. Finally,
we show that essential genes whose function can be replaced in the laboratory
are more likely to be non-essential or not present in other taxa. These results
are consistent with the notion that patterns of evolutionary conservation of essential
genes are influenced by their compensability-that is, by how easily they can be
functionally replaced, for example through increased expression of other genes.'
acknowledgement: We thank Alex Boehm for discussions and comments.
article_number: e1002803
author:
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
- first_name: Olin
full_name: Silander, Olin
last_name: Silander
citation:
ama: Bergmiller T, Ackermann M, Silander O. Patterns of evolutionary conservation
of essential genes correlate with their compensability. PLoS Genetics.
2012;8(6). doi:10.1371/journal.pgen.1002803
apa: Bergmiller, T., Ackermann, M., & Silander, O. (2012). Patterns of evolutionary
conservation of essential genes correlate with their compensability. PLoS Genetics.
Public Library of Science. https://doi.org/10.1371/journal.pgen.1002803
chicago: Bergmiller, Tobias, Martin Ackermann, and Olin Silander. “Patterns of Evolutionary
Conservation of Essential Genes Correlate with Their Compensability.” PLoS
Genetics. Public Library of Science, 2012. https://doi.org/10.1371/journal.pgen.1002803.
ieee: T. Bergmiller, M. Ackermann, and O. Silander, “Patterns of evolutionary conservation
of essential genes correlate with their compensability,” PLoS Genetics,
vol. 8, no. 6. Public Library of Science, 2012.
ista: Bergmiller T, Ackermann M, Silander O. 2012. Patterns of evolutionary conservation
of essential genes correlate with their compensability. PLoS Genetics. 8(6), e1002803.
mla: Bergmiller, Tobias, et al. “Patterns of Evolutionary Conservation of Essential
Genes Correlate with Their Compensability.” PLoS Genetics, vol. 8, no.
6, e1002803, Public Library of Science, 2012, doi:10.1371/journal.pgen.1002803.
short: T. Bergmiller, M. Ackermann, O. Silander, PLoS Genetics 8 (2012).
date_created: 2018-12-11T12:01:34Z
date_published: 2012-06-28T00:00:00Z
date_updated: 2021-01-12T07:41:16Z
day: '28'
ddc:
- '576'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1002803
file:
- access_level: open_access
checksum: f8506fb579eda6fc5613ba9bf421b86a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:52Z
date_updated: 2020-07-14T12:46:01Z
file_id: '4973'
file_name: IST-2015-386-v1+1_journal.pgen.1002803.pdf
file_size: 2674138
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Genetics
publication_status: published
publisher: Public Library of Science
publist_id: '3567'
pubrep_id: '386'
quality_controlled: '1'
scopus_import: 1
status: public
title: Patterns of evolutionary conservation of essential genes correlate with their
compensability
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2012'
...
---
_id: '3131'
abstract:
- lang: eng
text: 'In large populations, many beneficial mutations may be simultaneously available
and may compete with one another, slowing adaptation. By finding the probability
of fixation of a favorable allele in a simple model of a haploid sexual population,
we find limits to the rate of adaptive substitution, Λ, that depend on simple
parameter combinations. When variance in fitness is low and linkage is loose,
the baseline rate of substitution is Λ 0=2NU〈s〉 is the population size, U is the
rate of beneficial mutations per genome, and 〈s〉 is their mean selective advantage.
Heritable variance ν in log fitness due to unlinked loci reduces Λ by e -4ν under
polygamy and e -8ν under monogamy. With a linear genetic map of length R Morgans,
interference is yet stronger. We use a scaling argument to show that the density
of adaptive substitutions depends on s, N, U, and R only through the baseline
density: Λ/R=F(Λ 0/R). Under the approximation that the interference due to different
sweeps adds up, we show that Λ/R~(Λ 0/R)/(1+2Λ 0/R), implying that interference
prevents the rate of adaptive substitution from exceeding one per centimorgan
per 200 generations. Simulations and numerical calculations confirm the scaling
argument and confirm the additive approximation for Λ 0/R 1; for higher Λ 0/R,
the rate of adaptation grows above R/2, but only very slowly. We also consider
the effect of sweeps on neutral diversity and show that, while even occasional
sweeps can greatly reduce neutral diversity, this effect saturates as sweeps become
more common-diversity can be maintained even in populations experiencing very
strong interference. Our results indicate that for some organisms the rate of
adaptive substitution may be primarily recombination-limited, depending only weakly
on the mutation supply and the strength of selection.'
acknowledgement: "The work was funded by ERC grant 250152.\r\nWe thank B. Charlesworth,
O. Hallatschek, W. G. Hill, R. A. Neher, S. P. Otto, and the anonymous reviewers
for their helpful suggestions."
article_number: e1002740
author:
- first_name: Daniel
full_name: Weissman, Daniel
id: 2D0CE020-F248-11E8-B48F-1D18A9856A87
last_name: Weissman
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Weissman D, Barton NH. Limits to the rate of adaptive substitution in sexual
populations. PLoS Genetics. 2012;8(6). doi:10.1371/journal.pgen.1002740
apa: Weissman, D., & Barton, N. H. (2012). Limits to the rate of adaptive substitution
in sexual populations. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1002740
chicago: Weissman, Daniel, and Nicholas H Barton. “Limits to the Rate of Adaptive
Substitution in Sexual Populations.” PLoS Genetics. Public Library of Science,
2012. https://doi.org/10.1371/journal.pgen.1002740.
ieee: D. Weissman and N. H. Barton, “Limits to the rate of adaptive substitution
in sexual populations,” PLoS Genetics, vol. 8, no. 6. Public Library of
Science, 2012.
ista: Weissman D, Barton NH. 2012. Limits to the rate of adaptive substitution in
sexual populations. PLoS Genetics. 8(6), e1002740.
mla: Weissman, Daniel, and Nicholas H. Barton. “Limits to the Rate of Adaptive Substitution
in Sexual Populations.” PLoS Genetics, vol. 8, no. 6, e1002740, Public
Library of Science, 2012, doi:10.1371/journal.pgen.1002740.
short: D. Weissman, N.H. Barton, PLoS Genetics 8 (2012).
date_created: 2018-12-11T12:01:34Z
date_published: 2012-06-07T00:00:00Z
date_updated: 2021-01-12T07:41:17Z
day: '07'
ddc:
- '570'
- '576'
department:
- _id: NiBa
doi: 10.1371/journal.pgen.1002740
ec_funded: 1
file:
- access_level: open_access
checksum: 729a4becda7d786c4c3db8f9a1f77953
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:00Z
date_updated: 2020-07-14T12:46:01Z
file_id: '4659'
file_name: IST-2013-114-v1+1_WeissmanBarton2012.pdf
file_size: 1284801
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: PLoS Genetics
publication_status: published
publisher: Public Library of Science
publist_id: '3566'
pubrep_id: '114'
quality_controlled: '1'
scopus_import: 1
status: public
title: Limits to the rate of adaptive substitution in sexual populations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2012'
...
---
_id: '3132'
abstract:
- lang: eng
text: 'Reproductive division of labour is a characteristic trait of social insects.
The dominant reproductive individual, often the queen, uses chemical communication
and/or behaviour to maintain her social status. Queens of many social insects
communicate their fertility status via cuticle-bound substances. As these substances
usually possess a low volatility, their range in queen–worker communication is
potentially limited. Here, we investigate the range and impact of behavioural
and chemical queen signals on workers of the ant Temnothorax longispinosus. We
compared the behaviour and ovary development of workers subjected to three different
treatments: workers with direct chemical and physical contact to the queen, those
solely under the influence of volatile queen substances and those entirely separated
from the queen. In addition to short-ranged queen signals preventing ovary development
in workers, we discovered a novel secondary pathway influencing worker behaviour.
Workers with no physical contact to the queen, but exposed to volatile substances,
started to develop their ovaries, but did not change their behaviour compared
to workers in direct contact to the queen. In contrast, workers in queen-separated
groups showed both increased ovary development and aggressive dominance interactions.
We conclude that T. longispinosus queens influence worker ovary development and
behaviour via two independent signals, both ensuring social harmony within the
colony.'
acknowledgement: We like to thank the editor and three anonymous reviewers for their
time and constructive criticism and Inon Scharf, Volker Witte and Andreas Modlmeier
for helpful comments on earlier versions of the manuscript. The first and second
authors appear in alphabetical order and contributed equally to this paper.
author:
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Tobias
full_name: Pamminger, Tobias
last_name: Pamminger
- first_name: Susanne
full_name: Foitzik, Susanne
last_name: Foitzik
citation:
ama: Konrad M, Pamminger T, Foitzik S. Two pathways ensuring social harmony. Naturwissenschaften.
2012;99(8):627-636. doi:10.1007/s00114-012-0943-z
apa: Konrad, M., Pamminger, T., & Foitzik, S. (2012). Two pathways ensuring
social harmony. Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-012-0943-z
chicago: Konrad, Matthias, Tobias Pamminger, and Susanne Foitzik. “Two Pathways
Ensuring Social Harmony.” Naturwissenschaften. Springer, 2012. https://doi.org/10.1007/s00114-012-0943-z.
ieee: M. Konrad, T. Pamminger, and S. Foitzik, “Two pathways ensuring social harmony,”
Naturwissenschaften, vol. 99, no. 8. Springer, pp. 627–636, 2012.
ista: Konrad M, Pamminger T, Foitzik S. 2012. Two pathways ensuring social harmony.
Naturwissenschaften. 99(8), 627–636.
mla: Konrad, Matthias, et al. “Two Pathways Ensuring Social Harmony.” Naturwissenschaften,
vol. 99, no. 8, Springer, 2012, pp. 627–36, doi:10.1007/s00114-012-0943-z.
short: M. Konrad, T. Pamminger, S. Foitzik, Naturwissenschaften 99 (2012) 627–636.
date_created: 2018-12-11T12:01:34Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:41:17Z
day: '01'
department:
- _id: SyCr
doi: 10.1007/s00114-012-0943-z
intvolume: ' 99'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 627 - 636
publication: Naturwissenschaften
publication_status: published
publisher: Springer
publist_id: '3565'
quality_controlled: '1'
scopus_import: 1
status: public
title: Two pathways ensuring social harmony
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2012'
...
---
_id: '3133'
abstract:
- lang: eng
text: 'This note contributes to the point calculus of persistent homology by extending
Alexander duality from spaces to real-valued functions. Given a perfect Morse
function f: S n+1 →[0, 1 and a decomposition S n+1 = U ∪ V into two (n + 1)-manifolds
with common boundary M, we prove elementary relationships between the persistence
diagrams of f restricted to U, to V, and to M. '
acknowledgement: "his research is partially supported by the National Science Foundation
(NSF) under grant DBI-0820624, the European Science Foundation under the Research
Networking Programme, and the Russian Government Project 11.G34.31.0053.\r\nThe
authors thank an anonymous referee for suggesting the simplified proof of the Contravariant
PE Theorem given in this paper. They also thank Frederick Cohen, Yuriy Mileyko and
Amit Patel for helpful discussions."
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: 'Edelsbrunner H, Kerber M. Alexander duality for functions: The persistent
behavior of land and water and shore. In: Proceedings of the Twenty-Eighth
Annual Symposium on Computational Geometry . ACM; 2012:249-258. doi:10.1145/2261250.2261287'
apa: 'Edelsbrunner, H., & Kerber, M. (2012). Alexander duality for functions:
The persistent behavior of land and water and shore. In Proceedings of the
twenty-eighth annual symposium on Computational geometry (pp. 249–258). Chapel
Hill, NC, USA: ACM. https://doi.org/10.1145/2261250.2261287'
chicago: 'Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions:
The Persistent Behavior of Land and Water and Shore.” In Proceedings of the
Twenty-Eighth Annual Symposium on Computational Geometry , 249–58. ACM, 2012.
https://doi.org/10.1145/2261250.2261287.'
ieee: 'H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent
behavior of land and water and shore,” in Proceedings of the twenty-eighth
annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp.
249–258.'
ista: 'Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent
behavior of land and water and shore. Proceedings of the twenty-eighth annual
symposium on Computational geometry . SCG: Symposium on Computational Geometry,
249–258.'
mla: 'Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions:
The Persistent Behavior of Land and Water and Shore.” Proceedings of the Twenty-Eighth
Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–58, doi:10.1145/2261250.2261287.'
short: H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual
Symposium on Computational Geometry , ACM, 2012, pp. 249–258.
conference:
end_date: 2012-06-20
location: Chapel Hill, NC, USA
name: 'SCG: Symposium on Computational Geometry'
start_date: 2012-06-17
date_created: 2018-12-11T12:01:35Z
date_published: 2012-06-20T00:00:00Z
date_updated: 2021-01-12T07:41:17Z
day: '20'
department:
- _id: HeEd
doi: 10.1145/2261250.2261287
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1109.5052
month: '06'
oa: 1
oa_version: Preprint
page: 249 - 258
publication: 'Proceedings of the twenty-eighth annual symposium on Computational geometry '
publication_status: published
publisher: ACM
publist_id: '3564'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Alexander duality for functions: The persistent behavior of land and water
and shore'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3134'
abstract:
- lang: eng
text: 'It has been an open question whether the sum of finitely many isotropic Gaussian
kernels in n ≥ 2 dimensions can have more modes than kernels, until in 2003 Carreira-Perpiñán
and Williams exhibited n +1 isotropic Gaussian kernels in ℝ n with n + 2 modes.
We give a detailed analysis of this example, showing that it has exponentially
many critical points and that the resilience of the extra mode grows like √n.
In addition, we exhibit finite configurations of isotropic Gaussian kernels with
superlinearly many modes. '
acknowledgement: This research is partially supported by the National Science Foun-
dation (NSF) under grant DBI-0820624, by the European Science Foundation under the
Research Networking Programme, and the Russian Government Project 11.G34.31.0053.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Brittany
full_name: Fasy, Brittany
last_name: Fasy
- first_name: Günter
full_name: Rote, Günter
last_name: Rote
citation:
ama: 'Edelsbrunner H, Fasy B, Rote G. Add isotropic Gaussian kernels at own risk:
More and more resilient modes in higher dimensions. In: Proceedings of the
Twenty-Eighth Annual Symposium on Computational Geometry . ACM; 2012:91-100.
doi:10.1145/2261250.2261265'
apa: 'Edelsbrunner, H., Fasy, B., & Rote, G. (2012). Add isotropic Gaussian
kernels at own risk: More and more resilient modes in higher dimensions. In Proceedings
of the twenty-eighth annual symposium on Computational geometry (pp. 91–100).
Chapel Hill, NC, USA: ACM. https://doi.org/10.1145/2261250.2261265'
chicago: 'Edelsbrunner, Herbert, Brittany Fasy, and Günter Rote. “Add Isotropic
Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.”
In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry
, 91–100. ACM, 2012. https://doi.org/10.1145/2261250.2261265.'
ieee: 'H. Edelsbrunner, B. Fasy, and G. Rote, “Add isotropic Gaussian kernels at
own risk: More and more resilient modes in higher dimensions,” in Proceedings
of the twenty-eighth annual symposium on Computational geometry , Chapel Hill,
NC, USA, 2012, pp. 91–100.'
ista: 'Edelsbrunner H, Fasy B, Rote G. 2012. Add isotropic Gaussian kernels at own
risk: More and more resilient modes in higher dimensions. Proceedings of the twenty-eighth
annual symposium on Computational geometry . SCG: Symposium on Computational Geometry,
91–100.'
mla: 'Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk:
More and More Resilient Modes in Higher Dimensions.” Proceedings of the Twenty-Eighth
Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100, doi:10.1145/2261250.2261265.'
short: H. Edelsbrunner, B. Fasy, G. Rote, in:, Proceedings of the Twenty-Eighth
Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100.
conference:
end_date: 2012-06-20
location: Chapel Hill, NC, USA
name: 'SCG: Symposium on Computational Geometry'
start_date: 2012-06-17
date_created: 2018-12-11T12:01:35Z
date_published: 2012-06-20T00:00:00Z
date_updated: 2023-02-23T10:59:27Z
day: '20'
department:
- _id: HeEd
doi: 10.1145/2261250.2261265
language:
- iso: eng
month: '06'
oa_version: None
page: 91 - 100
publication: 'Proceedings of the twenty-eighth annual symposium on Computational geometry '
publication_status: published
publisher: ACM
publist_id: '3563'
quality_controlled: '1'
related_material:
record:
- id: '2815'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Add isotropic Gaussian kernels at own risk: More and more resilient modes
in higher dimensions'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3135'
abstract:
- lang: eng
text: 'We introduce consumption games, a model for discrete interactive system with
multiple resources that are consumed or reloaded independently. More precisely,
a consumption game is a finite-state graph where each transition is labeled by
a vector of resource updates, where every update is a non-positive number or ω.
The ω updates model the reloading of a given resource. Each vertex belongs either
to player □ or player ◇, where the aim of player □ is to play so that the resources
are never exhausted. We consider several natural algorithmic problems about consumption
games, and show that although these problems are computationally hard in general,
they are solvable in polynomial time for every fixed number of resource types
(i.e., the dimension of the update vectors) and bounded resource updates. '
acknowledgement: 'Tomas Brazdil, Antonin Kucera, and Petr Novotny are supported by
the Czech Science Foundation, grant No. P202/10/1469. Krishnendu Chatterjee is supported
by the FWF (Austrian Science Fund) NFN Grant No S11407-N23 (RiSE) and ERC Start
grant (279307: Graph Games).'
alternative_title:
- LNCS
author:
- first_name: Brázdil
full_name: Brázdil, Brázdil
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
citation:
ama: 'Brázdil B, Chatterjee K, Kučera A, Novotný P. Efficient controller synthesis
for consumption games with multiple resource types. In: Vol 7358. Springer; 2012:23-38.
doi:10.1007/978-3-642-31424-7_8'
apa: 'Brázdil, B., Chatterjee, K., Kučera, A., & Novotný, P. (2012). Efficient
controller synthesis for consumption games with multiple resource types (Vol.
7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley,
CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_8'
chicago: Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kučera, and Petr Novotný.
“Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,”
7358:23–38. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_8.
ieee: 'B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller
synthesis for consumption games with multiple resource types,” presented at the
CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.'
ista: 'Brázdil B, Chatterjee K, Kučera A, Novotný P. 2012. Efficient controller
synthesis for consumption games with multiple resource types. CAV: Computer Aided
Verification, LNCS, vol. 7358, 23–38.'
mla: Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption
Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38,
doi:10.1007/978-3-642-31424-7_8.
short: B. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, in:, Springer, 2012, pp.
23–38.
conference:
end_date: 2012-07-13
location: Berkeley, CA, USA
name: 'CAV: Computer Aided Verification'
start_date: 2012-07-07
date_created: 2018-12-11T12:01:35Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:41:18Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-31424-7_8
ec_funded: 1
intvolume: ' 7358'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.0796
month: '07'
oa: 1
oa_version: Preprint
page: 23 - 38
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: Springer
publist_id: '3562'
quality_controlled: '1'
scopus_import: 1
status: public
title: Efficient controller synthesis for consumption games with multiple resource
types
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7358
year: '2012'
...
---
_id: '3136'
abstract:
- lang: eng
text: 'Continuous-time Markov chains (CTMC) with their rich theory and efficient
simulation algorithms have been successfully used in modeling stochastic processes
in diverse areas such as computer science, physics, and biology. However, systems
that comprise non-instantaneous events cannot be accurately and efficiently modeled
with CTMCs. In this paper we define delayed CTMCs, an extension of CTMCs that
allows for the specification of a lower bound on the time interval between an
event''s initiation and its completion, and we propose an algorithm for the computation
of their behavior. Our algorithm effectively decomposes the computation into two
stages: a pure CTMC governs event initiations while a deterministic process guarantees
lower bounds on event completion times. Furthermore, from the nature of delayed
CTMCs, we obtain a parallelized version of our algorithm. We use our formalism
to model genetic regulatory circuits (biological systems where delayed events
are common) and report on the results of our numerical algorithm as run on a cluster.
We compare performance and accuracy of our results with results obtained by using
pure CTMCs. © 2012 Springer-Verlag.'
acknowledgement: This work was supported by the ERC Advanced Investigator grant on
Quantitative Reactive Modeling (QUAREM) and by the Swiss National Science Foundation.
alternative_title:
- LNCS
author:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: Maria
full_name: Mateescu, Maria
id: 3B43276C-F248-11E8-B48F-1D18A9856A87
last_name: Mateescu
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: 'Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. Delayed continuous time
Markov chains for genetic regulatory circuits. In: Vol 7358. Springer; 2012:294-309.
doi:10.1007/978-3-642-31424-7_24'
apa: 'Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., & Sezgin, A. (2012).
Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358,
pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA,
USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_24'
chicago: Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and
Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,”
7358:294–309. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_24.
ieee: 'C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed
continuous time Markov chains for genetic regulatory circuits,” presented at the
CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.'
ista: 'Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous
time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification,
LNCS, vol. 7358, 294–309.'
mla: Guet, Calin C., et al. Delayed Continuous Time Markov Chains for Genetic
Regulatory Circuits. Vol. 7358, Springer, 2012, pp. 294–309, doi:10.1007/978-3-642-31424-7_24.
short: C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer,
2012, pp. 294–309.
conference:
end_date: 2012-07-13
location: Berkeley, CA, USA
name: 'CAV: Computer Aided Verification'
start_date: 2012-07-07
date_created: 2018-12-11T12:01:36Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:41:18Z
day: '01'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/978-3-642-31424-7_24
ec_funded: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 294 - 309
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '3561'
quality_controlled: '1'
scopus_import: 1
status: public
title: Delayed continuous time Markov chains for genetic regulatory circuits
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: '7358 '
year: '2012'
...
---
_id: '3155'
abstract:
- lang: eng
text: 'We propose synchronous interfaces, a new interface theory for discrete-time
systems. We use an application to time-triggered scheduling to drive the design
choices for our formalism; in particular, additionally to deriving useful mathematical
properties, we focus on providing a syntax which is adapted to natural high-level
system modeling. As a result, we develop an interface model that relies on a guarded-command
based language and is equipped with shared variables and explicit discrete-time
clocks. We define all standard interface operations: compatibility checking, composition,
refinement, and shared refinement. Apart from the synchronous interface model,
the contribution of this paper is the establishment of a formal relation between
interface theories and real-time scheduling, where we demonstrate a fully automatic
framework for the incremental computation of time-triggered schedules.'
acknowledgement: Research partially supported by the Danish-Chinese Center for Cyber
Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB.
alternative_title:
- LNCS
author:
- first_name: Benoît
full_name: Delahaye, Benoît
last_name: Delahaye
- first_name: Uli
full_name: Fahrenberg, Uli
last_name: Fahrenberg
- 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: Axel
full_name: Legay, Axel
last_name: Legay
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface
theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218.
doi:10.1007/978-3-642-30793-5_13'
apa: 'Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., & Nickovic,
D. (2012). Synchronous interface theories and time triggered scheduling (Vol.
7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and
Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed
Systems , Stockholm, Sweden: Springer. https://doi.org/10.1007/978-3-642-30793-5_13'
chicago: Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan
Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18.
Springer, 2012. https://doi.org/10.1007/978-3-642-30793-5_13.
ieee: 'B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous
interface theories and time triggered scheduling,” presented at the FORTE: Formal
Techniques for Networked and Distributed Systems & FMOODS: Formal Methods
for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273,
pp. 203–218.'
ista: 'Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous
interface theories and time triggered scheduling. FORTE: Formal Techniques for
Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based
Distributed Systems , LNCS, vol. 7273, 203–218.'
mla: Delahaye, Benoît, et al. Synchronous Interface Theories and Time Triggered
Scheduling. Vol. 7273, Springer, 2012, pp. 203–18, doi:10.1007/978-3-642-30793-5_13.
short: B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer,
2012, pp. 203–218.
conference:
end_date: 2012-06-16
location: Stockholm, Sweden
name: 'FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS:
Formal Methods for Open Object-Based Distributed Systems '
start_date: 2012-06-13
date_created: 2018-12-11T12:01:43Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:26Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-30793-5_13
file:
- access_level: open_access
checksum: feae2e07f2d9a59843f8ddabf25d179f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:25Z
date_updated: 2020-07-14T12:46:01Z
file_id: '4879'
file_name: IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf
file_size: 493198
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 7273'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 203 - 218
publication_status: published
publisher: Springer
publist_id: '3539'
pubrep_id: '88'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synchronous interface theories and time triggered scheduling
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7273
year: '2012'
...
---
_id: '3156'
abstract:
- lang: eng
text: Dispersal is crucial for gene flow and often determines the long-term stability
of meta-populations, particularly in rare species with specialized life cycles.
Such species are often foci of conservation efforts because they suffer disproportionally
from degradation and fragmentation of their habitat. However, detailed knowledge
of effective gene flow through dispersal is often missing, so that conservation
strategies have to be based on mark-recapture observations that are suspected
to be poor predictors of long-distance dispersal. These constraints have been
especially severe in the study of butterfly populations, where microsatellite
markers have been difficult to develop. We used eight microsatellite markers to
analyse genetic population structure of the Large Blue butterfly Maculinea arion
in Sweden. During recent decades, this species has become an icon of insect conservation
after massive decline throughout Europe and extinction in Britain followed by
reintroduction of a seed population from the Swedish island of Öland. We find
that populations are highly structured genetically, but that gene flow occurs
over distances 15 times longer than the maximum distance recorded from mark-recapture
studies, which can only be explained by maximum dispersal distances at least twice
as large as previously accepted. However, we also find evidence that gaps between
sites with suitable habitat exceeding ∼ 20 km induce genetic erosion that can
be detected from bottleneck analyses. Although further work is needed, our results
suggest that M. arion can maintain fully functional metapopulations when they
consist of optimal habitat patches that are no further apart than ∼10 km.
acknowledgement: "The work was financed by the Danish National Science Research Foundation
via a grant to the Centre for Social Evolution.\r\nWe thank four anonymous reviewers
for useful comments on the manuscript, J. Bergsten, P. Bina, B. Carlsson, M. Johannesson
and A.E. Lomborg for providing additional wingtip samples, A. Illum for assistance
in the field, and in particular P.S. Nielsen for mediating the contact to the collectors
and the Swedish authorities. Collection was made possible through a permit by the
Åtgärdsprogrammet, supported by the Swedish Environmental Protection Agency."
author:
- 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: Anne
full_name: Andersen, Anne
last_name: Andersen
- first_name: Jacobus
full_name: Boomsma, Jacobus
last_name: Boomsma
- first_name: David
full_name: Nash, David
last_name: Nash
citation:
ama: Ugelvig LV, Andersen A, Boomsma J, Nash D. Dispersal and gene flow in the rare
parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 2012;21(13):3224-3236.
doi:10.1111/j.1365-294X.2012.05592.x
apa: Ugelvig, L. V., Andersen, A., Boomsma, J., & Nash, D. (2012). Dispersal
and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular
Ecology. Wiley-Blackwell. https://doi.org/10.1111/j.1365-294X.2012.05592.x
chicago: Ugelvig, Line V, Anne Andersen, Jacobus Boomsma, and David Nash. “Dispersal
and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” Molecular
Ecology. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1365-294X.2012.05592.x.
ieee: L. V. Ugelvig, A. Andersen, J. Boomsma, and D. Nash, “Dispersal and gene flow
in the rare parasitic Large Blue butterfly Maculinea arion,” Molecular Ecology,
vol. 21, no. 13. Wiley-Blackwell, pp. 3224–3236, 2012.
ista: Ugelvig LV, Andersen A, Boomsma J, Nash D. 2012. Dispersal and gene flow in
the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 21(13),
3224–3236.
mla: Ugelvig, Line V., et al. “Dispersal and Gene Flow in the Rare Parasitic Large
Blue Butterfly Maculinea Arion.” Molecular Ecology, vol. 21, no. 13, Wiley-Blackwell,
2012, pp. 3224–36, doi:10.1111/j.1365-294X.2012.05592.x.
short: L.V. Ugelvig, A. Andersen, J. Boomsma, D. Nash, Molecular Ecology 21 (2012)
3224–3236.
date_created: 2018-12-11T12:01:43Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:41:27Z
day: '01'
department:
- _id: SyCr
doi: 10.1111/j.1365-294X.2012.05592.x
intvolume: ' 21'
issue: '13'
language:
- iso: eng
month: '07'
oa_version: None
page: 3224 - 3236
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3538'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea
arion
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2012'
...
---
_id: '3157'
abstract:
- lang: eng
text: Colorectal tumours that are wild type for KRAS are often sensitive to EGFR
blockade, but almost always develop resistance within several months of initiating
therapy. The mechanisms underlying this acquired resistance to anti-EGFR antibodies
are largely unknown. This situation is in marked contrast to that of small-molecule
targeted agents, such as inhibitors of ABL, EGFR, BRAF and MEK, in which mutations
in the genes encoding the protein targets render the tumours resistant to the
effects of the drugs. The simplest hypothesis to account for the development of
resistance to EGFR blockade is that rare cells with KRAS mutations pre-exist at
low levels in tumours with ostensibly wild-type KRAS genes. Although this hypothesis
would seem readily testable, there is no evidence in pre-clinical models to support
it, nor is there data from patients. To test this hypothesis, we determined whether
mutant KRAS DNA could be detected in the circulation of 28 patients receiving
monotherapy with panitumumab, a therapeutic anti-EGFR antibody. We found that
9 out of 24 (38%) patients whose tumours were initially KRAS wild type developed
detectable mutations in KRAS in their sera, three of which developed multiple
different KRAS mutations. The appearance of these mutations was very consistent,
generally occurring between 5 and 6months following treatment. Mathematical modelling
indicated that the mutations were present in expanded subclones before the initiation
of panitumumab treatment. These results suggest that the emergence of KRAS mutations
is a mediator of acquired resistance to EGFR blockade and that these mutations
can be detected in a non-invasive manner. They explain why solid tumours develop
resistance to targeted therapies in a highly reproducible fashion.
author:
- first_name: Luis
full_name: Diaz Jr, Luis
last_name: Diaz Jr
- first_name: Richard
full_name: Williams, Richard
last_name: Williams
- first_name: Jian
full_name: Wu, Jian
last_name: Wu
- first_name: Isaac
full_name: Kinde, Isaac
last_name: Kinde
- first_name: Joel
full_name: Hecht, Joel
last_name: Hecht
- first_name: Jordan
full_name: Berlin, Jordan
last_name: Berlin
- first_name: Benjamin
full_name: Allen, Benjamin
last_name: Allen
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Kenneth
full_name: Kinzler, Kenneth
last_name: Kinzler
- first_name: Kelly
full_name: Oliner, Kelly
last_name: Oliner
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
citation:
ama: Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance
to targeted EGFR blockade in colorectal cancers. Nature. 2012;486(7404):537-540.
doi:10.1038/nature11219
apa: Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein,
B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade
in colorectal cancers. Nature. Nature Publishing Group. https://doi.org/10.1038/nature11219
chicago: Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan
Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance
to Targeted EGFR Blockade in Colorectal Cancers.” Nature. Nature Publishing
Group, 2012. https://doi.org/10.1038/nature11219.
ieee: L. Diaz Jr et al., “The molecular evolution of acquired resistance
to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no.
7404. Nature Publishing Group, pp. 537–540, 2012.
ista: Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I,
Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution
of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature.
486(7404), 537–540.
mla: Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted
EGFR Blockade in Colorectal Cancers.” Nature, vol. 486, no. 7404, Nature
Publishing Group, 2012, pp. 537–40, doi:10.1038/nature11219.
short: L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen,
I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486
(2012) 537–540.
date_created: 2018-12-11T12:01:43Z
date_published: 2012-06-28T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '28'
department:
- _id: KrCh
doi: 10.1038/nature11219
ec_funded: 1
external_id:
pmid:
- '22722843'
intvolume: ' 486'
issue: '7404'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/
month: '06'
oa: 1
oa_version: Submitted Version
page: 537 - 540
pmid: 1
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: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '3537'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The molecular evolution of acquired resistance to targeted EGFR blockade in
colorectal cancers
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 486
year: '2012'
...