---
_id: '948'
abstract:
- lang: eng
text: Experience constantly shapes neural circuits through a variety of plasticity
mechanisms. While the functional roles of some plasticity mechanisms are well-understood,
it remains unclear how changes in neural excitability contribute to learning.
Here, we develop a normative interpretation of intrinsic plasticity (IP) as a
key component of unsupervised learning. We introduce a novel generative mixture
model that accounts for the class-specific statistics of stimulus intensities,
and we derive a neural circuit that learns the input classes and their intensities.
We will analytically show that inference and learning for our generative model
can be achieved by a neural circuit with intensity-sensitive neurons equipped
with a specific form of IP. Numerical experiments verify our analytical derivations
and show robust behavior for artificial and natural stimuli. Our results link
IP to non-trivial input statistics, in particular the statistics of stimulus intensities
for classes to which a neuron is sensitive. More generally, our work paves the
way toward new classification algorithms that are robust to intensity variations.
acknowledgement: DFG Cluster of Excellence EXC 1077/1 (Hearing4all) and LU 1196/5-1
(JL and TM), People Programme (Marie Curie Actions) FP7/2007-2013 grant agreement
no. 291734 (CS)
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
author:
- first_name: Travis
full_name: Monk, Travis
last_name: Monk
- first_name: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
- first_name: Jörg
full_name: Lücke, Jörg
last_name: Lücke
citation:
ama: 'Monk T, Savin C, Lücke J. Neurons equipped with intrinsic plasticity learn
stimulus intensity statistics. In: Vol 29. Neural Information Processing Systems
Foundation; 2016:4285-4293.'
apa: 'Monk, T., Savin, C., & Lücke, J. (2016). Neurons equipped with intrinsic
plasticity learn stimulus intensity statistics (Vol. 29, pp. 4285–4293). Presented
at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information
Processing Systems Foundation.'
chicago: Monk, Travis, Cristina Savin, and Jörg Lücke. “Neurons Equipped with Intrinsic
Plasticity Learn Stimulus Intensity Statistics,” 29:4285–93. Neural Information
Processing Systems Foundation, 2016.
ieee: 'T. Monk, C. Savin, and J. Lücke, “Neurons equipped with intrinsic plasticity
learn stimulus intensity statistics,” presented at the NIPS: Neural Information
Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 4285–4293.'
ista: 'Monk T, Savin C, Lücke J. 2016. Neurons equipped with intrinsic plasticity
learn stimulus intensity statistics. NIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 29, 4285–4293.'
mla: Monk, Travis, et al. Neurons Equipped with Intrinsic Plasticity Learn Stimulus
Intensity Statistics. Vol. 29, Neural Information Processing Systems Foundation,
2016, pp. 4285–93.
short: T. Monk, C. Savin, J. Lücke, in:, Neural Information Processing Systems Foundation,
2016, pp. 4285–4293.
conference:
end_date: 2016-12-10
location: Barcelona, Spain
name: 'NIPS: Neural Information Processing Systems'
start_date: 2016-12-05
date_created: 2018-12-11T11:49:21Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2026-09-17T13:00:27Z
day: '01'
department:
- _id: GaTk
ec_funded: 1
intvolume: ' 29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.nips.cc/paper/6582-neurons-equipped-with-intrinsic-plasticity-learn-stimulus-intensity-statistics
month: '01'
oa: 1
oa_version: None
page: 4285 - 4293
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '6469'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Neurons equipped with intrinsic plasticity learn stimulus intensity statistics
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '12903'
article_processing_charge: No
author:
- 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: Stephan
full_name: Stadlbauer, Stephan
id: 4D0BC184-F248-11E8-B48F-1D18A9856A87
last_name: Stadlbauer
citation:
ama: 'Schlögl A, Stadlbauer S. High performance computing at IST Austria: Modelling
the human hippocampus. In: AHPC16 - Austrian HPC Meeting 2016. VSC - Vienna
Scientific Cluster; 2016:37.'
apa: 'Schlögl, A., & Stadlbauer, S. (2016). High performance computing at IST
Austria: Modelling the human hippocampus. In AHPC16 - Austrian HPC Meeting
2016 (p. 37). Grundlsee, Austria: VSC - Vienna Scientific Cluster.'
chicago: 'Schlögl, Alois, and Stephan Stadlbauer. “High Performance Computing at
IST Austria: Modelling the Human Hippocampus.” In AHPC16 - Austrian HPC Meeting
2016, 37. VSC - Vienna Scientific Cluster, 2016.'
ieee: 'A. Schlögl and S. Stadlbauer, “High performance computing at IST Austria:
Modelling the human hippocampus,” in AHPC16 - Austrian HPC Meeting 2016,
Grundlsee, Austria, 2016, p. 37.'
ista: 'Schlögl A, Stadlbauer S. 2016. High performance computing at IST Austria:
Modelling the human hippocampus. AHPC16 - Austrian HPC Meeting 2016. AHPC: Austrian
HPC Meeting, 37.'
mla: 'Schlögl, Alois, and Stephan Stadlbauer. “High Performance Computing at IST
Austria: Modelling the Human Hippocampus.” AHPC16 - Austrian HPC Meeting 2016,
VSC - Vienna Scientific Cluster, 2016, p. 37.'
short: A. Schlögl, S. Stadlbauer, in:, AHPC16 - Austrian HPC Meeting 2016, VSC -
Vienna Scientific Cluster, 2016, p. 37.
conference:
end_date: 2016-02-24
location: Grundlsee, Austria
name: 'AHPC: Austrian HPC Meeting'
start_date: 2016-02-22
corr_author: '1'
date_created: 2023-05-05T12:54:47Z
date_published: 2016-02-24T00:00:00Z
date_updated: 2026-10-14T09:40:16Z
day: '24'
ddc:
- '000'
department:
- _id: ScienComp
- _id: PeJo
file:
- access_level: open_access
checksum: 4a7b00362e81358d568f5e216fa03c3e
content_type: application/pdf
creator: dernst
date_created: 2023-05-16T07:03:56Z
date_updated: 2023-05-16T07:03:56Z
file_id: '12968'
file_name: 2016_AHPC_Schloegl.pdf
file_size: 1073523
relation: main_file
success: 1
file_date_updated: 2023-05-16T07:03:56Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://asc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc16/BOOKLET_AHPC16.pdf
month: '02'
oa: 1
oa_version: Published Version
page: '37'
publication: AHPC16 - Austrian HPC Meeting 2016
publication_status: published
publisher: VSC - Vienna Scientific Cluster
quality_controlled: '1'
status: public
title: 'High performance computing at IST Austria: Modelling the human hippocampus'
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1100'
abstract:
- lang: eng
text: During metazoan development, the temporal pattern of morphogen signaling is
critical for organizing cell fates in space and time. Yet, tools for temporally
controlling morphogen signaling within the embryo are still scarce. Here, we developed
a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal
signaling affects cell fate specification during zebrafish gastrulation. By using
this receptor to manipulate the duration of Nodal signaling in vivo by light,
we show that extended Nodal signaling within the organizer promotes prechordal
plate specification and suppresses endoderm differentiation. Endoderm differentiation
is suppressed by extended Nodal signaling inducing expression of the transcriptional
repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains
Nodal signaling from upregulating the endoderm differentiation gene sox17 within
these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical
role of Nodal signaling duration for organizer cell fate specification during
gastrulation.
acknowledged_ssus:
- _id: SSU
acknowledgement: 'We are grateful to members of the C.-P.H. and H.J. labs for discussions,
R. Hauschild and the different Scientific Service Units at IST Austria for technical
help, M. Dravecka for performing initial experiments, A. Schier for reading an earlier
version of the manuscript, K.W. Rogers for technical help, and C. Hill, A. Bruce,
and L. Solnica-Krezel for sending plasmids. This work was supported by grants from
the Austrian Science Foundation (FWF): (T560-B17) and (I 812-B12) to V.R. and C.-P.H.,
and from the European Union (EU FP7): (6275) to H.J. A.I.-P. is supported by a Ramon
Areces fellowship.'
article_processing_charge: No
author:
- first_name: Keisuke
full_name: Sako, Keisuke
id: 3BED66BE-F248-11E8-B48F-1D18A9856A87
last_name: Sako
orcid: 0000-0002-6453-8075
- first_name: Saurabh
full_name: Pradhan, Saurabh
last_name: Pradhan
- first_name: Vanessa
full_name: Barone, Vanessa
id: 419EECCC-F248-11E8-B48F-1D18A9856A87
last_name: Barone
orcid: 0000-0003-2676-3367
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Patrick
full_name: Mueller, Patrick
last_name: Mueller
- first_name: Verena
full_name: Ruprecht, Verena
id: 4D71A03A-F248-11E8-B48F-1D18A9856A87
last_name: Ruprecht
orcid: 0000-0003-4088-8633
- first_name: Daniel
full_name: Capek, Daniel
id: 31C42484-F248-11E8-B48F-1D18A9856A87
last_name: Capek
orcid: 0000-0001-5199-9940
- first_name: Sanjeev
full_name: Galande, Sanjeev
last_name: Galande
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Sako K, Pradhan S, Barone V, et al. Optogenetic control of nodal signaling
reveals a temporal pattern of nodal signaling regulating cell fate specification
during gastrulation. Cell Reports. 2016;16(3):866-877. doi:10.1016/j.celrep.2016.06.036
apa: Sako, K., Pradhan, S., Barone, V., Inglés Prieto, Á., Mueller, P., Ruprecht,
V., … Heisenberg, C.-P. J. (2016). Optogenetic control of nodal signaling reveals
a temporal pattern of nodal signaling regulating cell fate specification during
gastrulation. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2016.06.036
chicago: Sako, Keisuke, Saurabh Pradhan, Vanessa Barone, Álvaro Inglés Prieto, Patrick
Mueller, Verena Ruprecht, Daniel Capek, Sanjeev Galande, Harald L Janovjak, and
Carl-Philipp J Heisenberg. “Optogenetic Control of Nodal Signaling Reveals a Temporal
Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.”
Cell Reports. Cell Press, 2016. https://doi.org/10.1016/j.celrep.2016.06.036.
ieee: K. Sako et al., “Optogenetic control of nodal signaling reveals a temporal
pattern of nodal signaling regulating cell fate specification during gastrulation,”
Cell Reports, vol. 16, no. 3. Cell Press, pp. 866–877, 2016.
ista: Sako K, Pradhan S, Barone V, Inglés Prieto Á, Mueller P, Ruprecht V, Capek
D, Galande S, Janovjak HL, Heisenberg C-PJ. 2016. Optogenetic control of nodal
signaling reveals a temporal pattern of nodal signaling regulating cell fate specification
during gastrulation. Cell Reports. 16(3), 866–877.
mla: Sako, Keisuke, et al. “Optogenetic Control of Nodal Signaling Reveals a Temporal
Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.”
Cell Reports, vol. 16, no. 3, Cell Press, 2016, pp. 866–77, doi:10.1016/j.celrep.2016.06.036.
short: K. Sako, S. Pradhan, V. Barone, Á. Inglés Prieto, P. Mueller, V. Ruprecht,
D. Capek, S. Galande, H.L. Janovjak, C.-P.J. Heisenberg, Cell Reports 16 (2016)
866–877.
date_created: 2018-12-11T11:50:08Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2026-10-26T23:30:31Z
day: '19'
ddc:
- '570'
- '576'
department:
- _id: CaHe
- _id: HaJa
doi: 10.1016/j.celrep.2016.06.036
ec_funded: 1
external_id:
isi:
- '000380264200024'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:04Z
date_updated: 2018-12-12T10:11:04Z
file_id: '4857'
file_name: IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf
file_size: 3921947
relation: main_file
file_date_updated: 2018-12-12T10:11:04Z
fulldoi: https://doi.org/10.1016/j.celrep.2016.06.036
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 866 - 877
project:
- _id: 2529486C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T 560-B17
name: Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation
- _id: 2527D5CC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I812-B12
name: Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
publication: Cell Reports
publication_status: published
publisher: Cell Press
publist_id: '6275'
pubrep_id: '754'
quality_controlled: '1'
related_material:
record:
- id: '961'
relation: dissertation_contains
status: public
- id: '50'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Optogenetic control of nodal signaling reveals a temporal pattern of nodal
signaling regulating cell fate specification during gastrulation
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 16
year: '2016'
...
---
_id: '1321'
abstract:
- lang: eng
text: Most migrating cells extrude their front by the force of actin polymerization.
Polymerization requires an initial nucleation step, which is mediated by factors
establishing either parallel filaments in the case of filopodia or branched filaments
that form the branched lamellipodial network. Branches are considered essential
for regular cell motility and are initiated by the Arp2/3 complex, which in turn
is activated by nucleation-promoting factors of the WASP and WAVE families. Here
we employed rapid amoeboid crawling leukocytes and found that deletion of the
WAVE complex eliminated actin branching and thus lamellipodia formation. The cells
were left with parallel filaments at the leading edge, which translated, depending
on the differentiation status of the cell, into a unipolar pointed cell shape
or cells with multiple filopodia. Remarkably, unipolar cells migrated with increased
speed and enormous directional persistence, while they were unable to turn towards
chemotactic gradients. Cells with multiple filopodia retained chemotactic activity
but their migration was progressively impaired with increasing geometrical complexity
of the extracellular environment. These findings establish that diversified leading
edge protrusions serve as explorative structures while they slow down actual locomotion.
acknowledged_ssus:
- _id: SSU
acknowledgement: "This work was supported by the German Research Foundation (DFG)
Priority Program SP 1464 to T.E.B.S. and M.S., and European Research Council (ERC
GA 281556) and Human Frontiers Program grants to M.S.\r\nService Units of IST Austria
for excellent technical support."
article_processing_charge: No
article_type: original
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Anne
full_name: Reversat, Anne
id: 35B76592-F248-11E8-B48F-1D18A9856A87
last_name: Reversat
orcid: 0000-0003-0666-8928
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Jan
full_name: Schwarz, Jan
id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
last_name: Schwarz
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: David
full_name: De Gorter, David
last_name: De Gorter
- first_name: Florian
full_name: Schur, Florian
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Jonathan
full_name: Bayerl, Jonathan
last_name: Bayerl
- first_name: Ingrid
full_name: De Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: De Vries
- first_name: Stefan
full_name: Wieser, Stefan
id: 355AA5A0-F248-11E8-B48F-1D18A9856A87
last_name: Wieser
orcid: 0000-0002-2670-2217
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Frank
full_name: Lai, Frank
last_name: Lai
- first_name: Markus
full_name: Moser, Markus
last_name: Moser
- first_name: Dontscho
full_name: Kerjaschki, Dontscho
last_name: Kerjaschki
- first_name: Klemens
full_name: Rottner, Klemens
last_name: Rottner
- first_name: Victor
full_name: Small, Victor
last_name: Small
- first_name: Theresia
full_name: Stradal, Theresia
last_name: Stradal
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Leithner AF, Eichner A, Müller J, et al. Diversified actin protrusions promote
environmental exploration but are dispensable for locomotion of leukocytes. Nature
Cell Biology. 2016;18:1253-1259. doi:10.1038/ncb3426
apa: Leithner, A. F., Eichner, A., Müller, J., Reversat, A., Brown, M., Schwarz,
J., … Sixt, M. K. (2016). Diversified actin protrusions promote environmental
exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology.
Nature Publishing Group. https://doi.org/10.1038/ncb3426
chicago: Leithner, Alexander F, Alexander Eichner, Jan Müller, Anne Reversat, Markus
Brown, Jan Schwarz, Jack Merrin, et al. “Diversified Actin Protrusions Promote
Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” Nature
Cell Biology. Nature Publishing Group, 2016. https://doi.org/10.1038/ncb3426.
ieee: A. F. Leithner et al., “Diversified actin protrusions promote environmental
exploration but are dispensable for locomotion of leukocytes,” Nature Cell
Biology, vol. 18. Nature Publishing Group, pp. 1253–1259, 2016.
ista: Leithner AF, Eichner A, Müller J, Reversat A, Brown M, Schwarz J, Merrin J,
De Gorter D, Schur FK, Bayerl J, de Vries I, Wieser S, Hauschild R, Lai F, Moser
M, Kerjaschki D, Rottner K, Small V, Stradal T, Sixt MK. 2016. Diversified actin
protrusions promote environmental exploration but are dispensable for locomotion
of leukocytes. Nature Cell Biology. 18, 1253–1259.
mla: Leithner, Alexander F., et al. “Diversified Actin Protrusions Promote Environmental
Exploration but Are Dispensable for Locomotion of Leukocytes.” Nature Cell
Biology, vol. 18, Nature Publishing Group, 2016, pp. 1253–59, doi:10.1038/ncb3426.
short: A.F. Leithner, A. Eichner, J. Müller, A. Reversat, M. Brown, J. Schwarz,
J. Merrin, D. De Gorter, F.K. Schur, J. Bayerl, I. de Vries, S. Wieser, R. Hauschild,
F. Lai, M. Moser, D. Kerjaschki, K. Rottner, V. Small, T. Stradal, M.K. Sixt,
Nature Cell Biology 18 (2016) 1253–1259.
corr_author: '1'
date_created: 2018-12-11T11:51:21Z
date_published: 2016-10-24T00:00:00Z
date_updated: 2026-10-26T23:30:37Z
day: '24'
ddc:
- '570'
department:
- _id: MiSi
- _id: NanoFab
- _id: Bio
doi: 10.1038/ncb3426
ec_funded: 1
external_id:
isi:
- '000387165600018'
file:
- access_level: open_access
checksum: e1411cb7c99a2d9089c178a6abef25e7
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T16:33:46Z
date_updated: 2020-07-14T12:44:43Z
file_id: '7844'
file_name: 2018_NatureCell_Leithner.pdf
file_size: 4433280
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
fulldoi: https://doi.org/10.1038/ncb3426
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1253 - 1259
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '5949'
quality_controlled: '1'
related_material:
record:
- id: '323'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Diversified actin protrusions promote environmental exploration but are dispensable
for locomotion of leukocytes
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 18
year: '2016'
...
---
_id: '1183'
abstract:
- lang: eng
text: Autism spectrum disorders (ASD) are a group of genetic disorders often overlapping
with other neurological conditions. We previously described abnormalities in the
branched-chain amino acid (BCAA) catabolic pathway as a cause of ASD. Here, we
show that the solute carrier transporter 7a5 (SLC7A5), a large neutral amino acid
transporter localized at the blood brain barrier (BBB), has an essential role
in maintaining normal levels of brain BCAAs. In mice, deletion of Slc7a5 from
the endothelial cells of the BBB leads to atypical brain amino acid profile, abnormal
mRNA translation, and severe neurological abnormalities. Furthermore, we identified
several patients with autistic traits and motor delay carrying deleterious homozygous
mutations in the SLC7A5 gene. Finally, we demonstrate that BCAA intracerebroventricular
administration ameliorates abnormal behaviors in adult mutant mice. Our data elucidate
a neurological syndrome defined by SLC7A5 mutations and support an essential role
for the BCAA in human brain function.
acknowledgement: "This work was supported by NICHD (P01HD070494) and SFARI (grant
275275) to J.G.G., and FWF (SFB35_3523) to G.N.\r\nWe thank A.C. Manzano, Mike Liu,
and F. Marr for technical assistance, and R. Shigemoto and the IST Austria Electron
Microscopy (EM) Facility for assistance. We acknowledge support from CIDR for genome-wide
SNP analysis (X01HG008823) and Broad Institute Center for Mendelian Disorders (UM1HG008900
to D. MacArthur), the Yale Center for Mendelian Disorders (U54HG006504 to M.G.),
the Gregory M. Kiez and Mehmet Kutman Foundation (M.G.), Italian Ministry of Instruction
University and Research (PON01_00937 to C.I.), and NIH (R01-GM108911 to A.S.). This
work was supported by NICHD (P01HD070494) and SFARI (grant 275275) to J.G.G., and
FWF (SFB35_3523) to G.N.\r\n\r\n#EMFacility"
article_processing_charge: No
article_type: original
author:
- first_name: Dora-Clara
full_name: Tarlungeanu, Dora-Clara
id: 2ABCE612-F248-11E8-B48F-1D18A9856A87
last_name: Tarlungeanu
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
orcid: 0000-0002-9033-9096
- first_name: Majdi
full_name: Kara, Majdi
last_name: Kara
- first_name: Philipp
full_name: Janiesch, Philipp
last_name: Janiesch
- first_name: Mariafrancesca
full_name: Scalise, Mariafrancesca
last_name: Scalise
- first_name: Michele
full_name: Galluccio, Michele
last_name: Galluccio
- first_name: Mateja
full_name: Tesulov, Mateja
last_name: Tesulov
- first_name: Emanuela
full_name: Morelli, Emanuela
id: 3F4D1282-F248-11E8-B48F-1D18A9856A87
last_name: Morelli
- first_name: Fatma
full_name: Sönmez, Fatma
last_name: Sönmez
- first_name: Kaya
full_name: Bilgüvar, Kaya
last_name: Bilgüvar
- first_name: Ryuichi
full_name: Ohgaki, Ryuichi
last_name: Ohgaki
- first_name: Yoshikatsu
full_name: Kanai, Yoshikatsu
last_name: Kanai
- first_name: Anide
full_name: Johansen, Anide
last_name: Johansen
- first_name: Seham
full_name: Esharif, Seham
last_name: Esharif
- first_name: Tawfeg
full_name: Ben Omran, Tawfeg
last_name: Ben Omran
- first_name: Meral
full_name: Topcu, Meral
last_name: Topcu
- first_name: Avner
full_name: Schlessinger, Avner
last_name: Schlessinger
- first_name: Cesare
full_name: Indiveri, Cesare
last_name: Indiveri
- first_name: Kent
full_name: Duncan, Kent
last_name: Duncan
- first_name: Ahmet
full_name: Caglayan, Ahmet
last_name: Caglayan
- first_name: Murat
full_name: Günel, Murat
last_name: Günel
- first_name: Joseph
full_name: Gleeson, Joseph
last_name: Gleeson
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Tarlungeanu D-C, Deliu E, Dotter C, et al. Impaired amino acid transport at
the blood brain barrier is a cause of autism spectrum disorder. Cell. 2016;167(6):1481-1494.
doi:10.1016/j.cell.2016.11.013
apa: Tarlungeanu, D.-C., Deliu, E., Dotter, C., Kara, M., Janiesch, P., Scalise,
M., … Novarino, G. (2016). Impaired amino acid transport at the blood brain barrier
is a cause of autism spectrum disorder. Cell. Cell Press. https://doi.org/10.1016/j.cell.2016.11.013
chicago: Tarlungeanu, Dora-Clara, Elena Deliu, Christoph Dotter, Majdi Kara, Philipp
Janiesch, Mariafrancesca Scalise, Michele Galluccio, et al. “Impaired Amino Acid
Transport at the Blood Brain Barrier Is a Cause of Autism Spectrum Disorder.”
Cell. Cell Press, 2016. https://doi.org/10.1016/j.cell.2016.11.013.
ieee: D.-C. Tarlungeanu et al., “Impaired amino acid transport at the blood
brain barrier is a cause of autism spectrum disorder,” Cell, vol. 167,
no. 6. Cell Press, pp. 1481–1494, 2016.
ista: Tarlungeanu D-C, Deliu E, Dotter C, Kara M, Janiesch P, Scalise M, Galluccio
M, Tesulov M, Morelli E, Sönmez F, Bilgüvar K, Ohgaki R, Kanai Y, Johansen A,
Esharif S, Ben Omran T, Topcu M, Schlessinger A, Indiveri C, Duncan K, Caglayan
A, Günel M, Gleeson J, Novarino G. 2016. Impaired amino acid transport at the
blood brain barrier is a cause of autism spectrum disorder. Cell. 167(6), 1481–1494.
mla: Tarlungeanu, Dora-Clara, et al. “Impaired Amino Acid Transport at the Blood
Brain Barrier Is a Cause of Autism Spectrum Disorder.” Cell, vol. 167,
no. 6, Cell Press, 2016, pp. 1481–94, doi:10.1016/j.cell.2016.11.013.
short: D.-C. Tarlungeanu, E. Deliu, C. Dotter, M. Kara, P. Janiesch, M. Scalise,
M. Galluccio, M. Tesulov, E. Morelli, F. Sönmez, K. Bilgüvar, R. Ohgaki, Y. Kanai,
A. Johansen, S. Esharif, T. Ben Omran, M. Topcu, A. Schlessinger, C. Indiveri,
K. Duncan, A. Caglayan, M. Günel, J. Gleeson, G. Novarino, Cell 167 (2016) 1481–1494.
date_created: 2018-12-11T11:50:35Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2026-10-26T23:30:36Z
day: '01'
ddc:
- '576'
- '616'
department:
- _id: GaNo
doi: 10.1016/j.cell.2016.11.013
external_id:
isi:
- '000389470500012'
file:
- access_level: open_access
checksum: 7fe01ab12a6610d3db421e0136db2f77
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:44Z
date_updated: 2020-07-14T12:44:37Z
file_id: '5030'
file_name: IST-2017-771-v1+1_Tarlungeanu_et_al._Final_edited.pdf
file_size: 73907957
relation: main_file
file_date_updated: 2020-07-14T12:44:37Z
fulldoi: https://doi.org/10.1016/j.cell.2016.11.013
has_accepted_license: '1'
intvolume: ' 167'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 1481 - 1494
project:
- _id: 25473368-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F03523
name: Transmembrane Transporters in Health and Disease
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '6170'
pubrep_id: '771'
quality_controlled: '1'
related_material:
record:
- id: '395'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Impaired amino acid transport at the blood brain barrier is a cause of autism
spectrum disorder
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 167
year: '2016'
...
---
_id: '1437'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
alternative_title:
- POPL
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: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- 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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for
algebraic path properties in concurrent systems of constant treewidth components.
In: Vol 20-22. ACM; 2016:733-747. doi:10.1145/2837614.2837624'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A.
(2016). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles
of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,”
presented at the POPL: Principles of Programming Languages, St. Petersburg, FL,
USA, 2016, vol. 20–22, pp. 733–747.'
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.'
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016,
pp. 733–47, doi:10.1145/2837614.2837624.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM,
2016, pp. 733–747.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
corr_author: '1'
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2026-10-26T23:30:46Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/2837614.2837624
ec_funded: 1
external_id:
arxiv:
- '1510.07565'
fulldoi: https://doi.org/10.1145/2837614.2837624
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.07565
month: '01'
oa: 1
oa_version: Preprint
page: 733 - 747
project:
- _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'
publication_status: published
publisher: ACM
publist_id: '5761'
quality_controlled: '1'
related_material:
record:
- id: '5441'
relation: earlier_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '6009'
relation: later_version
status: public
- id: '821'
relation: dissertation_contains
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1386'
abstract:
- lang: eng
text: We consider nondeterministic probabilistic programs with the most basic liveness
property of termination. We present efficient methods for termination analysis
of nondeterministic probabilistic programs with polynomial guards and assignments.
Our approach is through synthesis of polynomial ranking supermartingales, that
on one hand significantly generalizes linear ranking supermartingales and on the
other hand is a counterpart of polynomial ranking-functions for proving termination
of nonprobabilistic programs. The approach synthesizes polynomial ranking-supermartingales
through Positivstellensatz's, yielding an efficient method which is not only sound,
but also semi-complete over a large subclass of programs. We show experimental
results to demonstrate that our approach can handle several classical programs
with complex polynomial guards and assignments, and can synthesize efficient quadratic
ranking-supermartingales when a linear one does not exist even for simple affine
programs.
alternative_title:
- LNCS
article_processing_charge: No
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: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: 'Chatterjee K, Fu H, Goharshady AK. Termination analysis of probabilistic programs
through Positivstellensatz’s. In: Vol 9779. Springer; 2016:3-22. doi:10.1007/978-3-319-41528-4_1'
apa: 'Chatterjee, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis
of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22).
Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.
https://doi.org/10.1007/978-3-319-41528-4_1'
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination
Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer,
2016. https://doi.org/10.1007/978-3-319-41528-4_1.
ieee: 'K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic
programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification,
Toronto, Canada, 2016, vol. 9779, pp. 3–22.'
ista: 'Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic
programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS,
vol. 9779, 3–22.'
mla: Chatterjee, Krishnendu, et al. Termination Analysis of Probabilistic Programs
through Positivstellensatz’s. Vol. 9779, Springer, 2016, pp. 3–22, doi:10.1007/978-3-319-41528-4_1.
short: K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22.
conference:
end_date: 2016-07-23
location: Toronto, Canada
name: 'CAV: Computer Aided Verification'
start_date: 2016-07-17
corr_author: '1'
date_created: 2018-12-11T11:51:43Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2026-10-26T23:30:46Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-319-41528-4_1
ec_funded: 1
external_id:
arxiv:
- '1604.07169'
isi:
- '000387731200001'
fulldoi: https://doi.org/10.1007/978-3-319-41528-4_1
intvolume: ' 9779'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1604.07169
month: '07'
oa: 1
oa_version: Preprint
page: 3 - 22
project:
- _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
publication_status: published
publisher: Springer
publist_id: '5824'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Termination analysis of probabilistic programs through Positivstellensatz's
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9779
year: '2016'
...
---
_id: '2271'
abstract:
- lang: eng
text: "A class of valued constraint satisfaction problems (VCSPs) is characterised
by a valued constraint language, a fixed set of cost functions on a finite domain.
Finite-valued constraint languages contain functions that take on rational costs
and general-valued constraint languages contain functions that take on rational
or infinite costs. An instance of the problem is specified by a sum of functions
from the language with the goal to minimise the sum. This framework includes and
generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint
satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation
of valued constraint languages whose instances can be solved exactly by the basic
linear programming relaxation (BLP). For a general-valued constraint language
Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional
polymorphism of every arity. For a finite-valued constraint language Γ, BLP is
a decision procedure if and only if Γ admits a symmetric fractional polymorphism
of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism
of arity 2.\r\nUsing these results, we obtain tractability of several novel and
previously widely-open classes of VCSPs, including problems over valued constraint
languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also
known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly)
tree-submodular on arbitrary trees. "
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Johan
full_name: Thapper, Johan
last_name: Thapper
- first_name: Stanislav
full_name: Živný, Stanislav
last_name: Živný
citation:
ama: Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued
CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648
apa: Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming
for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648
chicago: Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of
Linear Programming for General-Valued CSPs.” SIAM Journal on Computing.
SIAM, 2015. https://doi.org/10.1137/130945648.
ieee: V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming
for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM,
pp. 1–36, 2015.
ista: Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for
general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.
mla: Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued
CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36,
doi:10.1137/130945648.
short: V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015)
1–36.
date_created: 2018-12-11T11:56:41Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2025-09-23T14:14:57Z
day: '01'
department:
- _id: VlKo
doi: 10.1137/130945648
external_id:
arxiv:
- '1311.4219'
isi:
- '000353967100001'
fulldoi: https://doi.org/10.1137/130945648
intvolume: ' 44'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.4219
month: '02'
oa: 1
oa_version: Preprint
page: 1 - 36
publication: SIAM Journal on Computing
publication_status: published
publisher: SIAM
publist_id: '4673'
quality_controlled: '1'
related_material:
record:
- id: '2518'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: The power of linear programming for general-valued CSPs
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 44
year: '2015'
...
---
_id: '12196'
abstract:
- lang: eng
text: SNC1 (SUPPRESSOR OF NPR1, CONSTITUTIVE 1) is one of a suite of intracellular
Arabidopsis NOD-like receptor (NLR) proteins which, upon activation, result in
the induction of defense responses. However, the molecular mechanisms underlying
NLR activation and the subsequent provocation of immune responses are only partially
characterized. To identify negative regulators of NLR-mediated immunity, a forward
genetic screen was undertaken to search for enhancers of the dwarf, autoimmune
gain-of-function snc1 mutant. To avoid lethality resulting from severe dwarfism,
the screen was conducted using mos4 (modifier of snc1, 4) snc1 plants, which display
wild-type-like morphology and resistance. M2 progeny were screened for mutant,
snc1-enhancing (muse) mutants displaying a reversion to snc1-like phenotypes.
The muse9 mos4 snc1 triple mutant was found to exhibit dwarf morphology, elevated
expression of the pPR2-GUS defense marker reporter gene and enhanced resistance
to the oomycete pathogen Hyaloperonospora arabidopsidis Noco2. Via map-based cloning
and Illumina sequencing, it was determined that the muse9 mutation is in the gene
encoding the SWI/SNF chromatin remodeler SYD (SPLAYED), and was thus renamed syd-10.
The syd-10 single mutant has no observable alteration from wild-type-like resistance,
although the syd-4 T-DNA insertion allele displays enhanced resistance to the
bacterial pathogen Pseudomonas syringae pv. maculicola ES4326. Transcription of
SNC1 is increased in both syd-4 and syd-10. These data suggest that SYD plays
a subtle, specific role in the regulation of SNC1 expression and SNC1-mediated
immunity. SYD may work with other proteins at the chromatin level to repress SNC1
transcription; such regulation is important for fine-tuning the expression of
NLR-encoding genes to prevent unpropitious autoimmunity.
acknowledgement: "This work was supported by the National Sciences and Engineering
Research Council of Canada [Canada Graduate\r\nScholarship–Doctoral to K.J.; Discovery
Grant to X.L.]; the department of Botany at the University of f British Columbia\r\n[the
Dewar Cooper Memorial Fund to X.L.].The authors would like to thank Dr. Yuelin Zhang
and Ms. Yan Li for their assistance with next-generation sequencing, and Mr. Charles
Copeland for critical reading of the manuscript."
article_processing_charge: No
article_type: original
author:
- first_name: Kaeli C.M.
full_name: Johnson, Kaeli C.M.
last_name: Johnson
- first_name: Shitou
full_name: Xia, Shitou
last_name: Xia
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Xin
full_name: Li, Xin
last_name: Li
citation:
ama: Johnson KCM, Xia S, Feng X, Li X. The chromatin remodeler SPLAYED negatively
regulates SNC1-mediated immunity. Plant and Cell Physiology. 2015;56(8):1616-1623.
doi:10.1093/pcp/pcv087
apa: Johnson, K. C. M., Xia, S., Feng, X., & Li, X. (2015). The chromatin remodeler
SPLAYED negatively regulates SNC1-mediated immunity. Plant and Cell Physiology.
Oxford University Press. https://doi.org/10.1093/pcp/pcv087
chicago: Johnson, Kaeli C.M., Shitou Xia, Xiaoqi Feng, and Xin Li. “The Chromatin
Remodeler SPLAYED Negatively Regulates SNC1-Mediated Immunity.” Plant and Cell
Physiology. Oxford University Press, 2015. https://doi.org/10.1093/pcp/pcv087.
ieee: K. C. M. Johnson, S. Xia, X. Feng, and X. Li, “The chromatin remodeler SPLAYED
negatively regulates SNC1-mediated immunity,” Plant and Cell Physiology,
vol. 56, no. 8. Oxford University Press, pp. 1616–1623, 2015.
ista: Johnson KCM, Xia S, Feng X, Li X. 2015. The chromatin remodeler SPLAYED negatively
regulates SNC1-mediated immunity. Plant and Cell Physiology. 56(8), 1616–1623.
mla: Johnson, Kaeli C. M., et al. “The Chromatin Remodeler SPLAYED Negatively Regulates
SNC1-Mediated Immunity.” Plant and Cell Physiology, vol. 56, no. 8, Oxford
University Press, 2015, pp. 1616–23, doi:10.1093/pcp/pcv087.
short: K.C.M. Johnson, S. Xia, X. Feng, X. Li, Plant and Cell Physiology 56 (2015)
1616–1623.
date_created: 2023-01-16T09:20:22Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2023-05-08T11:03:23Z
department:
- _id: XiFe
doi: 10.1093/pcp/pcv087
extern: '1'
external_id:
pmid:
- '26063389'
fulldoi: https://doi.org/10.1093/pcp/pcv087
intvolume: ' 56'
issue: '8'
keyword:
- Cell Biology
- Plant Science
- Physiology
- General Medicine
language:
- iso: eng
month: '08'
oa_version: None
page: 1616-1623
pmid: 1
publication: Plant and Cell Physiology
publication_identifier:
issn:
- 0032-0781
- 1471-9053
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2015'
...
---
_id: '12881'
acknowledgement: This work was supported by the DFG (SPP 1527) and the EU (FP7, REA
grant no 291734).
article_processing_charge: No
author:
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
- first_name: Eckehard
full_name: Olbrich, Eckehard
last_name: Olbrich
citation:
ama: 'Martius GS, Olbrich E. Quantifying self-organizing behavior of autonomous
robots. In: Proceedings of the 13th European Conference on Artificial Life.
MIT Press; 2015:78. doi:10.7551/978-0-262-33027-5-ch018'
apa: 'Martius, G. S., & Olbrich, E. (2015). Quantifying self-organizing behavior
of autonomous robots. In Proceedings of the 13th European Conference on Artificial
Life (p. 78). York, United Kingdom: MIT Press. https://doi.org/10.7551/978-0-262-33027-5-ch018'
chicago: Martius, Georg S, and Eckehard Olbrich. “Quantifying Self-Organizing Behavior
of Autonomous Robots.” In Proceedings of the 13th European Conference on Artificial
Life, 78. MIT Press, 2015. https://doi.org/10.7551/978-0-262-33027-5-ch018.
ieee: G. S. Martius and E. Olbrich, “Quantifying self-organizing behavior of autonomous
robots,” in Proceedings of the 13th European Conference on Artificial Life,
York, United Kingdom, 2015, p. 78.
ista: 'Martius GS, Olbrich E. 2015. Quantifying self-organizing behavior of autonomous
robots. Proceedings of the 13th European Conference on Artificial Life. ECAL:
European Conference on Artificial Life, 78.'
mla: Martius, Georg S., and Eckehard Olbrich. “Quantifying Self-Organizing Behavior
of Autonomous Robots.” Proceedings of the 13th European Conference on Artificial
Life, MIT Press, 2015, p. 78, doi:10.7551/978-0-262-33027-5-ch018.
short: G.S. Martius, E. Olbrich, in:, Proceedings of the 13th European Conference
on Artificial Life, MIT Press, 2015, p. 78.
conference:
end_date: 2015-07-24
location: York, United Kingdom
name: 'ECAL: European Conference on Artificial Life'
start_date: 2015-07-20
corr_author: '1'
date_created: 2023-04-30T22:01:07Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2025-09-29T11:08:17Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.7551/978-0-262-33027-5-ch018
ec_funded: 1
external_id:
isi:
- '000510147800018'
file:
- access_level: open_access
checksum: 880eabe59c9df12f06a882aa1bc4e600
content_type: application/pdf
creator: dernst
date_created: 2023-05-02T07:02:59Z
date_updated: 2023-05-02T07:02:59Z
file_id: '12882'
file_name: 2015_ECAL_Martius.pdf
file_size: 1674241
relation: main_file
success: 1
file_date_updated: 2023-05-02T07:02:59Z
fulldoi: https://doi.org/10.7551/978-0-262-33027-5-ch018
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '78'
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the 13th European Conference on Artificial Life
publication_identifier:
isbn:
- '9780262330275'
publication_status: published
publisher: MIT Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantifying self-organizing behavior of autonomous robots
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2015'
...
---
_id: '2085'
abstract:
- lang: eng
text: 'We study the spectrum of a large system of N identical bosons interacting
via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov''s
theory predicts that the spectrum of the N-particle Hamiltonian can be approximated
by that of an effective quadratic Hamiltonian acting on Fock space, which describes
the fluctuations around a condensed state. Recently, Bogoliubov''s theory has
been justified rigorously in the case that the low-energy eigenvectors of the
N-particle Hamiltonian display complete condensation in the unique minimizer of
the corresponding Hartree functional. In this paper, we shall justify Bogoliubov''s
theory for the high-energy part of the spectrum of the N-particle Hamiltonian
corresponding to (non-linear) excited states of the Hartree functional. Moreover,
we shall extend the existing results on the excitation spectrum to the case of
non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the
latter covers the case of rotating Bose gases, when the rotation speed is large
enough to break the symmetry and to produce multiple quantized vortices in the
Hartree minimizer. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Nam P, Seiringer R. Collective excitations of Bose gases in the mean-field
regime. Archive for Rational Mechanics and Analysis. 2015;215(2):381-417.
doi:10.1007/s00205-014-0781-6
apa: Nam, P., & Seiringer, R. (2015). Collective excitations of Bose gases in
the mean-field regime. Archive for Rational Mechanics and Analysis. Springer.
https://doi.org/10.1007/s00205-014-0781-6
chicago: Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases
in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis.
Springer, 2015. https://doi.org/10.1007/s00205-014-0781-6.
ieee: P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field
regime,” Archive for Rational Mechanics and Analysis, vol. 215, no. 2.
Springer, pp. 381–417, 2015.
ista: Nam P, Seiringer R. 2015. Collective excitations of Bose gases in the mean-field
regime. Archive for Rational Mechanics and Analysis. 215(2), 381–417.
mla: Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the
Mean-Field Regime.” Archive for Rational Mechanics and Analysis, vol. 215,
no. 2, Springer, 2015, pp. 381–417, doi:10.1007/s00205-014-0781-6.
short: P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015)
381–417.
corr_author: '1'
date_created: 2018-12-11T11:55:37Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2025-09-23T08:17:14Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00205-014-0781-6
external_id:
arxiv:
- '1402.1153'
isi:
- '000347150400002'
fulldoi: https://doi.org/10.1007/s00205-014-0781-6
intvolume: ' 215'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.1153
month: '02'
oa: 1
oa_version: Preprint
page: 381 - 417
publication: Archive for Rational Mechanics and Analysis
publication_status: published
publisher: Springer
publist_id: '4951'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Collective excitations of Bose gases in the mean-field regime
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 215
year: '2015'
...
---
_id: '2166'
abstract:
- lang: eng
text: 'We consider the spectral statistics of large random band matrices on mesoscopic
energy scales. We show that the correlation function of the local eigenvalue density
exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta
statistics. This law had been predicted in the physics literature by Altshuler
and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it
describes the correlations of the eigenvalue density in general metallic sampleswith
weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas
for band matrices. In two dimensions, where the leading term vanishes owing to
an algebraic cancellation, we identify the first non-vanishing term and show that
it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev
Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion
(Ann. H. Poincaré. arXiv:1309.5107, 2014). '
article_processing_charge: No
arxiv: 1
author:
- 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
citation:
ama: 'Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices
I: the unimodular case. Communications in Mathematical Physics. 2015;333(3):1365-1416.
doi:10.1007/s00220-014-2119-5'
apa: 'Erdös, L., & Knowles, A. (2015). The Altshuler-Shklovskii formulas for
random band matrices I: the unimodular case. Communications in Mathematical
Physics. Springer. https://doi.org/10.1007/s00220-014-2119-5'
chicago: 'Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for
Random Band Matrices I: The Unimodular Case.” Communications in Mathematical
Physics. Springer, 2015. https://doi.org/10.1007/s00220-014-2119-5.'
ieee: 'L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band
matrices I: the unimodular case,” Communications in Mathematical Physics,
vol. 333, no. 3. Springer, pp. 1365–1416, 2015.'
ista: 'Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band
matrices I: the unimodular case. Communications in Mathematical Physics. 333(3),
1365–1416.'
mla: 'Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random
Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics,
vol. 333, no. 3, Springer, 2015, pp. 1365–416, doi:10.1007/s00220-014-2119-5.'
short: L. Erdös, A. Knowles, Communications in Mathematical Physics 333 (2015) 1365–1416.
date_created: 2018-12-11T11:56:05Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2025-09-23T13:39:37Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00220-014-2119-5
external_id:
arxiv:
- '1309.5106'
isi:
- '000348303100008'
fulldoi: https://doi.org/10.1007/s00220-014-2119-5
intvolume: ' 333'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5106
month: '02'
oa: 1
oa_version: Preprint
page: 1365 - 1416
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4818'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The Altshuler-Shklovskii formulas for random band matrices I: the unimodular
case'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 333
year: '2015'
...
---
_id: '1383'
abstract:
- lang: eng
text: In plants, vacuolar H+-ATPase (V-ATPase) activity acidifies both the trans-Golgi
network/early endosome (TGN/EE) and the vacuole. This dual V-ATPase function has
impeded our understanding of how the pH homeostasis within the plant TGN/EE controls
exo- and endocytosis. Here, we show that the weak V-ATPase mutant deetiolated3
(det3) displayed a pH increase in the TGN/EE, but not in the vacuole, strongly
impairing secretion and recycling of the brassinosteroid receptor and the cellulose
synthase complexes to the plasma membrane, in contrast to mutants lacking tonoplast-localized
V-ATPase activity only. The brassinosteroid insensitivity and the cellulose deficiency
defects in det3 were tightly correlated with reduced Golgi and TGN/EE motility.
Thus, our results provide strong evidence that acidification of the TGN/EE, but
not of the vacuole, is indispensable for functional secretion and recycling in
plants.
article_number: '15094'
article_processing_charge: No
article_type: original
author:
- first_name: Luo
full_name: Yu, Luo
last_name: Yu
- first_name: Stefan
full_name: Scholl, Stefan
last_name: Scholl
- first_name: Anett
full_name: Doering, Anett
last_name: Doering
- first_name: Zhang
full_name: Yi, Zhang
last_name: Yi
- first_name: Niloufer
full_name: Irani, Niloufer
last_name: Irani
- first_name: Simone
full_name: Di Rubbo, Simone
last_name: Di Rubbo
- first_name: Lutz
full_name: Neumetzler, Lutz
last_name: Neumetzler
- first_name: Praveen
full_name: Krishnamoorthy, Praveen
last_name: Krishnamoorthy
- first_name: Isabelle
full_name: Van Houtte, Isabelle
last_name: Van Houtte
- first_name: Evelien
full_name: Mylle, Evelien
last_name: Mylle
- first_name: Volker
full_name: Bischoff, Volker
last_name: Bischoff
- first_name: Samantha
full_name: Vernhettes, Samantha
last_name: Vernhettes
- first_name: Johan
full_name: Winne, Johan
last_name: Winne
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: York
full_name: Stierhof, York
last_name: Stierhof
- first_name: Karin
full_name: Schumacher, Karin
last_name: Schumacher
- first_name: Staffan
full_name: Persson, Staffan
last_name: Persson
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
citation:
ama: Yu L, Scholl S, Doering A, et al. V-ATPase activity in the TGN/EE is required
for exocytosis and recycling in Arabidopsis. Nature Plants. 2015;1(7).
doi:10.1038/nplants.2015.94
apa: Yu, L., Scholl, S., Doering, A., Yi, Z., Irani, N., Di Rubbo, S., … Russinova,
E. (2015). V-ATPase activity in the TGN/EE is required for exocytosis and recycling
in Arabidopsis. Nature Plants. Nature Publishing Group. https://doi.org/10.1038/nplants.2015.94
chicago: Yu, Luo, Stefan Scholl, Anett Doering, Zhang Yi, Niloufer Irani, Simone
Di Rubbo, Lutz Neumetzler, et al. “V-ATPase Activity in the TGN/EE Is Required
for Exocytosis and Recycling in Arabidopsis.” Nature Plants. Nature Publishing
Group, 2015. https://doi.org/10.1038/nplants.2015.94.
ieee: L. Yu et al., “V-ATPase activity in the TGN/EE is required for exocytosis
and recycling in Arabidopsis,” Nature Plants, vol. 1, no. 7. Nature Publishing
Group, 2015.
ista: Yu L, Scholl S, Doering A, Yi Z, Irani N, Di Rubbo S, Neumetzler L, Krishnamoorthy
P, Van Houtte I, Mylle E, Bischoff V, Vernhettes S, Winne J, Friml J, Stierhof
Y, Schumacher K, Persson S, Russinova E. 2015. V-ATPase activity in the TGN/EE
is required for exocytosis and recycling in Arabidopsis. Nature Plants. 1(7),
15094.
mla: Yu, Luo, et al. “V-ATPase Activity in the TGN/EE Is Required for Exocytosis
and Recycling in Arabidopsis.” Nature Plants, vol. 1, no. 7, 15094, Nature
Publishing Group, 2015, doi:10.1038/nplants.2015.94.
short: L. Yu, S. Scholl, A. Doering, Z. Yi, N. Irani, S. Di Rubbo, L. Neumetzler,
P. Krishnamoorthy, I. Van Houtte, E. Mylle, V. Bischoff, S. Vernhettes, J. Winne,
J. Friml, Y. Stierhof, K. Schumacher, S. Persson, E. Russinova, Nature Plants
1 (2015).
date_created: 2018-12-11T11:51:42Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2025-09-29T11:04:05Z
day: '06'
department:
- _id: JiFr
doi: 10.1038/nplants.2015.94
external_id:
isi:
- '000364407200001'
pmid:
- '27250258'
fulldoi: https://doi.org/10.1038/nplants.2015.94
intvolume: ' 1'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4905525/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Nature Plants
publication_status: published
publisher: Nature Publishing Group
publist_id: '5827'
quality_controlled: '1'
scopus_import: '1'
status: public
title: V-ATPase activity in the TGN/EE is required for exocytosis and recycling in
Arabidopsis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1
year: '2015'
...
---
OA_place: publisher
_id: '1401'
abstract:
- lang: eng
text: 'The human ability to recognize objects in complex scenes has driven research
in the computer vision field over couple of decades. This thesis focuses on the
object recognition task in images. That is, given the image, we want the computer
system to be able to predict the class of the object that appears in the image.
A recent successful attempt to bridge semantic understanding of the image perceived
by humans and by computers uses attribute-based models. Attributes are semantic
properties of the objects shared across different categories, which humans and
computers can decide on. To explore the attribute-based models we take a statistical
machine learning approach, and address two key learning challenges in view of
object recognition task: learning augmented attributes as mid-level discriminative
feature representation, and learning with attributes as privileged information.
Our main contributions are parametric and non-parametric models and algorithms
to solve these frameworks. In the parametric approach, we explore an autoencoder
model combined with the large margin nearest neighbor principle for mid-level
feature learning, and linear support vector machines for learning with privileged
information. In the non-parametric approach, we propose a supervised Indian Buffet
Process for automatic augmentation of semantic attributes, and explore the Gaussian
Processes classification framework for learning with privileged information. A
thorough experimental analysis shows the effectiveness of the proposed models
in both parametric and non-parametric views.'
acknowledgement: "I would like to thank my supervisor, Christoph Lampert, for guidance
throughout my studies and for patience in transforming me into a scientist, and
my thesis committee, Chris Wojtan and Horst Bischof, for their help and advice.
\r\n\r\nI would like to thank Elisabeth Hacker who perfectly assisted all my administrative
needs and was always nice and friendly to me, and the campus team for making the
IST Austria campus my second home. \r\nI was honored to collaborate with brilliant
researchers and to learn from their experience. Undoubtedly, I learned most of all
from Novi Quadrianto: brainstorming our projects and getting exciting results was
the most enjoyable part of my work – thank you! I am also grateful to David Knowles,
Zoubin Ghahramani, Daniel Hernández-Lobato, Kristian Kersting and Anastasia Pentina
for the fantastic projects we worked on together, and to Kristen Grauman and Adriana
Kovashka for the exceptional experience working with user studies. I would like
to thank my colleagues at IST Austria and my office mates who shared their happy
moods, scientific breakthroughs and thought-provoking conversations with me: Chao,
Filip, Rustem, Asya, Sameh, Alex, Vlad, Mayu, Neel, Csaba, Thomas, Vladimir, Cristina,
Alex Z., Avro, Amelie and Emilie, Andreas H. and Andreas E., Chris, Lena, Michael,
Ali and Ipek, Vera, Igor, Katia. Special thanks to Morten for the countless games
of table soccer we played together and the tournaments we teamed up for: we will
definitely win next time:) A very warm hug to Asya for always being so inspiring
and supportive to me, and for helping me to increase the proportion of female computer
scientists in our group. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
citation:
ama: 'Sharmanska V. Learning with attributes for object recognition: Parametric
and non-parametrics views. 2015. doi:10.15479/at:ista:1401'
apa: 'Sharmanska, V. (2015). Learning with attributes for object recognition:
Parametric and non-parametrics views. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:1401'
chicago: 'Sharmanska, Viktoriia. “Learning with Attributes for Object Recognition:
Parametric and Non-Parametrics Views.” Institute of Science and Technology Austria,
2015. https://doi.org/10.15479/at:ista:1401.'
ieee: 'V. Sharmanska, “Learning with attributes for object recognition: Parametric
and non-parametrics views,” Institute of Science and Technology Austria, 2015.'
ista: 'Sharmanska V. 2015. Learning with attributes for object recognition: Parametric
and non-parametrics views. Institute of Science and Technology Austria.'
mla: 'Sharmanska, Viktoriia. Learning with Attributes for Object Recognition:
Parametric and Non-Parametrics Views. Institute of Science and Technology
Austria, 2015, doi:10.15479/at:ista:1401.'
short: 'V. Sharmanska, Learning with Attributes for Object Recognition: Parametric
and Non-Parametrics Views, Institute of Science and Technology Austria, 2015.'
corr_author: '1'
date_created: 2018-12-11T11:51:48Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2026-04-09T14:25:49Z
day: '01'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ChLa
- _id: GradSch
doi: 10.15479/at:ista:1401
file:
- access_level: open_access
checksum: 3605b402bb6934e09ae4cf672c84baf7
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:33:17Z
date_updated: 2021-02-22T11:33:17Z
file_id: '9177'
file_name: 2015_Thesis_Sharmanska.pdf
file_size: 7964342
relation: main_file
success: 1
- access_level: closed
checksum: e37593b3ee75bf3180629df2d6ca8f4e
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-16T14:40:45Z
date_updated: 2021-11-17T13:47:24Z
file_id: '10297'
file_name: 2015_Thesis_Sharmanska_pdfa.pdf
file_size: 7372241
relation: main_file
file_date_updated: 2021-11-17T13:47:24Z
fulldoi: https://doi.org/10.15479/at:ista:1401
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://users.sussex.ac.uk/~nq28/viktoriia/Thesis_Sharmanska.pdf
month: '04'
oa: 1
oa_version: Published Version
page: '144'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5806'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: 'Learning with attributes for object recognition: Parametric and non-parametrics
views'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2015'
...
---
_id: '1424'
abstract:
- lang: eng
text: We consider the problem of statistical computations with persistence diagrams,
a summary representation of topological features in data. These diagrams encode
persistent homology, a widely used invariant in topological data analysis. While
several avenues towards a statistical treatment of the diagrams have been explored
recently, we follow an alternative route that is motivated by the success of methods
based on the embedding of probability measures into reproducing kernel Hilbert
spaces. In fact, a positive definite kernel on persistence diagrams has recently
been proposed, connecting persistent homology to popular kernel-based learning
techniques such as support vector machines. However, important properties of that
kernel enabling a principled use in the context of probability measure embeddings
remain to be explored. Our contribution is to close this gap by proving universality
of a variant of the original kernel, and to demonstrate its effective use in twosample
hypothesis testing on synthetic as well as real-world data.
acknowledgement: This work was partially supported by the Austrian Science FUnd, project
no. KLI 00012.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
author:
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Marc
full_name: Niethammer, Marc
last_name: Niethammer
- first_name: Weili
full_name: Lin, Weili
last_name: Lin
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
citation:
ama: 'Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. Statistical topological data
analysis-A kernel perspective. In: Vol 28. Neural Information Processing Systems
Foundation; 2015:3070-3078.'
apa: 'Kwitt, R., Huber, S., Niethammer, M., Lin, W., & Bauer, U. (2015). Statistical
topological data analysis-A kernel perspective (Vol. 28, pp. 3070–3078). Presented
at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information
Processing Systems Foundation.'
chicago: Kwitt, Roland, Stefan Huber, Marc Niethammer, Weili Lin, and Ulrich Bauer.
“Statistical Topological Data Analysis-A Kernel Perspective,” 28:3070–78. Neural
Information Processing Systems Foundation, 2015.
ieee: 'R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological
data analysis-A kernel perspective,” presented at the NIPS: Neural Information
Processing Systems, Montreal, Canada, 2015, vol. 28, pp. 3070–3078.'
ista: 'Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. 2015. Statistical topological
data analysis-A kernel perspective. NIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 28, 3070–3078.'
mla: Kwitt, Roland, et al. Statistical Topological Data Analysis-A Kernel Perspective.
Vol. 28, Neural Information Processing Systems Foundation, 2015, pp. 3070–78.
short: R. Kwitt, S. Huber, M. Niethammer, W. Lin, U. Bauer, in:, Neural Information
Processing Systems Foundation, 2015, pp. 3070–3078.
conference:
end_date: 2015-12-12
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2015-12-07
date_created: 2018-12-11T11:51:56Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2025-06-03T11:41:36Z
day: '01'
department:
- _id: HeEd
intvolume: ' 28'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.nips.cc/paper/5887-statistical-topological-data-analysis-a-kernel-perspective
month: '12'
oa: 1
oa_version: Submitted Version
page: 3070 - 3078
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '5782'
quality_controlled: '1'
status: public
title: Statistical topological data analysis-A kernel perspective
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2015'
...
---
_id: '1425'
abstract:
- lang: eng
text: 'In this work we aim at extending the theoretical foundations of lifelong
learning. Previous work analyzing this scenario is based on the assumption that
learning tasks are sampled i.i.d. from a task environment or limited to strongly
constrained data distributions. Instead, we study two scenarios when lifelong
learning is possible, even though the observed tasks do not form an i.i.d. sample:
first, when they are sampled from the same environment, but possibly with dependencies,
and second, when the task environment is allowed to change over time in a consistent
way. In the first case we prove a PAC-Bayesian theorem that can be seen as a direct
generalization of the analogous previous result for the i.i.d. case. For the second
scenario we propose to learn an inductive bias in form of a transfer procedure.
We present a generalization bound and show on a toy example how it can be used
to identify a beneficial transfer algorithm.'
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Lampert C. Lifelong learning with non-i.i.d. tasks. In: Vol 2015.
Neural Information Processing Systems Foundation; 2015:1540-1548.'
apa: 'Pentina, A., & Lampert, C. (2015). Lifelong learning with non-i.i.d. tasks
(Vol. 2015, pp. 1540–1548). Presented at the NIPS: Neural Information Processing
Systems, Montreal, Canada: Neural Information Processing Systems Foundation.'
chicago: Pentina, Anastasia, and Christoph Lampert. “Lifelong Learning with Non-i.i.d.
Tasks,” 2015:1540–48. Neural Information Processing Systems Foundation, 2015.
ieee: 'A. Pentina and C. Lampert, “Lifelong learning with non-i.i.d. tasks,” presented
at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol.
2015, pp. 1540–1548.'
ista: 'Pentina A, Lampert C. 2015. Lifelong learning with non-i.i.d. tasks. NIPS:
Neural Information Processing Systems, Advances in Neural Information Processing
Systems, vol. 2015, 1540–1548.'
mla: Pentina, Anastasia, and Christoph Lampert. Lifelong Learning with Non-i.i.d.
Tasks. Vol. 2015, Neural Information Processing Systems Foundation, 2015,
pp. 1540–48.
short: A. Pentina, C. Lampert, in:, Neural Information Processing Systems Foundation,
2015, pp. 1540–1548.
conference:
end_date: 2015-12-12
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2015-12-07
date_created: 2018-12-11T11:51:57Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-06-03T11:41:45Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
intvolume: ' 2015'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://papers.nips.cc/paper/6007-lifelong-learning-with-non-iid-tasks
month: '01'
oa: 1
oa_version: None
page: 1540 - 1548
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '5781'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lifelong learning with non-i.i.d. tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...
---
_id: '1430'
abstract:
- lang: eng
text: Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired
by natural evolution. In recent years the field of evolutionary computation has
developed a rigorous analytical theory to analyse their runtime on many illustrative
problems. Here we apply this theory to a simple model of natural evolution. In
the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between
occurrence of new mutations is much longer than the time it takes for a new beneficial
mutation to take over the population. In this situation, the population only contains
copies of one genotype and evolution can be modelled as a (1+1)-type process where
the probability of accepting a new genotype (improvements or worsenings) depends
on the change in fitness. We present an initial runtime analysis of SSWM, quantifying
its performance for various parameters and investigating differences to the (1+1)
EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing
fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking
advantage of information on the fitness gradient.
article_processing_charge: No
arxiv: 1
author:
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Jorge
full_name: Heredia, Jorge
last_name: Heredia
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
citation:
ama: 'Paixao T, Sudholt D, Heredia J, Trubenova B. First steps towards a runtime
comparison of natural and artificial evolution. In: Proceedings of the 2015
Annual Conference on Genetic and Evolutionary Computation. ACM; 2015:1455-1462.
doi:10.1145/2739480.2754758'
apa: 'Paixao, T., Sudholt, D., Heredia, J., & Trubenova, B. (2015). First steps
towards a runtime comparison of natural and artificial evolution. In Proceedings
of the 2015 Annual Conference on Genetic and Evolutionary Computation (pp.
1455–1462). Madrid, Spain: ACM. https://doi.org/10.1145/2739480.2754758'
chicago: Paixao, Tiago, Dirk Sudholt, Jorge Heredia, and Barbora Trubenova. “First
Steps towards a Runtime Comparison of Natural and Artificial Evolution.” In Proceedings
of the 2015 Annual Conference on Genetic and Evolutionary Computation, 1455–62.
ACM, 2015. https://doi.org/10.1145/2739480.2754758.
ieee: T. Paixao, D. Sudholt, J. Heredia, and B. Trubenova, “First steps towards
a runtime comparison of natural and artificial evolution,” in Proceedings of
the 2015 Annual Conference on Genetic and Evolutionary Computation, Madrid,
Spain, 2015, pp. 1455–1462.
ista: 'Paixao T, Sudholt D, Heredia J, Trubenova B. 2015. First steps towards a
runtime comparison of natural and artificial evolution. Proceedings of the 2015
Annual Conference on Genetic and Evolutionary Computation. GECCO: Genetic and
evolutionary computation conference, 1455–1462.'
mla: Paixao, Tiago, et al. “First Steps towards a Runtime Comparison of Natural
and Artificial Evolution.” Proceedings of the 2015 Annual Conference on Genetic
and Evolutionary Computation, ACM, 2015, pp. 1455–62, doi:10.1145/2739480.2754758.
short: T. Paixao, D. Sudholt, J. Heredia, B. Trubenova, in:, Proceedings of the
2015 Annual Conference on Genetic and Evolutionary Computation, ACM, 2015, pp.
1455–1462.
conference:
end_date: 2015-07-15
location: Madrid, Spain
name: 'GECCO: Genetic and evolutionary computation conference'
start_date: 2015-07-11
date_created: 2018-12-11T11:51:58Z
date_published: 2015-07-11T00:00:00Z
date_updated: 2025-09-23T08:50:33Z
day: '11'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1145/2739480.2754758
ec_funded: 1
external_id:
arxiv:
- '1504.06260'
isi:
- '000358795700182'
fulldoi: https://doi.org/10.1145/2739480.2754758
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1504.06260
month: '07'
oa: 1
oa_version: Preprint
page: 1455 - 1462
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary
Computation
publication_status: published
publisher: ACM
publist_id: '5768'
quality_controlled: '1'
scopus_import: '1'
status: public
title: First steps towards a runtime comparison of natural and artificial evolution
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2015'
...
---
_id: '1474'
abstract:
- lang: eng
text: Cryptographic access control offers selective access to encrypted data via
a combination of key management and functionality-rich cryptographic schemes,
such as attribute-based encryption. Using this approach, publicly available meta-data
may inadvertently leak information on the access policy that is enforced by cryptography,
which renders cryptographic access control unusable in settings where this information
is highly sensitive. We begin to address this problem by presenting rigorous definitions
for policy privacy in cryptographic access control. For concreteness we set our
results in the model of Role-Based Access Control (RBAC), where we identify and
formalize several different flavors of privacy, however, our framework should
serve as inspiration for other models of access control. Based on our insights
we propose a new system which significantly improves on the privacy properties
of state-of-the-art constructions. Our design is based on a novel type of privacy-preserving
attribute-based encryption, which we introduce and show how to instantiate. We
present our results in the context of a cryptographic RBAC system by Ferrara et
al. (CSF'13), which uses cryptography to control read access to files, while write
access is still delegated to trusted monitors. We give an extension of the construction
that permits cryptographic control over write access. Our construction assumes
that key management uses out-of-band channels between the policy enforcer and
the users but eliminates completely the need for monitoring read/write access
to the data.
article_processing_charge: No
author:
- first_name: Anna
full_name: Ferrara, Anna
last_name: Ferrara
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Bin
full_name: Liu, Bin
last_name: Liu
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic
access control. In: IEEE; 2015:46-60. doi:10.1109/CSF.2015.11'
apa: 'Ferrara, A., Fuchsbauer, G., Liu, B., & Warinschi, B. (2015). Policy privacy
in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security
Foundations, Verona, Italy: IEEE. https://doi.org/10.1109/CSF.2015.11'
chicago: Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy
Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. https://doi.org/10.1109/CSF.2015.11.
ieee: 'A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic
access control,” presented at the CSF: Computer Security Foundations, Verona,
Italy, 2015, pp. 46–60.'
ista: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic
access control. CSF: Computer Security Foundations, 46–60.'
mla: Ferrara, Anna, et al. Policy Privacy in Cryptographic Access Control.
IEEE, 2015, pp. 46–60, doi:10.1109/CSF.2015.11.
short: A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.
conference:
end_date: 2015-07-17
location: Verona, Italy
name: 'CSF: Computer Security Foundations'
start_date: 2015-07-13
date_created: 2018-12-11T11:52:14Z
date_published: 2015-09-04T00:00:00Z
date_updated: 2025-09-23T09:50:52Z
day: '04'
department:
- _id: KrPi
doi: 10.1109/CSF.2015.11
ec_funded: 1
external_id:
isi:
- '000380428500004'
fulldoi: https://doi.org/10.1109/CSF.2015.11
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://epubs.surrey.ac.uk/808055/
month: '09'
oa: 1
oa_version: Submitted Version
page: 46-60
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: IEEE
publist_id: '5722'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Policy privacy in cryptographic access control
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2015'
...
---
_id: '1481'
abstract:
- lang: eng
text: 'Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role
not only in the development of mathematical and logical skills, but also in the
emotional and social development. In this paper, we address the problem of generating
targeted starting positions for such games. This can facilitate new approaches
for bringing novice players to mastery, and also leads to discovery of interesting
game variants. We present an approach that generates starting states of varying
hardness levels for player 1 in a two-player board game, given rules of the board
game, the desired number of steps required for player 1 to win, and the expertise
levels of the two players. Our approach leverages symbolic methods and iterative
simulation to efficiently search the extremely large state space. We present experimental
results that include discovery of states of varying hardness levels for several
simple grid-based board games. The presence of such states for standard game variants
like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played
as the default start state is heavily biased. '
acknowledgement: "A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: 'Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting
positions for simple traditional board games. In: Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.'
apa: 'Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation
of alternative starting positions for simple traditional board games. In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp.
745–752). Austin, TX, USA: AAAI Press.'
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation
of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52.
AAAI Press, 2015.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative
starting positions for simple traditional board games,” in Proceedings of the
Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA,
2015, vol. 2, pp. 745–752.
ista: 'Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative
starting positions for simple traditional board games. Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 2, 745–752.'
mla: Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions
for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference
on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.
short: U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.
conference:
end_date: 2015-01-30
location: Austin, TX, USA
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2015-01-25
date_created: 2018-12-11T11:52:16Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-05-19T11:10:17Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
arxiv:
- '1411.4023'
intvolume: ' 2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300
month: '01'
oa: 1
oa_version: None
page: 745 - 752
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '5713'
quality_controlled: '1'
related_material:
record:
- id: '5410'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Automatic generation of alternative starting positions for simple traditional
board games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '1483'
abstract:
- lang: eng
text: Topological data analysis offers a rich source of valuable information to
study vision problems. Yet, so far we lack a theoretically sound connection to
popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In
this work, we establish such a connection by designing a multi-scale kernel for
persistence diagrams, a stable summary representation of topological features
in data. We show that this kernel is positive definite and prove its stability
with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets
for 3D shape classification/retrieval and texture recognition show considerable
performance gains of the proposed method compared to an alternative approach that
is based on the recently introduced persistence landscapes.
article_processing_charge: No
arxiv: 1
author:
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
citation:
ama: 'Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for
topological machine learning. In: IEEE; 2015:4741-4748. doi:10.1109/CVPR.2015.7299106'
apa: 'Reininghaus, J., Huber, S., Bauer, U., & Kwitt, R. (2015). A stable multi-scale
kernel for topological machine learning (pp. 4741–4748). Presented at the CVPR:
Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7299106'
chicago: Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable
Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299106.
ieee: 'J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel
for topological machine learning,” presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.'
ista: 'Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel
for topological machine learning. CVPR: Computer Vision and Pattern Recognition,
4741–4748.'
mla: Reininghaus, Jan, et al. A Stable Multi-Scale Kernel for Topological Machine
Learning. IEEE, 2015, pp. 4741–48, doi:10.1109/CVPR.2015.7299106.
short: J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.
conference:
end_date: 2015-06-12
location: Boston, MA, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:52:17Z
date_published: 2015-10-14T00:00:00Z
date_updated: 2025-06-11T06:37:43Z
day: '14'
department:
- _id: HeEd
doi: 10.1109/CVPR.2015.7299106
external_id:
arxiv:
- '1412.6821'
fulldoi: https://doi.org/10.1109/CVPR.2015.7299106
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.6821
month: '10'
oa: 1
oa_version: Preprint
page: 4741 - 4748
publication_identifier:
eisbn:
- '978-1-4673-6964-0 '
publication_status: published
publisher: IEEE
publist_id: '5709'
scopus_import: '1'
status: public
title: A stable multi-scale kernel for topological machine learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...