---
_id: '3409'
abstract:
- lang: eng
text: With the introduction of single-molecule force spectroscopy (SMFS) it has
become possible to directly access the interactions of various molecular systems.
A bottleneck in conventional SMFS is collecting the large amount of data required
for statistically meaningful analysis. Currently, atomic force microscopy (AFM)-based
SMFS requires the user to tediously 'fish' for single molecules. In addition,
most experimental and environmental conditions must be manually adjusted. Here,
we developed a fully automated single-molecule force spectroscope. The instrument
is able to perform SMFS while monitoring and regulating experimental conditions
such as buffer composition and temperature. Cantilever alignment and calibration
can also be automatically performed during experiments. This, combined with in-line
data analysis, enables the instrument, once set up, to perform complete SMFS experiments
autonomously.
author:
- first_name: Jens
full_name: Struckmeier, Jens
last_name: Struckmeier
- first_name: Reiner
full_name: Wahl, Reiner
last_name: Wahl
- first_name: Mirko
full_name: Leuschner, Mirko
last_name: Leuschner
- first_name: Joao
full_name: Nunes, Joao
last_name: Nunes
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Ulrich
full_name: Geisler, Ulrich
last_name: Geisler
- first_name: Gerd
full_name: Hofmann, Gerd
last_name: Hofmann
- first_name: Torsten
full_name: Jähnke, Torsten
last_name: Jähnke
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Struckmeier J, Wahl R, Leuschner M, et al. Fully automated single-molecule
force spectroscopy for screening applications. Nanotechnology. 2008;19(38).
doi:10.1088/0957-4484/19/38/384020
apa: Struckmeier, J., Wahl, R., Leuschner, M., Nunes, J., Janovjak, H. L., Geisler,
U., … Mueller, D. (2008). Fully automated single-molecule force spectroscopy for
screening applications. Nanotechnology. IOP Publishing Ltd. https://doi.org/10.1088/0957-4484/19/38/384020
chicago: Struckmeier, Jens, Reiner Wahl, Mirko Leuschner, Joao Nunes, Harald L Janovjak,
Ulrich Geisler, Gerd Hofmann, Torsten Jähnke, and Daniel Mueller. “Fully Automated
Single-Molecule Force Spectroscopy for Screening Applications.” Nanotechnology.
IOP Publishing Ltd., 2008. https://doi.org/10.1088/0957-4484/19/38/384020.
ieee: J. Struckmeier et al., “Fully automated single-molecule force spectroscopy
for screening applications,” Nanotechnology, vol. 19, no. 38. IOP Publishing
Ltd., 2008.
ista: Struckmeier J, Wahl R, Leuschner M, Nunes J, Janovjak HL, Geisler U, Hofmann
G, Jähnke T, Mueller D. 2008. Fully automated single-molecule force spectroscopy
for screening applications. Nanotechnology. 19(38).
mla: Struckmeier, Jens, et al. “Fully Automated Single-Molecule Force Spectroscopy
for Screening Applications.” Nanotechnology, vol. 19, no. 38, IOP Publishing
Ltd., 2008, doi:10.1088/0957-4484/19/38/384020.
short: J. Struckmeier, R. Wahl, M. Leuschner, J. Nunes, H.L. Janovjak, U. Geisler,
G. Hofmann, T. Jähnke, D. Mueller, Nanotechnology 19 (2008).
date_created: 2018-12-11T12:03:11Z
date_published: 2008-08-12T00:00:00Z
date_updated: 2021-01-12T07:43:17Z
day: '12'
doi: 10.1088/0957-4484/19/38/384020
extern: 1
intvolume: ' 19'
issue: '38'
month: '08'
publication: Nanotechnology
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '2993'
quality_controlled: 0
status: public
title: Fully automated single-molecule force spectroscopy for screening applications
type: journal_article
volume: 19
year: '2008'
...
---
_id: '3410'
abstract:
- lang: eng
text: Membrane proteins are involved in essential biological processes such as energy
conversion, signal transduction, solute transport and secretion. All biological
processes, also those involving membrane proteins, are steered by molecular interactions.
Molecular interactions guide the folding and stability of membrane proteins, determine
their assembly, switch their functional states or mediate signal transduction.
The sequential steps of molecular interactions driving these processes can be
described by dynamic energy landscapes. The conceptual energy landscape allows
to follow the complex reaction pathways of membrane proteins while its modifications
describe why and how pathways are changed. Single-molecule force spectroscopy
(SMFS) detects, quantifies and locates interactions within and between membrane
proteins. SMFS helps to determine how these interactions change with temperature,
point mutations, oligomerization and the functional states of membrane proteins.
Applied in different modes, SMFS explores the co-existence and population of reaction
pathways in the energy landscape of the protein and thus reveals detailed insights
into local mechanisms, determining its structural and functional relationships.
Here we review how SMFS extracts the defining parameters of an energy landscape
such as the barrier position, reaction kinetics and roughness with high precision.
author:
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Tanuj
full_name: Sapra, Tanuj K
last_name: Sapra
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: 'Janovjak HL, Sapra T, Kedrov A, Mueller D. From valleys to ridges: Exploring
the energy landscape of single membrane proteins. ChemPhysChem. 2008;9(7):954-966.
doi:10.1002/cphc.200700662'
apa: 'Janovjak, H. L., Sapra, T., Kedrov, A., & Mueller, D. (2008). From valleys
to ridges: Exploring the energy landscape of single membrane proteins. ChemPhysChem.
Wiley-Blackwell. https://doi.org/10.1002/cphc.200700662'
chicago: 'Janovjak, Harald L, Tanuj Sapra, Alexej Kedrov, and Daniel Mueller. “From
Valleys to Ridges: Exploring the Energy Landscape of Single Membrane Proteins.”
ChemPhysChem. Wiley-Blackwell, 2008. https://doi.org/10.1002/cphc.200700662.'
ieee: 'H. L. Janovjak, T. Sapra, A. Kedrov, and D. Mueller, “From valleys to ridges:
Exploring the energy landscape of single membrane proteins,” ChemPhysChem,
vol. 9, no. 7. Wiley-Blackwell, pp. 954–966, 2008.'
ista: 'Janovjak HL, Sapra T, Kedrov A, Mueller D. 2008. From valleys to ridges:
Exploring the energy landscape of single membrane proteins. ChemPhysChem. 9(7),
954–966.'
mla: 'Janovjak, Harald L., et al. “From Valleys to Ridges: Exploring the Energy
Landscape of Single Membrane Proteins.” ChemPhysChem, vol. 9, no. 7, Wiley-Blackwell,
2008, pp. 954–66, doi:10.1002/cphc.200700662.'
short: H.L. Janovjak, T. Sapra, A. Kedrov, D. Mueller, ChemPhysChem 9 (2008) 954–966.
date_created: 2018-12-11T12:03:11Z
date_published: 2008-05-02T00:00:00Z
date_updated: 2019-04-26T07:22:27Z
day: '02'
doi: 10.1002/cphc.200700662
extern: 1
intvolume: ' 9'
issue: '7'
month: '05'
page: 954 - 966
publication: ChemPhysChem
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2992'
quality_controlled: 0
status: public
title: 'From valleys to ridges: Exploring the energy landscape of single membrane
proteins'
type: review
volume: 9
year: '2008'
...
---
_id: '3435'
abstract:
- lang: eng
text: We develop a new method for estimating effective population sizes, Ne, and
selection coefficients, s, from time-series data of allele frequencies sampled
from a single diallelic locus. The method is based on calculating transition probabilities,
using a numerical solution of the diffusion process, and assuming independent
binomial sampling from this diffusion process at each time point. We apply the
method in two example applications. First, we estimate selection coefficients
acting on the CCR5-Δ32 mutation on the basis of published samples of contemporary
and ancient human DNA. We show that the data are compatible with the assumption
of s = 0, although moderate amounts of selection acting on this mutation cannot
be excluded. In our second example, we estimate the selection coefficient acting
on a mutation segregating in an experimental phage population. We show that the
selection coefficient acting on this mutation is ~0.43.
author:
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Thomas
full_name: York, Thomas L
last_name: York
- first_name: Rasmus
full_name: Nielsen, Rasmus
last_name: Nielsen
citation:
ama: Bollback JP, York T, Nielsen R. Estimation of 2Nes From Temporal Allele Frequency
Data. Genetics. 2008;179(1):497-502. doi:10.1534/genetics.107.085019
apa: Bollback, J. P., York, T., & Nielsen, R. (2008). Estimation of 2Nes From
Temporal Allele Frequency Data. Genetics. Genetics Society of America.
https://doi.org/10.1534/genetics.107.085019
chicago: Bollback, Jonathan P, Thomas York, and Rasmus Nielsen. “Estimation of 2Nes
From Temporal Allele Frequency Data.” Genetics. Genetics Society of America,
2008. https://doi.org/10.1534/genetics.107.085019.
ieee: J. P. Bollback, T. York, and R. Nielsen, “Estimation of 2Nes From Temporal
Allele Frequency Data,” Genetics, vol. 179, no. 1. Genetics Society of
America, pp. 497–502, 2008.
ista: Bollback JP, York T, Nielsen R. 2008. Estimation of 2Nes From Temporal Allele
Frequency Data. Genetics. 179(1), 497–502.
mla: Bollback, Jonathan P., et al. “Estimation of 2Nes From Temporal Allele Frequency
Data.” Genetics, vol. 179, no. 1, Genetics Society of America, 2008, pp.
497–502, doi:10.1534/genetics.107.085019.
short: J.P. Bollback, T. York, R. Nielsen, Genetics 179 (2008) 497–502.
date_created: 2018-12-11T12:03:19Z
date_published: 2008-05-01T00:00:00Z
date_updated: 2021-01-12T07:43:27Z
day: '01'
doi: 10.1534/genetics.107.085019
extern: 1
intvolume: ' 179'
issue: '1'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2390626
month: '05'
oa: 1
page: 497 - 502
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '2965'
quality_controlled: 0
status: public
title: Estimation of 2Nes From Temporal Allele Frequency Data
type: journal_article
volume: 179
year: '2008'
...
---
_id: '3501'
abstract:
- lang: eng
text: |-
The Wikipedia is a collaborative encyclopedia: anyone can contribute to its articles simply by clicking on an "edit" button. The open nature of the Wikipedia has been key to its success, but has also created a challenge: how can readers develop an informed opinion on its reliability? We propose a system that computes quantitative values of trust for the text in Wikipedia articles; these trust values provide an indication of text reliability.
The system uses as input the revision history of each article, as well as information about the reputation of the contributing authors, as provided by a reputation system. The trust of a word in an article is computed on the basis of the reputation of the original author of the word, as well as the reputation of all authors who edited text near the word. The algorithm computes word trust values that vary smoothly across the text; the trust values can be visualized using varying text-background colors. The algorithm ensures that all changes to an article's text are reflected in the trust values, preventing surreptitious content changes.
We have implemented the proposed system, and we have used it to compute and display the trust of the text of thousands of articles of the English Wikipedia. To validate our trust-computation algorithms, we show that text labeled as low-trust has a significantly higher probability of being edited in the future than text labeled as high-trust.
acknowledgement: 'This research has been partially supported by the CITRIS: Center
for Information Technology Research in the Interest of Society.'
author:
- first_name: B Thomas
full_name: Adler, B Thomas
last_name: Adler
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: de Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- first_name: Ian
full_name: Pye, Ian
last_name: Pye
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: 'Adler BT, Chatterjee K, De Alfaro L, Faella M, Pye I, Raman V. Assigning trust
to Wikipedia content. In: ACM; 2008. doi:10.1145/1822258.1822293'
apa: 'Adler, B. T., Chatterjee, K., De Alfaro, L., Faella, M., Pye, I., & Raman,
V. (2008). Assigning trust to Wikipedia content. Presented at the WikiSym: International
Symposium on Wikis, ACM. https://doi.org/10.1145/1822258.1822293'
chicago: Adler, B Thomas, Krishnendu Chatterjee, Luca De Alfaro, Marco Faella, Ian
Pye, and Vishwanath Raman. “Assigning Trust to Wikipedia Content.” ACM, 2008.
https://doi.org/10.1145/1822258.1822293.
ieee: 'B. T. Adler, K. Chatterjee, L. De Alfaro, M. Faella, I. Pye, and V. Raman,
“Assigning trust to Wikipedia content,” presented at the WikiSym: International
Symposium on Wikis, 2008.'
ista: 'Adler BT, Chatterjee K, De Alfaro L, Faella M, Pye I, Raman V. 2008. Assigning
trust to Wikipedia content. WikiSym: International Symposium on Wikis.'
mla: Adler, B. Thomas, et al. Assigning Trust to Wikipedia Content. ACM,
2008, doi:10.1145/1822258.1822293.
short: B.T. Adler, K. Chatterjee, L. De Alfaro, M. Faella, I. Pye, V. Raman, in:,
ACM, 2008.
conference:
name: 'WikiSym: International Symposium on Wikis'
date_created: 2018-12-11T12:03:40Z
date_published: 2008-09-10T00:00:00Z
date_updated: 2021-01-12T07:43:53Z
day: '10'
doi: 10.1145/1822258.1822293
extern: 1
month: '09'
publication_status: published
publisher: ACM
publist_id: '2886'
quality_controlled: 0
status: public
title: Assigning trust to Wikipedia content
type: conference
year: '2008'
...
---
_id: '3502'
abstract:
- lang: eng
text: 'In content-driven reputation systems for collaborative content, users gain
or lose reputation according to how their contributions fare: authors of long-lived
contributions gain reputation, while authors of reverted contributions lose reputation.
Existing content-driven systems are prone to Sybil attacks, in which multiple
identities, controlled by the same person, perform coordinated actions to increase
their reputation. We show that content-driven reputation systems can be made resistant
to such attacks by taking advantage of thefact that the reputation increments
and decrements depend on content modifications, which are visible to all. We present
an algorithm for content-driven reputation that prevents a set of identities from
increasing their maximum reputation without doing any useful work. Here, work
is considered useful if it causes content to evolve in a direction that is consistent
with the actions of high-reputation users. We argue that the content modifications
that require no effort, such as the insertion or deletion of arbitrary text, are
invariably non-useful. We prove a truthfullness result for the resulting system,
stating that users who wish to perform a contribution do not gain by employing
complex contribution schemes, compared to simply performing the contribution at
once. In particular, splitting the contribution in multiple portions, or employing
the coordinated actions of multiple identities, do not yield additional reputation.
Taken together, these results indicate that content-driven systems can be made
robust with respect to Sybil attacks. Copyright 2008 ACM.'
acknowledgement: 'This research has been partially supported by the CITRIS: Center
for Information Technology Research in the Interest of Society.'
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: de Alfaro, Luca
last_name: De Alfaro
- first_name: Ian
full_name: Pye, Ian
last_name: Pye
citation:
ama: 'Chatterjee K, De Alfaro L, Pye I. Robust content-driven reputation. In: ACM;
2008:33-42. doi:10.1145/1456377.1456387
'
apa: 'Chatterjee, K., De Alfaro, L., & Pye, I. (2008). Robust content-driven
reputation (pp. 33–42). Presented at the AISec: Artificial Intelligence and Security,
ACM. https://doi.org/10.1145/1456377.1456387
'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Ian Pye. “Robust Content-Driven
Reputation,” 33–42. ACM, 2008. https://doi.org/10.1145/1456377.1456387 .
ieee: 'K. Chatterjee, L. De Alfaro, and I. Pye, “Robust content-driven reputation,”
presented at the AISec: Artificial Intelligence and Security, 2008, pp. 33–42.'
ista: 'Chatterjee K, De Alfaro L, Pye I. 2008. Robust content-driven reputation.
AISec: Artificial Intelligence and Security, 33–42.'
mla: Chatterjee, Krishnendu, et al. Robust Content-Driven Reputation. ACM,
2008, pp. 33–42, doi:10.1145/1456377.1456387
.
short: K. Chatterjee, L. De Alfaro, I. Pye, in:, ACM, 2008, pp. 33–42.
conference:
name: 'AISec: Artificial Intelligence and Security'
date_created: 2018-12-11T12:03:40Z
date_published: 2008-10-31T00:00:00Z
date_updated: 2021-01-12T07:43:54Z
day: '31'
doi: '10.1145/1456377.1456387 '
extern: 1
month: '10'
page: 33 - 42
publication_status: published
publisher: ACM
publist_id: '2885'
quality_controlled: 0
status: public
title: Robust content-driven reputation
type: conference
year: '2008'
...
---
_id: '3504'
abstract:
- lang: eng
text: "Simulation and bisimulation metrics for stochastic systems provide a quantitative
gen- eralization of the classical simulation and bisimulation relations. These
metrics capture the similarity of states with respect to quantitative specifications
written in the quantitative μ-calculus and related probabilistic logics.\r\nWe
present algorithms for computing the metrics on Markov decision processes (MDPs),
turn- based stochastic games, and concurrent games. For turn-based games and MDPs,
we provide a polynomial-time algorithm based on linear programming for the computation
of the one-step metric distance between states. The algorithm improves on the
previously known exponential-time algo- rithm based on a reduction to the theory
of reals. We then present PSPACE algorithms for both the decision problem and
the problem of approximating the metric distance between two states, matching
the best known bound for Markov chains. For the bisimulation kernel of the metric,
which corresponds to probabilistic bisimulation, our algorithm works in time O(n4)
for both turn-based games and MDPs; improving the previously best known O(n9 ·
log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing
the exact distance between states is at least as hard as computing the value of
concurrent reachability games and the square-root-sum problem in computational
geometry. We show that checking whether the metric distance is bounded by a rational
r, can be accomplished via a reduction to the theory of real closed fields, involving
a\r\nformula with three quantifier alternations, yielding O(|G|O(|G|5)) time complexity,
improving the previously known reduction with O(|G|O(|G|7)) time complexity. These
algorithms can be iterated\r\nto approximate the metrics using binary search."
acknowledgement: This research was supported in part by the NSF grants CCR-0132780
and CNS-0720884.
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: 'Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics.
In: Vol 2. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2008:107-118. doi:10.4230/LIPIcs.FSTTCS.2008.1745'
apa: 'Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2008). Algorithms
for game metrics (Vol. 2, pp. 107–118). Presented at the FSTTCS: Foundations of
Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath
Raman. “Algorithms for Game Metrics,” 2:107–18. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2008. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745.
ieee: 'K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game
metrics,” presented at the FSTTCS: Foundations of Software Technology and Theoretical
Computer Science, 2008, vol. 2, pp. 107–118.'
ista: 'Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2008. Algorithms for game
metrics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science,
LIPIcs, vol. 2, 107–118.'
mla: Chatterjee, Krishnendu, et al. Algorithms for Game Metrics. Vol. 2,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 107–18, doi:10.4230/LIPIcs.FSTTCS.2008.1745.
short: K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2008, pp. 107–118.
conference:
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
date_created: 2018-12-11T12:03:40Z
date_published: 2008-12-05T00:00:00Z
date_updated: 2023-02-23T11:46:14Z
day: '05'
ddc:
- '000'
doi: 10.4230/LIPIcs.FSTTCS.2008.1745
extern: '1'
file:
- access_level: open_access
checksum: 0a447454a24e273f7ddf51dbfe47f877
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T10:01:21Z
date_updated: 2020-07-14T12:46:12Z
file_id: '6398'
file_name: 2008_LIPIcs_Chatterjee.pdf
file_size: 442139
relation: main_file
file_date_updated: 2020-07-14T12:46:12Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 107 - 118
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2883'
quality_controlled: '1'
related_material:
record:
- id: '3868'
relation: later_version
status: public
status: public
title: Algorithms for game metrics
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2008'
...
---
_id: '3516'
abstract:
- lang: eng
text: Temporal coding is a means of representing information by the time, as opposed
to the rate, at which neurons fire. Evidence of temporal coding in the hippocampus
comes from place cells, whose spike times relative to theta oscillations reflect
a rat's position while running along stereotyped trajectories. This arises from
the backwards shift in cell firing relative to local theta oscillations (phase
precession). Here we demonstrate phase precession during place-field crossings
in an open-field foraging task. This produced spike sequences in each theta cycle
that disambiguate the rat's trajectory through two-dimensional space and can be
used to predict movement direction. Furthermore, position and movement direction
were maximally predicted from firing in the early and late portions of the theta
cycle, respectively. This represents the first direct evidence of a combined representation
of position, trajectory and heading in the hippocampus, organized on a fine temporal
scale by theta oscillations.
author:
- first_name: John
full_name: Huxter,John R
last_name: Huxter
- first_name: Timothy
full_name: Senior,Timothy J
last_name: Senior
- first_name: Kevin
full_name: Allen, Kevin
last_name: Allen
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Huxter J, Senior T, Allen K, Csicsvari JL. Theta phase-specific codes for two-dimensional
position, trajectory and heading in the hippocampus. Nature Neuroscience.
2008;11(5):587-594. doi:10.1038/nn.2106
apa: Huxter, J., Senior, T., Allen, K., & Csicsvari, J. L. (2008). Theta phase-specific
codes for two-dimensional position, trajectory and heading in the hippocampus.
Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.2106
chicago: Huxter, John, Timothy Senior, Kevin Allen, and Jozsef L Csicsvari. “Theta
Phase-Specific Codes for Two-Dimensional Position, Trajectory and Heading in the
Hippocampus.” Nature Neuroscience. Nature Publishing Group, 2008. https://doi.org/10.1038/nn.2106.
ieee: J. Huxter, T. Senior, K. Allen, and J. L. Csicsvari, “Theta phase-specific
codes for two-dimensional position, trajectory and heading in the hippocampus,”
Nature Neuroscience, vol. 11, no. 5. Nature Publishing Group, pp. 587–594,
2008.
ista: Huxter J, Senior T, Allen K, Csicsvari JL. 2008. Theta phase-specific codes
for two-dimensional position, trajectory and heading in the hippocampus. Nature
Neuroscience. 11(5), 587–594.
mla: Huxter, John, et al. “Theta Phase-Specific Codes for Two-Dimensional Position,
Trajectory and Heading in the Hippocampus.” Nature Neuroscience, vol. 11,
no. 5, Nature Publishing Group, 2008, pp. 587–94, doi:10.1038/nn.2106.
short: J. Huxter, T. Senior, K. Allen, J.L. Csicsvari, Nature Neuroscience 11 (2008)
587–594.
date_created: 2018-12-11T12:03:44Z
date_published: 2008-05-29T00:00:00Z
date_updated: 2021-01-12T07:44:00Z
day: '29'
doi: 10.1038/nn.2106
extern: 1
intvolume: ' 11'
issue: '5'
month: '05'
page: 587 - 594
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '2869'
quality_controlled: 0
status: public
title: Theta phase-specific codes for two-dimensional position, trajectory and heading
in the hippocampus
type: journal_article
volume: 11
year: '2008'
...
---
_id: '3520'
abstract:
- lang: eng
text: The hippocampus is thought to be involved in episodic memory formation by
reactivating traces of waking experience during sleep. Indeed, the joint firing
of spatially tuned pyramidal cells encoding nearby places recur during sleep.
We found that the sleep cofiring of rat CA1 pyramidal cells encoding similar places
increased relative to the sleep session before exploration. This cofiring increase
depended on the number of times that cells fired together with short latencies
( < 50 ms) during exploration, and was strongest between cells representing
the most visited places. This is indicative of a Hebbian learning rule in which
changes in firing associations between cells are determined by the number of waking
coincident firing events. In contrast, cells encoding different locations reduced
their cofiring in proportion to the number of times that they fired independently.
Together these data indicate that reactivated patterns are shaped by both positive
and negative changes in cofiring, which are determined by recent behavior.
author:
- first_name: Joseph
full_name: Joseph O'Neill
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Timothy
full_name: Senior,Timothy J
last_name: Senior
- first_name: Kevin
full_name: Allen, Kevin
last_name: Allen
- first_name: John
full_name: Huxter,John R
last_name: Huxter
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: O’Neill J, Senior T, Allen K, Huxter J, Csicsvari JL. Reactivation of experience-dependent
cell assembly patterns in the hippocampus. Nature Neuroscience. 2008;11(2):209-215.
doi:10.1038/nn2037
apa: O’Neill, J., Senior, T., Allen, K., Huxter, J., & Csicsvari, J. L. (2008).
Reactivation of experience-dependent cell assembly patterns in the hippocampus.
Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn2037
chicago: O’Neill, Joseph, Timothy Senior, Kevin Allen, John Huxter, and Jozsef L
Csicsvari. “Reactivation of Experience-Dependent Cell Assembly Patterns in the
Hippocampus.” Nature Neuroscience. Nature Publishing Group, 2008. https://doi.org/10.1038/nn2037.
ieee: J. O’Neill, T. Senior, K. Allen, J. Huxter, and J. L. Csicsvari, “Reactivation
of experience-dependent cell assembly patterns in the hippocampus,” Nature
Neuroscience, vol. 11, no. 2. Nature Publishing Group, pp. 209–215, 2008.
ista: O’Neill J, Senior T, Allen K, Huxter J, Csicsvari JL. 2008. Reactivation of
experience-dependent cell assembly patterns in the hippocampus. Nature Neuroscience.
11(2), 209–215.
mla: O’Neill, Joseph, et al. “Reactivation of Experience-Dependent Cell Assembly
Patterns in the Hippocampus.” Nature Neuroscience, vol. 11, no. 2, Nature
Publishing Group, 2008, pp. 209–15, doi:10.1038/nn2037.
short: J. O’Neill, T. Senior, K. Allen, J. Huxter, J.L. Csicsvari, Nature Neuroscience
11 (2008) 209–215.
date_created: 2018-12-11T12:03:46Z
date_published: 2008-02-01T00:00:00Z
date_updated: 2021-01-12T07:44:02Z
day: '01'
doi: 10.1038/nn2037
extern: 1
intvolume: ' 11'
issue: '2'
month: '02'
page: 209 - 215
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '2864'
quality_controlled: 0
status: public
title: Reactivation of experience-dependent cell assembly patterns in the hippocampus
type: journal_article
volume: 11
year: '2008'
...
---
_id: '3530'
abstract:
- lang: eng
text: In the cerebral cortex, GABAergic interneurons are often regarded as fast-spiking
cells. We have identified a type of slow-spiking interneuron that offers distinct
contributions to network activity. “Ivy” cells, named after their dense and fine
axons innervating mostly basal and oblique pyramidal cell dendrites, are more
numerous than the parvalbumin-expressing basket, bistratified, or axo-axonic cells.
Ivy cells express nitric oxide synthase, neuropeptide Y, and high levels of GABA(A)
receptor alpha 1 subunit; they discharge at a low frequency with wide spikes in
vivo, yet are distinctively phase-locked to behaviorally relevant network rhythms
including theta, gamma, and ripple oscillations. Paired recordings in vitro showed
that Ivy cells receive depressing EPSPs from pyramidal cells, which in turn receive
slowly rising and decaying inhibitory input from Ivy cells. In contrast to fast-spiking
interneurons operating with millisecond precision, the highly abundant Ivy cells
express presynaptically acting neuromodulators and regulate the excitability of
pyramidal cell dendrites through slowly rising and decaying GABAergic inputs.
author:
- first_name: Pablo
full_name: Fuentealba,Pablo
last_name: Fuentealba
- first_name: Rahima
full_name: Begum,Rahima
last_name: Begum
- first_name: Marco
full_name: Capogna,Marco
last_name: Capogna
- first_name: Shozo
full_name: Jinno,Shozo
last_name: Jinno
- first_name: Laszlo
full_name: Marton,Laszlo F
last_name: Marton
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Alex
full_name: Thomson,Alex
last_name: Thomson
- first_name: Péter
full_name: Somogyi, Péter
last_name: Somogyi
- first_name: Thomas
full_name: Klausberger,Thomas
last_name: Klausberger
citation:
ama: 'Fuentealba P, Begum R, Capogna M, et al. Ivy cells: A population of nitric-oxide-producing,
slow-spiking GABAergic neurons and their involvement in hippocampal network activity.
Neuron. 2008;57(6):917-929. doi:10.1016/j.neuron.2008.01.034'
apa: 'Fuentealba, P., Begum, R., Capogna, M., Jinno, S., Marton, L., Csicsvari,
J. L., … Klausberger, T. (2008). Ivy cells: A population of nitric-oxide-producing,
slow-spiking GABAergic neurons and their involvement in hippocampal network activity.
Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2008.01.034'
chicago: 'Fuentealba, Pablo, Rahima Begum, Marco Capogna, Shozo Jinno, Laszlo Marton,
Jozsef L Csicsvari, Alex Thomson, Péter Somogyi, and Thomas Klausberger. “Ivy
Cells: A Population of Nitric-Oxide-Producing, Slow-Spiking GABAergic Neurons
and Their Involvement in Hippocampal Network Activity.” Neuron. Elsevier,
2008. https://doi.org/10.1016/j.neuron.2008.01.034.'
ieee: 'P. Fuentealba et al., “Ivy cells: A population of nitric-oxide-producing,
slow-spiking GABAergic neurons and their involvement in hippocampal network activity,”
Neuron, vol. 57, no. 6. Elsevier, pp. 917–929, 2008.'
ista: 'Fuentealba P, Begum R, Capogna M, Jinno S, Marton L, Csicsvari JL, Thomson
A, Somogyi P, Klausberger T. 2008. Ivy cells: A population of nitric-oxide-producing,
slow-spiking GABAergic neurons and their involvement in hippocampal network activity.
Neuron. 57(6), 917–929.'
mla: 'Fuentealba, Pablo, et al. “Ivy Cells: A Population of Nitric-Oxide-Producing,
Slow-Spiking GABAergic Neurons and Their Involvement in Hippocampal Network Activity.”
Neuron, vol. 57, no. 6, Elsevier, 2008, pp. 917–29, doi:10.1016/j.neuron.2008.01.034.'
short: P. Fuentealba, R. Begum, M. Capogna, S. Jinno, L. Marton, J.L. Csicsvari,
A. Thomson, P. Somogyi, T. Klausberger, Neuron 57 (2008) 917–929.
date_created: 2018-12-11T12:03:49Z
date_published: 2008-03-27T00:00:00Z
date_updated: 2021-01-12T07:44:06Z
day: '27'
doi: 10.1016/j.neuron.2008.01.034
extern: 1
intvolume: ' 57'
issue: '6'
month: '03'
page: 917 - 929
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2855'
quality_controlled: 0
status: public
title: 'Ivy cells: A population of nitric-oxide-producing, slow-spiking GABAergic
neurons and their involvement in hippocampal network activity'
type: journal_article
volume: 57
year: '2008'
...
---
_id: '3534'
author:
- first_name: David
full_name: Dupret, David
last_name: Dupret
- first_name: Barty
full_name: Pleydell-Bouverie, Barty
last_name: Pleydell Bouverie
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Dupret D, Pleydell Bouverie B, Csicsvari JL. Inhibitory interneurons and network
oscillations. PNAS. 2008;105(47):18079-18080. doi:10.1073/pnas.0810064105
apa: Dupret, D., Pleydell Bouverie, B., & Csicsvari, J. L. (2008). Inhibitory
interneurons and network oscillations. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.0810064105
chicago: Dupret, David, Barty Pleydell Bouverie, and Jozsef L Csicsvari. “Inhibitory
Interneurons and Network Oscillations.” PNAS. National Academy of Sciences,
2008. https://doi.org/10.1073/pnas.0810064105.
ieee: D. Dupret, B. Pleydell Bouverie, and J. L. Csicsvari, “Inhibitory interneurons
and network oscillations,” PNAS, vol. 105, no. 47. National Academy of
Sciences, pp. 18079–18080, 2008.
ista: Dupret D, Pleydell Bouverie B, Csicsvari JL. 2008. Inhibitory interneurons
and network oscillations. PNAS. 105(47), 18079–18080.
mla: Dupret, David, et al. “Inhibitory Interneurons and Network Oscillations.” PNAS,
vol. 105, no. 47, National Academy of Sciences, 2008, pp. 18079–80, doi:10.1073/pnas.0810064105.
short: D. Dupret, B. Pleydell Bouverie, J.L. Csicsvari, PNAS 105 (2008) 18079–18080.
date_created: 2018-12-11T12:03:50Z
date_published: 2008-11-25T00:00:00Z
date_updated: 2021-01-12T07:44:08Z
day: '25'
doi: 10.1073/pnas.0810064105
extern: 1
intvolume: ' 105'
issue: '47'
month: '11'
page: 18079 - 18080
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '2852'
quality_controlled: 0
status: public
title: Inhibitory interneurons and network oscillations
type: journal_article
volume: 105
year: '2008'
...
---
_id: '3537'
abstract:
- lang: eng
text: 'Hippocampal place cells that fire together within the same cycle of theta
oscillations represent the sequence of positions (movement trajectory) that a
rat traverses on a linear track. Furthermore, it has been suggested that the encoding
of these and other types of temporal memory sequences is organized by gamma oscillations
nested within theta oscillations. Here, we examined whether gamma-related firing
of place cells permits such discrete temporal coding. We found that gamma-modulated
CA1 pyramidal cells separated into two classes on the basis of gamma firing phases
during waking theta periods. These groups also differed in terms of their spike
waveforms, firing rates, and burst firing tendency. During gamma oscillations
one group''s firing became restricted to theta phases associated with the highest
gamma power. Consequently, on the linear track, cells in this group often failed
to fire early in theta-phase precession (as the rat entered the place field) if
gamma oscillations were present. The second group fired throughout the theta cycle
during gamma oscillations, and maintained gamma-modulated firing at different
stages of theta-phase precession. Our results suggest that the two different pyramidal
cell classes may support different types of population codes within a theta cycle:
one in which spike sequences representing movement trajectories occur across subsequent
gamma cycles nested within each theta cycle, and another in which firing in synchronized
gamma discharges without temporal sequences encode a representation of location.
We propose that gamma oscillations during theta-phase precession organize the
mnemonic recall of population patterns representing places and movement paths.'
author:
- first_name: Timothy
full_name: Senior,Timothy J
last_name: Senior
- first_name: John
full_name: Huxter,John R
last_name: Huxter
- first_name: Kevin
full_name: Allen, Kevin
last_name: Allen
- first_name: Joseph
full_name: Joseph O'Neill
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Senior T, Huxter J, Allen K, O’Neill J, Csicsvari JL. Gamma oscillatory firing
reveals distinct populations of pyramidal cells in the CA1 region of the hippocampus.
Journal of Neuroscience. 2008;28(9):2274-2286. doi:10.1523/JNEUROSCI.4669-07.2008
apa: Senior, T., Huxter, J., Allen, K., O’Neill, J., & Csicsvari, J. L. (2008).
Gamma oscillatory firing reveals distinct populations of pyramidal cells in the
CA1 region of the hippocampus. Journal of Neuroscience. Society for Neuroscience.
https://doi.org/10.1523/JNEUROSCI.4669-07.2008
chicago: Senior, Timothy, John Huxter, Kevin Allen, Joseph O’Neill, and Jozsef L
Csicsvari. “Gamma Oscillatory Firing Reveals Distinct Populations of Pyramidal
Cells in the CA1 Region of the Hippocampus.” Journal of Neuroscience. Society
for Neuroscience, 2008. https://doi.org/10.1523/JNEUROSCI.4669-07.2008.
ieee: T. Senior, J. Huxter, K. Allen, J. O’Neill, and J. L. Csicsvari, “Gamma oscillatory
firing reveals distinct populations of pyramidal cells in the CA1 region of the
hippocampus,” Journal of Neuroscience, vol. 28, no. 9. Society for Neuroscience,
pp. 2274–2286, 2008.
ista: Senior T, Huxter J, Allen K, O’Neill J, Csicsvari JL. 2008. Gamma oscillatory
firing reveals distinct populations of pyramidal cells in the CA1 region of the
hippocampus. Journal of Neuroscience. 28(9), 2274–2286.
mla: Senior, Timothy, et al. “Gamma Oscillatory Firing Reveals Distinct Populations
of Pyramidal Cells in the CA1 Region of the Hippocampus.” Journal of Neuroscience,
vol. 28, no. 9, Society for Neuroscience, 2008, pp. 2274–86, doi:10.1523/JNEUROSCI.4669-07.2008.
short: T. Senior, J. Huxter, K. Allen, J. O’Neill, J.L. Csicsvari, Journal of Neuroscience
28 (2008) 2274–2286.
date_created: 2018-12-11T12:03:51Z
date_published: 2008-02-27T00:00:00Z
date_updated: 2021-01-12T07:44:09Z
day: '27'
doi: 10.1523/JNEUROSCI.4669-07.2008
extern: 1
intvolume: ' 28'
issue: '9'
month: '02'
page: 2274 - 2286
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2847'
quality_controlled: 0
status: public
title: Gamma oscillatory firing reveals distinct populations of pyramidal cells in
the CA1 region of the hippocampus
type: journal_article
volume: 28
year: '2008'
...
---
_id: '3544'
abstract:
- lang: eng
text: In the subthalamic nucleus (STN) of Parkinson's disease (PD) patients, a pronounced
synchronization of oscillatory activity at beta frequencies (15-30 Hz) accompanies
movement difficulties. Abnormal beta oscillations and motor symptoms are concomitantly
and acutely suppressed by dopaminergic therapies, suggesting that these inappropriate
rhythms might also emerge acutely from disrupted dopamine transmission. The neural
basis of these abnormal beta oscillations is unclear, and how they might compromise
information processing, or how they arise, is unknown. Using a 6-hydroxydopamine-lesioned
rodent model of PD, we demonstrate that beta oscillations are inappropriately
exaggerated, compared with controls, in a brain-state-dependent manner after chronic
dopamine loss. Exaggerated beta oscillations are expressed at the levels of single
neurons and small neuronal ensembles, and are focally present and spatially distributed
within STN. They are also expressed in synchronous population activities, as evinced
by oscillatory local field potentials, in STN and cortex. Excessively synchronized
beta oscillations reduce the information coding capacity of STN neuronal ensembles,
which may contribute to parkinsonian motor impairment. Acute disruption of dopamine
transmission in control animals with antagonists of D-1/D-2 receptors did not
exaggerate STN or cortical beta oscillations. Moreover, beta oscillations were
not exaggerated until several days after 6-hydroxydopamine injections. Thus, contrary
to predictions, abnormally amplified beta oscillations in cortico-STN circuits
do not result simply from an acute absence of dopamine receptor stimulation, but
are instead delayed sequelae of chronic dopamine depletion. Targeting the plastic
processes underlying the delayed emergence of pathological beta oscillations after
continuing dopaminergic dysfunction may offer considerable therapeutic promise.
author:
- first_name: Nicolas
full_name: Mallet,Nicolas
last_name: Mallet
- first_name: Alek
full_name: Pogosyan,Alek
last_name: Pogosyan
- first_name: Andrew
full_name: Sharott,Andrew
last_name: Sharott
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: John
full_name: Bolam, John Paul
last_name: Bolam
- first_name: Peter
full_name: Brown,Peter
last_name: Brown
- first_name: Peter
full_name: Magill,Peter J
last_name: Magill
citation:
ama: Mallet N, Pogosyan A, Sharott A, et al. Disrupted dopamine transmission and
the emergence of exaggerated beta oscillations in subthalamic nucleus and cerebral
cortex. Journal of Neuroscience. 2008;28(18):4795-4806. doi:10.1523/JNEUROSCI.0123-08.2008
apa: Mallet, N., Pogosyan, A., Sharott, A., Csicsvari, J. L., Bolam, J., Brown,
P., & Magill, P. (2008). Disrupted dopamine transmission and the emergence
of exaggerated beta oscillations in subthalamic nucleus and cerebral cortex. Journal
of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0123-08.2008
chicago: Mallet, Nicolas, Alek Pogosyan, Andrew Sharott, Jozsef L Csicsvari, John
Bolam, Peter Brown, and Peter Magill. “Disrupted Dopamine Transmission and the
Emergence of Exaggerated Beta Oscillations in Subthalamic Nucleus and Cerebral
Cortex.” Journal of Neuroscience. Society for Neuroscience, 2008. https://doi.org/10.1523/JNEUROSCI.0123-08.2008.
ieee: N. Mallet et al., “Disrupted dopamine transmission and the emergence
of exaggerated beta oscillations in subthalamic nucleus and cerebral cortex,”
Journal of Neuroscience, vol. 28, no. 18. Society for Neuroscience, pp.
4795–4806, 2008.
ista: Mallet N, Pogosyan A, Sharott A, Csicsvari JL, Bolam J, Brown P, Magill P.
2008. Disrupted dopamine transmission and the emergence of exaggerated beta oscillations
in subthalamic nucleus and cerebral cortex. Journal of Neuroscience. 28(18), 4795–4806.
mla: Mallet, Nicolas, et al. “Disrupted Dopamine Transmission and the Emergence
of Exaggerated Beta Oscillations in Subthalamic Nucleus and Cerebral Cortex.”
Journal of Neuroscience, vol. 28, no. 18, Society for Neuroscience, 2008,
pp. 4795–806, doi:10.1523/JNEUROSCI.0123-08.2008.
short: N. Mallet, A. Pogosyan, A. Sharott, J.L. Csicsvari, J. Bolam, P. Brown, P.
Magill, Journal of Neuroscience 28 (2008) 4795–4806.
date_created: 2018-12-11T12:03:53Z
date_published: 2008-04-30T00:00:00Z
date_updated: 2021-01-12T07:44:12Z
day: '30'
doi: 10.1523/JNEUROSCI.0123-08.2008
extern: 1
intvolume: ' 28'
issue: '18'
month: '04'
page: 4795 - 4806
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2842'
quality_controlled: 0
status: public
title: Disrupted dopamine transmission and the emergence of exaggerated beta oscillations
in subthalamic nucleus and cerebral cortex
type: journal_article
volume: 28
year: '2008'
...
---
_id: '3577'
alternative_title:
- Mathematics and Visualization
author:
- first_name: Silvia
full_name: Biasotti, Silvia
last_name: Biasotti
- first_name: Dominique
full_name: Attali, Dominique
last_name: Attali
- first_name: Jean
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Gershon
full_name: Elber, Gershon
last_name: Elber
- first_name: Michela
full_name: Mortara, Michela
last_name: Mortara
- first_name: Gabriella
full_name: Sanniti di Baja, Gabriella
last_name: Sanniti Di Baja
- first_name: Michela
full_name: Spagnuolo, Michela
last_name: Spagnuolo
- first_name: Mirela
full_name: Tanase, Mirela
last_name: Tanase
- first_name: Remco
full_name: Veltkam, Remco
last_name: Veltkam
citation:
ama: 'Biasotti S, Attali D, Boissonnat J, et al. Skeletal structures. In: Shape
Analysis and Structuring. Springer; 2008:145-183. doi:10.1007/978-3-540-33265-7_5'
apa: Biasotti, S., Attali, D., Boissonnat, J., Edelsbrunner, H., Elber, G., Mortara,
M., … Veltkam, R. (2008). Skeletal structures. In Shape Analysis and Structuring
(pp. 145–183). Springer. https://doi.org/10.1007/978-3-540-33265-7_5
chicago: Biasotti, Silvia, Dominique Attali, Jean Boissonnat, Herbert Edelsbrunner,
Gershon Elber, Michela Mortara, Gabriella Sanniti Di Baja, Michela Spagnuolo,
Mirela Tanase, and Remco Veltkam. “Skeletal Structures.” In Shape Analysis
and Structuring, 145–83. Springer, 2008. https://doi.org/10.1007/978-3-540-33265-7_5.
ieee: S. Biasotti et al., “Skeletal structures,” in Shape Analysis and
Structuring, Springer, 2008, pp. 145–183.
ista: 'Biasotti S, Attali D, Boissonnat J, Edelsbrunner H, Elber G, Mortara M, Sanniti
Di Baja G, Spagnuolo M, Tanase M, Veltkam R. 2008.Skeletal structures. In: Shape
Analysis and Structuring. Mathematics and Visualization, , 145–183.'
mla: Biasotti, Silvia, et al. “Skeletal Structures.” Shape Analysis and Structuring,
Springer, 2008, pp. 145–83, doi:10.1007/978-3-540-33265-7_5.
short: S. Biasotti, D. Attali, J. Boissonnat, H. Edelsbrunner, G. Elber, M. Mortara,
G. Sanniti Di Baja, M. Spagnuolo, M. Tanase, R. Veltkam, in:, Shape Analysis and
Structuring, Springer, 2008, pp. 145–183.
date_created: 2018-12-11T12:04:03Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:44:25Z
day: '01'
doi: 10.1007/978-3-540-33265-7_5
extern: 1
month: '01'
page: 145 - 183
publication: Shape Analysis and Structuring
publication_status: published
publisher: Springer
publist_id: '2808'
quality_controlled: 0
status: public
title: Skeletal structures
type: book_chapter
year: '2008'
...
---
_id: '3591'
abstract:
- lang: eng
text: The controlled internalization of membrane receptors and lipids is crucial
for cells to control signaling pathways and interact with their environment. During
clathrin-mediated endocytosis, membrane constituents are transported via endocytic
vesicles into early endosomes, from which they are further distributed within
the cell. The small guanosine triphosphatase (GTPase) Rab5 is both required and
sufficient for the formation of these early endosomes and can be used to experimentally
address endocytic processes. Recent evidence shows that endocytic turnover of
E-cadherin regulates the migration of mesendodermal cells during zebrafish gastrulation
by modulating their adhesive interactions with neighboring cells. This in turn
leads to effective and synchronized movement within the embryo. In this review,
we discuss techniques to manipulate E-cadherin endocytosis by morpholino-mediated
knockdown of rab5 during zebrafish gastrulation. We describe the use of antibodies
specifically directed against zebrafish E-cadherin to detect its intracellular
localization and of in situ hybridization and primary cell culture to reveal patterns
of cell migration and adhesion, respectively
article_processing_charge: No
author:
- first_name: Florian
full_name: Ulrich, Florian
last_name: Ulrich
- 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: Ulrich F, Heisenberg C-PJ. Probing E-cadherin endocytosis by morpholino-mediated
Rab5 knock-down in zebrafish. Methods in Molecular Biology. 2008;440:371-387.
doi:10.1007/978-1-59745-178-9_27
apa: Ulrich, F., & Heisenberg, C.-P. J. (2008). Probing E-cadherin endocytosis
by morpholino-mediated Rab5 knock-down in zebrafish. Methods in Molecular Biology.
Springer. https://doi.org/10.1007/978-1-59745-178-9_27
chicago: Ulrich, Florian, and Carl-Philipp J Heisenberg. “Probing E-Cadherin Endocytosis
by Morpholino-Mediated Rab5 Knock-down in Zebrafish.” Methods in Molecular
Biology. Springer, 2008. https://doi.org/10.1007/978-1-59745-178-9_27.
ieee: F. Ulrich and C.-P. J. Heisenberg, “Probing E-cadherin endocytosis by morpholino-mediated
Rab5 knock-down in zebrafish.,” Methods in Molecular Biology, vol. 440.
Springer, pp. 371–387, 2008.
ista: Ulrich F, Heisenberg C-PJ. 2008. Probing E-cadherin endocytosis by morpholino-mediated
Rab5 knock-down in zebrafish. Methods in Molecular Biology. 440, 371–387.
mla: Ulrich, Florian, and Carl-Philipp J. Heisenberg. “Probing E-Cadherin Endocytosis
by Morpholino-Mediated Rab5 Knock-down in Zebrafish.” Methods in Molecular
Biology, vol. 440, Springer, 2008, pp. 371–87, doi:10.1007/978-1-59745-178-9_27.
short: F. Ulrich, C.-P.J. Heisenberg, Methods in Molecular Biology 440 (2008) 371–387.
date_created: 2018-12-11T12:04:08Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:44:31Z
day: '01'
doi: 10.1007/978-1-59745-178-9_27
extern: '1'
intvolume: ' 440'
language:
- iso: eng
month: '01'
oa_version: None
page: 371 - 387
publication: Methods in Molecular Biology
publication_status: published
publisher: Springer
publist_id: '2792'
status: public
title: Probing E-cadherin endocytosis by morpholino-mediated Rab5 knock-down in zebrafish.
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 440
year: '2008'
...
---
_id: '3599'
abstract:
- lang: eng
text: In this paper, adaptive formation control and bio-inspired optimization are
jointly addressed for a cluster-based satellite wireless sensor network in which
there are multiple satellites flying in formation (MSFF) in the presence of unknown
disturbances. The full nonlinear dynamics model describing the relative positioning
of the MSFF system is used to develop an adaptive formation controller. First,
the original nonlinear system is transformed into a linear controllable system
with aperturbation term by invoking the input-output feedback linearization technique.
Second, by using the integral feedback design scheme, the adaptive formation controller
is presented for improving the steady-state performance of the MSFF system in
the presence of unknown disturbances. Third, as a currently popular bio-inspired
algorithm, PSO (particle swarm optimizer) is employed to minimize the total energy
consumption under the required quality of service by jointly optimizing the transmission
power and rate for each satellite. Simulation results are provided to demonstrate
the effectiveness of the adaptive formation controller and the PSO-based optimization
for saving the total communication energy.
author:
- first_name: Erfu
full_name: Yang, Erfu
last_name: Yang
- first_name: Ahmet
full_name: Erdogan, Ahmet T
last_name: Erdogan
- first_name: Tughrul
full_name: Arslan, Tughrul
last_name: Arslan
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Yang E, Erdogan A, Arslan T, Barton NH. Adaptive formation control and bio-inspired
optimization of a cluster-based satellite wireless sensor network . In: IEEE;
2008:432-439. doi:10.1109/AHS.2008.60'
apa: 'Yang, E., Erdogan, A., Arslan, T., & Barton, N. H. (2008). Adaptive formation
control and bio-inspired optimization of a cluster-based satellite wireless sensor
network (pp. 432–439). Presented at the AHS: NASA/ESA Conference on Adaptive
Hardware and Systems, IEEE. https://doi.org/10.1109/AHS.2008.60'
chicago: Yang, Erfu, Ahmet Erdogan, Tughrul Arslan, and Nicholas H Barton. “Adaptive
Formation Control and Bio-Inspired Optimization of a Cluster-Based Satellite Wireless
Sensor Network ,” 432–39. IEEE, 2008. https://doi.org/10.1109/AHS.2008.60.
ieee: 'E. Yang, A. Erdogan, T. Arslan, and N. H. Barton, “Adaptive formation control
and bio-inspired optimization of a cluster-based satellite wireless sensor network
,” presented at the AHS: NASA/ESA Conference on Adaptive Hardware and Systems,
2008, pp. 432–439.'
ista: 'Yang E, Erdogan A, Arslan T, Barton NH. 2008. Adaptive formation control
and bio-inspired optimization of a cluster-based satellite wireless sensor network
. AHS: NASA/ESA Conference on Adaptive Hardware and Systems, 432–439.'
mla: Yang, Erfu, et al. Adaptive Formation Control and Bio-Inspired Optimization
of a Cluster-Based Satellite Wireless Sensor Network . IEEE, 2008, pp. 432–39,
doi:10.1109/AHS.2008.60.
short: E. Yang, A. Erdogan, T. Arslan, N.H. Barton, in:, IEEE, 2008, pp. 432–439.
conference:
name: 'AHS: NASA/ESA Conference on Adaptive Hardware and Systems'
date_created: 2018-12-11T12:04:10Z
date_published: 2008-08-01T00:00:00Z
date_updated: 2021-01-12T07:44:34Z
day: '01'
doi: 10.1109/AHS.2008.60
extern: 1
month: '08'
page: 432 - 439
publication_status: published
publisher: IEEE
publist_id: '2784'
quality_controlled: 0
status: public
title: 'Adaptive formation control and bio-inspired optimization of a cluster-based
satellite wireless sensor network '
type: conference
year: '2008'
...
---
_id: '3600'
abstract:
- lang: eng
text: Scalability is one of the most important issues for optimization algorithms
used in wireless sensor networks (WSNs) since there are often many parameters
to be optimized at the same time. In this case it is very hard to ensure that
an optimization algorithm can be smoothly scaled up from a low-dimensional optimization
problem to the one with a high dimensionality. This paper addresses the scalability
issue of a novel optimization algorithm inspired by the Shifting Balance Theory
(SBT) of evolution in population genetics. Toward this end, a cluster-based WSN
is employed in this paper as a benchmark to perform a comparative study. The total
energy consumption is minimized under the required quality of service by jointly
optimizing the transmission power and rate for each sensor node. The results obtained
by the SBT-based algorithm are compared with the Metropolis algorithm (MA) and
currently popular particle swarm optimizer (PSO) to assess the scaling performance
of the three algorithms against the same WSN optimization problem.
alternative_title:
- LNCS
author:
- first_name: Erfu
full_name: Yang, Erfu
last_name: Yang
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Tughrul
full_name: Arslan, Tughrul
last_name: Arslan
- first_name: Ahmet
full_name: Erdogan, Ahmet T
last_name: Erdogan
citation:
ama: 'Yang E, Barton NH, Arslan T, Erdogan A. Scalability of a novel shifting balance
theory-based optimization algorithm: A comparative study on a cluster-based wireless
sensor network. In: Vol 5216. Springer; 2008:249-260. doi:10.1007/978-3-540-85857-7_22'
apa: 'Yang, E., Barton, N. H., Arslan, T., & Erdogan, A. (2008). Scalability
of a novel shifting balance theory-based optimization algorithm: A comparative
study on a cluster-based wireless sensor network (Vol. 5216, pp. 249–260). Presented
at the IECS: International Conference on Evolvable Systems, Springer. https://doi.org/10.1007/978-3-540-85857-7_22'
chicago: 'Yang, Erfu, Nicholas H Barton, Tughrul Arslan, and Ahmet Erdogan. “ Scalability
of a Novel Shifting Balance Theory-Based Optimization Algorithm: A Comparative
Study on a Cluster-Based Wireless Sensor Network,” 5216:249–60. Springer, 2008.
https://doi.org/10.1007/978-3-540-85857-7_22.'
ieee: 'E. Yang, N. H. Barton, T. Arslan, and A. Erdogan, “ Scalability of a novel
shifting balance theory-based optimization algorithm: A comparative study on a
cluster-based wireless sensor network,” presented at the IECS: International Conference
on Evolvable Systems, 2008, vol. 5216, pp. 249–260.'
ista: 'Yang E, Barton NH, Arslan T, Erdogan A. 2008. Scalability of a novel shifting
balance theory-based optimization algorithm: A comparative study on a cluster-based
wireless sensor network. IECS: International Conference on Evolvable Systems,
LNCS, vol. 5216, 249–260.'
mla: 'Yang, Erfu, et al. Scalability of a Novel Shifting Balance Theory-Based
Optimization Algorithm: A Comparative Study on a Cluster-Based Wireless Sensor
Network. Vol. 5216, Springer, 2008, pp. 249–60, doi:10.1007/978-3-540-85857-7_22.'
short: E. Yang, N.H. Barton, T. Arslan, A. Erdogan, in:, Springer, 2008, pp. 249–260.
conference:
name: 'IECS: International Conference on Evolvable Systems'
date_created: 2018-12-11T12:04:10Z
date_published: 2008-09-08T00:00:00Z
date_updated: 2021-01-12T07:44:35Z
day: '08'
doi: 10.1007/978-3-540-85857-7_22
extern: 1
intvolume: ' 5216'
month: '09'
page: 249 - 260
publication_status: published
publisher: Springer
publist_id: '2783'
quality_controlled: 0
status: public
title: ' Scalability of a novel shifting balance theory-based optimization algorithm:
A comparative study on a cluster-based wireless sensor network'
type: conference
volume: 5216
year: '2008'
...
---
_id: '3605'
abstract:
- lang: eng
text: Many animals and plants show a correlation between the traits of the individuals
in the mating pair, implying assortative mating. Given the ubiquity of assortative
mating in nature, why and how it has evolved remain open questions. Here we attempt
to answer these questions in those cases where the trait under assortment is the
same in males and females. We consider the most favorable scenario for assortment
to evolve, where the same trait is under assortment and viability selection. We
find conditions for assortment to evolve using a multilocus formalism in a haploid
population. Our results show how epistasis in fitness between the loci that control
the focal trait is crucial for assortment to evolve. We then assume specific forms
of assortment in haploids and diploids and study the limiting cases of selective
and nonselective mating. We find that selection for increased assortment is weak
and that where increased assortment is costly, it does not invade.
author:
- first_name: Maria
full_name: De Cara, Maria A
last_name: De Cara
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Mark
full_name: Kirkpatrick, Mark
last_name: Kirkpatrick
citation:
ama: De Cara M, Barton NH, Kirkpatrick M. A model for the evolution of assortative
mating. American Naturalist. 2008;171(5):580-596. doi:10.1086/587062
apa: De Cara, M., Barton, N. H., & Kirkpatrick, M. (2008). A model for the evolution
of assortative mating. American Naturalist. University of Chicago Press.
https://doi.org/10.1086/587062
chicago: De Cara, Maria, Nicholas H Barton, and Mark Kirkpatrick. “A Model for the
Evolution of Assortative Mating.” American Naturalist. University of Chicago
Press, 2008. https://doi.org/10.1086/587062.
ieee: M. De Cara, N. H. Barton, and M. Kirkpatrick, “A model for the evolution of
assortative mating,” American Naturalist, vol. 171, no. 5. University of
Chicago Press, pp. 580–596, 2008.
ista: De Cara M, Barton NH, Kirkpatrick M. 2008. A model for the evolution of assortative
mating. American Naturalist. 171(5), 580–596.
mla: De Cara, Maria, et al. “A Model for the Evolution of Assortative Mating.” American
Naturalist, vol. 171, no. 5, University of Chicago Press, 2008, pp. 580–96,
doi:10.1086/587062.
short: M. De Cara, N.H. Barton, M. Kirkpatrick, American Naturalist 171 (2008) 580–596.
date_created: 2018-12-11T12:04:12Z
date_published: 2008-05-01T00:00:00Z
date_updated: 2021-01-12T07:44:36Z
day: '01'
doi: 10.1086/587062
extern: 1
intvolume: ' 171'
issue: '5'
month: '05'
page: 580 - 596
publication: American Naturalist
publication_status: published
publisher: University of Chicago Press
publist_id: '2778'
quality_controlled: 0
status: public
title: A model for the evolution of assortative mating
type: journal_article
volume: 171
year: '2008'
...
---
_id: '3606'
abstract:
- lang: eng
text: 'Explicit formulae are given for the effects of a barrier to gene flow on
random fluctuations in allele frequency; these formulae can also be seen as generating
functions for the distribution of coalescence times. The formulae are derived
using a continuous diffusion approximation, which is accurate over all but very
small spatial scales. The continuous approximation is confirmed by comparison
with the exact solution to the stepping stone model. In both one and two spatial
dimensions, the variance of fluctuations in allele frequencies increases near
the barrier; when the barrier is very strong, the variance doubles. However, the
effect on fluctuations close to the barrier is much greater when the population
is spread over two spatial dimensions than when it occupies a linear, one-dimensional
habitat: barriers of strength comparable with the dispersal range (B≈σ) can have
an appreciable effect in two dimensions, whereas only barriers with strength comparable
with the characteristic scale (B\! \approx\! L \equals \sigma \sol \sqrt {2 \mu}\hskip2)
are significant in one dimension (μ is the rate of mutation or long-range dispersal).
Thus, in a two-dimensional population, barriers to gene flow can be detected through
their effect on the spatial pattern of genetic marker alleles.'
author:
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. The effect of a barrier to gene flow on patterns of geographic variation.
Genetical Research. 2008;90(1):139-149. doi:10.1017/S0016672307009081
apa: Barton, N. H. (2008). The effect of a barrier to gene flow on patterns of geographic
variation. Genetical Research. Cambridge University Press. https://doi.org/10.1017/S0016672307009081
chicago: Barton, Nicholas H. “The Effect of a Barrier to Gene Flow on Patterns of
Geographic Variation.” Genetical Research. Cambridge University Press,
2008. https://doi.org/10.1017/S0016672307009081.
ieee: N. H. Barton, “The effect of a barrier to gene flow on patterns of geographic
variation,” Genetical Research, vol. 90, no. 1. Cambridge University Press,
pp. 139–149, 2008.
ista: Barton NH. 2008. The effect of a barrier to gene flow on patterns of geographic
variation. Genetical Research. 90(1), 139–149.
mla: Barton, Nicholas H. “The Effect of a Barrier to Gene Flow on Patterns of Geographic
Variation.” Genetical Research, vol. 90, no. 1, Cambridge University Press,
2008, pp. 139–49, doi:10.1017/S0016672307009081.
short: N.H. Barton, Genetical Research 90 (2008) 139–149.
date_created: 2018-12-11T12:04:12Z
date_published: 2008-02-01T00:00:00Z
date_updated: 2021-01-12T07:44:37Z
day: '01'
doi: 10.1017/S0016672307009081
extern: 1
intvolume: ' 90'
issue: '1'
month: '02'
page: 139 - 149
publication: Genetical Research
publication_status: published
publisher: Cambridge University Press
publist_id: '2777'
quality_controlled: 0
status: public
title: The effect of a barrier to gene flow on patterns of geographic variation
type: journal_article
volume: 90
year: '2008'
...
---
_id: '3694'
abstract:
- lang: eng
text: Distributed Denial of Service (DDoS) attacks are today the most destabilizing
factor in the global internet and there is a strong need for sophisticated solutions.
We introduce a formal statistical framework and derive a Bayes optimal packet
classifier from it. Our proposed practical algorithm "Adaptive History-Based
IP Filtering" (AHIF) mitigates DDoS attacks near the victim and outperforms
existing methods by at least 32% in terms of collateral damage. Furthermore, it
adjusts to the strength of an ongoing attack and ensures availability of the attacked
server. In contrast to other adaptive solutions, firewall rulesets used to resist
an attack can be precalculated before an attack takes place. This ensures an immediate
response in a DDoS emergency. For evaluation, simulated DDoS attacks and two real-world
user traffic datasets are used.
author:
- first_name: Markus
full_name: Goldstein,Markus
last_name: Goldstein
- first_name: Christoph
full_name: Christoph Lampert
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Matthias
full_name: Reif,Matthias
last_name: Reif
- first_name: Armin
full_name: Stahl,Armin
last_name: Stahl
- first_name: Thomas
full_name: Breuel,Thomas M
last_name: Breuel
citation:
ama: 'Goldstein M, Lampert C, Reif M, Stahl A, Breuel T. Bayes optimal DDoS mitigation
by adaptive history-based IP filtering. In: IEEE; 2008:174-179. doi:10.1109/ICN.2008.64'
apa: 'Goldstein, M., Lampert, C., Reif, M., Stahl, A., & Breuel, T. (2008).
Bayes optimal DDoS mitigation by adaptive history-based IP filtering (pp. 174–179).
Presented at the ICN: International Conference on Networking, IEEE. https://doi.org/10.1109/ICN.2008.64'
chicago: Goldstein, Markus, Christoph Lampert, Matthias Reif, Armin Stahl, and Thomas
Breuel. “Bayes Optimal DDoS Mitigation by Adaptive History-Based IP Filtering,”
174–79. IEEE, 2008. https://doi.org/10.1109/ICN.2008.64.
ieee: 'M. Goldstein, C. Lampert, M. Reif, A. Stahl, and T. Breuel, “Bayes optimal
DDoS mitigation by adaptive history-based IP filtering,” presented at the ICN:
International Conference on Networking, 2008, pp. 174–179.'
ista: 'Goldstein M, Lampert C, Reif M, Stahl A, Breuel T. 2008. Bayes optimal DDoS
mitigation by adaptive history-based IP filtering. ICN: International Conference
on Networking, 174–179.'
mla: Goldstein, Markus, et al. Bayes Optimal DDoS Mitigation by Adaptive History-Based
IP Filtering. IEEE, 2008, pp. 174–79, doi:10.1109/ICN.2008.64.
short: M. Goldstein, C. Lampert, M. Reif, A. Stahl, T. Breuel, in:, IEEE, 2008,
pp. 174–179.
conference:
name: 'ICN: International Conference on Networking'
date_created: 2018-12-11T12:04:39Z
date_published: 2008-04-13T00:00:00Z
date_updated: 2021-01-12T07:49:01Z
day: '13'
doi: 10.1109/ICN.2008.64
extern: 1
main_file_link:
- open_access: '0'
url: http://pub.ist.ac.at/~chl/papers/goldstein-icn2008.pdf
month: '04'
page: 174 - 179
publication_status: published
publisher: IEEE
publist_id: '2671'
quality_controlled: 0
status: public
title: Bayes optimal DDoS mitigation by adaptive history-based IP filtering
type: conference
year: '2008'
...
---
_id: '3698'
abstract:
- lang: eng
text: Kernel canonical correlation analysis (KCCA) is a dimensionality reduction
technique for paired data. By finding directions that maximize correlation, KCCA
learns representations that are more closely tied to the underlying semantics
of the data rather than noise. However, meaningful directions are not only those
that have high correlation to another modality, but also those that capture the
manifold structure of the data. We propose a method that is simultaneously able
to find highly correlated directions that are also located on high variance directions
along the data manifold. This is achieved by the use of semi-supervised Laplacian
regularization of KCCA. We show experimentally that Laplacian regularized training
improves class separation over KCCA with only Tikhonov regularization, while causing
no degradation in the correlation between modalities. We propose a model selection
criterion based on the Hilbert-Schmidt norm of the semi-supervised Laplacian regularized
cross-covariance operator, which we compute in closed form.
alternative_title:
- LNCS
author:
- first_name: Matthew
full_name: Blaschko,Matthew B
last_name: Blaschko
- first_name: Christoph
full_name: Christoph Lampert
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Arthur
full_name: Gretton,Arthur
last_name: Gretton
citation:
ama: 'Blaschko M, Lampert C, Gretton A. Semi-supervised Laplacian regularization
of kernel canonical correlation analysis. In: Vol 5211. Springer; 2008:133-145.
doi:10.1007/978-3-540-87479-9_27'
apa: 'Blaschko, M., Lampert, C., & Gretton, A. (2008). Semi-supervised Laplacian
regularization of kernel canonical correlation analysis (Vol. 5211, pp. 133–145).
Presented at the ECML: European Conference on Machine Learning, Springer. https://doi.org/10.1007/978-3-540-87479-9_27'
chicago: Blaschko, Matthew, Christoph Lampert, and Arthur Gretton. “Semi-Supervised
Laplacian Regularization of Kernel Canonical Correlation Analysis,” 5211:133–45.
Springer, 2008. https://doi.org/10.1007/978-3-540-87479-9_27.
ieee: 'M. Blaschko, C. Lampert, and A. Gretton, “Semi-supervised Laplacian regularization
of kernel canonical correlation analysis,” presented at the ECML: European Conference
on Machine Learning, 2008, vol. 5211, no. Part 1, pp. 133–145.'
ista: 'Blaschko M, Lampert C, Gretton A. 2008. Semi-supervised Laplacian regularization
of kernel canonical correlation analysis. ECML: European Conference on Machine
Learning, LNCS, vol. 5211, 133–145.'
mla: Blaschko, Matthew, et al. Semi-Supervised Laplacian Regularization of Kernel
Canonical Correlation Analysis. Vol. 5211, no. Part 1, Springer, 2008, pp.
133–45, doi:10.1007/978-3-540-87479-9_27.
short: M. Blaschko, C. Lampert, A. Gretton, in:, Springer, 2008, pp. 133–145.
conference:
name: 'ECML: European Conference on Machine Learning'
date_created: 2018-12-11T12:04:41Z
date_published: 2008-10-21T00:00:00Z
date_updated: 2021-01-12T07:49:02Z
day: '21'
doi: 10.1007/978-3-540-87479-9_27
extern: 1
intvolume: ' 5211'
issue: Part 1
month: '10'
page: 133 - 145
publication_status: published
publisher: Springer
publist_id: '2662'
quality_controlled: 0
status: public
title: Semi-supervised Laplacian regularization of kernel canonical correlation analysis
type: conference
volume: 5211
year: '2008'
...