---
_id: '1727'
abstract:
- lang: eng
text: 'Cells at different positions in a developing tissue receive different concentrations
of signaling molecules, called morphogens, and this influences their cell fate.
Morphogen concentration gradients have been proposed to control patterning as
well as growth in many developing tissues. Some outstanding questions about tissue
patterning by morphogen gradients are the following: What are the mechanisms that
regulate gradient formation and shape? Is the positional information encoded in
the gradient sufficiently precise to determine the positions of target gene domain
boundaries? What are the temporal dynamics of gradients and how do they relate
to patterning and growth? These questions are inherently quantitative in nature
and addressing them requires measuring morphogen concentrations in cells, levels
of downstream signaling activity, and kinetics of morphogen transport. Here we
first present methods for quantifying morphogen gradient shape in which the measurements
can be calibrated to reflect actual morphogen concentrations. We then discuss
using fluorescence recovery after photobleaching to study the kinetics of morphogen
transport at the tissue level. Finally, we present particle tracking as a method
to study morphogen intracellular trafficking.'
author:
- first_name: Anna
full_name: Anna Kicheva
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: Laurent
full_name: Holtzer, Laurent
last_name: Holtzer
- first_name: Ortrud
full_name: Wartlick, Ortrud
last_name: Wartlick
- first_name: Thomas
full_name: Schmidt, Thomas S
last_name: Schmidt
- first_name: Marcos
full_name: González-Gaitán, Marcos A
last_name: González Gaitán
citation:
ama: Kicheva A, Holtzer L, Wartlick O, Schmidt T, González Gaitán M. Quantitative
imaging of morphogen gradients in drosophila imaginal discs. Cold Spring Harbor
Protocols. 2013;8(5):387-403. doi:10.1101/pdb.top074237
apa: Kicheva, A., Holtzer, L., Wartlick, O., Schmidt, T., & González Gaitán,
M. (2013). Quantitative imaging of morphogen gradients in drosophila imaginal
discs. Cold Spring Harbor Protocols. Cold Spring Harbor Laboratory Press.
https://doi.org/10.1101/pdb.top074237
chicago: Kicheva, Anna, Laurent Holtzer, Ortrud Wartlick, Thomas Schmidt, and Marcos
González Gaitán. “Quantitative Imaging of Morphogen Gradients in Drosophila Imaginal
Discs.” Cold Spring Harbor Protocols. Cold Spring Harbor Laboratory Press,
2013. https://doi.org/10.1101/pdb.top074237.
ieee: A. Kicheva, L. Holtzer, O. Wartlick, T. Schmidt, and M. González Gaitán, “Quantitative
imaging of morphogen gradients in drosophila imaginal discs,” Cold Spring Harbor
Protocols, vol. 8, no. 5. Cold Spring Harbor Laboratory Press, pp. 387–403,
2013.
ista: Kicheva A, Holtzer L, Wartlick O, Schmidt T, González Gaitán M. 2013. Quantitative
imaging of morphogen gradients in drosophila imaginal discs. Cold Spring Harbor
Protocols. 8(5), 387–403.
mla: Kicheva, Anna, et al. “Quantitative Imaging of Morphogen Gradients in Drosophila
Imaginal Discs.” Cold Spring Harbor Protocols, vol. 8, no. 5, Cold Spring
Harbor Laboratory Press, 2013, pp. 387–403, doi:10.1101/pdb.top074237.
short: A. Kicheva, L. Holtzer, O. Wartlick, T. Schmidt, M. González Gaitán, Cold
Spring Harbor Protocols 8 (2013) 387–403.
date_created: 2018-12-11T11:53:41Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2021-01-12T06:52:47Z
day: '01'
doi: 10.1101/pdb.top074237
extern: 1
intvolume: ' 8'
issue: '5'
month: '05'
page: 387 - 403
publication: Cold Spring Harbor Protocols
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
publist_id: '5401'
quality_controlled: 0
status: public
title: Quantitative imaging of morphogen gradients in drosophila imaginal discs
type: journal_article
volume: 8
year: '2013'
...
---
_id: '1759'
abstract:
- lang: eng
text: We report an electric-field-induced giant modulation of the hole g factor
in SiGe nanocrystals. The observed effect is ascribed to a so-far overlooked contribution
to the g factor that stems from the mixing between heavy- and light-hole wave
functions. We show that the relative displacement between the confined heavy-
and light-hole states, occurring upon application of the electric field, alters
their mixing strength leading to a strong nonmonotonic modulation of the g factor.
acknowledgement: We acknowledge financial support from the Nanosciences Foundation
(Grenoble, France), DOE under Contract No. DEFG02-08ER46482 (Yale), the Agence Nationale
de la Recherche, and the European Starting Grant. G. K. acknowledges support from
the European Commission via a Marie Curie Carrer Integration Grant and the FWF for
a Lise-Meitner Fellowship
author:
- first_name: Natalia
full_name: Ares, Natalia
last_name: Ares
- first_name: Vitaly
full_name: Golovach, Vitaly N
last_name: Golovach
- first_name: Georgios
full_name: Georgios Katsaros
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
- first_name: Mathieu
full_name: Stoffel, Mathieu
last_name: Stoffel
- first_name: Frank
full_name: Fournel, Frank
last_name: Fournel
- first_name: Leonid
full_name: Glazman, Leonid I
last_name: Glazman
- first_name: Oliver
full_name: Schmidt, Oliver G
last_name: Schmidt
- first_name: Silvano
full_name: De Franceschi, Silvano
last_name: De Franceschi
citation:
ama: Ares N, Golovach V, Katsaros G, et al. Nature of tunable hole g factors in
quantum dots. Physical Review Letters. 2013;110(4). doi:10.1103/PhysRevLett.110.046602
apa: Ares, N., Golovach, V., Katsaros, G., Stoffel, M., Fournel, F., Glazman, L.,
… De Franceschi, S. (2013). Nature of tunable hole g factors in quantum dots.
Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.110.046602
chicago: Ares, Natalia, Vitaly Golovach, Georgios Katsaros, Mathieu Stoffel, Frank
Fournel, Leonid Glazman, Oliver Schmidt, and Silvano De Franceschi. “Nature of
Tunable Hole g Factors in Quantum Dots.” Physical Review Letters. American
Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.046602.
ieee: N. Ares et al., “Nature of tunable hole g factors in quantum dots,”
Physical Review Letters, vol. 110, no. 4. American Physical Society, 2013.
ista: Ares N, Golovach V, Katsaros G, Stoffel M, Fournel F, Glazman L, Schmidt O,
De Franceschi S. 2013. Nature of tunable hole g factors in quantum dots. Physical
Review Letters. 110(4).
mla: Ares, Natalia, et al. “Nature of Tunable Hole g Factors in Quantum Dots.” Physical
Review Letters, vol. 110, no. 4, American Physical Society, 2013, doi:10.1103/PhysRevLett.110.046602.
short: N. Ares, V. Golovach, G. Katsaros, M. Stoffel, F. Fournel, L. Glazman, O.
Schmidt, S. De Franceschi, Physical Review Letters 110 (2013).
date_created: 2018-12-11T11:53:51Z
date_published: 2013-01-23T00:00:00Z
date_updated: 2021-01-12T06:53:01Z
day: '23'
doi: 10.1103/PhysRevLett.110.046602
extern: 1
intvolume: ' 110'
issue: '4'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1208.0476
month: '01'
oa: 1
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '5365'
quality_controlled: 0
status: public
title: Nature of tunable hole g factors in quantum dots
type: journal_article
volume: 110
year: '2013'
...
---
_id: '1760'
abstract:
- lang: eng
text: We report on hole g-factor measurements in three terminal SiGe self-assembled
quantum dot devices with a top gate electrode positioned very close to the nanostructure.
Measurements of both the perpendicular as well as the parallel g-factor reveal
significant changes for a small modulation of the top gate voltage. From the observed
modulations, we estimate that, for realistic experimental conditions, hole spins
can be electrically manipulated with Rabi frequencies in the order of 100 MHz.
This work emphasises the potential of hole-based nano-devices for efficient spin
manipulation by means of the g-tensor modulation technique.
acknowledgement: We acknowledge the financial support from the Nanosciences Foundation
(Grenoble, France), the Commission for a Marie Curie Carrer Integration Grant, the
Austrian Science Fund (FWF) for a Lise-Meitner Fellowship (M1435-N30), the DOE under
Contract No. DE-FG02-08ER46482 (Yale), the European Starting Grant program, and
the Agence Nationale de la Recherche
author:
- first_name: Natalia
full_name: Ares, Natalia
last_name: Ares
- first_name: Georgios
full_name: Georgios Katsaros
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
- first_name: Vitaly
full_name: Golovach, Vitaly N
last_name: Golovach
- first_name: Jianjun
full_name: Zhang, Jianjun
last_name: Zhang
- first_name: Aaron
full_name: Prager, Aaron A
last_name: Prager
- first_name: Leonid
full_name: Glazman, Leonid I
last_name: Glazman
- first_name: Oliver
full_name: Schmidt, Oliver G
last_name: Schmidt
- first_name: Silvano
full_name: De Franceschi, Silvano
last_name: De Franceschi
citation:
ama: Ares N, Katsaros G, Golovach V, et al. SiGe quantum dots for fast hole spin
Rabi oscillations. Applied Physics Letters. 2013;103(26). doi:10.1063/1.4858959
apa: Ares, N., Katsaros, G., Golovach, V., Zhang, J., Prager, A., Glazman, L., …
De Franceschi, S. (2013). SiGe quantum dots for fast hole spin Rabi oscillations.
Applied Physics Letters. American Institute of Physics. https://doi.org/10.1063/1.4858959
chicago: Ares, Natalia, Georgios Katsaros, Vitaly Golovach, Jianjun Zhang, Aaron
Prager, Leonid Glazman, Oliver Schmidt, and Silvano De Franceschi. “SiGe Quantum
Dots for Fast Hole Spin Rabi Oscillations.” Applied Physics Letters. American
Institute of Physics, 2013. https://doi.org/10.1063/1.4858959.
ieee: N. Ares et al., “SiGe quantum dots for fast hole spin Rabi oscillations,”
Applied Physics Letters, vol. 103, no. 26. American Institute of Physics,
2013.
ista: Ares N, Katsaros G, Golovach V, Zhang J, Prager A, Glazman L, Schmidt O, De
Franceschi S. 2013. SiGe quantum dots for fast hole spin Rabi oscillations. Applied
Physics Letters. 103(26).
mla: Ares, Natalia, et al. “SiGe Quantum Dots for Fast Hole Spin Rabi Oscillations.”
Applied Physics Letters, vol. 103, no. 26, American Institute of Physics,
2013, doi:10.1063/1.4858959.
short: N. Ares, G. Katsaros, V. Golovach, J. Zhang, A. Prager, L. Glazman, O. Schmidt,
S. De Franceschi, Applied Physics Letters 103 (2013).
date_created: 2018-12-11T11:53:52Z
date_published: 2013-01-23T00:00:00Z
date_updated: 2021-01-12T06:53:02Z
day: '23'
doi: 10.1063/1.4858959
extern: 1
intvolume: ' 103'
issue: '26'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.7196
month: '01'
oa: 1
publication: Applied Physics Letters
publication_status: published
publisher: American Institute of Physics
publist_id: '5364'
quality_controlled: 0
status: public
title: SiGe quantum dots for fast hole spin Rabi oscillations
type: journal_article
volume: 103
year: '2013'
...
---
_id: '1785'
abstract:
- lang: eng
text: The geometric aspects of quantum mechanics are emphasized most prominently
by the concept of geometric phases, which are acquired whenever a quantum system
evolves along a path in Hilbert space, that is, the space of quantum states of
the system. The geometric phase is determined only by the shape of this path and
is, in its simplest form, a real number. However, if the system has degenerate
energy levels, then matrix-valued geometric state transformations, known as non-Abelian
holonomies-the effect of which depends on the order of two consecutive paths-can
be obtained. They are important, for example, for the creation of synthetic gauge
fields in cold atomic gases or the description of non-Abelian anyon statistics.
Moreover, there are proposals to exploit non-Abelian holonomic gates for the purposes
of noise-resilient quantum computation. In contrast to Abelian geometric operations,
non-Abelian ones have been observed only in nuclear quadrupole resonance experiments
with a large number of spins, and without full characterization of the geometric
process and its non-commutative nature. Here we realize non-Abelian non-adiabatic
holonomic quantum operations on a single, superconducting, artificial three-level
atom by applying a well-controlled, two-tone microwave drive. Using quantum process
tomography, we determine fidelities of the resulting non-commuting gates that
exceed 95 per cent. We show that two different quantum gates, originating from
two distinct paths in Hilbert space, yield non-equivalent transformations when
applied in different orders. This provides evidence for the non-Abelian character
of the implemented holonomic quantum operations. In combination with a non-trivial
two-quantum-bit gate, our method suggests a way to universal holonomic quantum
computing.
acknowledgement: This work is supported financially by GEOMDISS, the Swiss National
Science Foundation and ETH Zurich
author:
- first_name: Abdufarrukh
full_name: Abdumalikov, Abdufarrukh A
last_name: Abdumalikov
- first_name: Johannes M
full_name: Johannes Fink
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: K
full_name: Juliusson, K
last_name: Juliusson
- first_name: M
full_name: Pechal, M
last_name: Pechal
- first_name: Stefan
full_name: Berger, Stefan T
last_name: Berger
- first_name: Andreas
full_name: Wallraff, Andreas
last_name: Wallraff
- first_name: Stefan
full_name: Filipp, Stefan
last_name: Filipp
citation:
ama: Abdumalikov A, Fink JM, Juliusson K, et al. Experimental realization of non-Abelian
non-adiabatic geometric gates. Nature. 2013;496(7446):482-485. doi:10.1038/nature12010
apa: Abdumalikov, A., Fink, J. M., Juliusson, K., Pechal, M., Berger, S., Wallraff,
A., & Filipp, S. (2013). Experimental realization of non-Abelian non-adiabatic
geometric gates. Nature. Nature Publishing Group. https://doi.org/10.1038/nature12010
chicago: Abdumalikov, Abdufarrukh, Johannes M Fink, K Juliusson, M Pechal, Stefan
Berger, Andreas Wallraff, and Stefan Filipp. “Experimental Realization of Non-Abelian
Non-Adiabatic Geometric Gates.” Nature. Nature Publishing Group, 2013.
https://doi.org/10.1038/nature12010.
ieee: A. Abdumalikov et al., “Experimental realization of non-Abelian non-adiabatic
geometric gates,” Nature, vol. 496, no. 7446. Nature Publishing Group,
pp. 482–485, 2013.
ista: Abdumalikov A, Fink JM, Juliusson K, Pechal M, Berger S, Wallraff A, Filipp
S. 2013. Experimental realization of non-Abelian non-adiabatic geometric gates.
Nature. 496(7446), 482–485.
mla: Abdumalikov, Abdufarrukh, et al. “Experimental Realization of Non-Abelian Non-Adiabatic
Geometric Gates.” Nature, vol. 496, no. 7446, Nature Publishing Group,
2013, pp. 482–85, doi:10.1038/nature12010.
short: A. Abdumalikov, J.M. Fink, K. Juliusson, M. Pechal, S. Berger, A. Wallraff,
S. Filipp, Nature 496 (2013) 482–485.
date_created: 2018-12-11T11:54:00Z
date_published: 2013-04-25T00:00:00Z
date_updated: 2021-01-12T06:53:11Z
day: '25'
doi: 10.1038/nature12010
extern: 1
intvolume: ' 496'
issue: '7446'
month: '04'
page: 482 - 485
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5329'
quality_controlled: 0
status: public
title: Experimental realization of non-Abelian non-adiabatic geometric gates
type: journal_article
volume: 496
year: '2013'
...
---
_id: '1786'
abstract:
- lang: eng
text: We report the experimental observation and a theoretical explanation of collective
suppression of linewidths for multiple superconducting qubits coupled to a good
cavity. This demonstrates how strong qubit-cavity coupling can significantly modify
the dephasing and dissipation processes that might be expected for individual
qubits, and can potentially improve coherence times in many-body circuit QED.
acknowledgement: J. K. acknowledges financial support from EPSRC program “TOPNES”
(EP/I031014/1) and EPSRC (EP/G004714/2)
author:
- first_name: Felix
full_name: Nissen, Felix
last_name: Nissen
- first_name: Johannes M
full_name: Johannes Fink
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Jonas
full_name: Mlynek, Jonas A
last_name: Mlynek
- first_name: Andreas
full_name: Wallraff, Andreas
last_name: Wallraff
- first_name: Jonathan
full_name: Keeling, Jonathan M
last_name: Keeling
citation:
ama: Nissen F, Fink JM, Mlynek J, Wallraff A, Keeling J. Collective suppression
of linewidths in circuit QED. Physical Review Letters. 2013;110(20). doi:10.1103/PhysRevLett.110.203602
apa: Nissen, F., Fink, J. M., Mlynek, J., Wallraff, A., & Keeling, J. (2013).
Collective suppression of linewidths in circuit QED. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.110.203602
chicago: Nissen, Felix, Johannes M Fink, Jonas Mlynek, Andreas Wallraff, and Jonathan
Keeling. “Collective Suppression of Linewidths in Circuit QED.” Physical Review
Letters. American Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.203602.
ieee: F. Nissen, J. M. Fink, J. Mlynek, A. Wallraff, and J. Keeling, “Collective
suppression of linewidths in circuit QED,” Physical Review Letters, vol.
110, no. 20. American Physical Society, 2013.
ista: Nissen F, Fink JM, Mlynek J, Wallraff A, Keeling J. 2013. Collective suppression
of linewidths in circuit QED. Physical Review Letters. 110(20).
mla: Nissen, Felix, et al. “Collective Suppression of Linewidths in Circuit QED.”
Physical Review Letters, vol. 110, no. 20, American Physical Society, 2013,
doi:10.1103/PhysRevLett.110.203602.
short: F. Nissen, J.M. Fink, J. Mlynek, A. Wallraff, J. Keeling, Physical Review
Letters 110 (2013).
date_created: 2018-12-11T11:54:00Z
date_published: 2013-05-15T00:00:00Z
date_updated: 2021-01-12T06:53:11Z
day: '15'
doi: 10.1103/PhysRevLett.110.203602
extern: 1
intvolume: ' 110'
issue: '20'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1302.0665
month: '05'
oa: 1
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '5328'
quality_controlled: 0
status: public
title: Collective suppression of linewidths in circuit QED
type: journal_article
volume: 110
year: '2013'
...
---
_id: '1787'
abstract:
- lang: eng
text: When two indistinguishable single photons impinge at the two inputs of a beam
splitter they coalesce into a pair of photons appearing in either one of its two
outputs. This effect is due to the bosonic nature of photons and was first experimentally
observed by Hong, Ou and Mandel. Here, we present the observation of the Hong-Ou-Mandel
effect with two independent single-photon sources in the microwave frequency domain.
We probe the indistinguishability of single photons, created with a controllable
delay, in time-resolved second-order cross- and auto-correlation function measurements.
Using quadrature amplitude detection we are able to resolve different photon numbers
and detect coherence in and between the output arms. This scheme allows us to
fully characterize the two-mode entanglement of the spatially separated beam-splitter
output modes. Our experiments constitute a first step towards using two-photon
interference at microwave frequencies for quantum communication and information
processing.
acknowledgement: This work was supported by the European Research Council (ERC) through
a Starting Grant and by ETHZ. L.S. was supported by EU IP SOLID. A.B. and M.J.W.
were supported by NSERC, CIFAR and the Alfred P. Sloan Foundation
author:
- first_name: C
full_name: Lang, C
last_name: Lang
- first_name: Christopher
full_name: Eichler, Christopher
last_name: Eichler
- first_name: L.
full_name: Steffen, L. Kraig
last_name: Steffen
- first_name: Johannes M
full_name: Johannes Fink
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Matthew
full_name: Woolley, Matthew J
last_name: Woolley
- first_name: Alexandre
full_name: Blais, Alexandre
last_name: Blais
- first_name: Andreas
full_name: Wallraff, Andreas
last_name: Wallraff
citation:
ama: Lang C, Eichler C, Steffen L, et al. Correlations, indistinguishability and
entanglement in Hong-Ou-Mandel experiments at microwave frequencies. Nature
Physics. 2013;9(6):345-348. doi:10.1038/nphys2612
apa: Lang, C., Eichler, C., Steffen, L., Fink, J. M., Woolley, M., Blais, A., &
Wallraff, A. (2013). Correlations, indistinguishability and entanglement in Hong-Ou-Mandel
experiments at microwave frequencies. Nature Physics. Nature Publishing
Group. https://doi.org/10.1038/nphys2612
chicago: Lang, C, Christopher Eichler, L. Steffen, Johannes M Fink, Matthew Woolley,
Alexandre Blais, and Andreas Wallraff. “Correlations, Indistinguishability and
Entanglement in Hong-Ou-Mandel Experiments at Microwave Frequencies.” Nature
Physics. Nature Publishing Group, 2013. https://doi.org/10.1038/nphys2612.
ieee: C. Lang et al., “Correlations, indistinguishability and entanglement
in Hong-Ou-Mandel experiments at microwave frequencies,” Nature Physics,
vol. 9, no. 6. Nature Publishing Group, pp. 345–348, 2013.
ista: Lang C, Eichler C, Steffen L, Fink JM, Woolley M, Blais A, Wallraff A. 2013.
Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments
at microwave frequencies. Nature Physics. 9(6), 345–348.
mla: Lang, C., et al. “Correlations, Indistinguishability and Entanglement in Hong-Ou-Mandel
Experiments at Microwave Frequencies.” Nature Physics, vol. 9, no. 6, Nature
Publishing Group, 2013, pp. 345–48, doi:10.1038/nphys2612.
short: C. Lang, C. Eichler, L. Steffen, J.M. Fink, M. Woolley, A. Blais, A. Wallraff,
Nature Physics 9 (2013) 345–348.
date_created: 2018-12-11T11:54:00Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2021-01-12T06:53:11Z
day: '01'
doi: 10.1038/nphys2612
extern: 1
intvolume: ' 9'
issue: '6'
month: '06'
page: 345 - 348
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '5327'
quality_controlled: 0
status: public
title: Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments
at microwave frequencies
type: journal_article
volume: 9
year: '2013'
...
---
_id: '1790'
abstract:
- lang: eng
text: In the September 12, 2013 issue of Nature, the Epi4K Consortium (. Allen etal.,
2013) reported sequencing 264patient trios with epileptic encephalopathies. The
Consortium focused on genes exceptionally intolerant to sequence variations and
found substantial interconnections with autism and intellectual disability gene
networks.
author:
- first_name: Gaia
full_name: Gaia Novarino
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Seungtae
full_name: Baek, SeungTae
last_name: Baek
- first_name: Joseph
full_name: Gleeson, Joseph G
last_name: Gleeson
citation:
ama: 'Novarino G, Baek S, Gleeson J. The sacred disease: The puzzling genetics of
epileptic disorders. Neuron. 2013;80(1):9-11. doi:10.1016/j.neuron.2013.09.019'
apa: 'Novarino, G., Baek, S., & Gleeson, J. (2013). The sacred disease: The
puzzling genetics of epileptic disorders. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2013.09.019'
chicago: 'Novarino, Gaia, Seungtae Baek, and Joseph Gleeson. “The Sacred Disease:
The Puzzling Genetics of Epileptic Disorders.” Neuron. Elsevier, 2013.
https://doi.org/10.1016/j.neuron.2013.09.019.'
ieee: 'G. Novarino, S. Baek, and J. Gleeson, “The sacred disease: The puzzling genetics
of epileptic disorders,” Neuron, vol. 80, no. 1. Elsevier, pp. 9–11, 2013.'
ista: 'Novarino G, Baek S, Gleeson J. 2013. The sacred disease: The puzzling genetics
of epileptic disorders. Neuron. 80(1), 9–11.'
mla: 'Novarino, Gaia, et al. “The Sacred Disease: The Puzzling Genetics of Epileptic
Disorders.” Neuron, vol. 80, no. 1, Elsevier, 2013, pp. 9–11, doi:10.1016/j.neuron.2013.09.019.'
short: G. Novarino, S. Baek, J. Gleeson, Neuron 80 (2013) 9–11.
date_created: 2018-12-11T11:54:01Z
date_published: 2013-10-02T00:00:00Z
date_updated: 2021-01-12T06:53:13Z
day: '02'
doi: 10.1016/j.neuron.2013.09.019
extern: 1
intvolume: ' 80'
issue: '1'
month: '10'
page: 9 - 11
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '5323'
quality_controlled: 0
status: public
title: 'The sacred disease: The puzzling genetics of epileptic disorders'
type: journal_article
volume: 80
year: '2013'
...
---
_id: '1977'
abstract:
- lang: eng
text: Complex I (NADH:ubiquinone oxidoreductase) is central to cellular energy production,
being the first and largest enzyme of the respiratory chain in mitochondria. It
couples electron transfer from NADH to ubiquinone with proton translocation across
the inner mitochondrial membrane and is involved in a wide range of human neurodegenerative
disorders. Mammalian complex I is composed of 44 different subunits, whereas the
'minimal' bacterial version contains 14 highly conserved 'core' subunits. The
L-shaped assembly consists of hydrophilic and membrane domains. We have determined
all known atomic structures of complex I, starting from the hydrophilic domain
of Thermus thermophilus enzyme (eight subunits, nine Fe-S clusters), followed
by the membrane domains of the Escherichia coli (six subunits, 55 transmembrane
helices) and T. thermophilus (seven subunits, 64 transmembrane helices) enzymes,
and finally culminating in a recent crystal structure of the entire intact complex
I from T. thermophilus (536 kDa, 16 subunits, nine Fe-S clusters, 64 transmembrane
helices). The structure suggests an unusual and unique coupling mechanism via
longrange conformational changes. Determination of the structure of the entire
complex was possible only through this step-by-step approach, building on from
smaller subcomplexes towards the entire assembly. Large membrane proteins are
notoriously difficult to crystallize, and so various non-standard and sometimes
counterintuitive approaches were employed in order to achieve crystal diffraction
to high resolution and solve the structures. These steps, as well as the implications
from the final structure, are discussed in the present review.
acknowledgement: This work was funded by the Medical Research Council.
author:
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Rozbeh
full_name: 'Baradaran, Rozbeh '
last_name: Baradaran
- first_name: Rouslan
full_name: Efremov, Rouslan G
last_name: Efremov
- first_name: John
full_name: Berrisford, John M
last_name: Berrisford
- first_name: Gurdeep
full_name: Minhas, Gurdeep S
last_name: Minhas
citation:
ama: Sazanov LA, Baradaran R, Efremov R, Berrisford J, Minhas G. A long road towards
the structure of respiratory complex I, a giant molecular proton pump. Biochemical
Society Transactions. 2013;41(5):1265-1271. doi:10.1042/BST20130193
apa: Sazanov, L. A., Baradaran, R., Efremov, R., Berrisford, J., & Minhas, G.
(2013). A long road towards the structure of respiratory complex I, a giant molecular
proton pump. Biochemical Society Transactions. Portland Press. https://doi.org/10.1042/BST20130193
chicago: Sazanov, Leonid A, Rozbeh Baradaran, Rouslan Efremov, John Berrisford,
and Gurdeep Minhas. “A Long Road towards the Structure of Respiratory Complex
I, a Giant Molecular Proton Pump.” Biochemical Society Transactions. Portland
Press, 2013. https://doi.org/10.1042/BST20130193.
ieee: L. A. Sazanov, R. Baradaran, R. Efremov, J. Berrisford, and G. Minhas, “A
long road towards the structure of respiratory complex I, a giant molecular proton
pump,” Biochemical Society Transactions, vol. 41, no. 5. Portland Press,
pp. 1265–1271, 2013.
ista: Sazanov LA, Baradaran R, Efremov R, Berrisford J, Minhas G. 2013. A long road
towards the structure of respiratory complex I, a giant molecular proton pump.
Biochemical Society Transactions. 41(5), 1265–1271.
mla: Sazanov, Leonid A., et al. “A Long Road towards the Structure of Respiratory
Complex I, a Giant Molecular Proton Pump.” Biochemical Society Transactions,
vol. 41, no. 5, Portland Press, 2013, pp. 1265–71, doi:10.1042/BST20130193.
short: L.A. Sazanov, R. Baradaran, R. Efremov, J. Berrisford, G. Minhas, Biochemical
Society Transactions 41 (2013) 1265–1271.
date_created: 2018-12-11T11:55:00Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2021-01-12T06:54:28Z
day: '01'
doi: 10.1042/BST20130193
extern: 1
intvolume: ' 41'
issue: '5'
month: '10'
page: 1265 - 1271
publication: Biochemical Society Transactions
publication_status: published
publisher: Portland Press
publist_id: '5106'
quality_controlled: 0
status: public
title: A long road towards the structure of respiratory complex I, a giant molecular
proton pump
type: journal_article
volume: 41
year: '2013'
...
---
_id: '1978'
abstract:
- lang: eng
text: Complex I is the first and largest enzyme of the respiratory chain and has
a central role in cellular energy production through the coupling of NADH:ubiquinone
electron transfer to proton translocation. It is also implicated in many common
human neurodegenerative diseases. Here, we report the first crystal structure
of the entire, intact complex I (from Thermus thermophilus) at 3.3 Å resolution.
The structure of the 536-kDa complex comprises 16 different subunits, with a total
of 64 transmembrane helices and 9 iron-sulphur clusters. The core fold of subunit
Nqo8 (ND1 in humans) is, unexpectedly, similar to a half-channel of the antiporter-like
subunits. Small subunits nearby form a linked second half-channel, which completes
the fourth proton-translocation pathway (present in addition to the channels in
three antiporter-like subunits). The quinone-binding site is unusually long, narrow
and enclosed. The quinone headgroup binds at the deep end of this chamber, near
iron-sulphur cluster N2. Notably, the chamber is linked to the fourth channel
by a 'funnel' of charged residues. The link continues over the entire membrane
domain as a flexible central axis of charged and polar residues, and probably
has a leading role in the propagation of conformational changes, aided by coupling
elements. The structure suggests that a unique, out-of-the-membrane quinone-reaction
chamber enables the redox energy to drive concerted long-range conformational
changes in the four antiporter-like domains, resulting in translocation of four
protons per cycle.
acknowledgement: This work was funded by the Medical Research Council.
author:
- first_name: Rozbeh
full_name: 'Baradaran, Rozbeh '
last_name: Baradaran
- first_name: John
full_name: Berrisford, John M
last_name: Berrisford
- first_name: Gurdeep
full_name: Minhas, Gurdeep S
last_name: Minhas
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Baradaran R, Berrisford J, Minhas G, Sazanov LA. Crystal structure of the entire
respiratory complex i. Nature. 2013;494(7438):443-448. doi:10.1038/nature11871
apa: Baradaran, R., Berrisford, J., Minhas, G., & Sazanov, L. A. (2013). Crystal
structure of the entire respiratory complex i. Nature. Nature Publishing
Group. https://doi.org/10.1038/nature11871
chicago: Baradaran, Rozbeh, John Berrisford, Gurdeep Minhas, and Leonid A Sazanov.
“Crystal Structure of the Entire Respiratory Complex I.” Nature. Nature
Publishing Group, 2013. https://doi.org/10.1038/nature11871.
ieee: R. Baradaran, J. Berrisford, G. Minhas, and L. A. Sazanov, “Crystal structure
of the entire respiratory complex i,” Nature, vol. 494, no. 7438. Nature
Publishing Group, pp. 443–448, 2013.
ista: Baradaran R, Berrisford J, Minhas G, Sazanov LA. 2013. Crystal structure of
the entire respiratory complex i. Nature. 494(7438), 443–448.
mla: Baradaran, Rozbeh, et al. “Crystal Structure of the Entire Respiratory Complex
I.” Nature, vol. 494, no. 7438, Nature Publishing Group, 2013, pp. 443–48,
doi:10.1038/nature11871.
short: R. Baradaran, J. Berrisford, G. Minhas, L.A. Sazanov, Nature 494 (2013) 443–448.
date_created: 2018-12-11T11:55:01Z
date_published: 2013-02-28T00:00:00Z
date_updated: 2021-01-12T06:54:28Z
day: '28'
doi: 10.1038/nature11871
extern: 1
intvolume: ' 494'
issue: '7438'
month: '02'
page: 443 - 448
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5107'
quality_controlled: 0
status: public
title: Crystal structure of the entire respiratory complex i
type: journal_article
volume: 494
year: '2013'
...
---
_id: '1988'
abstract:
- lang: eng
text: The rod-shaped bacterium Escherichia coli selects the cell center as site
of division with the help of the proteins MinC, MinD, and MinE. This protein system
collectively oscillates between the two cell poles by alternately binding to the
membrane in one of the two cell halves. This dynamic behavior, which emerges from
the interaction of the ATPase MinD and its activator MinE on the cell membrane,
has become a paradigm for protein self-organization. Recently, it has been found
that not only the binding of MinD to the membrane, but also interactions of MinE
with the membrane contribute to Min-protein self-organization. Here, we show that
by accounting for this finding in a computational model, we can comprehensively
describe all observed Min-protein patterns in vivo and in vitro. Furthermore,
by varying the system's geometry, our computations predict patterns that have
not yet been reported. We confirm these predictions experimentally.
author:
- first_name: Mike
full_name: 'Bonny, Mike '
last_name: Bonny
- first_name: Elisabeth
full_name: Fischer-Friedrich, Elisabeth
last_name: Fischer Friedrich
- first_name: Martin
full_name: Martin Loose
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Petra
full_name: 'Schwille, Petra '
last_name: Schwille
- first_name: Karsten
full_name: Kruse, Karsten
last_name: Kruse
citation:
ama: Bonny M, Fischer Friedrich E, Loose M, Schwille P, Kruse K. Membrane binding
of MinE allows for a comprehensive description of Min-protein pattern formation.
PLoS Computational Biology. 2013;9(12). doi:10.1371/journal.pcbi.1003347
apa: Bonny, M., Fischer Friedrich, E., Loose, M., Schwille, P., & Kruse, K.
(2013). Membrane binding of MinE allows for a comprehensive description of Min-protein
pattern formation. PLoS Computational Biology. Public Library of Science.
https://doi.org/10.1371/journal.pcbi.1003347
chicago: Bonny, Mike, Elisabeth Fischer Friedrich, Martin Loose, Petra Schwille,
and Karsten Kruse. “Membrane Binding of MinE Allows for a Comprehensive Description
of Min-Protein Pattern Formation.” PLoS Computational Biology. Public Library
of Science, 2013. https://doi.org/10.1371/journal.pcbi.1003347.
ieee: M. Bonny, E. Fischer Friedrich, M. Loose, P. Schwille, and K. Kruse, “Membrane
binding of MinE allows for a comprehensive description of Min-protein pattern
formation,” PLoS Computational Biology, vol. 9, no. 12. Public Library
of Science, 2013.
ista: Bonny M, Fischer Friedrich E, Loose M, Schwille P, Kruse K. 2013. Membrane
binding of MinE allows for a comprehensive description of Min-protein pattern
formation. PLoS Computational Biology. 9(12).
mla: Bonny, Mike, et al. “Membrane Binding of MinE Allows for a Comprehensive Description
of Min-Protein Pattern Formation.” PLoS Computational Biology, vol. 9,
no. 12, Public Library of Science, 2013, doi:10.1371/journal.pcbi.1003347.
short: M. Bonny, E. Fischer Friedrich, M. Loose, P. Schwille, K. Kruse, PLoS Computational
Biology 9 (2013).
date_created: 2018-12-11T11:55:04Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:54:32Z
day: '01'
doi: 10.1371/journal.pcbi.1003347
extern: 1
intvolume: ' 9'
issue: '12'
month: '12'
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5095'
quality_controlled: 0
status: public
title: Membrane binding of MinE allows for a comprehensive description of Min-protein
pattern formation
type: journal_article
volume: 9
year: '2013'
...
---
_id: '1991'
abstract:
- lang: eng
text: Although transitions of sex-determination mechanisms are frequent in species
with homomorphic sex chromosomes, heteromorphic sex chromosomes are thought to
represent a terminal evolutionary stage owing to chromosome-specific adaptations
such as dosage compensation or an accumulation of sex-specific mutations. Here
we show that an autosome of Drosophila, the dot chromosome, was ancestrally a
differentiated X chromosome. We analyse the whole genome of true fruitflies (Tephritidae),
flesh flies (Sarcophagidae) and soldier flies (Stratiomyidae) to show that genes
located on the dot chromosome of Drosophila are X-linked in outgroup species,
whereas Drosophila X-linked genes are autosomal. We date this chromosomal transition
to early drosophilid evolution by sequencing the genome of other Drosophilidae.
Our results reveal several puzzling aspects of Drosophila dot chromosome biology
to be possible remnants of its former life as a sex chromosome, such as its minor
feminizing role in sex determination or its targeting by a chromosome-specific
regulatory mechanism. We also show that patterns of biased gene expression of
the dot chromosome during early embryogenesis, oogenesis and spermatogenesis resemble
that of the current X chromosome. Thus, although sex chromosomes are not necessarily
evolutionary end points and can revert back to an autosomal inheritance, the highly
specialized genome architecture of this former X chromosome suggests that severe
fitness costs must be overcome for such a turnover to occur.
acknowledgement: Funded by National Institutes of Health grants (R01GM076007 and R01GM093182)
and a Packard Fellowship to D.B.
author:
- first_name: Beatriz
full_name: Beatriz Vicoso
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
- first_name: Doris
full_name: Bachtrog, Doris
last_name: Bachtrog
citation:
ama: Vicoso B, Bachtrog D. Reversal of an ancient sex chromosome to an autosome
in Drosophila. Nature. 2013;499(7458):332-335. doi:10.1038/nature12235
apa: Vicoso, B., & Bachtrog, D. (2013). Reversal of an ancient sex chromosome
to an autosome in Drosophila. Nature. Nature Publishing Group. https://doi.org/10.1038/nature12235
chicago: Vicoso, Beatriz, and Doris Bachtrog. “Reversal of an Ancient Sex Chromosome
to an Autosome in Drosophila.” Nature. Nature Publishing Group, 2013. https://doi.org/10.1038/nature12235.
ieee: B. Vicoso and D. Bachtrog, “Reversal of an ancient sex chromosome to an autosome
in Drosophila,” Nature, vol. 499, no. 7458. Nature Publishing Group, pp.
332–335, 2013.
ista: Vicoso B, Bachtrog D. 2013. Reversal of an ancient sex chromosome to an autosome
in Drosophila. Nature. 499(7458), 332–335.
mla: Vicoso, Beatriz, and Doris Bachtrog. “Reversal of an Ancient Sex Chromosome
to an Autosome in Drosophila.” Nature, vol. 499, no. 7458, Nature Publishing
Group, 2013, pp. 332–35, doi:10.1038/nature12235.
short: B. Vicoso, D. Bachtrog, Nature 499 (2013) 332–335.
date_created: 2018-12-11T11:55:05Z
date_published: 2013-07-18T00:00:00Z
date_updated: 2021-01-12T06:54:33Z
day: '18'
doi: 10.1038/nature12235
extern: 1
intvolume: ' 499'
issue: '7458'
month: '07'
page: 332 - 335
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5092'
quality_controlled: 0
status: public
title: Reversal of an ancient sex chromosome to an autosome in Drosophila
type: journal_article
volume: 499
year: '2013'
...
---
_id: '2000'
abstract:
- lang: eng
text: In this work we present a flexible tool for tumor progression, which simulates
the evolutionary dynamics of cancer. Tumor progression implements a multi-type
branching process where the key parameters are the fitness landscape, the mutation
rate, and the average time of cell division. The fitness of a cancer cell depends
on the mutations it has accumulated. The input to our tool could be any fitness
landscape, mutation rate, and cell division time, and the tool produces the growth
dynamics and all relevant statistics.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression.
In: Proceedings of 25th Int. Conf. on Computer Aided Verification. Vol
8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:10.1007/978-3-642-39799-8_6'
apa: 'Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for
tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification
(Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6'
chicago: 'Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak.
“TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer
Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-39799-8_6.'
ieee: 'J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,”
in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg,
Russia, 2013, vol. 8044, pp. 101–106.'
ista: 'Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression.
Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided
VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.'
mla: 'Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” Proceedings
of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013,
pp. 101–06, doi:10.1007/978-3-642-39799-8_6.'
short: J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int.
Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
conference:
end_date: 2013-07-19
location: St. Petersburg, Russia
name: 'CAV: Computer Aided Verification'
start_date: 2013-07-13
date_created: 2018-12-11T11:55:08Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-39799-8_6
ec_funded: 1
external_id:
arxiv:
- '1303.5251'
intvolume: ' 8044'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1303.5251
month: '01'
oa: 1
oa_version: Preprint
page: 101 - 106
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
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of 25th Int. Conf. on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '5077'
quality_controlled: '1'
related_material:
record:
- id: '5399'
relation: earlier_version
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'TTP: Tool for tumor progression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '2009'
abstract:
- lang: eng
text: Traditional statistical methods for confidentiality protection of statistical
databases do not scale well to deal with GWAS databases especially in terms of
guarantees regarding protection from linkage to external information. 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, although
the guarantees may come at a serious price in terms of data utility. 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.
article_processing_charge: No
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Aleksandra
full_name: Slavkovic, Aleksandra
last_name: Slavkovic
- first_name: Stephen
full_name: Fienberg, Stephen
last_name: Fienberg
citation:
ama: Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide
association studies. Journal of Privacy and Confidentiality . 2013;5(1):137-166.
doi:10.29012/jpc.v5i1.629
apa: Uhler, C., Slavkovic, A., & Fienberg, S. (2013). Privacy-preserving data
sharing for genome-wide association studies. Journal of Privacy and Confidentiality
. Carnegie Mellon University. https://doi.org/10.29012/jpc.v5i1.629
chicago: Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving
Data Sharing for Genome-Wide Association Studies.” Journal of Privacy and Confidentiality
. Carnegie Mellon University, 2013. https://doi.org/10.29012/jpc.v5i1.629.
ieee: C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing
for genome-wide association studies,” Journal of Privacy and Confidentiality
, vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013.
ista: Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for
genome-wide association studies. Journal of Privacy and Confidentiality . 5(1),
137–166.
mla: Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association
Studies.” Journal of Privacy and Confidentiality , vol. 5, no. 1, Carnegie
Mellon University, 2013, pp. 137–66, doi:10.29012/jpc.v5i1.629.
short: C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality 5
(2013) 137–166.
date_created: 2018-12-11T11:55:11Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2021-01-12T06:54:41Z
day: '01'
department:
- _id: CaUh
doi: 10.29012/jpc.v5i1.629
intvolume: ' 5'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://repository.cmu.edu/jpc/vol5/iss1/6
month: '08'
oa: 1
oa_version: Published Version
page: 137 - 166
publication: 'Journal of Privacy and Confidentiality '
publication_status: published
publisher: Carnegie Mellon University
publist_id: '5067'
quality_controlled: '1'
status: public
title: Privacy-preserving data sharing for genome-wide association studies
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2013'
...
---
_id: '2010'
abstract:
- lang: eng
text: Many algorithms for inferring causality rely heavily on the faithfulness assumption.
The main justification for imposing this assumption is that the set of unfaithful
distributions has Lebesgue measure zero, since it can be seen as a collection
of hypersurfaces in a hypercube. However, due to sampling error the faithfulness
condition alone is not sufficient for statistical estimation, and strong-faithfulness
has been proposed and assumed to achieve uniform or high-dimensional consistency.
In contrast to the plain faithfulness assumption, the set of distributions that
is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly
large as we show in this paper. We study the strong-faithfulness condition from
a geometric and combinatorial point of view and give upper and lower bounds on
the Lebesgue measure of strong-faithful distributions for various classes of directed
acyclic graphs. Our results imply fundamental limitations for the PC-algorithm
and potentially also for other algorithms based on partial correlation testing
in the Gaussian case.
arxiv: 1
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Garvesh
full_name: Raskutti, Garvesh
last_name: Raskutti
- first_name: Peter
full_name: Bühlmann, Peter
last_name: Bühlmann
- first_name: Bin
full_name: Yu, Bin
last_name: Yu
citation:
ama: Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption
in causal inference. The Annals of Statistics. 2013;41(2):436-463. doi:10.1214/12-AOS1080
apa: Uhler, C., Raskutti, G., Bühlmann, P., & Yu, B. (2013). Geometry of the
faithfulness assumption in causal inference. The Annals of Statistics.
Institute of Mathematical Statistics. https://doi.org/10.1214/12-AOS1080
chicago: Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry
of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics.
Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/12-AOS1080.
ieee: C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness
assumption in causal inference,” The Annals of Statistics, vol. 41, no.
2. Institute of Mathematical Statistics, pp. 436–463, 2013.
ista: Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness
assumption in causal inference. The Annals of Statistics. 41(2), 436–463.
mla: Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal
Inference.” The Annals of Statistics, vol. 41, no. 2, Institute of Mathematical
Statistics, 2013, pp. 436–63, doi:10.1214/12-AOS1080.
short: C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013)
436–463.
date_created: 2018-12-11T11:55:11Z
date_published: 2013-04-01T00:00:00Z
date_updated: 2021-01-12T06:54:42Z
day: '01'
department:
- _id: CaUh
doi: 10.1214/12-AOS1080
external_id:
arxiv:
- '1207.0547'
intvolume: ' 41'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.doi.org/10.1214/12-AOS1080
month: '04'
oa: 1
oa_version: Published Version
page: 436 - 463
publication: The Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5066'
quality_controlled: '1'
scopus_import: 1
status: public
title: Geometry of the faithfulness assumption in causal inference
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2013'
...
---
_id: '13405'
abstract:
- lang: eng
text: We report a method for preparing electrode–molecule–electrode junctions that
incorporate nonsymmetrical azobenzene dithiols. Our approach is based on sequential
deprotection of thiol moieties originally carrying two different protecting groups.
The azobenzene derivatives retained their switching properties within monolayers
and permitted the photocontrol of electrical conductance.
article_processing_charge: No
article_type: original
author:
- first_name: Tal
full_name: Ely, Tal
last_name: Ely
- first_name: Sanjib
full_name: Das, Sanjib
last_name: Das
- first_name: Wenjie
full_name: Li, Wenjie
last_name: Li
- first_name: Pintu
full_name: Kundu, Pintu
last_name: Kundu
- first_name: Einat
full_name: Tirosh, Einat
last_name: Tirosh
- first_name: David
full_name: Cahen, David
last_name: Cahen
- first_name: Ayelet
full_name: Vilan, Ayelet
last_name: Vilan
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Ely T, Das S, Li W, et al. Photocontrol of electrical conductance with a nonsymmetrical
azobenzene dithiol. Synlett. 2013;24(18):2370-2374. doi:10.1055/s-0033-1340087
apa: Ely, T., Das, S., Li, W., Kundu, P., Tirosh, E., Cahen, D., … Klajn, R. (2013).
Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol.
Synlett. Georg Thieme Verlag. https://doi.org/10.1055/s-0033-1340087
chicago: Ely, Tal, Sanjib Das, Wenjie Li, Pintu Kundu, Einat Tirosh, David Cahen,
Ayelet Vilan, and Rafal Klajn. “Photocontrol of Electrical Conductance with a
Nonsymmetrical Azobenzene Dithiol.” Synlett. Georg Thieme Verlag, 2013.
https://doi.org/10.1055/s-0033-1340087.
ieee: T. Ely et al., “Photocontrol of electrical conductance with a nonsymmetrical
azobenzene dithiol,” Synlett, vol. 24, no. 18. Georg Thieme Verlag, pp.
2370–2374, 2013.
ista: Ely T, Das S, Li W, Kundu P, Tirosh E, Cahen D, Vilan A, Klajn R. 2013. Photocontrol
of electrical conductance with a nonsymmetrical azobenzene dithiol. Synlett. 24(18),
2370–2374.
mla: Ely, Tal, et al. “Photocontrol of Electrical Conductance with a Nonsymmetrical
Azobenzene Dithiol.” Synlett, vol. 24, no. 18, Georg Thieme Verlag, 2013,
pp. 2370–74, doi:10.1055/s-0033-1340087.
short: T. Ely, S. Das, W. Li, P. Kundu, E. Tirosh, D. Cahen, A. Vilan, R. Klajn,
Synlett 24 (2013) 2370–2374.
date_created: 2023-08-01T09:47:17Z
date_published: 2013-10-22T00:00:00Z
date_updated: 2023-08-08T07:47:35Z
day: '22'
doi: 10.1055/s-0033-1340087
extern: '1'
intvolume: ' 24'
issue: '18'
keyword:
- Organic Chemistry
language:
- iso: eng
month: '10'
oa_version: None
page: 2370-2374
publication: Synlett
publication_identifier:
eissn:
- 1437-2096
issn:
- 0936-5214
publication_status: published
publisher: Georg Thieme Verlag
quality_controlled: '1'
scopus_import: '1'
status: public
title: Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2013'
...
---
_id: '13406'
abstract:
- lang: eng
text: Dual-responsive nanoparticles are designed by functionalizing magnetic cores
with light-responsive ligands. These materials respond to both light and magnetic
fields and can be assembled into various higher-order structures, depending on
the relative contributions of these two stimuli.
article_processing_charge: No
article_type: original
author:
- first_name: Sanjib
full_name: Das, Sanjib
last_name: Das
- first_name: Priyadarshi
full_name: Ranjan, Priyadarshi
last_name: Ranjan
- first_name: Pradipta Sankar
full_name: Maiti, Pradipta Sankar
last_name: Maiti
- first_name: Gurvinder
full_name: Singh, Gurvinder
last_name: Singh
- first_name: Gregory
full_name: Leitus, Gregory
last_name: Leitus
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. Dual-responsive nanoparticles
and their self-assembly. Advanced Materials. 2013;25(3):422-426. doi:10.1002/adma.201201734
apa: Das, S., Ranjan, P., Maiti, P. S., Singh, G., Leitus, G., & Klajn, R. (2013).
Dual-responsive nanoparticles and their self-assembly. Advanced Materials.
Wiley. https://doi.org/10.1002/adma.201201734
chicago: Das, Sanjib, Priyadarshi Ranjan, Pradipta Sankar Maiti, Gurvinder Singh,
Gregory Leitus, and Rafal Klajn. “Dual-Responsive Nanoparticles and Their Self-Assembly.”
Advanced Materials. Wiley, 2013. https://doi.org/10.1002/adma.201201734.
ieee: S. Das, P. Ranjan, P. S. Maiti, G. Singh, G. Leitus, and R. Klajn, “Dual-responsive
nanoparticles and their self-assembly,” Advanced Materials, vol. 25, no.
3. Wiley, pp. 422–426, 2013.
ista: Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. 2013. Dual-responsive
nanoparticles and their self-assembly. Advanced Materials. 25(3), 422–426.
mla: Das, Sanjib, et al. “Dual-Responsive Nanoparticles and Their Self-Assembly.”
Advanced Materials, vol. 25, no. 3, Wiley, 2013, pp. 422–26, doi:10.1002/adma.201201734.
short: S. Das, P. Ranjan, P.S. Maiti, G. Singh, G. Leitus, R. Klajn, Advanced Materials
25 (2013) 422–426.
date_created: 2023-08-01T09:47:30Z
date_published: 2013-01-18T00:00:00Z
date_updated: 2023-08-08T07:49:36Z
day: '18'
doi: 10.1002/adma.201201734
extern: '1'
external_id:
pmid:
- '22933327'
intvolume: ' 25'
issue: '3'
keyword:
- Mechanical Engineering
- Mechanics of Materials
- General Materials Science
language:
- iso: eng
month: '01'
oa_version: None
page: 422-426
pmid: 1
publication: Advanced Materials
publication_identifier:
issn:
- 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dual-responsive nanoparticles and their self-assembly
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '1374'
abstract:
- lang: eng
text: 'We study two-player zero-sum games over infinite-state graphs equipped with
ωB and finitary conditions. Our first contribution is about the strategy complexity,
i.e the memory required for winning strategies: we prove that over general infinite-state
graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory
suffices for finitary parity games. We then study pushdown games with boundedness
conditions, with two contributions. First we prove a collapse result for pushdown
games with ωB-conditions, implying the decidability of solving these games. Second
we consider pushdown games with finitary parity along with stack boundedness conditions,
and show that solving these games is EXPTIME-complete.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nathanaël
full_name: Fijalkow, Nathanaël
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In:
22nd EACSL Annual Conference on Computer Science Logic. Vol 23. Leibniz
International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2013:181-196. doi:10.4230/LIPIcs.CSL.2013.181'
apa: 'Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary
conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol.
23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CSL.2013.181'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with
Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic,
23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.
ieee: K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,”
in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy,
2013, vol. 23, pp. 181–196.
ista: 'Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions.
22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science
LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with
Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic,
vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96,
doi:10.4230/LIPIcs.CSL.2013.181.
short: K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer
Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 203-09-02
date_created: 2018-12-11T11:51:39Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2021-01-12T06:50:14Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2013.181
ec_funded: 1
file:
- access_level: open_access
checksum: b7091a3866db573c0db5ec486952255e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:38Z
date_updated: 2020-07-14T12:44:47Z
file_id: '5023'
file_name: IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf
file_size: 547296
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 181 - 196
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 22nd EACSL Annual Conference on Computer Science Logic
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5837'
pubrep_id: '624'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: Infinite-state games with finitary conditions
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '1376'
abstract:
- lang: eng
text: 'We consider the distributed synthesis problem for temporal logic specifications.
Traditionally, the problem has been studied for LTL, and the previous results
show that the problem is decidable iff there is no information fork in the architecture.
We consider the problem for fragments of LTL and our main results are as follows:
(1) We show that the problem is undecidable for architectures with information
forks even for the fragment of LTL with temporal operators restricted to next
and eventually. (2) For specifications restricted to globally along with non-nested
next operators, we establish decidability (in EXPSPACE) for star architectures
where the processes receive disjoint inputs, whereas we establish undecidability
for architectures containing an information fork-meet structure. (3) Finally,
we consider LTL without the next operator, and establish decidability (NEXPTIME-complete)
for all architectures for a fragment that consists of a set of safety assumptions,
and a set of guarantees where each guarantee is a safety, reachability, or liveness
condition.'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis
for LTL fragments. In: 13th International Conference on Formal Methods in Computer-Aided
Design. IEEE; 2013:18-25. doi:10.1109/FMCAD.2013.6679386'
apa: 'Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013).
Distributed synthesis for LTL fragments. In 13th International Conference on
Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United
States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis.
“Distributed Synthesis for LTL Fragments.” In 13th International Conference
on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679386.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed
synthesis for LTL fragments,” in 13th International Conference on Formal Methods
in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
ista: 'Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis
for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided
Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.'
mla: Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” 13th
International Conference on Formal Methods in Computer-Aided Design, IEEE,
2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.
short: K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International
Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
conference:
end_date: 2013-10-23
location: Portland, OR, United States
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2013-10-20
date_created: 2018-12-11T11:51:40Z
date_published: 2013-12-11T00:00:00Z
date_updated: 2023-02-23T12:24:53Z
day: '11'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/FMCAD.2013.6679386
ec_funded: 1
language:
- iso: eng
month: '12'
oa_version: None
page: 18 - 25
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 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: 13th International Conference on Formal Methods in Computer-Aided Design
publication_status: published
publisher: IEEE
publist_id: '5835'
quality_controlled: '1'
related_material:
record:
- id: '5406'
relation: earlier_version
status: public
status: public
title: Distributed synthesis for LTL fragments
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1385'
abstract:
- lang: eng
text: It is often difficult to correctly implement a Boolean controller for a complex
system, especially when concurrency is involved. Yet, it may be easy to formally
specify a controller. For instance, for a pipelined processor it suffices to state
that the visible behavior of the pipelined system should be identical to a non-pipelined
reference system (Burch-Dill paradigm). We present a novel procedure to efficiently
synthesize multiple Boolean control signals from a specification given as a quantified
first-order formula (with a specific quantifier structure). Our approach uses
uninterpreted functions to abstract details of the design. We construct an unsatisfiable
SMT formula from the given specification. Then, from just one proof of unsatisfiability,
we use a variant of Craig interpolation to compute multiple coordinated interpolants
that implement the Boolean control signals. Our method avoids iterative learning
and back-substitution of the control functions. We applied our approach to synthesize
a controller for a simple two-stage pipelined processor, and present first experimental
results.
acknowledgement: "This research was supported by the European Commission through project\r\nDIAMOND
\ (FP7-2009-IST-4-248613), and QUAINT (I774-N23), "
arxiv: 1
author:
- first_name: Georg
full_name: Hofferek, Georg
last_name: Hofferek
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Bettina
full_name: Könighofer, Bettina
last_name: Könighofer
- first_name: Jie
full_name: Jiang, Jie
last_name: Jiang
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
citation:
ama: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple
boolean functions using interpolation on a single proof. In: 2013 Formal Methods
in Computer-Aided Design. IEEE; 2013:77-84. doi:10.1109/FMCAD.2013.6679394'
apa: 'Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013).
Synthesizing multiple boolean functions using interpolation on a single proof.
In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland,
OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394'
chicago: Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick
Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single
Proof.” In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013.
https://doi.org/10.1109/FMCAD.2013.6679394.
ieee: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing
multiple boolean functions using interpolation on a single proof,” in 2013
Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013,
pp. 77–84.
ista: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple
boolean functions using interpolation on a single proof. 2013 Formal Methods in
Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.'
mla: Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation
on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE,
2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394.
short: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal
Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.
conference:
end_date: 2013-10-23
location: Portland, OR, United States
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2013-10-20
date_created: 2018-12-11T11:51:43Z
date_published: 2013-12-11T00:00:00Z
date_updated: 2021-01-12T06:50:19Z
day: '11'
department:
- _id: ToHe
doi: 10.1109/FMCAD.2013.6679394
ec_funded: 1
external_id:
arxiv:
- '1308.4767'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1308.4767
month: '12'
oa: 1
oa_version: Preprint
page: 77 - 84
project:
- _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
publication: 2013 Formal Methods in Computer-Aided Design
publication_status: published
publisher: IEEE
publist_id: '5825'
quality_controlled: '1'
status: public
title: Synthesizing multiple boolean functions using interpolation on a single proof
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1387'
abstract:
- lang: eng
text: Choices made by nondeterministic word automata depend on both the past (the
prefix of the word read so far) and the future (the suffix yet to be read). In
several applications, most notably synthesis, the future is diverse or unknown,
leading to algorithms that are based on deterministic automata. Hoping to retain
some of the advantages of nondeterministic automata, researchers have studied
restricted classes of nondeterministic automata. Three such classes are nondeterministic
automata that are good for trees (GFT; i.e., ones that can be expanded to tree
automata accepting the derived tree languages, thus whose choices should satisfy
diverse futures), good for games (GFG; i.e., ones whose choices depend only on
the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent
deterministic automata). The theoretical properties and relative merits of the
different classes are still open, having vagueness on whether they really differ
from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known
whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also
open is the possible succinctness of GFG and GFT automata compared to deterministic
automata. We study these problems for ω-regular automata with all common acceptance
conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction
for GFG automata.
acknowledgement: and ERC Grant QUALITY.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Denis
full_name: Kuperberg, Denis
last_name: Kuperberg
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Michał
full_name: Skrzypczak, Michał
last_name: Skrzypczak
citation:
ama: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence
of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11
apa: 'Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism
in the presence of a diverse or unknown future. Presented at the ICALP: Automata,
Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11'
chicago: Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism
in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science.
Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11.
ieee: U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in
the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer,
pp. 89–100, 2013.
ista: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the
presence of a diverse or unknown future. 7966(PART 2), 89–100.
mla: Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown
Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.
short: U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.
conference:
end_date: 2013-07-12
location: Riga, Latvia
name: 'ICALP: Automata, Languages and Programming'
start_date: 2013-07-08
date_created: 2018-12-11T11:51:44Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2020-08-11T10:09:09Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39212-2_11
ec_funded: 1
file:
- access_level: open_access
checksum: 98bc02e3793072e279ec8d364b381ff3
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:05:50Z
date_updated: 2020-07-14T12:44:48Z
file_id: '7857'
file_name: 2013_ICALP_Boker.pdf
file_size: 276982
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: ' 7966'
issue: PART 2
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 89 - 100
project:
- _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
publication_status: published
publisher: Springer
publist_id: '5823'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Nondeterminism in the presence of a diverse or unknown future
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7966
year: '2013'
...