---
OA_place: publisher
_id: '1398'
abstract:
- lang: eng
text: Hybrid zones represent evolutionary laboratories, where recombination brings
together alleles in combinations which have not previously been tested by selection.
This provides an excellent opportunity to test the effect of molecular variation
on fitness, and how this variation is able to spread through populations in a
natural context. The snapdragon Antirrhinum majus is polymorphic in the wild for
two loci controlling the distribution of yellow and magenta floral pigments. Where
the yellow A. m. striatum and the magenta A. m. pseudomajus meet along a valley
in the Spanish Pyrenees they form a stable hybrid zone Alleles at these loci recombine
to give striking transgressive variation for flower colour. The sharp transition
in phenotype over ~1km implies strong selection maintaining the hybrid zone. An
indirect assay of pollinator visitation in the field found that pollinators forage
in a positive-frequency dependent manner on Antirrhinum, matching previous data
on fruit set. Experimental arrays and paternity analysis of wild-pollinated seeds
demonstrated assortative mating for pigmentation alleles, and that pollinator
behaviour alone is sufficient to explain this pattern. Selection by pollinators
should be sufficiently strong to maintain the hybrid zone, although other mechanisms
may be at work. At a broader scale I examined evolutionary transitions between
yellow and anthocyanin pigmentation in the tribe Antirrhinae, and found that selection
has acted strate that pollinators are a major determinant of reproductive success
and mating patterns in wild Antirrhinum.
acknowledgement: "I am indebted to many people for their support during my PhD, but
I particularly wish to thank Nick Barton for his guidance and intuition, and for
encouraging me to take the time to look beyond the immediate topic of my PhD to
understand the broader context. I am also especially grateful to David Field his
bottomless patience, invaluable advice on experimental design, analysis and scientific
writing, and for tireless work on the population surveys and genomic work without
most of my thesis could not have happened. \r\n\r\nIt has been a pleasure to work
with the combined strengths of the groups at The John Innes Centre, University of
Toulouse and IST Austria. Thanks to Enrico Coen and his group for hosting me in
Norwich in 2011 and especially for setting up the tag experiment. \r\n\r\nI thank
David Field, Desmond Bradley and Maria Clara Melo-Hurtado for organising field collections,
as well as Monique Burrus and Christophe Andalo and a large number of volunteers
for their e ff orts helping with the field work. Furthermore I thank Coline Jaworski
for providing seeds and for her input into the design of the experimental arrays,
and Matthew Couchman for maintaining the database of. \r\n\r\nIn addition to those
mentioned above, I am grateful to Melinda Pickup, Spencer Barrett, and four anonymous
reviewers for their insightful comments on sections of this manuscript. I also thank
Jana Porsche for her e ff orts in tracking down the more obscure references for
chapter 5, and Jon Bollback for his advice about the analysis. \r\n\r\nI am indebted
to Jon Ågren for his patience whilst I finished this thesis, and to Sylvia Cremer
and Magnus Nordborg for taking the time to read and evaluate the thesis given a
shorter deadline than was fair. \r\n\r\nA very positive aspect of my PhD has been
the supportive atmosphere of IST. In particular, I have come to appreciate the enormous
support from our group assistants Nicole Hotzy, Julia Asimakis, Christine Ostermann
and Jerneja Beslagic. I also thank Christian Chaloupka and Stefan Hipfinger for
their enthusiasm and readiness to help where possible in setting up our greenhouse
and experiments. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Ellis T. The role of pollinator-mediated selection in the maintenance of a
flower color polymorphism in an Antirrhinum majus hybrid zone. 2016. doi:10.15479/AT:ISTA:TH_526
apa: Ellis, T. (2016). The role of pollinator-mediated selection in the maintenance
of a flower color polymorphism in an Antirrhinum majus hybrid zone. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_526
chicago: Ellis, Thomas. “The Role of Pollinator-Mediated Selection in the Maintenance
of a Flower Color Polymorphism in an Antirrhinum Majus Hybrid Zone.” Institute
of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:TH_526 .
ieee: T. Ellis, “The role of pollinator-mediated selection in the maintenance of
a flower color polymorphism in an Antirrhinum majus hybrid zone,” Institute of
Science and Technology Austria, 2016.
ista: Ellis T. 2016. The role of pollinator-mediated selection in the maintenance
of a flower color polymorphism in an Antirrhinum majus hybrid zone. Institute
of Science and Technology Austria.
mla: Ellis, Thomas. The Role of Pollinator-Mediated Selection in the Maintenance
of a Flower Color Polymorphism in an Antirrhinum Majus Hybrid Zone. Institute
of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:TH_526 .
short: T. Ellis, The Role of Pollinator-Mediated Selection in the Maintenance of
a Flower Color Polymorphism in an Antirrhinum Majus Hybrid Zone, Institute of
Science and Technology Austria, 2016.
corr_author: '1'
date_created: 2018-12-11T11:51:47Z
date_published: 2016-02-18T00:00:00Z
date_updated: 2026-04-09T10:52:07Z
day: '18'
ddc:
- '576'
degree_awarded: PhD
department:
- _id: NiBa
- _id: GradSch
doi: '10.15479/AT:ISTA:TH_526 '
file:
- access_level: open_access
checksum: f0f7c260e19ec1416824b165afe2d5fd
content_type: application/pdf
creator: dernst
date_created: 2025-07-03T06:24:17Z
date_updated: 2025-07-03T06:24:17Z
file_id: '19957'
file_name: 2016_Thesis_Ellis_noSignatures.pdf
file_size: 7590862
relation: main_file
- access_level: closed
checksum: a89b17ff27cf92c9a15f6b3d46bd7e53
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:51Z
date_updated: 2025-07-03T06:24:39Z
file_id: '5106'
file_name: IST-2016-526-v1+1_Ellis_signed_thesis.pdf
file_size: 11928241
relation: main_file
file_date_updated: 2025-07-03T06:24:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '130'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5809'
pubrep_id: '526'
related_material:
record:
- id: '5553'
relation: dissertation_contains
status: public
- id: '5551'
relation: dissertation_contains
status: public
- id: '5552'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: The role of pollinator-mediated selection in the maintenance of a flower color
polymorphism in an Antirrhinum majus hybrid zone
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2016'
...
---
OA_place: publisher
_id: '1130'
abstract:
- lang: eng
text: "In this thesis we present a computer-aided programming approach to concurrency.
Our approach helps the programmer by automatically fixing concurrency-related
bugs, i.e. bugs that occur when the program is executed using an aggressive preemptive
scheduler, but not when using a non-preemptive (cooperative) scheduler. Bugs are
program behaviours that are incorrect w.r.t. a specification. We consider both
user-provided explicit specifications in the form of assertion\r\nstatements in
the code as well as an implicit specification. The implicit specification is inferred
from the non-preemptive behaviour. Let us consider sequences of calls that the
program makes to an external interface. The implicit specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of sequences produced under a non-preemptive scheduler. We consider several
semantics-preserving fixes that go beyond atomic sections typically explored in
the synchronisation synthesis literature. Our synthesis is able to place locks,
barriers and wait-signal statements and last, but not least reorder independent
statements. The latter may be useful if a thread is released to early, e.g., before
some initialisation is completed. We guarantee that our synthesis does not introduce
deadlocks and that the synchronisation inserted is optimal w.r.t. a given objective
function. We dub our solution trace-based synchronisation synthesis and it is
loosely based on counterexample-guided inductive synthesis (CEGIS). The synthesis
works by discovering a trace that is incorrect w.r.t. the specification and identifying
ordering constraints crucial to trigger the specification violation. Synchronisation
may be placed immediately (greedy approach) or delayed until all incorrect traces
are found (non-greedy approach). For the non-greedy approach we construct a set
of global constraints over synchronisation placements. Each model of the global
constraints set corresponds to a correctness-ensuring synchronisation placement.
The placement that is optimal w.r.t. the given objective function is chosen as
the synchronisation solution. We evaluate our approach on a number of realistic
(albeit simplified) Linux device-driver\r\nbenchmarks. The benchmarks are versions
of the drivers with known concurrency-related bugs. For the experiments with an
explicit specification we added assertions that would detect the bugs in the experiments.
Device drivers lend themselves to implicit specification, where the device and
the operating system are the external interfaces. Our experiments demonstrate
that our synthesis method is precise and efficient. We implemented objective functions
for coarse-grained and fine-grained locking and observed that different synchronisation
placements are produced for our experiments, favouring e.g. a minimal number of
synchronisation operations or maximum concurrency."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Tarrach T. Automatic synthesis of synchronisation primitives for concurrent
programs. 2016. doi:10.15479/at:ista:1130
apa: Tarrach, T. (2016). Automatic synthesis of synchronisation primitives for
concurrent programs. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:1130
chicago: Tarrach, Thorsten. “Automatic Synthesis of Synchronisation Primitives for
Concurrent Programs.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/at:ista:1130.
ieee: T. Tarrach, “Automatic synthesis of synchronisation primitives for concurrent
programs,” Institute of Science and Technology Austria, 2016.
ista: Tarrach T. 2016. Automatic synthesis of synchronisation primitives for concurrent
programs. Institute of Science and Technology Austria.
mla: Tarrach, Thorsten. Automatic Synthesis of Synchronisation Primitives for
Concurrent Programs. Institute of Science and Technology Austria, 2016, doi:10.15479/at:ista:1130.
short: T. Tarrach, Automatic Synthesis of Synchronisation Primitives for Concurrent
Programs, Institute of Science and Technology Austria, 2016.
corr_author: '1'
date_created: 2018-12-11T11:50:19Z
date_published: 2016-07-07T00:00:00Z
date_updated: 2026-04-09T10:54:01Z
day: '07'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
- _id: GradSch
doi: 10.15479/at:ista:1130
ec_funded: 1
file:
- access_level: open_access
checksum: 319a506831650327e85376db41fc1094
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:39:32Z
date_updated: 2021-02-22T11:39:32Z
file_id: '9179'
file_name: 2016_Tarrach_Thesis.pdf
file_size: 1523935
relation: main_file
success: 1
- access_level: closed
checksum: 39efcd789f0ad859ff15652cb7afc412
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-16T14:14:38Z
date_updated: 2021-11-17T13:46:55Z
file_id: '10296'
file_name: 2016_Tarrach_Thesispdfa.pdf
file_size: 1306068
relation: main_file
file_date_updated: 2021-11-17T13:46:55Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://thorstent.github.io/theses/phd_thorsten_tarrach.pdf
month: '07'
oa: 1
oa_version: Published Version
page: '151'
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6230'
related_material:
record:
- id: '2218'
relation: part_of_dissertation
status: public
- id: '2445'
relation: part_of_dissertation
status: public
- id: '1729'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Automatic synthesis of synchronisation primitives for concurrent programs
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2016'
...
---
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
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'
...
---
OA_place: publisher
_id: '1405'
abstract:
- lang: eng
text: "Motivated by the analysis of highly dynamic message-passing systems, i.e.
unbounded thread creation, mobility, etc. we present a framework for the analysis
of depth-bounded systems. Depth-bounded systems are one of the most expressive
known fragment of the π-calculus for which interesting verification problems are
still decidable. Even though they are infinite state systems depth-bounded systems
are well-structured, thus can be analyzed algorithmically. We give an interpretation
of depth-bounded systems as graph-rewriting systems. This gives more flexibility
and ease of use to apply depth-bounded systems to other type of systems like shared
memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for
depth-bounded systems, a prerequisite for the effective representation of downward-closed
sets. Downward-closed sets are needed by forward saturation-based algorithms to
represent potentially infinite sets of states. Then, we present an abstract interpretation
framework to compute the covering set of well-structured transition systems. Because,
in general, the covering set is not computable, our abstraction over-approximates
the actual covering set. Our abstraction captures the essence of acceleration
based-algorithms while giving up enough precision to ensure convergence. We have
implemented the analysis in the PICASSO tool and show that it is accurate in practice.
Finally, we build some further analyses like termination using the covering set
as starting point."
acknowledgement: "This work was supported in part by the Austrian Science Fund NFN
RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative
Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger
and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of
Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal
Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint
work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS
2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this
part is mostly related to the implementation. The theory required to understand
the method and its implementation is quickly recalled to make the thesis self-contained,
but should not be considered as a contribution. For the details of the methods,
we refer the reader to the orig- inal publication [13] and the corresponding technical
report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar,
and Thomas Wies. I also would like to thank the people who supported over the past
4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on
projects I was interested in. My collaborators, especially Thomas Wies with whom
I worked since the beginning. The members of my thesis committee, Viktor Kun- cak
and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny,
Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created
an enjoyable environment. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: Zufferey D. Analysis of dynamic message passing programs. 2013. doi:10.15479/at:ista:1405
apa: Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:1405
chicago: Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute
of Science and Technology Austria, 2013. https://doi.org/10.15479/at:ista:1405.
ieee: D. Zufferey, “Analysis of dynamic message passing programs,” Institute of
Science and Technology Austria, 2013.
ista: Zufferey D. 2013. Analysis of dynamic message passing programs. Institute
of Science and Technology Austria.
mla: Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute
of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.
short: D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science
and Technology Austria, 2013.
corr_author: '1'
date_created: 2018-12-11T11:51:50Z
date_published: 2013-09-05T00:00:00Z
date_updated: 2026-04-09T14:35:24Z
day: '05'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
- _id: GradSch
doi: 10.15479/at:ista:1405
ec_funded: 1
file:
- access_level: open_access
checksum: ed2d7b52933d134e8dc69d569baa284e
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:28:36Z
date_updated: 2021-02-22T11:28:36Z
file_id: '9176'
file_name: 2013_Zufferey_thesis_final.pdf
file_size: 1514906
relation: main_file
success: 1
- access_level: closed
checksum: cecc4c4b14225bee973d32e3dba91a55
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-16T14:42:52Z
date_updated: 2021-11-17T13:47:58Z
file_id: '10298'
file_name: 2013_Zufferey_thesis_final_pdfa.pdf
file_size: 1378313
relation: main_file
file_date_updated: 2021-11-17T13:47:58Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://dzufferey.github.io/files/2013_thesis.pdf
month: '09'
oa: 1
oa_version: Published Version
page: '134'
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5802'
related_material:
record:
- id: '4361'
relation: part_of_dissertation
status: public
- id: '3251'
relation: part_of_dissertation
status: public
- id: '2847'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Analysis of dynamic message passing programs
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2013'
...
---
OA_place: publisher
_id: '2964'
abstract:
- lang: eng
text: 'CA3 pyramidal neurons are important for memory formation and pattern completion
in the hippocampal network. These neurons receive multiple excitatory inputs from
numerous sources. Therefore, the rules of spatiotemporal integration of multiple
synaptic inputs and propagation of action potentials are important to understand
how CA3 neurons contribute to higher brain functions at cellular level. By using
confocally targeted patch-clamp recording techniques, we investigated the biophysical
properties of rat CA3 pyramidal neuron dendrites. We found two distinct dendritic
domains critical for action potential initiation and propagation: In the proximal
domain, action potentials initiated in the axon backpropagate actively with large
amplitude and fast time course. In the distal domain, Na+-channel mediated dendritic
spikes are efficiently evoked by local dendritic depolarization or waveforms mimicking
synaptic events. These findings can be explained by a high Na+-to-K+ conductance
density ratio of CA3 pyramidal neuron dendrites. The results challenge the prevailing
view that proximal mossy fiber inputs activate CA3 pyramidal neurons more efficiently
than distal perforant inputs by showing that the distal synapses trigger a different
form of activity represented by dendritic spikes. The high probability of dendritic
spike initiation in the distal area may enhance the computational power of CA3
pyramidal neurons in the hippocampal network. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sooyun
full_name: Kim, Sooyun
id: 394AB1C8-F248-11E8-B48F-1D18A9856A87
last_name: Kim
citation:
ama: Kim S. Active properties of hippocampal CA3 pyramidal neuron dendrites. 2012.
apa: Kim, S. (2012). Active properties of hippocampal CA3 pyramidal neuron dendrites.
Institute of Science and Technology Austria.
chicago: Kim, Sooyun. “Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites.”
Institute of Science and Technology Austria, 2012.
ieee: S. Kim, “Active properties of hippocampal CA3 pyramidal neuron dendrites,”
Institute of Science and Technology Austria, 2012.
ista: Kim S. 2012. Active properties of hippocampal CA3 pyramidal neuron dendrites.
Institute of Science and Technology Austria.
mla: Kim, Sooyun. Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites.
Institute of Science and Technology Austria, 2012.
short: S. Kim, Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites,
Institute of Science and Technology Austria, 2012.
corr_author: '1'
date_created: 2018-12-11T12:00:35Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2026-04-09T14:36:04Z
day: '01'
degree_awarded: PhD
department:
- _id: PeJo
- _id: GradSch
language:
- iso: eng
month: '06'
oa_version: None
page: '65'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '3755'
related_material:
record:
- id: '3258'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
title: Active properties of hippocampal CA3 pyramidal neuron dendrites
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2012'
...
---
OA_place: publisher
_id: '3962'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Holger
full_name: Pflicke, Holger
id: CAA57A9A-5B61-11E9-B130-E0C1E1F2C83D
last_name: Pflicke
citation:
ama: Pflicke H. Dendritic cell migration across basement membranes in the skin.
2010.
apa: Pflicke, H. (2010). Dendritic cell migration across basement membranes
in the skin. Institute of Science and Technology Austria.
chicago: Pflicke, Holger. “ Dendritic Cell Migration across Basement Membranes
in the Skin.” Institute of Science and Technology Austria, 2010.
ieee: H. Pflicke, “ Dendritic cell migration across basement membranes in the skin,”
Institute of Science and Technology Austria, 2010.
ista: Pflicke H. 2010. Dendritic cell migration across basement membranes in the
skin. Institute of Science and Technology Austria.
mla: Pflicke, Holger. Dendritic Cell Migration across Basement Membranes in
the Skin. Institute of Science and Technology Austria, 2010.
short: H. Pflicke, Dendritic Cell Migration across Basement Membranes in the Skin,
Institute of Science and Technology Austria, 2010.
corr_author: '1'
date_created: 2018-12-11T12:06:08Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2026-04-09T14:37:07Z
day: '01'
degree_awarded: PhD
department:
- _id: CaHe
- _id: GradSch
language:
- iso: eng
month: '07'
oa_version: None
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '2165'
status: public
supervisor:
- 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
title: "\uFEFF\uFEFFDendritic cell migration across basement membranes in the skin"
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2010'
...