---
_id: '2800'
abstract:
- lang: eng
text: In shear flows, turbulence first occurs in the form of localized structures
(puffs/spots) surrounded by laminar fluid. We here investigate such spatially
intermittent flows in a pipe experiment showing that turbulent puffs have a well-defined
interaction distance, which sets their minimum spacing as well as the maximum
observable turbulent fraction. Two methodologies are employed. Starting from a
laminar flow, puffs are first created by locally injecting a jet of fluid through
the pipe wall. When the perturbation is applied periodically at low frequencies,
as expected, a regular sequence of puffs is observed where the puff spacing is
given by the ratio of the mean flow speed to the perturbation frequency. At large
frequencies however puffs are found to interact and annihilate each other. Varying
the perturbation frequency, an interaction distance is determined which sets the
highest possible turbulence fraction. This enables us to establish an upper bound
for the friction factor in the transitional regime, which provides a well-defined
link between the Blasius and the Hagen-Poiseuille friction laws. In the second
set of experiments, the Reynolds number is reduced suddenly from fully turbulent
to the intermittent regime. The resulting flow reorganizes itself to a sequence
of constant size puffs which, unlike in Couette and Taylor–Couette flow are randomly
spaced. The minimum distance between the turbulent patches is identical to the
puff interaction length. The puff interaction length is found to be in agreement
with the wavelength of regular stripe and spiral patterns in plane Couette and
Taylor–Couette flow.
author:
- first_name: Devranjan
full_name: Samanta, Devranjan
last_name: Samanta
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Samanta D, De Lózar A, Hof B. Experimental investigation of laminar turbulent
intermittency in pipe flow. Journal of Fluid Mechanics. 2011;681:193-204.
doi:10.1017/jfm.2011.189
apa: Samanta, D., De Lózar, A., & Hof, B. (2011). Experimental investigation
of laminar turbulent intermittency in pipe flow. Journal of Fluid Mechanics.
Cambridge University Press. https://doi.org/10.1017/jfm.2011.189
chicago: Samanta, Devranjan, Alberto De Lózar, and Björn Hof. “Experimental Investigation
of Laminar Turbulent Intermittency in Pipe Flow.” Journal of Fluid Mechanics.
Cambridge University Press, 2011. https://doi.org/10.1017/jfm.2011.189.
ieee: D. Samanta, A. De Lózar, and B. Hof, “Experimental investigation of laminar
turbulent intermittency in pipe flow,” Journal of Fluid Mechanics, vol.
681. Cambridge University Press, pp. 193–204, 2011.
ista: Samanta D, De Lózar A, Hof B. 2011. Experimental investigation of laminar
turbulent intermittency in pipe flow. Journal of Fluid Mechanics. 681, 193–204.
mla: Samanta, Devranjan, et al. “Experimental Investigation of Laminar Turbulent
Intermittency in Pipe Flow.” Journal of Fluid Mechanics, vol. 681, Cambridge
University Press, 2011, pp. 193–204, doi:10.1017/jfm.2011.189.
short: D. Samanta, A. De Lózar, B. Hof, Journal of Fluid Mechanics 681 (2011) 193–204.
date_created: 2018-12-11T11:59:40Z
date_published: 2011-08-25T00:00:00Z
date_updated: 2021-01-12T06:59:48Z
day: '25'
doi: 10.1017/jfm.2011.189
extern: 1
intvolume: ' 681'
month: '08'
page: 193 - 204
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '4089'
quality_controlled: 0
status: public
title: Experimental investigation of laminar turbulent intermittency in pipe flow
type: journal_article
volume: 681
year: '2011'
...
---
_id: '2801'
abstract:
- lang: eng
text: Turbulent puffs in pipe flow are characterized by a sharp laminar-turbulent
interface at the trailing edge and a more diffused leading interface. It is known
that these laminar-turbulent interfaces propagate at a speed that is approximately
equal to the flow rate. Our results from direct numerical simulation show that,
locally, the interface velocity relative to the fluid (i) counteracts the advection
due to the laminar velocity profile so that the puff can preserve its characteristic
overall shape, (ii) is very small in magnitude, but involves a large interface
area so that the global propagation velocity relative to the mean flow can be
large and (iii) is determined by both inertial and viscous effects. The analysis
provides some new insights into the mechanisms that sustain or expand localized
turbulence and might be relevant for the design of new control strategies.
alternative_title:
- 'Journal of Physics: Conference Series'
author:
- first_name: Markus
full_name: Holzner, Markus
last_name: Holzner
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: 'Holzner M, Avila M, De Lózar A, Hof B. A Lagrangian approach to the interface
velocity of turbulent puffs in pipe flow. In: Vol 318. IOP Publishing Ltd.; 2011.
doi:10.1088/1742-6596/318/5/052031'
apa: 'Holzner, M., Avila, M., De Lózar, A., & Hof, B. (2011). A Lagrangian approach
to the interface velocity of turbulent puffs in pipe flow (Vol. 318). Presented
at the ETC13: European Turbulence Conference, IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/318/5/052031'
chicago: Holzner, Markus, Marc Avila, Alberto De Lózar, and Björn Hof. “A Lagrangian
Approach to the Interface Velocity of Turbulent Puffs in Pipe Flow,” Vol. 318.
IOP Publishing Ltd., 2011. https://doi.org/10.1088/1742-6596/318/5/052031.
ieee: 'M. Holzner, M. Avila, A. De Lózar, and B. Hof, “A Lagrangian approach to
the interface velocity of turbulent puffs in pipe flow,” presented at the ETC13:
European Turbulence Conference, 2011, vol. 318, no. 5.'
ista: 'Holzner M, Avila M, De Lózar A, Hof B. 2011. A Lagrangian approach to the
interface velocity of turbulent puffs in pipe flow. ETC13: European Turbulence
Conference, Journal of Physics: Conference Series, vol. 318.'
mla: Holzner, Markus, et al. A Lagrangian Approach to the Interface Velocity
of Turbulent Puffs in Pipe Flow. Vol. 318, no. 5, IOP Publishing Ltd., 2011,
doi:10.1088/1742-6596/318/5/052031.
short: M. Holzner, M. Avila, A. De Lózar, B. Hof, in:, IOP Publishing Ltd., 2011.
conference:
name: 'ETC13: European Turbulence Conference'
date_created: 2018-12-11T11:59:40Z
date_published: 2011-09-01T00:00:00Z
date_updated: 2019-04-26T07:22:20Z
day: '01'
doi: 10.1088/1742-6596/318/5/052031
extern: 1
intvolume: ' 318'
issue: '5'
month: '09'
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '4088'
quality_controlled: 0
status: public
title: A Lagrangian approach to the interface velocity of turbulent puffs in pipe
flow
type: conference
volume: 318
year: '2011'
...
---
_id: '2871'
abstract:
- lang: eng
text: Despite their relatively simple appearance, roots are incredibly complex organs
that are highly adapted to differing environments. Many aspects of root development
are co-ordinated by subtle spatial differences in the concentrations of the phytohormones
auxin and cytokinin. Events from the formation of a root during embryogenesis
to the determination of the network of lateral roots are controlled by interactions
between these hormones. Recently, interactions have been defined where auxin signaling
promotes the expression of cytokinin signaling inhibitors, cytokinin signaling
promotes the expression of auxin signaling inhibitors and finally where cytokinin
signaling regulates the complex network of auxin transport proteins to position
zones of high auxin signaling. We are witnessing a period of discovery in which
we are beginning to understand how these hormonal pathways communicate to regulate
root formation.
author:
- first_name: Anthony
full_name: Bishopp, Anthony
last_name: Bishopp
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Ykä
full_name: Helariutta, Ykä
last_name: Helariutta
citation:
ama: 'Bishopp A, Benková E, Helariutta Y. Sending mixed messages: Auxin-cytokinin
crosstalk in roots. Current Opinion in Plant Biology. 2011;14(1):10-16.
doi:10.1016/j.pbi.2010.08.014'
apa: 'Bishopp, A., Benková, E., & Helariutta, Y. (2011). Sending mixed messages:
Auxin-cytokinin crosstalk in roots. Current Opinion in Plant Biology. Elsevier.
https://doi.org/10.1016/j.pbi.2010.08.014'
chicago: 'Bishopp, Anthony, Eva Benková, and Ykä Helariutta. “Sending Mixed Messages:
Auxin-Cytokinin Crosstalk in Roots.” Current Opinion in Plant Biology.
Elsevier, 2011. https://doi.org/10.1016/j.pbi.2010.08.014.'
ieee: 'A. Bishopp, E. Benková, and Y. Helariutta, “Sending mixed messages: Auxin-cytokinin
crosstalk in roots,” Current Opinion in Plant Biology, vol. 14, no. 1.
Elsevier, pp. 10–16, 2011.'
ista: 'Bishopp A, Benková E, Helariutta Y. 2011. Sending mixed messages: Auxin-cytokinin
crosstalk in roots. Current Opinion in Plant Biology. 14(1), 10–16.'
mla: 'Bishopp, Anthony, et al. “Sending Mixed Messages: Auxin-Cytokinin Crosstalk
in Roots.” Current Opinion in Plant Biology, vol. 14, no. 1, Elsevier,
2011, pp. 10–16, doi:10.1016/j.pbi.2010.08.014.'
short: A. Bishopp, E. Benková, Y. Helariutta, Current Opinion in Plant Biology 14
(2011) 10–16.
date_created: 2018-12-11T12:00:03Z
date_published: 2011-02-01T00:00:00Z
date_updated: 2021-01-12T07:00:23Z
day: '01'
doi: 10.1016/j.pbi.2010.08.014
extern: 1
intvolume: ' 14'
issue: '1'
month: '02'
page: 10 - 16
publication: Current Opinion in Plant Biology
publication_status: published
publisher: Elsevier
publist_id: '3894'
quality_controlled: 0
status: public
title: 'Sending mixed messages: Auxin-cytokinin crosstalk in roots'
type: journal_article
volume: 14
year: '2011'
...
---
_id: '2874'
abstract:
- lang: eng
text: The apical hook develops in the upper part of the hypocotyl when seeds buried
in the soil germinate, and serves to protect cotyledons and the shoot apical meristem
from possible damage caused by pushing through the soil. The curvature is formed
through differential cell growth that occurs at the two opposite sides of the
hypocotyl, and it is established by a gradient of auxin activity and refined by
the coordinated action of auxin and ethylene. Here we show that gibberellins (GAs)
promote hook development through the transcriptional regulation of several genes
of the ethylene and auxin pathways in Arabidopsis. The level of GA activity determines
the speed of hook formation and the extent of the curvature during the formation
phase independently of ethylene, probably by modulating auxin transport and response
through HLS1, PIN3, and PIN7. Moreover, GAs cooperate with ethylene in preventing
hook opening, in part through the induction of ethylene production mediated by
ACS5/ETO2 and ACS8.
author:
- first_name: Javier
full_name: Gallego-Bartolomé, Javier
last_name: Gallego Bartolomé
- first_name: María
full_name: Arana, María V
last_name: Arana
- first_name: Filip
full_name: Vandenbussche, Filip
last_name: Vandenbussche
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Eugenio
full_name: Minguet, Eugenio G
last_name: Minguet
- first_name: Vicente
full_name: Guardiola, Vicente
last_name: Guardiola
- first_name: Dominique
full_name: Van Der Straeten, Dominique
last_name: Van Der Straeten
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: David
full_name: Alabadí, David
last_name: Alabadí
- first_name: Miguel
full_name: Blázquez, Miguel A
last_name: Blázquez
citation:
ama: Gallego Bartolomé J, Arana M, Vandenbussche F, et al. Hierarchy of hormone
action controlling apical hook development in Arabidopsis. Plant Journal.
2011;67(4):622-634. doi:10.1111/j.1365-313X.2011.04621.x
apa: Gallego Bartolomé, J., Arana, M., Vandenbussche, F., Žádníková, P., Minguet,
E., Guardiola, V., … Blázquez, M. (2011). Hierarchy of hormone action controlling
apical hook development in Arabidopsis. Plant Journal. Wiley-Blackwell.
https://doi.org/10.1111/j.1365-313X.2011.04621.x
chicago: Gallego Bartolomé, Javier, María Arana, Filip Vandenbussche, Petra Žádníková,
Eugenio Minguet, Vicente Guardiola, Dominique Van Der Straeten, Eva Benková, David
Alabadí, and Miguel Blázquez. “Hierarchy of Hormone Action Controlling Apical
Hook Development in Arabidopsis.” Plant Journal. Wiley-Blackwell, 2011.
https://doi.org/10.1111/j.1365-313X.2011.04621.x.
ieee: J. Gallego Bartolomé et al., “Hierarchy of hormone action controlling
apical hook development in Arabidopsis,” Plant Journal, vol. 67, no. 4.
Wiley-Blackwell, pp. 622–634, 2011.
ista: Gallego Bartolomé J, Arana M, Vandenbussche F, Žádníková P, Minguet E, Guardiola
V, Van Der Straeten D, Benková E, Alabadí D, Blázquez M. 2011. Hierarchy of hormone
action controlling apical hook development in Arabidopsis. Plant Journal. 67(4),
622–634.
mla: Gallego Bartolomé, Javier, et al. “Hierarchy of Hormone Action Controlling
Apical Hook Development in Arabidopsis.” Plant Journal, vol. 67, no. 4,
Wiley-Blackwell, 2011, pp. 622–34, doi:10.1111/j.1365-313X.2011.04621.x.
short: J. Gallego Bartolomé, M. Arana, F. Vandenbussche, P. Žádníková, E. Minguet,
V. Guardiola, D. Van Der Straeten, E. Benková, D. Alabadí, M. Blázquez, Plant
Journal 67 (2011) 622–634.
date_created: 2018-12-11T12:00:04Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2021-01-12T07:00:24Z
day: '01'
doi: 10.1111/j.1365-313X.2011.04621.x
extern: 1
intvolume: ' 67'
issue: '4'
month: '08'
page: 622 - 634
publication: Plant Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3891'
quality_controlled: 0
status: public
title: Hierarchy of hormone action controlling apical hook development in Arabidopsis
type: journal_article
volume: 67
year: '2011'
...
---
_id: '2897'
acknowledgement: TFs regulate gene expression by binding to specific sequences in
the promoter regions of their target genes. Promoters often contain multiple copies
of the same TF binding sites. How does this multiplicity evolve? One possibility
is that individuals with multiple, redundant binding sites have higher fitness.
However, nonadaptive processes are also likely to be important. Here, we develop
a mathematical model of the evolution of TF binding sites to help us disentangle
how different evolutionary mechanisms contribute to the evolution of binding site
redundancy and multiplicity. We show that recombination is expected to promote the
evolution of multiple binding sites. This prediction is corroborated by genome-wide
data from yeast. Another important factor in the evolution of multiplicity predicted
in our analysis is TF promiscuity, that is, the ability of a TF to bind to multiple
sequences. In addition, our analysis indicated that direct selection can have large
effects on the evolution of redundancy and multiplicity. Data from yeast identified
selection for changes in expression level as a candidate mechanism for the evolution
of multiple binding sites. We conclude that, although selection may play a major
role in the evolution of multiplicity in regulatory regions, nonadaptive forces
can also lead to high levels of multiplicity.
author:
- first_name: Tiago
full_name: Tiago Paixao
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Ricardo
full_name: Azevedo, Ricardo B
last_name: Azevedo
citation:
ama: Paixao T, Azevedo R. Redundancy and the Evolution of Cis Regulatory Element
Multiplicity. PLoS Computational Biology. 2011;6(7). doi:10.1371/journal.pcbi.1000848
apa: Paixao, T., & Azevedo, R. (2011). Redundancy and the Evolution of Cis Regulatory
Element Multiplicity. PLoS Computational Biology. Public Library of Science.
https://doi.org/10.1371/journal.pcbi.1000848
chicago: Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis
Regulatory Element Multiplicity.” PLoS Computational Biology. Public Library
of Science, 2011. https://doi.org/10.1371/journal.pcbi.1000848.
ieee: T. Paixao and R. Azevedo, “Redundancy and the Evolution of Cis Regulatory
Element Multiplicity,” PLoS Computational Biology, vol. 6, no. 7. Public
Library of Science, 2011.
ista: Paixao T, Azevedo R. 2011. Redundancy and the Evolution of Cis Regulatory
Element Multiplicity. PLoS Computational Biology. 6(7).
mla: Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis Regulatory
Element Multiplicity.” PLoS Computational Biology, vol. 6, no. 7, Public
Library of Science, 2011, doi:10.1371/journal.pcbi.1000848.
short: T. Paixao, R. Azevedo, PLoS Computational Biology 6 (2011).
date_created: 2018-12-11T12:00:13Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:33Z
day: '01'
doi: 10.1371/journal.pcbi.1000848
extern: 1
intvolume: ' 6'
issue: '7'
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '3861'
quality_controlled: 0
status: public
title: Redundancy and the Evolution of Cis Regulatory Element Multiplicity
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
volume: 6
year: '2011'
...
---
_id: '2898'
abstract:
- lang: eng
text: Sex allocation theory has been remarkably successful at explaining the prevalence
of even sex ratios in natural populations and at identifying specific conditions
that can result in biased sex ratios. Much of this theory focuses on parental
sex determination (SD) strategies. Here, we consider instead the evolutionary
causes and consequences of mixed offspring SD strategies, in which the genotype
of an individual determines not its sex, but the probability of developing one
of multiple sexes. We find that alleles specifying mixed offspring SD strategies
can generally outcompete alleles that specify pure strategies, but generate constraints
that may prevent a population from reaching an even sex ratio. We use our model
to analyze sex ratios in natural populations of Tetrahymena thermophila, a ciliate
with seven sexes determined by mixed SD alleles. We show that probabilistic SD
is sufficient to account for the occurrence of skewed sex ratios in natural populations
of T. thermophila, provided that their effective population sizes are small. Our
results highlight the importance of genetic drift in sex ratio evolution and suggest
that mixed offspring SD strategies should be more common than currently thought.
author:
- first_name: Tiago
full_name: Tiago Paixao
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Sujal
full_name: Phadke, Sujal S
last_name: Phadke
- first_name: Ricardo
full_name: Azevedo, Ricardo B
last_name: Azevedo
- first_name: Rebecca
full_name: Zufall, Rebecca A
last_name: Zufall
citation:
ama: Paixao T, Phadke S, Azevedo R, Zufall R. Sex ratio evolution under probabilistic
sex determination. Evolution; International Journal of Organic Evolution.
2011;65(7):2050-2060. doi:10.1111/j.1558-5646.2011.01266.x
apa: Paixao, T., Phadke, S., Azevedo, R., & Zufall, R. (2011). Sex ratio evolution
under probabilistic sex determination. Evolution; International Journal of
Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.2011.01266.x
chicago: Paixao, Tiago, Sujal Phadke, Ricardo Azevedo, and Rebecca Zufall. “Sex
Ratio Evolution under Probabilistic Sex Determination.” Evolution; International
Journal of Organic Evolution. Wiley-Blackwell, 2011. https://doi.org/10.1111/j.1558-5646.2011.01266.x.
ieee: T. Paixao, S. Phadke, R. Azevedo, and R. Zufall, “Sex ratio evolution under
probabilistic sex determination,” Evolution; International Journal of Organic
Evolution, vol. 65, no. 7. Wiley-Blackwell, pp. 2050–2060, 2011.
ista: Paixao T, Phadke S, Azevedo R, Zufall R. 2011. Sex ratio evolution under probabilistic
sex determination. Evolution; International Journal of Organic Evolution. 65(7),
2050–2060.
mla: Paixao, Tiago, et al. “Sex Ratio Evolution under Probabilistic Sex Determination.”
Evolution; International Journal of Organic Evolution, vol. 65, no. 7,
Wiley-Blackwell, 2011, pp. 2050–60, doi:10.1111/j.1558-5646.2011.01266.x.
short: T. Paixao, S. Phadke, R. Azevedo, R. Zufall, Evolution; International Journal
of Organic Evolution 65 (2011) 2050–2060.
date_created: 2018-12-11T12:00:13Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2021-01-12T07:00:33Z
day: '01'
doi: 10.1111/j.1558-5646.2011.01266.x
extern: 1
intvolume: ' 65'
issue: '7'
month: '03'
page: 2050 - 2060
publication: Evolution; International Journal of Organic Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3860'
quality_controlled: 0
status: public
title: Sex ratio evolution under probabilistic sex determination
type: journal_article
volume: 65
year: '2011'
...
---
_id: '2922'
author:
- first_name: Sara
full_name: Vicente, Sara
last_name: Vicente
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Vicente S, Kolmogorov V, Rother C. Graph-cut Based Image Segmentation with
Connectivity Priors. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields
for Vision and Image Processing. Massachusetts Institute of Technology Press;
2011.'
apa: Vicente, S., Kolmogorov, V., & Rother, C. (2011). Graph-cut Based Image
Segmentation with Connectivity Priors. In A. Blake, P. Kohli, & C. Rother
(Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts
Institute of Technology Press.
chicago: Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph-Cut Based
Image Segmentation with Connectivity Priors.” In Markov Random Fields for Vision
and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten
Rother. Massachusetts Institute of Technology Press, 2011.
ieee: S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation
with Connectivity Priors,” in Markov Random Fields for Vision and Image Processing,
A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology
Press, 2011.
ista: 'Vicente S, Kolmogorov V, Rother C. 2011.Graph-cut Based Image Segmentation
with Connectivity Priors. In: Markov Random Fields for Vision and Image Processing.
.'
mla: Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity
Priors.” Markov Random Fields for Vision and Image Processing, edited by
Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
short: S. Vicente, V. Kolmogorov, C. Rother, in:, A. Blake, P. Kohli, C. Rother
(Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute
of Technology Press, 2011.
date_created: 2018-12-11T12:00:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:43Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3815'
quality_controlled: 0
status: public
title: Graph-cut Based Image Segmentation with Connectivity Priors
type: book_chapter
year: '2011'
...
---
_id: '2923'
author:
- first_name: M Pawan
full_name: Kumar, M Pawan
last_name: Kumar
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Philip
full_name: Torr, Philip H
last_name: Torr
citation:
ama: 'Kumar MP, Kolmogorov V, Torr P. Analyzing Convex Relaxations for MAP Estimation.
In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image
Processing. Massachusetts Institute of Technology Press; 2011.'
apa: Kumar, M. P., Kolmogorov, V., & Torr, P. (2011). Analyzing Convex Relaxations
for MAP Estimation. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random
Fields for Vision and Image Processing. Massachusetts Institute of Technology
Press.
chicago: Kumar, M Pawan, Vladimir Kolmogorov, and Philip Torr. “Analyzing Convex
Relaxations for MAP Estimation.” In Markov Random Fields for Vision and Image
Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts
Institute of Technology Press, 2011.
ieee: M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for
MAP Estimation,” in Markov Random Fields for Vision and Image Processing,
A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology
Press, 2011.
ista: 'Kumar MP, Kolmogorov V, Torr P. 2011.Analyzing Convex Relaxations for MAP
Estimation. In: Markov Random Fields for Vision and Image Processing. .'
mla: Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.”
Markov Random Fields for Vision and Image Processing, edited by Andrew
Blake et al., Massachusetts Institute of Technology Press, 2011.
short: M.P. Kumar, V. Kolmogorov, P. Torr, in:, A. Blake, P. Kohli, C. Rother (Eds.),
Markov Random Fields for Vision and Image Processing, Massachusetts Institute
of Technology Press, 2011.
date_created: 2018-12-11T12:00:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:43Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3814'
quality_controlled: 0
status: public
title: Analyzing Convex Relaxations for MAP Estimation
type: book_chapter
year: '2011'
...
---
_id: '2924'
author:
- first_name: Antonio
full_name: Criminisi, Antonio
last_name: Criminisi
- first_name: Geoffrey
full_name: Cross, Geoffrey
last_name: Cross
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Criminisi A, Cross G, Blake A, Kolmogorov V. Bilayer Segmentation of Video.
In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image
Processing. Massachusetts Institute of Technology Press; 2011.'
apa: Criminisi, A., Cross, G., Blake, A., & Kolmogorov, V. (2011). Bilayer Segmentation
of Video. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields
for Vision and Image Processing. Massachusetts Institute of Technology Press.
chicago: Criminisi, Antonio, Geoffrey Cross, Andrew Blake, and Vladimir Kolmogorov.
“Bilayer Segmentation of Video.” In Markov Random Fields for Vision and Image
Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts
Institute of Technology Press, 2011.
ieee: A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation
of Video,” in Markov Random Fields for Vision and Image Processing, A.
Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press,
2011.
ista: 'Criminisi A, Cross G, Blake A, Kolmogorov V. 2011.Bilayer Segmentation of
Video. In: Markov Random Fields for Vision and Image Processing. .'
mla: Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” Markov Random
Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts
Institute of Technology Press, 2011.
short: A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, A. Blake, P. Kohli,
C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts
Institute of Technology Press, 2011.
date_created: 2018-12-11T12:00:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:43Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3813'
quality_controlled: 0
status: public
title: Bilayer Segmentation of Video
type: book_chapter
year: '2011'
...
---
_id: '2925'
author:
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
citation:
ama: 'Rother C, Kolmogorov V, Boykov Y, Blake A. Interactive Foreground Extraction
using graph cut. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields
for Vision and Image Processing. Massachusetts Institute of Technology Press;
2011.'
apa: Rother, C., Kolmogorov, V., Boykov, Y., & Blake, A. (2011). Interactive
Foreground Extraction using graph cut. In A. Blake, P. Kohli, & C. Rother
(Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts
Institute of Technology Press.
chicago: Rother, Carsten, Vladimir Kolmogorov, Yuri Boykov, and Andrew Blake. “Interactive
Foreground Extraction Using Graph Cut.” In Markov Random Fields for Vision
and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten
Rother. Massachusetts Institute of Technology Press, 2011.
ieee: C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground
Extraction using graph cut,” in Markov Random Fields for Vision and Image Processing,
A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology
Press, 2011.
ista: 'Rother C, Kolmogorov V, Boykov Y, Blake A. 2011.Interactive Foreground Extraction
using graph cut. In: Markov Random Fields for Vision and Image Processing. .'
mla: Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.”
Markov Random Fields for Vision and Image Processing, edited by Andrew
Blake et al., Massachusetts Institute of Technology Press, 2011.
short: C. Rother, V. Kolmogorov, Y. Boykov, A. Blake, in:, A. Blake, P. Kohli, C.
Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts
Institute of Technology Press, 2011.
date_created: 2018-12-11T12:00:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:44Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3812'
quality_controlled: 0
status: public
title: Interactive Foreground Extraction using graph cut
type: book_chapter
year: '2011'
...
---
_id: '2935'
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Boykov Y, Kolmogorov V. Basic graph cut algorithms. In: Blake A, Kohli P,
Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts
Institute of Technology Press; 2011:31-50.'
apa: Boykov, Y., & Kolmogorov, V. (2011). Basic graph cut algorithms. In A.
Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and
Image Processing (pp. 31–50). Massachusetts Institute of Technology Press.
chicago: Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” In
Markov Random Fields for Vision and Image Processing, edited by Andrew
Blake, Pushmeet Kohli, and Carsten Rother, 31–50. Massachusetts Institute of Technology
Press, 2011.
ieee: Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in Markov Random
Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother,
Eds. Massachusetts Institute of Technology Press, 2011, pp. 31–50.
ista: 'Boykov Y, Kolmogorov V. 2011.Basic graph cut algorithms. In: Markov Random
Fields for Vision and Image Processing. , 31–50.'
mla: Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” Markov
Random Fields for Vision and Image Processing, edited by Andrew Blake et al.,
Massachusetts Institute of Technology Press, 2011, pp. 31–50.
short: Y. Boykov, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov
Random Fields for Vision and Image Processing, Massachusetts Institute of Technology
Press, 2011, pp. 31–50.
date_created: 2018-12-11T12:00:26Z
date_published: 2011-07-22T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '22'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '07'
page: 31 - 50
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3801'
quality_controlled: 0
status: public
title: Basic graph cut algorithms
type: book_chapter
year: '2011'
...
---
_id: '2960'
abstract:
- lang: eng
text: Traditional statistical methods for the confidentiality protection for statistical
databases do not scale well to deal with GWAS (genome-wide association studies)
databases and external information on them. The more recent concept of differential
privacy, introduced by the cryptographic community, is an approach which provides
a rigorous definition of privacy with meaningful privacy guarantees in the presence
of arbitrary external information. Building on such notions, we propose new methods
to release aggregate GWAS data without compromising an individual's privacy. We
present methods for releasing differentially private minor allele frequencies,
chi-square statistics and p-values. We compare these approaches on simulated data
and on a GWAS study of canine hair length involving 685 dogs. We also propose
a privacy-preserving method for finding genome-wide associations based on a differentially
private approach to penalized logistic regression.
author:
- first_name: Stephen
full_name: Fienberg, Stephen E
last_name: Fienberg
- first_name: Aleksandra
full_name: Slavkovic, Aleksandra
last_name: Slavkovic
- first_name: Caroline
full_name: Caroline Uhler
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: 'Fienberg S, Slavkovic A, Uhler C. Privacy Preserving GWAS Data Sharing. In:
IEEE; 2011. doi:10.1109/ICDMW.2011.140'
apa: Fienberg, S., Slavkovic, A., & Uhler, C. (2011). Privacy Preserving GWAS
Data Sharing. Presented at the Proceedings of the 11th IEEE International Conference
on Data Mining, IEEE. https://doi.org/10.1109/ICDMW.2011.140
chicago: Fienberg, Stephen, Aleksandra Slavkovic, and Caroline Uhler. “Privacy Preserving
GWAS Data Sharing.” IEEE, 2011. https://doi.org/10.1109/ICDMW.2011.140.
ieee: S. Fienberg, A. Slavkovic, and C. Uhler, “Privacy Preserving GWAS Data Sharing,”
presented at the Proceedings of the 11th IEEE International Conference on Data
Mining, 2011.
ista: Fienberg S, Slavkovic A, Uhler C. 2011. Privacy Preserving GWAS Data Sharing.
Proceedings of the 11th IEEE International Conference on Data Mining.
mla: Fienberg, Stephen, et al. Privacy Preserving GWAS Data Sharing. IEEE,
2011, doi:10.1109/ICDMW.2011.140.
short: S. Fienberg, A. Slavkovic, C. Uhler, in:, IEEE, 2011.
conference:
name: Proceedings of the 11th IEEE International Conference on Data Mining
date_created: 2018-12-11T12:00:34Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:40:05Z
day: '01'
doi: 10.1109/ICDMW.2011.140
extern: 1
month: '01'
publication_status: published
publisher: IEEE
publist_id: '3766'
quality_controlled: 0
status: public
title: Privacy Preserving GWAS Data Sharing
type: conference
year: '2011'
...
---
_id: '2961'
abstract:
- lang: eng
text: |-
Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specic phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To
perform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).
acknowledgement: Anna-Sapfo Malaspinas is supported by a Janggen-Poehn Fellowship.
Caroline Uhler is supported by an International Fulbright Science and Technology
Fellowship.
author:
- first_name: Anna
full_name: 'Malaspinas, Anna-Sapfo '
last_name: Malaspinas
- first_name: Caroline
full_name: Caroline Uhler
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Malaspinas A, Uhler C. Detecting epistasis via Markov bases. Journal of
Algebraic Statistics. 2011;2(1):36-53. doi:http://dx.doi.org/10.18409/jas.v2i1.27
apa: Malaspinas, A., & Uhler, C. (2011). Detecting epistasis via Markov bases.
Journal of Algebraic Statistics. Public Knowledge Project. http://dx.doi.org/10.18409/jas.v2i1.27
chicago: Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.”
Journal of Algebraic Statistics. Public Knowledge Project, 2011. http://dx.doi.org/10.18409/jas.v2i1.27.
ieee: A. Malaspinas and C. Uhler, “Detecting epistasis via Markov bases,” Journal
of Algebraic Statistics, vol. 2, no. 1. Public Knowledge Project, pp. 36–53,
2011.
ista: Malaspinas A, Uhler C. 2011. Detecting epistasis via Markov bases. Journal
of Algebraic Statistics. 2(1), 36–53.
mla: Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.”
Journal of Algebraic Statistics, vol. 2, no. 1, Public Knowledge Project,
2011, pp. 36–53, doi:http://dx.doi.org/10.18409/jas.v2i1.27.
short: A. Malaspinas, C. Uhler, Journal of Algebraic Statistics 2 (2011) 36–53.
date_created: 2018-12-11T12:00:34Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:40:05Z
day: '01'
doi: http://dx.doi.org/10.18409/jas.v2i1.27
extern: 1
intvolume: ' 2'
issue: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1006.4929
month: '01'
oa: 1
page: 36 - 53
publication: Journal of Algebraic Statistics
publication_status: published
publisher: Public Knowledge Project
publist_id: '3764'
quality_controlled: 0
status: public
title: Detecting epistasis via Markov bases
type: journal_article
volume: 2
year: '2011'
...
---
_id: '2975'
abstract:
- lang: eng
text: "Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related
problems are indispensable for practical cryptographic protocols. Recently, Camenisch,
Kiayias, and Yung provided a specification language (the CKY-language) for such
protocols which allows for a modular design and protocol analysis: for every zero-knowledge
proof specified in this language, protocol designers are ensured that there exists
an efficient protocol which indeed proves the specified statement.\n\nHowever,
the protocols resulting from their compilation techniques only satisfy the classical
notion of ZK-PoK, which is not retained are when they used as building blocks
for higher-level applications or composed with other protocols.\nThis problem
can be tackled by moving to the Universal Composability (UC) framework, which
guarantees retention of security when composing protocols in arbitrary ways. \nWhile
there exist generic transformations from $\\Sigma$-protocols to UC-secure protocols,
these transformation are often too inefficient for practice.\n \nIn this paper
we introduce a specification language akin to the CKY-language and a compiler
such that the resulting protocols are UC-secure and efficient. \nTo this end,
we propose an extension of the UC-framework addressing the \nissue that UC-secure
zero-knowledge proofs are by definition proofs of knowledge, and state a special
composition theorem which allows one to use the weaker -- but more efficient and
often sufficient -- notion of proofs of membership in the UC-framework. \nWe
believe that our contributions enable the design of practically efficient protocols
that are UC-secure and thus themselves can be used as building blocks."
acknowledgement: This work was in part funded by the Swiss Hasler Foundation, and
the EU FP7 grants 216483 and 216499, as well as by the NSF grant CNS-0716690.
alternative_title:
- LNCS
author:
- first_name: Jan
full_name: Camenisch, Jan
last_name: Camenisch
- first_name: Stephan
full_name: Stephan Krenn
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Victor
full_name: Shoup, Victor
last_name: Shoup
citation:
ama: 'Camenisch J, Krenn S, Shoup V. A Framework for Practical Universally Composable
Zero-Knowledge Protocols. In: Lee D, Wang X, eds. Vol 7073. Springer; 2011:449-467.
doi:10.1007/978-3-642-25385-0'
apa: 'Camenisch, J., Krenn, S., & Shoup, V. (2011). A Framework for Practical
Universally Composable Zero-Knowledge Protocols. In D. Lee & X. Wang (Eds.)
(Vol. 7073, pp. 449–467). Presented at the ASIACRYPT: Theory and Application of
Cryptology and Information Security, Springer. https://doi.org/10.1007/978-3-642-25385-0'
chicago: Camenisch, Jan, Stephan Krenn, and Victor Shoup. “A Framework for Practical
Universally Composable Zero-Knowledge Protocols.” edited by Dong Lee and Xiaoyun
Wang, 7073:449–67. Springer, 2011. https://doi.org/10.1007/978-3-642-25385-0.
ieee: 'J. Camenisch, S. Krenn, and V. Shoup, “A Framework for Practical Universally
Composable Zero-Knowledge Protocols,” presented at the ASIACRYPT: Theory and Application
of Cryptology and Information Security, 2011, vol. 7073, pp. 449–467.'
ista: 'Camenisch J, Krenn S, Shoup V. 2011. A Framework for Practical Universally
Composable Zero-Knowledge Protocols. ASIACRYPT: Theory and Application of Cryptology
and Information Security, LNCS, vol. 7073, 449–467.'
mla: Camenisch, Jan, et al. A Framework for Practical Universally Composable
Zero-Knowledge Protocols. Edited by Dong Lee and Xiaoyun Wang, vol. 7073,
Springer, 2011, pp. 449–67, doi:10.1007/978-3-642-25385-0.
short: J. Camenisch, S. Krenn, V. Shoup, in:, D. Lee, X. Wang (Eds.), Springer,
2011, pp. 449–467.
conference:
name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
date_created: 2018-12-11T12:00:39Z
date_published: 2011-11-21T00:00:00Z
date_updated: 2021-01-12T07:40:11Z
day: '21'
doi: 10.1007/978-3-642-25385-0
editor:
- first_name: Dong
full_name: Lee, Dong Hoon
last_name: Lee
- first_name: Xiaoyun
full_name: Wang, Xiaoyun
last_name: Wang
extern: 1
intvolume: ' 7073'
main_file_link:
- open_access: '0'
url: http://eprint.iacr.org/2011/228.pdf
month: '11'
page: 449 - 467
publication_status: published
publisher: Springer
publist_id: '3728'
quality_controlled: 0
status: public
title: A Framework for Practical Universally Composable Zero-Knowledge Protocols
type: conference
volume: 7073
year: '2011'
...
---
_id: '2976'
abstract:
- lang: eng
text: |-
Side channel attacks on cryptographic systems exploit information
gained from physical implementations rather than theoretical
weaknesses of a scheme. In recent years, major achievements were made
for the class of so called access-driven cache attacks. Such attacks
exploit the leakage of the memory locations accessed by a victim
process.
In this paper we consider the AES block cipher and present an attack
which is capable of recovering the full secret key in almost realtime
for AES-128, requiring only a very limited number of observed
encryptions. Unlike previous attacks, we do not require any
information about the plaintext (such as its distribution, etc.).
Moreover, for the first time, we also show how the plaintext can be
recovered without having access to the ciphertext at all. It is the
first working attack on AES implementations using compressed
tables. There, no efficient techniques to identify the beginning
of AES rounds is known, which is the fundamental assumption underlying previous
attacks.
We have a fully working implementation of our attack which is able to
recover AES keys after observing as little as 100 encryptions. It
works against the OpenSSL 0.9.8n implementation of AES on Linux
systems. Our spy process does not require any special privileges
beyond those of a standard Linux user. A contribution of probably
independent interest is a denial of service attack on the task scheduler of
current Linux systems (CFS), which allows one to observe (on average)
every single memory access of a victim process.
acknowledgement: |-
This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation.
An extended abstract was also accepted for COSADE 2011.
author:
- first_name: David
full_name: Gullasch, David
last_name: Gullasch
- first_name: Endre
full_name: Bangerter, Endre
last_name: Bangerter
- first_name: Stephan
full_name: Stephan Krenn
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
citation:
ama: 'Gullasch D, Bangerter E, Krenn S. Cache Games - Bringing Access-Based Cache
Attacks on AES to Practice. In: IEEE; 2011:490-505. doi:10.1109/SP.2011.22'
apa: 'Gullasch, D., Bangerter, E., & Krenn, S. (2011). Cache Games - Bringing
Access-Based Cache Attacks on AES to Practice (pp. 490–505). Presented at the
S&P: IEEE Symposium on Security and Privacy, IEEE. https://doi.org/10.1109/SP.2011.22'
chicago: Gullasch, David, Endre Bangerter, and Stephan Krenn. “Cache Games - Bringing
Access-Based Cache Attacks on AES to Practice,” 490–505. IEEE, 2011. https://doi.org/10.1109/SP.2011.22.
ieee: 'D. Gullasch, E. Bangerter, and S. Krenn, “Cache Games - Bringing Access-Based
Cache Attacks on AES to Practice,” presented at the S&P: IEEE Symposium on
Security and Privacy, 2011, pp. 490–505.'
ista: 'Gullasch D, Bangerter E, Krenn S. 2011. Cache Games - Bringing Access-Based
Cache Attacks on AES to Practice. S&P: IEEE Symposium on Security and Privacy,
490–505.'
mla: Gullasch, David, et al. Cache Games - Bringing Access-Based Cache Attacks
on AES to Practice. IEEE, 2011, pp. 490–505, doi:10.1109/SP.2011.22.
short: D. Gullasch, E. Bangerter, S. Krenn, in:, IEEE, 2011, pp. 490–505.
conference:
name: 'S&P: IEEE Symposium on Security and Privacy'
date_created: 2018-12-11T12:00:39Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:40:11Z
day: '01'
doi: 10.1109/SP.2011.22
extern: 1
main_file_link:
- open_access: '0'
url: http://eprint.iacr.org/2010/594.pdf
month: '01'
page: 490 - 505
publication_status: published
publisher: IEEE
publist_id: '3727'
quality_controlled: 0
status: public
title: Cache Games - Bringing Access-Based Cache Attacks on AES to Practice
type: conference
year: '2011'
...
---
_id: '2977'
abstract:
- lang: eng
text: "Cryptographic two-party protocols are used ubiquitously in\n everyday
life. While some of these protocols are easy to\n understand and implement
(e.g., key exchange or transmission of\n encrypted data), many of them are
much more complex (e.g.,\n e-banking and e-voting applications, or anonymous
authentication\n and credential systems).\n\n For a software engineer without
appropriate cryptographic skills\n the implementation of such protocols is
often difficult, time\n consuming and error-prone. For this reason, a number
of compilers\n supporting programmers have been published in recent\n years.
However, they are either designed for very specific\n cryptographic primitives
(e.g., zero-knowledge proofs of\n knowledge), or they only offer a very low
level of abstraction and\n thus again demand substantial mathematical and cryptographic\n
\ skills from the programmer. Finally, some of the existing\n compilers do
not produce executable code, but only metacode which\n has to be instantiated
with mathematical libraries, encryption\n routines, etc. before it can actually
be used.\n \n In this paper we present a cryptographically aware compiler
which\n is equally useful to cryptographers who want to benchmark\n protocols
designed on paper, and to programmers who want to\n implement complex security
sensitive protocols without having to\n understand all subtleties. Our tool
offers a high level of\n abstraction and outputs well-structured and documented
Java\n code. We believe that our compiler can contribute to shortening\n the
development cycles of cryptographic applications and to\n reducing their error-proneness."
acknowledgement: This work was in part funded by the European Community’s Seventh
Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler
Foundation under projects no. 09037 and 10069.
author:
- first_name: Endre
full_name: Bangerter, Endre
last_name: Bangerter
- first_name: Stephan
full_name: Stephan Krenn
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Martial
full_name: Seifriz, Martial
last_name: Seifriz
- first_name: Ulrich
full_name: Ultes-Nitsche, Ulrich
last_name: Ultes Nitsche
citation:
ama: 'Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. cPLC - A Cryptographic Programming
Language and Compiler. In: Venter H, Coetzee M, Loock M, eds. IEEE; 2011. doi:10.1109/ISSA.2011.6027533'
apa: 'Bangerter, E., Krenn, S., Seifriz, M., & Ultes Nitsche, U. (2011). cPLC
- A Cryptographic Programming Language and Compiler. In H. Venter, M. Coetzee,
& M. Loock (Eds.). Presented at the ISSA: Information Security South Africa,
IEEE. https://doi.org/10.1109/ISSA.2011.6027533'
chicago: Bangerter, Endre, Stephan Krenn, Martial Seifriz, and Ulrich Ultes Nitsche.
“CPLC - A Cryptographic Programming Language and Compiler.” edited by Hein Venter,
Marijke Coetzee, and Marianne Loock. IEEE, 2011. https://doi.org/10.1109/ISSA.2011.6027533.
ieee: 'E. Bangerter, S. Krenn, M. Seifriz, and U. Ultes Nitsche, “cPLC - A Cryptographic
Programming Language and Compiler,” presented at the ISSA: Information Security
South Africa, 2011.'
ista: 'Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. 2011. cPLC - A Cryptographic
Programming Language and Compiler. ISSA: Information Security South Africa.'
mla: Bangerter, Endre, et al. CPLC - A Cryptographic Programming Language and
Compiler. Edited by Hein Venter et al., IEEE, 2011, doi:10.1109/ISSA.2011.6027533.
short: E. Bangerter, S. Krenn, M. Seifriz, U. Ultes Nitsche, in:, H. Venter, M.
Coetzee, M. Loock (Eds.), IEEE, 2011.
conference:
name: 'ISSA: Information Security South Africa'
date_created: 2018-12-11T12:00:39Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2021-01-12T07:40:12Z
day: '01'
doi: 10.1109/ISSA.2011.6027533
editor:
- first_name: Hein
full_name: Venter, Hein S.
last_name: Venter
- first_name: Marijke
full_name: Coetzee, Marijke
last_name: Coetzee
- first_name: Marianne
full_name: Loock, Marianne
last_name: Loock
extern: 1
month: '08'
publication_status: published
publisher: IEEE
publist_id: '3726'
quality_controlled: 0
status: public
title: cPLC - A Cryptographic Programming Language and Compiler
type: conference
year: '2011'
...
---
_id: '3082'
abstract:
- lang: eng
text: Shoot branching is one of the major determinants of plant architecture. Polar
auxin transport in stems is necessary for the control of bud outgrowth by a dominant
apex. Here, we show that following decapitation in pea (Pisum sativum L.), the
axillary buds establish directional auxin export by subcellular polarization of
PIN auxin transporters. Apical auxin application on the decapitated stem prevents
this PIN polarization and canalization of laterally applied auxin. These results
support a model in which the apical and lateral auxin sources compete for primary
channels of auxin transport in the stem to control the outgrowth of axillary buds.
author:
- first_name: Jozef
full_name: Balla, Jozef
last_name: Balla
- first_name: Petr
full_name: Kalousek, Petr
last_name: Kalousek
- first_name: Vilém
full_name: Reinöhl, Vilém
last_name: Reinöhl
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Stanislav
full_name: Procházka, Stanislav
last_name: Procházka
citation:
ama: Balla J, Kalousek P, Reinöhl V, Friml J, Procházka S. Competitive canalization
of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. Plant
Journal. 2011;65(4):571-577. doi:10.1111/j.1365-313X.2010.04443.x
apa: Balla, J., Kalousek, P., Reinöhl, V., Friml, J., & Procházka, S. (2011).
Competitive canalization of PIN dependent auxin flow from axillary buds controls
pea bud outgrowth. Plant Journal. Wiley-Blackwell. https://doi.org/10.1111/j.1365-313X.2010.04443.x
chicago: Balla, Jozef, Petr Kalousek, Vilém Reinöhl, Jiří Friml, and Stanislav Procházka.
“Competitive Canalization of PIN Dependent Auxin Flow from Axillary Buds Controls
Pea Bud Outgrowth.” Plant Journal. Wiley-Blackwell, 2011. https://doi.org/10.1111/j.1365-313X.2010.04443.x.
ieee: J. Balla, P. Kalousek, V. Reinöhl, J. Friml, and S. Procházka, “Competitive
canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth,”
Plant Journal, vol. 65, no. 4. Wiley-Blackwell, pp. 571–577, 2011.
ista: Balla J, Kalousek P, Reinöhl V, Friml J, Procházka S. 2011. Competitive canalization
of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. Plant
Journal. 65(4), 571–577.
mla: Balla, Jozef, et al. “Competitive Canalization of PIN Dependent Auxin Flow
from Axillary Buds Controls Pea Bud Outgrowth.” Plant Journal, vol. 65,
no. 4, Wiley-Blackwell, 2011, pp. 571–77, doi:10.1111/j.1365-313X.2010.04443.x.
short: J. Balla, P. Kalousek, V. Reinöhl, J. Friml, S. Procházka, Plant Journal
65 (2011) 571–577.
date_created: 2018-12-11T12:01:16Z
date_published: 2011-02-01T00:00:00Z
date_updated: 2021-01-12T07:40:56Z
day: '01'
doi: 10.1111/j.1365-313X.2010.04443.x
extern: 1
intvolume: ' 65'
issue: '4'
month: '02'
page: 571 - 577
publication: Plant Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3619'
quality_controlled: 0
status: public
title: Competitive canalization of PIN dependent auxin flow from axillary buds controls
pea bud outgrowth
type: journal_article
volume: 65
year: '2011'
...
---
_id: '3083'
author:
- first_name: David
full_name: Robinson, David G
last_name: Robinson
- first_name: David
full_name: Scheuring, David
last_name: Scheuring
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Robinson D, Scheuring D, Naramoto S, Friml J. ARF1 localizes to the golgi and
the trans Golgi network. Plant Cell. 2011;23(3):846-849. doi:10.1105/tpc.110.082099
apa: Robinson, D., Scheuring, D., Naramoto, S., & Friml, J. (2011). ARF1 localizes
to the golgi and the trans Golgi network. Plant Cell. American Society
of Plant Biologists. https://doi.org/10.1105/tpc.110.082099
chicago: Robinson, David, David Scheuring, Satoshi Naramoto, and Jiří Friml. “ARF1
Localizes to the Golgi and the Trans Golgi Network.” Plant Cell. American
Society of Plant Biologists, 2011. https://doi.org/10.1105/tpc.110.082099.
ieee: D. Robinson, D. Scheuring, S. Naramoto, and J. Friml, “ARF1 localizes to the
golgi and the trans Golgi network,” Plant Cell, vol. 23, no. 3. American
Society of Plant Biologists, pp. 846–849, 2011.
ista: Robinson D, Scheuring D, Naramoto S, Friml J. 2011. ARF1 localizes to the
golgi and the trans Golgi network. Plant Cell. 23(3), 846–849.
mla: Robinson, David, et al. “ARF1 Localizes to the Golgi and the Trans Golgi Network.”
Plant Cell, vol. 23, no. 3, American Society of Plant Biologists, 2011,
pp. 846–49, doi:10.1105/tpc.110.082099.
short: D. Robinson, D. Scheuring, S. Naramoto, J. Friml, Plant Cell 23 (2011) 846–849.
date_created: 2018-12-11T12:01:16Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2021-01-12T07:40:56Z
day: '01'
doi: 10.1105/tpc.110.082099
extern: 1
intvolume: ' 23'
issue: '3'
month: '03'
page: 846 - 849
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3617'
quality_controlled: 0
status: public
title: ARF1 localizes to the golgi and the trans Golgi network
type: journal_article
volume: 23
year: '2011'
...
---
_id: '3084'
abstract:
- lang: eng
text: |2-
A central question in developmental biology concerns the mechanism of generation and maintenance of cell polarity, because these processes are essential for many cellular functions and multicellular development [1]. In plants, cell polarity has an additional role in mediating directional transport of the plant hormone auxin that is crucial for multiple developmental processes [2-4]. In addition, plant cells have a complex extracellular matrix, the cell wall [5, 6], whose role in regulating cellular processes, including cell polarity, is unexplored. We have found that polar distribution of PIN auxin transporters [7] in plant cells is maintained by connections between polar domains at the plasma membrane and the cell wall. Genetic and pharmacological interference with cellulose, the major component of the cell wall, or mechanical interference with the cell wall disrupts these connections and leads to increased lateral diffusion and loss of polar distribution of PIN transporters for the phytohormone auxin. Our results reveal a plant-specific mechanism for cell polarity maintenance and provide a conceptual framework for modulating cell polarity and plant development via endogenous and environmental manipulations of the cellulose-based extracellular matrix.
author:
- first_name: Elena
full_name: Feraru, Elena
last_name: Feraru
- first_name: Mugurel
full_name: Feraru, Mugurel I
last_name: Feraru
- first_name: Jürgen
full_name: Kleine-Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Alexandre
full_name: Martinière, Alexandre
last_name: Martinière
- first_name: Grégory
full_name: Mouille, Grégory
last_name: Mouille
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Samantha
full_name: Vernhettes, Samantha
last_name: Vernhettes
- first_name: John
full_name: Runions, John
last_name: Runions
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Feraru E, Feraru M, Kleine Vehn J, et al. PIN polarity maintenance by the cell
wall in Arabidopsis. Current Biology. 2011;21(4):338-343. doi:10.1016/j.cub.2011.01.036
apa: Feraru, E., Feraru, M., Kleine Vehn, J., Martinière, A., Mouille, G., Vanneste,
S., … Friml, J. (2011). PIN polarity maintenance by the cell wall in Arabidopsis.
Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2011.01.036
chicago: Feraru, Elena, Mugurel Feraru, Jürgen Kleine Vehn, Alexandre Martinière,
Grégory Mouille, Steffen Vanneste, Samantha Vernhettes, John Runions, and Jiří
Friml. “PIN Polarity Maintenance by the Cell Wall in Arabidopsis.” Current
Biology. Cell Press, 2011. https://doi.org/10.1016/j.cub.2011.01.036.
ieee: E. Feraru et al., “PIN polarity maintenance by the cell wall in Arabidopsis,”
Current Biology, vol. 21, no. 4. Cell Press, pp. 338–343, 2011.
ista: Feraru E, Feraru M, Kleine Vehn J, Martinière A, Mouille G, Vanneste S, Vernhettes
S, Runions J, Friml J. 2011. PIN polarity maintenance by the cell wall in Arabidopsis.
Current Biology. 21(4), 338–343.
mla: Feraru, Elena, et al. “PIN Polarity Maintenance by the Cell Wall in Arabidopsis.”
Current Biology, vol. 21, no. 4, Cell Press, 2011, pp. 338–43, doi:10.1016/j.cub.2011.01.036.
short: E. Feraru, M. Feraru, J. Kleine Vehn, A. Martinière, G. Mouille, S. Vanneste,
S. Vernhettes, J. Runions, J. Friml, Current Biology 21 (2011) 338–343.
date_created: 2018-12-11T12:01:17Z
date_published: 2011-02-22T00:00:00Z
date_updated: 2021-01-12T07:40:56Z
day: '22'
doi: 10.1016/j.cub.2011.01.036
extern: 1
intvolume: ' 21'
issue: '4'
month: '02'
page: 338 - 343
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '3618'
quality_controlled: 0
status: public
title: PIN polarity maintenance by the cell wall in Arabidopsis
type: journal_article
volume: 21
year: '2011'
...
---
_id: '3085'
abstract:
- lang: eng
text: Phototropism is an adaptation response, through which plants grow towards
the light. It involves light perception and asymmetric distribution of the plant
hormone auxin. Here we identify a crucial part of the mechanism for phototropism,
revealing how light perception initiates auxin redistribution that leads to directional
growth. We show that light polarizes the cellular localization of the auxin efflux
carrier PIN3 in hypocotyl endodermis cells, resulting in changes in auxin distribution
and differential growth. In the dark, high expression and activity of the PINOID
(PID) kinase correlates with apolar targeting of PIN3 to all cell sides. Following
illumination, light represses PINOID transcription and PIN3 is polarized specifically
to the inner cell sides by GNOM ARF GTPase GEF (guanine nucleotide exchange factor)-dependent
trafficking. Thus, differential trafficking at the shaded and illuminated hypocotyl
side aligns PIN3 polarity with the light direction, and presumably redirects auxin
flow towards the shaded side, where auxin promotes growth, causing hypocotyls
to bend towards the light. Our results imply that PID phosphorylation-dependent
recruitment of PIN proteins into distinct trafficking pathways is a mechanism
to polarize auxin fluxes in response to different environmental and endogenous
cues.
author:
- first_name: Zhaojun
full_name: Ding, Zhaojun
last_name: Ding
- first_name: Carlos
full_name: Galván-Ampudia, Carlos S
last_name: Galván Ampudia
- first_name: Emilie
full_name: Demarsy, Emilie
last_name: Demarsy
- first_name: Łukasz
full_name: Łangowski, Łukasz
last_name: Łangowski
- first_name: Jürgen
full_name: Kleine-Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Yuanwei
full_name: Fan, Yuanwei
last_name: Fan
- first_name: Miyo
full_name: Morita, Miyo T
last_name: Morita
- first_name: Masao
full_name: Tasaka, Masao
last_name: Tasaka
- first_name: Christian
full_name: Fankhauser, Christian
last_name: Fankhauser
- first_name: Remko
full_name: Offringa, Remko
last_name: Offringa
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Ding Z, Galván Ampudia C, Demarsy E, et al. Light-mediated polarization of
the PIN3 auxin transporter for the phototropic response in Arabidopsis. Nature
Cell Biology. 2011;13(4):447-453. doi:10.1038/ncb2208
apa: Ding, Z., Galván Ampudia, C., Demarsy, E., Łangowski, Ł., Kleine Vehn, J.,
Fan, Y., … Friml, J. (2011). Light-mediated polarization of the PIN3 auxin transporter
for the phototropic response in Arabidopsis. Nature Cell Biology. Nature
Publishing Group. https://doi.org/10.1038/ncb2208
chicago: Ding, Zhaojun, Carlos Galván Ampudia, Emilie Demarsy, Łukasz Łangowski,
Jürgen Kleine Vehn, Yuanwei Fan, Miyo Morita, et al. “Light-Mediated Polarization
of the PIN3 Auxin Transporter for the Phototropic Response in Arabidopsis.” Nature
Cell Biology. Nature Publishing Group, 2011. https://doi.org/10.1038/ncb2208.
ieee: Z. Ding et al., “Light-mediated polarization of the PIN3 auxin transporter
for the phototropic response in Arabidopsis,” Nature Cell Biology, vol.
13, no. 4. Nature Publishing Group, pp. 447–453, 2011.
ista: Ding Z, Galván Ampudia C, Demarsy E, Łangowski Ł, Kleine Vehn J, Fan Y, Morita
M, Tasaka M, Fankhauser C, Offringa R, Friml J. 2011. Light-mediated polarization
of the PIN3 auxin transporter for the phototropic response in Arabidopsis. Nature
Cell Biology. 13(4), 447–453.
mla: Ding, Zhaojun, et al. “Light-Mediated Polarization of the PIN3 Auxin Transporter
for the Phototropic Response in Arabidopsis.” Nature Cell Biology, vol.
13, no. 4, Nature Publishing Group, 2011, pp. 447–53, doi:10.1038/ncb2208.
short: Z. Ding, C. Galván Ampudia, E. Demarsy, Ł. Łangowski, J. Kleine Vehn, Y.
Fan, M. Morita, M. Tasaka, C. Fankhauser, R. Offringa, J. Friml, Nature Cell Biology
13 (2011) 447–453.
date_created: 2018-12-11T12:01:17Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2021-01-12T07:40:57Z
day: '01'
doi: 10.1038/ncb2208
extern: 1
intvolume: ' 13'
issue: '4'
month: '04'
page: 447 - 453
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '3616'
quality_controlled: 0
status: public
title: Light-mediated polarization of the PIN3 auxin transporter for the phototropic
response in Arabidopsis
type: journal_article
volume: 13
year: '2011'
...