---
_id: '2185'
abstract:
- lang: eng
text: 'We revisit the classical problem of converting an imperfect source of randomness
into a usable cryptographic key. Assume that we have some cryptographic application
P that expects a uniformly random m-bit key R and ensures that the best attack
(in some complexity class) against P(R) has success probability at most δ. Our
goal is to design a key-derivation function (KDF) h that converts any random source
X of min-entropy k into a sufficiently "good" key h(X), guaranteeing
that P(h(X)) has comparable security δ′ which is ''close'' to δ. Seeded randomness
extractors provide a generic way to solve this problem for all applications P,
with resulting security δ′ = O(δ), provided that we start with entropy k ≥ m +
2 log (1/δ) - O(1). By a result of Radhakrishnan and Ta-Shma, this bound on k
(called the "RT-bound") is also known to be tight in general. Unfortunately,
in many situations the loss of 2 log (1/δ) bits of entropy is unacceptable. This
motivates the study KDFs with less entropy waste by placing some restrictions
on the source X or the application P. In this work we obtain the following new
positive and negative results in this regard: - Efficient samplability of the
source X does not help beat the RT-bound for general applications. This resolves
the SRT (samplable RT) conjecture of Dachman-Soled et al. [DGKM12] in the affirmative,
and also shows that the existence of computationally-secure extractors beating
the RT-bound implies the existence of one-way functions. - We continue in the
line of work initiated by Barak et al. [BDK+11] and construct new information-theoretic
KDFs which beat the RT-bound for large but restricted classes of applications.
Specifically, we design efficient KDFs that work for all unpredictability applications
P (e.g., signatures, MACs, one-way functions, etc.) and can either: (1) extract
all of the entropy k = m with a very modest security loss δ′ = O(δ·log (1/δ)),
or alternatively, (2) achieve essentially optimal security δ′ = O(δ) with a very
modest entropy loss k ≥ m + loglog (1/δ). In comparison, the best prior results
from [BDK+11] for this class of applications would only guarantee δ′ = O(√δ) when
k = m, and would need k ≥ m + log (1/δ) to get δ′ = O(δ). - The weaker bounds
of [BDK+11] hold for a larger class of so-called "square- friendly"
applications (which includes all unpredictability, but also some important indistinguishability,
applications). Unfortunately, we show that these weaker bounds are tight for the
larger class of applications. - We abstract out a clean, information-theoretic
notion of (k,δ,δ′)- unpredictability extractors, which guarantee "induced"
security δ′ for any δ-secure unpredictability application P, and characterize
the parameters achievable for such unpredictability extractors. Of independent
interest, we also relate this notion to the previously-known notion of (min-entropy)
condensers, and improve the state-of-the-art parameters for such condensers.'
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Dodis Y, Pietrzak KZ, Wichs D. Key derivation without entropy waste. In: Nguyen
P, Oswald E, eds. Vol 8441. Springer; 2014:93-110. doi:10.1007/978-3-642-55220-5_6'
apa: 'Dodis, Y., Pietrzak, K. Z., & Wichs, D. (2014). Key derivation without
entropy waste. In P. Nguyen & E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen,
Denmark: Springer. https://doi.org/10.1007/978-3-642-55220-5_6'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation
without Entropy Waste.” edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110.
Springer, 2014. https://doi.org/10.1007/978-3-642-55220-5_6.
ieee: 'Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,”
presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques,
Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.'
ista: 'Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste.
EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441,
93–110.'
mla: Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited
by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.
short: Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer,
2014, pp. 93–110.
conference:
end_date: 2014-05-15
location: Copenhagen, Denmark
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2014-05-11
date_created: 2018-12-11T11:56:12Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-55220-5_6
editor:
- first_name: Phong
full_name: Nguyen, Phong
last_name: Nguyen
- first_name: Elisabeth
full_name: Oswald, Elisabeth
last_name: Oswald
file:
- access_level: open_access
checksum: da1aa01221086083b23c92e547b48ff4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:43Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4705'
file_name: IST-2016-680-v1+1_708.pdf
file_size: 505389
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 8441'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 93 - 110
publication_status: published
publisher: Springer
publist_id: '4795'
pubrep_id: '680'
quality_controlled: '1'
scopus_import: 1
status: public
title: Key derivation without entropy waste
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8441
year: '2014'
...
---
_id: '2186'
abstract:
- lang: eng
text: We prove the existence of scattering states for the defocusing cubic Gross-Pitaevskii
(GP) hierarchy in ℝ3. Moreover, we show that an exponential energy growth condition
commonly used in the well-posedness theory of the GP hierarchy is, in a specific
sense, necessary. In fact, we prove that without the latter, there exist initial
data for the focusing cubic GP hierarchy for which instantaneous blowup occurs.
author:
- first_name: Thomas
full_name: Chen, Thomas
last_name: Chen
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Nataša
full_name: Pavlović, Nataša
last_name: Pavlović
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Chen T, Hainzl C, Pavlović N, Seiringer R. On the well-posedness and scattering
for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical
Physics. 2014;104(7):871-891. doi:10.1007/s11005-014-0693-2
apa: Chen, T., Hainzl, C., Pavlović, N., & Seiringer, R. (2014). On the well-posedness
and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters
in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-014-0693-2
chicago: Chen, Thomas, Christian Hainzl, Nataša Pavlović, and Robert Seiringer.
“On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum
de Finetti.” Letters in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s11005-014-0693-2.
ieee: T. Chen, C. Hainzl, N. Pavlović, and R. Seiringer, “On the well-posedness
and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti,” Letters
in Mathematical Physics, vol. 104, no. 7. Springer, pp. 871–891, 2014.
ista: Chen T, Hainzl C, Pavlović N, Seiringer R. 2014. On the well-posedness and
scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters
in Mathematical Physics. 104(7), 871–891.
mla: Chen, Thomas, et al. “On the Well-Posedness and Scattering for the Gross-Pitaevskii
Hierarchy via Quantum de Finetti.” Letters in Mathematical Physics, vol.
104, no. 7, Springer, 2014, pp. 871–91, doi:10.1007/s11005-014-0693-2.
short: T. Chen, C. Hainzl, N. Pavlović, R. Seiringer, Letters in Mathematical Physics
104 (2014) 871–891.
date_created: 2018-12-11T11:56:12Z
date_published: 2014-05-07T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '07'
department:
- _id: RoSe
doi: 10.1007/s11005-014-0693-2
intvolume: ' 104'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.2136
month: '05'
oa: 1
oa_version: Submitted Version
page: 871 - 891
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4793'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via
quantum de Finetti
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2014'
...
---
_id: '2187'
abstract:
- lang: eng
text: 'Systems should not only be correct but also robust in the sense that they
behave reasonably in unexpected situations. This article addresses synthesis of
robust reactive systems from temporal specifications. Existing methods allow arbitrary
behavior if assumptions in the specification are violated. To overcome this, we
define two robustness notions, combine them, and show how to enforce them in synthesis.
The first notion applies to safety properties: If safety assumptions are violated
temporarily, we require that the system recovers to normal operation with as few
errors as possible. The second notion requires that, if liveness assumptions are
violated, as many guarantees as possible should be fulfilled nevertheless. We
present a synthesis procedure achieving this for the important class of GR(1)
specifications, and establish complexity bounds. We also present an implementation
of a special case of robustness, and show experimental results.'
article_processing_charge: No
article_type: original
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Karin
full_name: Greimel, Karin
last_name: Greimel
- 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: Georg
full_name: Hofferek, Georg
last_name: Hofferek
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Bettina
full_name: Könighofer, Bettina
last_name: Könighofer
- first_name: Robert
full_name: Könighofer, Robert
last_name: Könighofer
citation:
ama: Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. Acta
Informatica. 2014;51(3-4):193-220. doi:10.1007/s00236-013-0191-5
apa: Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann,
B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica.
Springer. https://doi.org/10.1007/s00236-013-0191-5
chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer.
“Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5.
ieee: R. Bloem et al., “Synthesizing robust systems,” Acta Informatica,
vol. 51, no. 3–4. Springer, pp. 193–220, 2014.
ista: Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer
B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4),
193–220.
mla: Bloem, Roderick, et al. “Synthesizing Robust Systems.” Acta Informatica,
vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.
short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann,
B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.
date_created: 2018-12-11T11:56:13Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '01'
ddc:
- '621'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s00236-013-0191-5
ec_funded: 1
file:
- access_level: open_access
checksum: d7f560f3d923f0f00aa10a0652f83273
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:44Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5234'
file_name: IST-2012-71-v1+1_Synthesizing_robust_systems.pdf
file_size: 169523
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 51'
issue: 3-4
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 193 - 220
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '4787'
pubrep_id: '71'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesizing robust systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_id: '2188'
abstract:
- lang: eng
text: Although plant and animal cells use a similar core mechanism to deliver proteins
to the plasma membrane, their different lifestyle, body organization and specific
cell structures resulted in the acquisition of regulatory mechanisms that vary
in the two kingdoms. In particular, cell polarity regulators do not seem to be
conserved, because genes encoding key components are absent in plant genomes.
In plants, the broad knowledge on polarity derives from the study of auxin transporters,
the PIN-FORMED proteins, in the model plant Arabidopsis thaliana. In animals,
much information is provided from the study of polarity in epithelial cells that
exhibit basolateral and luminal apical polarities, separated by tight junctions.
In this review, we summarize the similarities and differences of the polarization
mechanisms between plants and animals and survey the main genetic approaches that
have been used to characterize new genes involved in polarity establishment in
plants, including the frequently used forward and reverse genetics screens as
well as a novel chemical genetics approach that is expected to overcome the limitation
of classical genetics methods.
acknowledgement: "This work was supported by a grant from the Research Foundation-Flanders
(Odysseus).\r\n\r\n"
article_number: '140017'
author:
- first_name: Urszula
full_name: Kania, Urszula
id: 4AE5C486-F248-11E8-B48F-1D18A9856A87
last_name: Kania
- first_name: Matyas
full_name: Fendrych, Matyas
last_name: Fendrych
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences
to animal epithelial cells. Open Biology. 2014;4(APRIL). doi:10.1098/rsob.140017
apa: Kania, U., Fendrych, M., & Friml, J. (2014). Polar delivery in plants;
commonalities and differences to animal epithelial cells. Open Biology.
Royal Society. https://doi.org/10.1098/rsob.140017
chicago: Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants;
Commonalities and Differences to Animal Epithelial Cells.” Open Biology.
Royal Society, 2014. https://doi.org/10.1098/rsob.140017.
ieee: U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities
and differences to animal epithelial cells,” Open Biology, vol. 4, no.
APRIL. Royal Society, 2014.
ista: Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities
and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.
mla: Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences
to Animal Epithelial Cells.” Open Biology, vol. 4, no. APRIL, 140017, Royal
Society, 2014, doi:10.1098/rsob.140017.
short: U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).
date_created: 2018-12-11T11:56:13Z
date_published: 2014-04-16T00:00:00Z
date_updated: 2021-01-12T06:55:52Z
day: '16'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1098/rsob.140017
file:
- access_level: open_access
checksum: 2020627feff36cf0799167c84149fa75
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:40Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5025'
file_name: IST-2016-441-v1+1_140017.full.pdf
file_size: 682570
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 4'
issue: APRIL
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Open Biology
publication_status: published
publisher: Royal Society
publist_id: '4786'
pubrep_id: '441'
quality_controlled: '1'
scopus_import: 1
status: public
title: Polar delivery in plants; commonalities and differences to animal epithelial
cells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2014'
...
---
_id: '2189'
abstract:
- lang: fre
text: En apprentissage automatique, nous parlons d'adaptation de domaine lorsque
les données de test (cibles) et d'apprentissage (sources) sont générées selon
différentes distributions. Nous devons donc développer des algorithmes de classification
capables de s'adapter à une nouvelle distribution, pour laquelle aucune information
sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle
de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis
comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous
introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq.
PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux
points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté''
(justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage
non itératif qui se focalise dans les régions où les distributions marginales
source et cible sont les plus similaires. Dans un second temps, nous étudions
l'influence de notre auto-étiquetage pour en déduire une procédure de validation
des hyperparamètres. Finalement, notre approche montre des résultats empiriques
prometteurs.
article_processing_charge: No
author:
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
citation:
ama: 'Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non
itératif. In: Vol 1. Elsevier; 2014:49-58.'
apa: 'Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone
sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne,
France: Elsevier.'
chicago: Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage
Non Itératif,” 1:49–58. Elsevier, 2014.
ieee: 'E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage
Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014,
vol. 1, pp. 49–58.'
ista: 'Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine
Learning French Conference) vol. 1, 49–58.'
mla: Morvant, Emilie. Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage
Non Itératif. Vol. 1, Elsevier, 2014, pp. 49–58.
short: E. Morvant, in:, Elsevier, 2014, pp. 49–58.
conference:
location: Saint-Etienne, France
name: 'CAP: Conférence Francophone sur l''Apprentissage Automatique (Machine Learning
French Conference)'
date_created: 2018-12-11T11:56:13Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:55:52Z
day: '01'
department:
- _id: ChLa
intvolume: ' 1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01005776/
month: '07'
oa: 1
oa_version: Preprint
page: 49-58
publication_status: published
publisher: Elsevier
publist_id: '4785'
quality_controlled: '1'
status: public
title: Adaptation de domaine de vote de majorité par auto-étiquetage non itératif
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '2190'
abstract:
- lang: eng
text: We present a new algorithm to construct a (generalized) deterministic Rabin
automaton for an LTL formula φ. The automaton is the product of a master automaton
and an array of slave automata, one for each G-subformula of φ. The slave automaton
for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard
determinization procedures, the states of all our automata have a clear logical
structure, which allows for various optimizations. Our construction subsumes former
algorithms for fragments of LTL. Experimental results show improvement in the
sizes of the resulting automata compared to existing methods.
acknowledgement: The author is on leave from Faculty of Informatics, Masaryk University,
Czech Republic, and partially supported by the Czech Science Foundation, grant No.
P202/12/G061.
alternative_title:
- LNCS
author:
- first_name: Javier
full_name: Esparza, Javier
last_name: Esparza
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional
approach. In: Vol 8559. Springer; 2014:192-208. doi:10.1007/978-3-319-08867-9_13'
apa: 'Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata:
A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the
CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13'
chicago: 'Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata:
A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_13.'
ieee: 'J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless
compositional approach,” presented at the CAV: Computer Aided Verification, 2014,
vol. 8559, pp. 192–208.'
ista: 'Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless
compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.'
mla: 'Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata:
A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208,
doi:10.1007/978-3-319-08867-9_13.'
short: J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2018-12-11T11:56:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:53Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-08867-9_13
ec_funded: 1
intvolume: ' 8559'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.3388
month: '01'
oa: 1
oa_version: Submitted Version
page: 192 - 208
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_status: published
publisher: Springer
publist_id: '4784'
quality_controlled: '1'
status: public
title: 'From LTL to deterministic automata: A safraless compositional approach'
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8559
year: '2014'
...
---
_id: '2208'
abstract:
- lang: eng
text: 'We propose to detect quadrupole interactions of neutral ultracold atoms via
their induced mean-field shift. We consider a Mott insulator state of spin-polarized
atoms in a two-dimensional optical square lattice. The quadrupole moments of the
atoms are aligned by an external magnetic field. As the alignment angle is varied,
the mean-field shift shows a characteristic angular dependence, which constitutes
the defining signature of the quadrupole interaction. For the 3P2 states of Yb
and Sr atoms, we find a frequency shift of the order of tens of Hertz, which can
be realistically detected in experiment with current technology. We compare our
results to the mean-field shift of a spin-polarized quasi-two-dimensional Fermi
gas in continuum. '
article_number: '043616'
author:
- first_name: Martin
full_name: Lahrz, Martin
last_name: Lahrz
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Klaus
full_name: Sengstock, Klaus
last_name: Sengstock
- first_name: Christoph
full_name: Becker, Christoph
last_name: Becker
- first_name: Ludwig
full_name: Mathey, Ludwig
last_name: Mathey
citation:
ama: Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. Detecting quadrupole
interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular,
and Optical Physics. 2014;89(4). doi:10.1103/PhysRevA.89.043616
apa: Lahrz, M., Lemeshko, M., Sengstock, K., Becker, C., & Mathey, L. (2014).
Detecting quadrupole interactions in ultracold Fermi gases. Physical Review
A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.89.043616
chicago: Lahrz, Martin, Mikhail Lemeshko, Klaus Sengstock, Christoph Becker, and
Ludwig Mathey. “Detecting Quadrupole Interactions in Ultracold Fermi Gases.” Physical
Review A - Atomic, Molecular, and Optical Physics. American Physical Society,
2014. https://doi.org/10.1103/PhysRevA.89.043616.
ieee: M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, and L. Mathey, “Detecting
quadrupole interactions in ultracold Fermi gases,” Physical Review A - Atomic,
Molecular, and Optical Physics, vol. 89, no. 4. American Physical Society,
2014.
ista: Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. 2014. Detecting quadrupole
interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular,
and Optical Physics. 89(4), 043616.
mla: Lahrz, Martin, et al. “Detecting Quadrupole Interactions in Ultracold Fermi
Gases.” Physical Review A - Atomic, Molecular, and Optical Physics, vol.
89, no. 4, 043616, American Physical Society, 2014, doi:10.1103/PhysRevA.89.043616.
short: M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, L. Mathey, Physical Review
A - Atomic, Molecular, and Optical Physics 89 (2014).
date_created: 2018-12-11T11:56:20Z
date_published: 2014-04-23T00:00:00Z
date_updated: 2021-01-12T06:55:59Z
day: '23'
doi: 10.1103/PhysRevA.89.043616
extern: '1'
intvolume: ' 89'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.0873
month: '04'
oa: 1
oa_version: Submitted Version
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '4764'
quality_controlled: '1'
status: public
title: Detecting quadrupole interactions in ultracold Fermi gases
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2014'
...
---
_id: '2211'
abstract:
- lang: eng
text: 'In two-player finite-state stochastic games of partial observation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distribution over the successor states.
The game is played for infinitely many rounds and thus the players construct an
infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or positively (i.e., with positive probability), no matter the
strategy of the second player. We classify such games according to the information
and to the power of randomization available to the players. On the basis of information,
the game can be one-sided with either (a) player 1, or (b) player 2 having partial
observation (and the other player has perfect observation), or two-sided with
(c) both players having partial observation. On the basis of randomization, (a)
the players may not be allowed to use randomization (pure strategies), or (b)
they may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) they
may use full randomization. Our main results for pure strategies are as follows:
(1) For one-sided games with player 2 having perfect observation we show that
(in contrast to full randomized strategies) belief-based (subset-construction
based) strategies are not sufficient, and we present an exponential upper bound
on memory both for almost-sure and positive winning strategies; we show that the
problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the
explicit exponential construction. (2) For one-sided games with player 1 having
perfect observation we show that nonelementarymemory is both necessary and sufficient
for both almost-sure and positive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least nonelementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence result exhibit serious
flaws in previous results of the literature: we show a nonelementary memory lower
bound for almost-sure winning whereas an exponential upper bound was previously
claimed.'
article_number: '16'
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when
belief fails. ACM Transactions on Computational Logic (TOCL). 2014;15(2).
doi:10.1145/2579821'
apa: 'Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games:
How to win when belief fails. ACM Transactions on Computational Logic (TOCL).
ACM. https://doi.org/10.1145/2579821'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic
(TOCL). ACM, 2014. https://doi.org/10.1145/2579821.'
ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to
win when belief fails,” ACM Transactions on Computational Logic (TOCL),
vol. 15, no. 2. ACM, 2014.'
ista: 'Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to
win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2),
16.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic
(TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.'
short: K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15
(2014).
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2579821
external_id:
arxiv:
- '1107.2141'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2141
month: '04'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '4759'
quality_controlled: '1'
related_material:
record:
- id: '1903'
relation: earlier_version
status: public
- id: '2955'
relation: earlier_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2014'
...
---
_id: '2213'
abstract:
- lang: eng
text: We consider two-player partial-observation stochastic games on finitestate
graphs where player 1 has partial observation and player 2 has perfect observation.
The winning condition we study are ε-regular conditions specified as parity objectives.
The qualitative-analysis problem given a partial-observation stochastic game and
a parity objective asks whether there is a strategy to ensure that the objective
is satisfied with probability 1 (resp. positive probability). These qualitative-analysis
problems are known to be undecidable. However in many applications the relevant
question is the existence of finite-memory strategies, and the qualitative-analysis
problems under finite-memory strategies was recently shown to be decidable in
2EXPTIME.We improve the complexity and show that the qualitative-analysis problems
for partial-observation stochastic parity games under finite-memory strategies
are EXPTIME-complete; and also establish optimal (exponential) memory bounds for
finite-memory strategies required for qualitative analysis.
acknowledgement: 'This research was supported by European project Cassting (FP7-601148),
NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project
“ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096,
and by gift from Intel.'
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Sumit
full_name: Nain, Sumit
last_name: Nain
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: 'Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation
stochastic parity games with finite-memory strategies. In: Vol 8412. Springer;
2014:242-257. doi:10.1007/978-3-642-54830-7_16'
apa: 'Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity
of partial-observation stochastic parity games with finite-memory strategies (Vol.
8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science
and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The
Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,”
8412:242–57. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_16.
ieee: 'K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation
stochastic parity games with finite-memory strategies,” presented at the FoSSaCS:
Foundations of Software Science and Computation Structures, Grenoble, France,
2014, vol. 8412, pp. 242–257.'
ista: 'Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation
stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of
Software Science and Computation Structures, LNCS, vol. 8412, 242–257.'
mla: Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic
Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp.
242–57, doi:10.1007/978-3-642-54830-7_16.
short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
conference:
end_date: 2014-04-13
location: Grenoble, France
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2014-04-05
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:24:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54830-7_16
ec_funded: 1
external_id:
arxiv:
- '1401.3289'
intvolume: ' 8412'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1401.3289
month: '04'
oa: 1
oa_version: Preprint
page: 242 - 257
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_status: published
publisher: Springer
publist_id: '4757'
quality_controlled: '1'
related_material:
record:
- id: '5408'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: The complexity of partial-observation stochastic parity games with finite-memory
strategies
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8412
year: '2014'
...
---
_id: '2214'
abstract:
- lang: eng
text: A hallmark of immune cell trafficking is directional guidance via gradients
of soluble or surface bound chemokines. Vascular endothelial cells produce, transport
and deposit either their own chemokines or chemokines produced by the underlying
stroma. Endothelial heparan sulfate (HS) was suggested to be a critical scaffold
for these chemokine pools, but it is unclear how steep chemokine gradients are
sustained between the lumenal and ablumenal aspects of blood vessels. Addressing
this question by semi-quantitative immunostaining of HS moieties around blood
vessels with a pan anti-HS IgM mAb, we found a striking HS enrichment in the basal
lamina of resting and inflamed post capillary skin venules, as well as in high
endothelial venules (HEVs) of lymph nodes. Staining of skin vessels with a glycocalyx
probe further suggested that their lumenal glycocalyx contains much lower HS density
than their basolateral extracellular matrix (ECM). This polarized HS pattern was
observed also in isolated resting and inflamed microvascular dermal cells. Notably,
progressive skin inflammation resulted in massive ECM deposition and in further
HS enrichment around skin post capillary venules and their associated pericytes.
Inflammation-dependent HS enrichment was not compromised in mice deficient in
the main HS degrading enzyme, heparanase. Our results suggest that the blood vasculature
patterns steep gradients of HS scaffolds between their lumenal and basolateral
endothelial aspects, and that inflammatory processes can further enrich the HS
content nearby inflamed vessels. We propose that chemokine gradients between the
lumenal and ablumenal sides of vessels could be favored by these sharp HS scaffold
gradients.
acknowledgement: Michael Sixt's research is supported by the European Research Council
(ERC Starting grant).
article_number: e85699
author:
- first_name: Liat
full_name: Stoler Barak, Liat
last_name: Stoler Barak
- first_name: Christine
full_name: Moussion, Christine
id: 3356F664-F248-11E8-B48F-1D18A9856A87
last_name: Moussion
- first_name: Elias
full_name: Shezen, Elias
last_name: Shezen
- first_name: Miki
full_name: Hatzav, Miki
last_name: Hatzav
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Ronen
full_name: Alon, Ronen
last_name: Alon
citation:
ama: Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. Blood vessels
pattern heparan sulfate gradients between their apical and basolateral aspects.
PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085699
apa: Stoler Barak, L., Moussion, C., Shezen, E., Hatzav, M., Sixt, M. K., &
Alon, R. (2014). Blood vessels pattern heparan sulfate gradients between their
apical and basolateral aspects. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085699
chicago: Stoler Barak, Liat, Christine Moussion, Elias Shezen, Miki Hatzav, Michael
K Sixt, and Ronen Alon. “Blood Vessels Pattern Heparan Sulfate Gradients between
Their Apical and Basolateral Aspects.” PLoS One. Public Library of Science,
2014. https://doi.org/10.1371/journal.pone.0085699.
ieee: L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M. K. Sixt, and R. Alon,
“Blood vessels pattern heparan sulfate gradients between their apical and basolateral
aspects,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.
ista: Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. 2014. Blood
vessels pattern heparan sulfate gradients between their apical and basolateral
aspects. PLoS One. 9(1), e85699.
mla: Stoler Barak, Liat, et al. “Blood Vessels Pattern Heparan Sulfate Gradients
between Their Apical and Basolateral Aspects.” PLoS One, vol. 9, no. 1,
e85699, Public Library of Science, 2014, doi:10.1371/journal.pone.0085699.
short: L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M.K. Sixt, R. Alon, PLoS
One 9 (2014).
date_created: 2018-12-11T11:56:22Z
date_published: 2014-01-22T00:00:00Z
date_updated: 2021-01-12T06:56:03Z
day: '22'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1371/journal.pone.0085699
ec_funded: 1
file:
- access_level: open_access
checksum: 84a8033bda2e07e39405f5acc85f4eca
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:48Z
date_updated: 2020-07-14T12:45:33Z
file_id: '4646'
file_name: IST-2016-433-v1+1_journal.pone.0085699.pdf
file_size: 12634775
relation: main_file
file_date_updated: 2020-07-14T12:45:33Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25A76F58-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '289720'
name: Stromal Cell-immune Cell Interactions in Health and Disease
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4756'
pubrep_id: '433'
quality_controlled: '1'
scopus_import: 1
status: public
title: Blood vessels pattern heparan sulfate gradients between their apical and basolateral
aspects
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '2216'
abstract:
- lang: eng
text: The edit distance between two (untimed) traces is the minimum cost of a sequence
of edit operations (insertion, deletion, or substitution) needed to transform
one trace to the other. Edit distances have been extensively studied in the untimed
setting, and form the basis for approximate matching of sequences in different
domains such as coding theory, parsing, and speech recognition. In this paper,
we lift the study of edit distances from untimed languages to the timed setting.
We define an edit distance between timed words which incorporates both the edit
distance between the untimed words and the absolute difference in time stamps.
Our edit distance between two timed words is computable in polynomial time. Further,
we show that the edit distance between a timed word and a timed language generated
by a timed automaton, defined as the edit distance between the word and the closest
word in the language, is PSPACE-complete. While computing the edit distance between
two timed automata is undecidable, we show that the approximate version, where
we decide if the edit distance between two timed automata is either less than
a given parameter or more than δ away from the parameter, for δ > 0, can be
solved in exponential space and is EXPSPACE-hard. Our definitions and techniques
can be generalized to the setting of hybrid systems, and analogous decidability
results hold for rectangular automata.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata.
In: Springer; 2014:303-312. doi:10.1145/2562059.2562141'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance
for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation
and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit
Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed
automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin,
Germany, 2014, pp. 303–312.'
ista: 'Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata.
HSCC: Hybrid Systems - Computation and Control, 303–312.'
mla: Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer,
2014, pp. 303–12, doi:10.1145/2562059.2562141.
short: K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
conference:
end_date: 2017-04-17
location: Berlin, Germany
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2017-04-15
date_created: 2018-12-11T11:56:22Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:01Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2562059.2562141
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/citation.cfm?doid=2562059.2562141
month: '01'
oa: 1
oa_version: Submitted Version
page: 303 - 312
publication_status: published
publisher: Springer
publist_id: '4752'
quality_controlled: '1'
related_material:
record:
- id: '5409'
relation: earlier_version
status: public
status: public
title: Edit distance for timed automata
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2218'
abstract:
- lang: eng
text: While fixing concurrency bugs, program repair algorithms may introduce new
concurrency bugs. We present an algorithm that avoids such regressions. The solution
space is given by a set of program transformations we consider in the repair process.
These include reordering of instructions within a thread and inserting atomic
sections. The new algorithm learns a constraint on the space of candidate solutions,
from both positive examples (error-free traces) and counterexamples (error traces).
From each counterexample, the algorithm learns a constraint necessary to remove
the errors. From each positive examples, it learns a constraint that is necessary
in order to prevent the repair from turning the trace into an error trace. We
implemented the algorithm and evaluated it on simplified Linux device drivers
with known bugs.
alternative_title:
- LNCS
author:
- first_name: Pavol
full_name: Cerny, Pavol
last_name: Cerny
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Leonid
full_name: Ryzhyk, Leonid
last_name: Ryzhyk
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: 'Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free
synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:10.1007/978-3-319-08867-9_38'
apa: 'Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach,
T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584).
Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer.
https://doi.org/10.1007/978-3-319-08867-9_38'
chicago: Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and
Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer,
2014. https://doi.org/10.1007/978-3-319-08867-9_38.
ieee: 'P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free
synthesis for concurrency,” presented at the CAV: Computer Aided Verification,
Vienna, Austria, 2014, vol. 8559, pp. 568–584.'
ista: 'Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free
synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559,
568–584.'
mla: Cerny, Pavol, et al. Regression-Free Synthesis for Concurrency. Vol.
8559, Springer, 2014, pp. 568–84, doi:10.1007/978-3-319-08867-9_38.
short: P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer,
2014, pp. 568–584.
conference:
end_date: 2014-07-22
location: Vienna, Austria
name: 'CAV: Computer Aided Verification'
start_date: 2014-07-18
date_created: 2018-12-11T11:56:23Z
date_published: 2014-07-22T00:00:00Z
date_updated: 2023-09-07T11:57:01Z
day: '22'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-08867-9_38
ec_funded: 1
file:
- access_level: open_access
checksum: a631d3105509f239724644e77a1212e2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:14Z
date_updated: 2020-07-14T12:45:33Z
file_id: '4995'
file_name: IST-2014-297-v1+1_cav14-final.pdf
file_size: 416732
relation: main_file
- access_level: open_access
checksum: f8b0f748cc9fa697ca992cc56c87bc4e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:15Z
date_updated: 2020-07-14T12:45:33Z
file_id: '4996'
file_name: IST-2014-297-v2+1_cav14-final2.pdf
file_size: 616293
relation: main_file
file_date_updated: 2020-07-14T12:45:33Z
has_accepted_license: '1'
intvolume: ' 8559'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38
month: '07'
oa: 1
oa_version: Submitted Version
page: 568 - 584
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
isbn:
- 978-331908866-2
publication_status: published
publisher: Springer
publist_id: '4749'
pubrep_id: '297'
quality_controlled: '1'
related_material:
record:
- id: '1130'
relation: dissertation_contains
status: public
status: public
title: Regression-free synthesis for concurrency
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8559
year: '2014'
...
---
_id: '2219'
abstract:
- lang: eng
text: Recently, Döttling et al. (ASIACRYPT 2012) proposed the first chosen-ciphertext
(IND-CCA) secure public-key encryption scheme from the learning parity with noise
(LPN) assumption. In this work we give an alternative scheme which is conceptually
simpler and more efficient. At the core of our construction is a trapdoor technique
originally proposed for lattices by Micciancio and Peikert (EUROCRYPT 2012), which
we adapt to the LPN setting. The main technical tool is a new double-trapdoor
mechanism, together with a trapdoor switching lemma based on a computational variant
of the leftover hash lemma.
alternative_title:
- LNCS
author:
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Daniel
full_name: Masny, Daniel
last_name: Masny
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Kiltz E, Masny D, Pietrzak KZ. Simple chosen-ciphertext security from low
noise LPN. In: Vol 8383. Springer; 2014:1-18. doi:10.1007/978-3-642-54631-0_1'
apa: 'Kiltz, E., Masny, D., & Pietrzak, K. Z. (2014). Simple chosen-ciphertext
security from low noise LPN (Vol. 8383, pp. 1–18). Presented at the IACR: International
Conference on Practice and Theory in Public-Key Cryptography, Springer. https://doi.org/10.1007/978-3-642-54631-0_1'
chicago: Kiltz, Eike, Daniel Masny, and Krzysztof Z Pietrzak. “Simple Chosen-Ciphertext
Security from Low Noise LPN,” 8383:1–18. Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_1.
ieee: 'E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security
from low noise LPN,” presented at the IACR: International Conference on Practice
and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18.'
ista: 'Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from
low noise LPN. IACR: International Conference on Practice and Theory in Public-Key
Cryptography, LNCS, vol. 8383, 1–18.'
mla: Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN.
Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.
short: E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.
conference:
name: 'IACR: International Conference on Practice and Theory in Public-Key Cryptography'
date_created: 2018-12-11T11:56:24Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2021-01-12T06:56:05Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-54631-0_1
intvolume: ' 8383'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/401
month: '03'
oa: 1
oa_version: Submitted Version
page: 1 - 18
publication_identifier:
isbn:
- 978-364254630-3
publication_status: published
publisher: Springer
publist_id: '4748'
quality_controlled: '1'
scopus_import: 1
status: public
title: Simple chosen-ciphertext security from low noise LPN
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8383
year: '2014'
...
---
_id: '2220'
abstract:
- lang: eng
text: In this issue of Chemistry & Biology, Cokol and colleagues report a systematic
study of drug interactions between antifungal compounds. Suppressive drug interactions
occur more frequently than previously realized and come in different flavors with
interesting implications.
author:
- first_name: Marjon
full_name: De Vos, Marjon
id: 3111FFAC-F248-11E8-B48F-1D18A9856A87
last_name: De Vos
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: de Vos M, Bollenbach MT. Suppressive drug interactions between antifungals.
Chemistry and Biology. 2014;21(4):439-440. doi:10.1016/j.chembiol.2014.04.004
apa: de Vos, M., & Bollenbach, M. T. (2014). Suppressive drug interactions between
antifungals. Chemistry and Biology. Cell Press. https://doi.org/10.1016/j.chembiol.2014.04.004
chicago: Vos, Marjon de, and Mark Tobias Bollenbach. “Suppressive Drug Interactions
between Antifungals.” Chemistry and Biology. Cell Press, 2014. https://doi.org/10.1016/j.chembiol.2014.04.004.
ieee: M. de Vos and M. T. Bollenbach, “Suppressive drug interactions between antifungals,”
Chemistry and Biology, vol. 21, no. 4. Cell Press, pp. 439–440, 2014.
ista: de Vos M, Bollenbach MT. 2014. Suppressive drug interactions between antifungals.
Chemistry and Biology. 21(4), 439–440.
mla: de Vos, Marjon, and Mark Tobias Bollenbach. “Suppressive Drug Interactions
between Antifungals.” Chemistry and Biology, vol. 21, no. 4, Cell Press,
2014, pp. 439–40, doi:10.1016/j.chembiol.2014.04.004.
short: M. de Vos, M.T. Bollenbach, Chemistry and Biology 21 (2014) 439–440.
date_created: 2018-12-11T11:56:24Z
date_published: 2014-04-24T00:00:00Z
date_updated: 2021-01-12T06:56:06Z
day: '24'
department:
- _id: ToBo
doi: 10.1016/j.chembiol.2014.04.004
external_id:
pmid:
- '24766845'
intvolume: ' 21'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/24766845
month: '04'
oa: 1
oa_version: Published Version
page: 439 - 440
pmid: 1
publication: Chemistry and Biology
publication_identifier:
issn:
- '10745521'
publication_status: published
publisher: Cell Press
publist_id: '4747'
quality_controlled: '1'
scopus_import: 1
status: public
title: Suppressive drug interactions between antifungals
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2014'
...
---
_id: '2223'
abstract:
- lang: eng
text: Correct positioning of membrane proteins is an essential process in eukaryotic
organisms. The plant hormone auxin is distributed through intercellular transport
and triggers various cellular responses. Auxin transporters of the PIN-FORMED
(PIN) family localize asymmetrically at the plasma membrane (PM) and mediate the
directional transport of auxin between cells. A fungal toxin, brefeldin A (BFA),
inhibits a subset of guanine nucleotide exchange factors for ADP-ribosylation
factor small GTPases (ARF GEFs) including GNOM, which plays a major role in localization
of PIN1 predominantly to the basal side of the PM. The Arabidopsis genome encodes
19 ARF-related putative GTPases. However, ARF components involved in PIN1 localization
have been genetically poorly defined. Using a fluorescence imaging-based forward
genetic approach, we identified an Arabidopsis mutant, bfa-visualized exocytic
trafficking defective1 (bex1), in which PM localization of PIN1-green fluorescent
protein (GFP) as well as development is hypersensitive to BFA. We found that in
bex1 a member of the ARF1 gene family, ARF1A1C, was mutated. ARF1A1C localizes
to the trans-Golgi network/early endosome and Golgi apparatus, acts synergistically
to BEN1/MIN7 ARF GEF and is important for PIN recycling to the PM. Consistent
with the developmental importance of PIN proteins, functional interference with
ARF1 resulted in an impaired auxin response gradient and various developmental
defects including embryonic patterning defects and growth arrest. Our results
show that ARF1A1C is essential for recycling of PIN auxin transporters and for
various auxin-dependent developmental processes.
author:
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Saeko
full_name: Kitakura, Saeko
last_name: Kitakura
- first_name: Mugurel
full_name: Feraru, Mugurel
last_name: Feraru
- first_name: Michiko
full_name: Sasabe, Michiko
last_name: Sasabe
- first_name: Tomomi
full_name: Ishikawa, Tomomi
last_name: Ishikawa
- first_name: Jürgen
full_name: Kleine Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Tatsuo
full_name: Kakimoto, Tatsuo
last_name: Kakimoto
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Tanaka H, Nodzyński T, Kitakura S, et al. BEX1/ARF1A1C is required for BFA-sensitive
recycling of PIN auxin transporters and auxin-mediated development in arabidopsis.
Plant and Cell Physiology. 2014;55(4):737-749. doi:10.1093/pcp/pct196
apa: Tanaka, H., Nodzyński, T., Kitakura, S., Feraru, M., Sasabe, M., Ishikawa,
T., … Friml, J. (2014). BEX1/ARF1A1C is required for BFA-sensitive recycling of
PIN auxin transporters and auxin-mediated development in arabidopsis. Plant
and Cell Physiology. Oxford University Press. https://doi.org/10.1093/pcp/pct196
chicago: Tanaka, Hirokazu, Tomasz Nodzyński, Saeko Kitakura, Mugurel Feraru, Michiko
Sasabe, Tomomi Ishikawa, Jürgen Kleine Vehn, Tatsuo Kakimoto, and Jiří Friml.
“BEX1/ARF1A1C Is Required for BFA-Sensitive Recycling of PIN Auxin Transporters
and Auxin-Mediated Development in Arabidopsis.” Plant and Cell Physiology.
Oxford University Press, 2014. https://doi.org/10.1093/pcp/pct196.
ieee: H. Tanaka et al., “BEX1/ARF1A1C is required for BFA-sensitive recycling
of PIN auxin transporters and auxin-mediated development in arabidopsis,” Plant
and Cell Physiology, vol. 55, no. 4. Oxford University Press, pp. 737–749,
2014.
ista: Tanaka H, Nodzyński T, Kitakura S, Feraru M, Sasabe M, Ishikawa T, Kleine
Vehn J, Kakimoto T, Friml J. 2014. BEX1/ARF1A1C is required for BFA-sensitive
recycling of PIN auxin transporters and auxin-mediated development in arabidopsis.
Plant and Cell Physiology. 55(4), 737–749.
mla: Tanaka, Hirokazu, et al. “BEX1/ARF1A1C Is Required for BFA-Sensitive Recycling
of PIN Auxin Transporters and Auxin-Mediated Development in Arabidopsis.” Plant
and Cell Physiology, vol. 55, no. 4, Oxford University Press, 2014, pp. 737–49,
doi:10.1093/pcp/pct196.
short: H. Tanaka, T. Nodzyński, S. Kitakura, M. Feraru, M. Sasabe, T. Ishikawa,
J. Kleine Vehn, T. Kakimoto, J. Friml, Plant and Cell Physiology 55 (2014) 737–749.
date_created: 2018-12-11T11:56:25Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:56:07Z
day: '01'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1093/pcp/pct196
ec_funded: 1
file:
- access_level: open_access
checksum: b781a76b32ac35a520256453c3ba9433
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:25Z
date_updated: 2020-07-14T12:45:34Z
file_id: '5076'
file_name: IST-2016-431-v1+1_Plant_Cell_Physiol-2014-Tanaka-737-49.pdf
file_size: 2028111
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 55'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://repository.ist.ac.at/id/eprint/431
month: '04'
oa: 1
oa_version: Published Version
page: 737 - 749
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
- _id: 256BDAB0-B435-11E9-9278-68D0E5697425
name: Innovationsförderung in der Grenzregion Österreich – Tschechische Republik
durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur
publication: Plant and Cell Physiology
publication_identifier:
issn:
- '00320781'
publication_status: published
publisher: Oxford University Press
publist_id: '4741'
pubrep_id: '431'
quality_controlled: '1'
scopus_import: 1
status: public
title: BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters
and auxin-mediated development in arabidopsis
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2014'
...
---
_id: '2225'
abstract:
- lang: eng
text: "We consider sample covariance matrices of the form X∗X, where X is an M×N
matrix with independent random entries. We prove the isotropic local Marchenko-Pastur
law, i.e. we prove that the resolvent (X∗X−z)−1 converges to a multiple of the
identity in the sense of quadratic forms. More precisely, we establish sharp high-probability
bounds on the quantity ⟨v,(X∗X−z)−1w⟩−⟨v,w⟩m(z), where m is the Stieltjes transform
of the Marchenko-Pastur law and v,w∈CN. We require the logarithms of the dimensions
M and N to be comparable. Our result holds down to scales Iz≥N−1+ε and throughout
the entire spectrum away from 0. We also prove analogous results for generalized
Wigner matrices.\r\n"
article_number: '33'
author:
- first_name: Alex
full_name: Bloemendal, Alex
last_name: Bloemendal
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Antti
full_name: Knowles, Antti
last_name: Knowles
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Bloemendal A, Erdös L, Knowles A, Yau H, Yin J. Isotropic local laws for sample
covariance and generalized Wigner matrices. Electronic Journal of Probability.
2014;19. doi:10.1214/EJP.v19-3054
apa: Bloemendal, A., Erdös, L., Knowles, A., Yau, H., & Yin, J. (2014). Isotropic
local laws for sample covariance and generalized Wigner matrices. Electronic
Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/EJP.v19-3054
chicago: Bloemendal, Alex, László Erdös, Antti Knowles, Horng Yau, and Jun Yin.
“Isotropic Local Laws for Sample Covariance and Generalized Wigner Matrices.”
Electronic Journal of Probability. Institute of Mathematical Statistics,
2014. https://doi.org/10.1214/EJP.v19-3054.
ieee: A. Bloemendal, L. Erdös, A. Knowles, H. Yau, and J. Yin, “Isotropic local
laws for sample covariance and generalized Wigner matrices,” Electronic Journal
of Probability, vol. 19. Institute of Mathematical Statistics, 2014.
ista: Bloemendal A, Erdös L, Knowles A, Yau H, Yin J. 2014. Isotropic local laws
for sample covariance and generalized Wigner matrices. Electronic Journal of Probability.
19, 33.
mla: Bloemendal, Alex, et al. “Isotropic Local Laws for Sample Covariance and Generalized
Wigner Matrices.” Electronic Journal of Probability, vol. 19, 33, Institute
of Mathematical Statistics, 2014, doi:10.1214/EJP.v19-3054.
short: A. Bloemendal, L. Erdös, A. Knowles, H. Yau, J. Yin, Electronic Journal of
Probability 19 (2014).
date_created: 2018-12-11T11:56:25Z
date_published: 2014-03-15T00:00:00Z
date_updated: 2021-01-12T06:56:07Z
day: '15'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/EJP.v19-3054
ec_funded: 1
file:
- access_level: open_access
checksum: 7eb297ff367a2ee73b21b6dd1e1948e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:06Z
date_updated: 2020-07-14T12:45:34Z
file_id: '5055'
file_name: IST-2016-427-v1+1_3054-16624-4-PB.pdf
file_size: 810150
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 19'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Journal of Probability
publication_identifier:
issn:
- '10836489'
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '4739'
pubrep_id: '427'
quality_controlled: '1'
status: public
title: Isotropic local laws for sample covariance and generalized Wigner matrices
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2014'
...
---
_id: '2226'
abstract:
- lang: eng
text: Coriolis force effects on shear flows are important in geophysical and astrophysical
contexts. We report a study on the linear stability and the transient energy growth
of the plane Couette flow with system rotation perpendicular to the shear direction.
External rotation causes linear instability. At small rotation rates, the onset
of linear instability scales inversely with the rotation rate and the optimal
transient growth in the linearly stable region is slightly enhanced ∼Re2. The
corresponding optimal initial perturbations are characterized by roll structures
inclined in the streamwise direction and are twisted under external rotation.
At large rotation rates, the transient growth is significantly inhibited and hence
linear stability analysis is a reliable indicator for instability.
article_number: '013001'
author:
- first_name: Liang
full_name: Shi, Liang
last_name: Shi
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Andreas
full_name: Tilgner, Andreas
last_name: Tilgner
citation:
ama: Shi L, Hof B, Tilgner A. Transient growth of Ekman-Couette flow. Physical
Review E Statistical Nonlinear and Soft Matter Physics. 2014;89(1). doi:10.1103/PhysRevE.89.013001
apa: Shi, L., Hof, B., & Tilgner, A. (2014). Transient growth of Ekman-Couette
flow. Physical Review E Statistical Nonlinear and Soft Matter Physics.
American Institute of Physics. https://doi.org/10.1103/PhysRevE.89.013001
chicago: Shi, Liang, Björn Hof, and Andreas Tilgner. “Transient Growth of Ekman-Couette
Flow.” Physical Review E Statistical Nonlinear and Soft Matter Physics.
American Institute of Physics, 2014. https://doi.org/10.1103/PhysRevE.89.013001.
ieee: L. Shi, B. Hof, and A. Tilgner, “Transient growth of Ekman-Couette flow,”
Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 89,
no. 1. American Institute of Physics, 2014.
ista: Shi L, Hof B, Tilgner A. 2014. Transient growth of Ekman-Couette flow. Physical
Review E Statistical Nonlinear and Soft Matter Physics. 89(1), 013001.
mla: Shi, Liang, et al. “Transient Growth of Ekman-Couette Flow.” Physical Review
E Statistical Nonlinear and Soft Matter Physics, vol. 89, no. 1, 013001, American
Institute of Physics, 2014, doi:10.1103/PhysRevE.89.013001.
short: L. Shi, B. Hof, A. Tilgner, Physical Review E Statistical Nonlinear and Soft
Matter Physics 89 (2014).
date_created: 2018-12-11T11:56:26Z
date_published: 2014-01-06T00:00:00Z
date_updated: 2021-01-12T06:56:08Z
day: '06'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.89.013001
intvolume: ' 89'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1312.5095
month: '01'
oa: 1
oa_version: Submitted Version
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Physical Review E Statistical Nonlinear and Soft Matter Physics
publication_identifier:
issn:
- '15393755'
publication_status: published
publisher: American Institute of Physics
publist_id: '4737'
quality_controlled: '1'
scopus_import: 1
status: public
title: Transient growth of Ekman-Couette flow
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2014'
...
---
_id: '2228'
abstract:
- lang: eng
text: Fast-spiking, parvalbumin-expressing GABAergic interneurons, a large proportion
of which are basket cells (BCs), have a key role in feedforward and feedback inhibition,
gamma oscillations and complex information processing. For these functions, fast
propagation of action potentials (APs) from the soma to the presynaptic terminals
is important. However, the functional properties of interneuron axons remain elusive.
We examined interneuron axons by confocally targeted subcellular patch-clamp recording
in rat hippocampal slices. APs were initiated in the proximal axon ∼20 μm from
the soma and propagated to the distal axon with high reliability and speed. Subcellular
mapping revealed a stepwise increase of Na^+ conductance density from the soma
to the proximal axon, followed by a further gradual increase in the distal axon.
Active cable modeling and experiments with partial channel block revealed that
low axonal Na^+ conductance density was sufficient for reliability, but high Na^+
density was necessary for both speed of propagation and fast-spiking AP phenotype.
Our results suggest that a supercritical density of Na^+ channels compensates
for the morphological properties of interneuron axons (small segmental diameter,
extensive branching and high bouton density), ensuring fast AP propagation and
high-frequency repetitive firing.
author:
- first_name: Hua
full_name: Hu, Hua
id: 4AC0145C-F248-11E8-B48F-1D18A9856A87
last_name: Hu
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Hu H, Jonas PM. A supercritical density of Na^+ channels ensures fast signaling
in GABAergic interneuron axons. Nature Neuroscience. 2014;17(5):686-693.
doi:10.1038/nn.3678
apa: Hu, H., & Jonas, P. M. (2014). A supercritical density of Na^+ channels
ensures fast signaling in GABAergic interneuron axons. Nature Neuroscience.
Nature Publishing Group. https://doi.org/10.1038/nn.3678
chicago: Hu, Hua, and Peter M Jonas. “A Supercritical Density of Na^+ Channels Ensures
Fast Signaling in GABAergic Interneuron Axons.” Nature Neuroscience. Nature
Publishing Group, 2014. https://doi.org/10.1038/nn.3678.
ieee: H. Hu and P. M. Jonas, “A supercritical density of Na^+ channels ensures fast
signaling in GABAergic interneuron axons,” Nature Neuroscience, vol. 17,
no. 5. Nature Publishing Group, pp. 686–693, 2014.
ista: Hu H, Jonas PM. 2014. A supercritical density of Na^+ channels ensures fast
signaling in GABAergic interneuron axons. Nature Neuroscience. 17(5), 686–693.
mla: Hu, Hua, and Peter M. Jonas. “A Supercritical Density of Na^+ Channels Ensures
Fast Signaling in GABAergic Interneuron Axons.” Nature Neuroscience, vol.
17, no. 5, Nature Publishing Group, 2014, pp. 686–93, doi:10.1038/nn.3678.
short: H. Hu, P.M. Jonas, Nature Neuroscience 17 (2014) 686–693.
date_created: 2018-12-11T11:56:26Z
date_published: 2014-03-23T00:00:00Z
date_updated: 2021-01-12T06:56:08Z
day: '23'
department:
- _id: PeJo
doi: 10.1038/nn.3678
ec_funded: 1
intvolume: ' 17'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4286295/
month: '03'
oa: 1
oa_version: Submitted Version
page: 686-693
project:
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
publication: Nature Neuroscience
publication_identifier:
issn:
- '10976256'
publication_status: published
publisher: Nature Publishing Group
publist_id: '4733'
quality_controlled: '1'
scopus_import: 1
status: public
title: A supercritical density of Na^+ channels ensures fast signaling in GABAergic
interneuron axons
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2014'
...
---
_id: '2229'
abstract:
- lang: eng
text: The distance between Ca^2+ channels and release sensors determines the speed
and efficacy of synaptic transmission. Tight "nanodomain" channel-sensor
coupling initiates transmitter release at synapses in the mature brain, whereas
loose "microdomain" coupling appears restricted to early developmental
stages. To probe the coupling configuration at a plastic synapse in the mature
central nervous system, we performed paired recordings between mossy fiber terminals
and CA3 pyramidal neurons in rat hippocampus. Millimolar concentrations of both
the fast Ca^2+ chelator BAPTA [1,2-bis(2-aminophenoxy)ethane- N,N, N′,N′-tetraacetic
acid] and the slow chelator EGTA efficiently suppressed transmitter release, indicating
loose coupling between Ca^2+ channels and release sensors. Loose coupling enabled
the control of initial release probability by fast endogenous Ca^2+ buffers and
the generation of facilitation by buffer saturation. Thus, loose coupling provides
the molecular framework for presynaptic plasticity.
author:
- first_name: Nicholas
full_name: Vyleta, Nicholas
id: 36C4978E-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Vyleta N, Jonas PM. Loose coupling between Ca^2+ channels and release sensors
at a plastic hippocampal synapse. Science. 2014;343(6171):665-670. doi:10.1126/science.1244811
apa: Vyleta, N., & Jonas, P. M. (2014). Loose coupling between Ca^2+ channels
and release sensors at a plastic hippocampal synapse. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.1244811
chicago: Vyleta, Nicholas, and Peter M Jonas. “Loose Coupling between Ca^2+ Channels
and Release Sensors at a Plastic Hippocampal Synapse.” Science. American
Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1244811.
ieee: N. Vyleta and P. M. Jonas, “Loose coupling between Ca^2+ channels and release
sensors at a plastic hippocampal synapse,” Science, vol. 343, no. 6171.
American Association for the Advancement of Science, pp. 665–670, 2014.
ista: Vyleta N, Jonas PM. 2014. Loose coupling between Ca^2+ channels and release
sensors at a plastic hippocampal synapse. Science. 343(6171), 665–670.
mla: Vyleta, Nicholas, and Peter M. Jonas. “Loose Coupling between Ca^2+ Channels
and Release Sensors at a Plastic Hippocampal Synapse.” Science, vol. 343,
no. 6171, American Association for the Advancement of Science, 2014, pp. 665–70,
doi:10.1126/science.1244811.
short: N. Vyleta, P.M. Jonas, Science 343 (2014) 665–670.
date_created: 2018-12-11T11:56:27Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2021-01-12T06:56:09Z
day: '01'
department:
- _id: PeJo
doi: 10.1126/science.1244811
ec_funded: 1
intvolume: ' 343'
issue: '6171'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617475/
month: '02'
oa: 1
oa_version: Submitted Version
page: 665 - 670
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: Science
publication_identifier:
issn:
- '00368075'
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '4732'
quality_controlled: '1'
scopus_import: 1
status: public
title: Loose coupling between Ca^2+ channels and release sensors at a plastic hippocampal
synapse
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 343
year: '2014'
...
---
_id: '2230'
abstract:
- lang: eng
text: Intracellular electrophysiological recordings provide crucial insights into
elementary neuronal signals such as action potentials and synaptic currents. Analyzing
and interpreting these signals is essential for a quantitative understanding of
neuronal information processing, and requires both fast data visualization and
ready access to complex analysis routines. To achieve this goal, we have developed
Stimfit, a free software package for cellular neurophysiology with a Python scripting
interface and a built-in Python shell. The program supports most standard file
formats for cellular neurophysiology and other biomedical signals through the
Biosig library. To quantify and interpret the activity of single neurons and communication
between neurons, the program includes algorithms to characterize the kinetics
of presynaptic action potentials and postsynaptic currents, estimate latencies
between pre- and postsynaptic events, and detect spontaneously occurring events.
We validate and benchmark these algorithms, give estimation errors, and provide
sample use cases, showing that Stimfit represents an efficient, accessible and
extensible way to accurately analyze and interpret neuronal signals.
article_number: '16'
author:
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Christoph
full_name: Schmidt Hieber, Christoph
last_name: Schmidt Hieber
citation:
ama: 'Guzmán J, Schlögl A, Schmidt Hieber C. Stimfit: Quantifying electrophysiological
data with Python. Frontiers in Neuroinformatics. 2014;8(FEB). doi:10.3389/fninf.2014.00016'
apa: 'Guzmán, J., Schlögl, A., & Schmidt Hieber, C. (2014). Stimfit: Quantifying
electrophysiological data with Python. Frontiers in Neuroinformatics. Frontiers
Research Foundation. https://doi.org/10.3389/fninf.2014.00016'
chicago: 'Guzmán, José, Alois Schlögl, and Christoph Schmidt Hieber. “Stimfit: Quantifying
Electrophysiological Data with Python.” Frontiers in Neuroinformatics.
Frontiers Research Foundation, 2014. https://doi.org/10.3389/fninf.2014.00016.'
ieee: 'J. Guzmán, A. Schlögl, and C. Schmidt Hieber, “Stimfit: Quantifying electrophysiological
data with Python,” Frontiers in Neuroinformatics, vol. 8, no. FEB. Frontiers
Research Foundation, 2014.'
ista: 'Guzmán J, Schlögl A, Schmidt Hieber C. 2014. Stimfit: Quantifying electrophysiological
data with Python. Frontiers in Neuroinformatics. 8(FEB), 16.'
mla: 'Guzmán, José, et al. “Stimfit: Quantifying Electrophysiological Data with
Python.” Frontiers in Neuroinformatics, vol. 8, no. FEB, 16, Frontiers
Research Foundation, 2014, doi:10.3389/fninf.2014.00016.'
short: J. Guzmán, A. Schlögl, C. Schmidt Hieber, Frontiers in Neuroinformatics 8
(2014).
date_created: 2018-12-11T11:56:27Z
date_published: 2014-02-21T00:00:00Z
date_updated: 2021-01-12T06:56:09Z
day: '21'
ddc:
- '570'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.3389/fninf.2014.00016
file:
- access_level: open_access
checksum: eeca00bba7232ff7d27db83321f6ea30
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:17Z
date_updated: 2020-07-14T12:45:34Z
file_id: '4935'
file_name: IST-2016-425-v1+1_fninf-08-00016.pdf
file_size: 2883372
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8'
issue: FEB
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
publication: Frontiers in Neuroinformatics
publication_identifier:
issn:
- '16625196'
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '4731'
pubrep_id: '425'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Stimfit: Quantifying electrophysiological data with Python'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2014'
...