---
_id: '1034'
abstract:
- lang: eng
text: Three interacting particles form a system which is well known for its complex
physical behavior. A landmark theoretical result in few-body quantum physics is
Efimov\'s prediction of a universal set of weakly bound trimer states appearing
for three identical bosons with a resonant two-body interaction [1, 2]. Surprisingly,
these states even exist in the absence of a corresponding two-body bound state
and their precise nature is largely independent of the particular type of the
two-body interaction potential. Efimov\'s scenario has attracted great interest
in many areas of physics; an experimental test however has not been achieved.
We report the observation of an Efimov resonance in an ultracold thermal gas of
cesium atoms [3]. The resonance occurs in the range of large negative two-body
scattering lengths and arises from the coupling of three free atoms to an Efimov
trimer. We observe its signature as a giant three-body recombination loss when
the strength of the two-body interaction is varied near a Feshbach resonance.
This resonance develops into a continuum resonance at non-zero collision energies,
and we observe a shift of the resonance position as a function of temperature.
We also report on a minimum in the recombination loss for positive scattering
lengths, indicating destructive interference of decay pathways. Our results confirm
central theoretical predictions of Efimov physics and represent a starting point
from which to explore the universal properties of resonantly interacting few-body
systems.
acknowledgement: "We thank E. Braaten, C. Greene, B. Esry, H. Hammer, and T. Köhl\r\ner
for many stimulat-\r\ning and fruitful discussions and E. Kneringer for support
re\r\ngarding the data analysis. We\r\nacknowledge support by the Austrian Science
Fund (FWF) with\r\nin Spezialforschungs-\r\nbereich 15 and within the Lise Meitner
program, and by the Eur\r\nopean Union in the frame\r\nof the TMR networks “Cold
Molecules” and “FASTNet”. M.M. is s\r\nupported within the\r\nDoktorandenprogramm
of the Austrian Academy of Sciences."
article_processing_charge: No
author:
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
- first_name: Tobias
full_name: Kraemer, Tobias
last_name: Kraemer
- first_name: Michael
full_name: Mark, Michael
last_name: Mark
- first_name: Philipp
full_name: Waldburger, Philipp
last_name: Waldburger
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Bastian
full_name: Engeser, Bastian
last_name: Engeser
- first_name: Adam
full_name: Lange, Adam
last_name: Lange
- first_name: Karl
full_name: Pilch, Karl
last_name: Pilch
- first_name: Antti
full_name: Jaakkola, Antti
last_name: Jaakkola
- first_name: Cheng
full_name: Chin, Cheng
last_name: Chin
- first_name: Rudolf
full_name: Grimm, Rudolf
last_name: Grimm
citation:
ama: 'Nägerl H, Kraemer T, Mark M, et al. Experimental evidence for Efimov quantum
states. In: Vol 869. AIP; 2006:269-277. doi:10.1063/1.2400657'
apa: 'Nägerl, H., Kraemer, T., Mark, M., Waldburger, P., Danzl, J. G., Engeser,
B., … Grimm, R. (2006). Experimental evidence for Efimov quantum states (Vol.
869, pp. 269–277). Presented at the ICAP: International Conference on Atomic Physics,
AIP. https://doi.org/10.1063/1.2400657'
chicago: Nägerl, Hanns, Tobias Kraemer, Michael Mark, Philipp Waldburger, Johann
G Danzl, Bastian Engeser, Adam Lange, et al. “Experimental Evidence for Efimov
Quantum States,” 869:269–77. AIP, 2006. https://doi.org/10.1063/1.2400657.
ieee: 'H. Nägerl et al., “Experimental evidence for Efimov quantum states,”
presented at the ICAP: International Conference on Atomic Physics, 2006, vol.
869, pp. 269–277.'
ista: 'Nägerl H, Kraemer T, Mark M, Waldburger P, Danzl JG, Engeser B, Lange A,
Pilch K, Jaakkola A, Chin C, Grimm R. 2006. Experimental evidence for Efimov quantum
states. ICAP: International Conference on Atomic Physics vol. 869, 269–277.'
mla: Nägerl, Hanns, et al. Experimental Evidence for Efimov Quantum States.
Vol. 869, AIP, 2006, pp. 269–77, doi:10.1063/1.2400657.
short: H. Nägerl, T. Kraemer, M. Mark, P. Waldburger, J.G. Danzl, B. Engeser, A.
Lange, K. Pilch, A. Jaakkola, C. Chin, R. Grimm, in:, AIP, 2006, pp. 269–277.
conference:
name: 'ICAP: International Conference on Atomic Physics'
date_created: 2018-12-11T11:49:48Z
date_published: 2006-01-01T00:00:00Z
date_updated: 2021-01-12T06:47:49Z
day: '01'
doi: 10.1063/1.2400657
extern: '1'
intvolume: ' 869'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/cond-mat/0611629
month: '01'
oa: 1
oa_version: None
page: 269 - 277
publication_status: published
publisher: AIP
publist_id: '6355'
status: public
title: Experimental evidence for Efimov quantum states
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 869
year: '2006'
...
---
_id: '11929'
abstract:
- lang: eng
text: Broder et al.'s [3] shingling algorithm and Charikar's [4] random projection
based approach are considered "state-of-the-art" algorithms for finding near-duplicate
web pages. Both algorithms were either developed at or used by popular web search
engines. We compare the two algorithms on a very large scale, namely on a set
of 1.6B distinct web pages. The results show that neither of the algorithms works
well for finding near-duplicate pairs on the same site, while both achieve high
precision for near-duplicate pairs on different sites. Since Charikar's algorithm
finds more near-duplicate pairs on different sites, it achieves a better precision
overall, namely 0.50 versus 0.38 for Broder et al.'s algorithm. We present a combined
algorithm which achieves precision 0.79 with 79% of the recall of the other algorithms.
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger MH. Finding near-duplicate web pages: A large-scale evaluation of
algorithms. In: 29th Annual International ACM SIGIR Conference on Research
and Development in Information Retrieval. Association for Computing Machinery;
2006:284-291. doi:10.1145/1148170.1148222'
apa: 'Henzinger, M. H. (2006). Finding near-duplicate web pages: A large-scale evaluation
of algorithms. In 29th Annual International ACM SIGIR Conference on Research
and Development in Information Retrieval (pp. 284–291). Seattle, WA, United
States: Association for Computing Machinery. https://doi.org/10.1145/1148170.1148222'
chicago: 'Henzinger, Monika H. “Finding Near-Duplicate Web Pages: A Large-Scale
Evaluation of Algorithms.” In 29th Annual International ACM SIGIR Conference
on Research and Development in Information Retrieval, 284–91. Association
for Computing Machinery, 2006. https://doi.org/10.1145/1148170.1148222.'
ieee: 'M. H. Henzinger, “Finding near-duplicate web pages: A large-scale evaluation
of algorithms,” in 29th Annual International ACM SIGIR Conference on Research
and Development in Information Retrieval, Seattle, WA, United States, 2006,
pp. 284–291.'
ista: 'Henzinger MH. 2006. Finding near-duplicate web pages: A large-scale evaluation
of algorithms. 29th Annual International ACM SIGIR Conference on Research and
Development in Information Retrieval. SIGIR: International Conference on Research
and Development in Information Retrieval, 284–291.'
mla: 'Henzinger, Monika H. “Finding Near-Duplicate Web Pages: A Large-Scale Evaluation
of Algorithms.” 29th Annual International ACM SIGIR Conference on Research
and Development in Information Retrieval, Association for Computing Machinery,
2006, pp. 284–91, doi:10.1145/1148170.1148222.'
short: M.H. Henzinger, in:, 29th Annual International ACM SIGIR Conference on Research
and Development in Information Retrieval, Association for Computing Machinery,
2006, pp. 284–291.
conference:
end_date: 2006-08-11
location: Seattle, WA, United States
name: 'SIGIR: International Conference on Research and Development in Information
Retrieval'
start_date: 2006-08-06
date_created: 2022-08-19T07:20:31Z
date_published: 2006-08-01T00:00:00Z
date_updated: 2023-02-17T13:49:03Z
day: '01'
doi: 10.1145/1148170.1148222
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 284-291
publication: 29th Annual International ACM SIGIR Conference on Research and Development
in Information Retrieval
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Finding near-duplicate web pages: A large-scale evaluation of algorithms'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2006'
...
---
_id: '3404'
alternative_title:
- Manuals in Biomedical Research
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: Ravi
full_name: Sawhney, Ravi K
last_name: Sawhney
- first_name: Martin
full_name: Stark, Martin
last_name: Stark
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: 'Janovjak HL, Sawhney R, Stark M, Mueller D. Atomic force microscopy. In: Techniques
in Microscopy for Biomedical Applications. Vol 2. World Scientific Publishing;
2006:213-284.'
apa: Janovjak, H. L., Sawhney, R., Stark, M., & Mueller, D. (2006). Atomic force
microscopy. In Techniques in Microscopy for Biomedical Applications (Vol.
2, pp. 213–284). World Scientific Publishing.
chicago: Janovjak, Harald L, Ravi Sawhney, Martin Stark, and Daniel Mueller. “Atomic
Force Microscopy.” In Techniques in Microscopy for Biomedical Applications,
2:213–84. World Scientific Publishing, 2006.
ieee: H. L. Janovjak, R. Sawhney, M. Stark, and D. Mueller, “Atomic force microscopy,”
in Techniques in Microscopy for Biomedical Applications, vol. 2, World
Scientific Publishing, 2006, pp. 213–284.
ista: 'Janovjak HL, Sawhney R, Stark M, Mueller D. 2006.Atomic force microscopy.
In: Techniques in Microscopy for Biomedical Applications. Manuals in Biomedical
Research, vol. 2, 213–284.'
mla: Janovjak, Harald L., et al. “Atomic Force Microscopy.” Techniques in Microscopy
for Biomedical Applications, vol. 2, World Scientific Publishing, 2006, pp.
213–84.
short: H.L. Janovjak, R. Sawhney, M. Stark, D. Mueller, in:, Techniques in Microscopy
for Biomedical Applications, World Scientific Publishing, 2006, pp. 213–284.
date_created: 2018-12-11T12:03:09Z
date_published: 2006-09-28T00:00:00Z
date_updated: 2021-01-12T07:43:15Z
day: '28'
extern: 1
intvolume: ' 2'
month: '09'
page: 213 - 284
publication: Techniques in Microscopy for Biomedical Applications
publication_status: published
publisher: World Scientific Publishing
publist_id: '2998'
quality_controlled: 0
status: public
title: Atomic force microscopy
type: book_chapter
volume: 2
year: '2006'
...
---
_id: '3413'
abstract:
- lang: eng
text: |-
Despite their crucial importance for cellular function, little is known about the folding mechanisms of membrane proteins. Recently details of the folding energy landscape were elucidated by atomic force microscope (AFM)-based single molecule force spectroscopy. Upon unfolding and extraction of individual membrane proteins energy barriers in structural elements such as loops and helices were mapped and quantified with the precision of a few amino acids.
Here we report on the next logical step: controlled refolding of single proteins into the membrane. First individual bacteriorhodopsin monomers were partially unfolded and extracted from the purple membrane by pulling at the C-terminal end with an AFM tip. Then by gradually lowering the tip, the protein was allowed to refold into the membrane while the folding force was recorded.
We discovered that upon refolding certain helices are pulled into the membraneagainst a sizable externalforce of several tens of picoNewton. From the mechanical work, which the helix performs on the AFM cantilever, we derive an upper limit for the Gibbs free folding energy. Subsequent unfolding allowed us to analyze the pattern of unfolding barriers and corroborate that the protein had refolded into the native state.
author:
- first_name: Max
full_name: Kessler, Max
last_name: Kessler
- first_name: Kay
full_name: Gottschalk, Kay E
last_name: Gottschalk
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
- first_name: Hermann
full_name: Gaub, Hermann
last_name: Gaub
citation:
ama: Kessler M, Gottschalk K, Janovjak HL, Mueller D, Gaub H. Bacteriorhodopsin
folds into the membrane against an external force. Journal of Molecular Biology.
2006;357(2):644-654. doi:10.1016/j.jmb.2005.12.065
apa: Kessler, M., Gottschalk, K., Janovjak, H. L., Mueller, D., & Gaub, H. (2006).
Bacteriorhodopsin folds into the membrane against an external force. Journal
of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2005.12.065
chicago: Kessler, Max, Kay Gottschalk, Harald L Janovjak, Daniel Mueller, and Hermann
Gaub. “Bacteriorhodopsin Folds into the Membrane against an External Force.” Journal
of Molecular Biology. Elsevier, 2006. https://doi.org/10.1016/j.jmb.2005.12.065.
ieee: M. Kessler, K. Gottschalk, H. L. Janovjak, D. Mueller, and H. Gaub, “Bacteriorhodopsin
folds into the membrane against an external force,” Journal of Molecular Biology,
vol. 357, no. 2. Elsevier, pp. 644–654, 2006.
ista: Kessler M, Gottschalk K, Janovjak HL, Mueller D, Gaub H. 2006. Bacteriorhodopsin
folds into the membrane against an external force. Journal of Molecular Biology.
357(2), 644–654.
mla: Kessler, Max, et al. “Bacteriorhodopsin Folds into the Membrane against an
External Force.” Journal of Molecular Biology, vol. 357, no. 2, Elsevier,
2006, pp. 644–54, doi:10.1016/j.jmb.2005.12.065.
short: M. Kessler, K. Gottschalk, H.L. Janovjak, D. Mueller, H. Gaub, Journal of
Molecular Biology 357 (2006) 644–654.
date_created: 2018-12-11T12:03:12Z
date_published: 2006-03-24T00:00:00Z
date_updated: 2021-01-12T07:43:18Z
day: '24'
doi: 10.1016/j.jmb.2005.12.065
extern: 1
intvolume: ' 357'
issue: '2'
month: '03'
page: 644 - 654
publication: Journal of Molecular Biology
publication_status: published
publisher: Elsevier
publist_id: '2988'
quality_controlled: 0
status: public
title: Bacteriorhodopsin folds into the membrane against an external force
type: journal_article
volume: 357
year: '2006'
...
---
_id: '3414'
abstract:
- lang: eng
text: Mechanisms of folding and misfolding of membrane proteins are of interest
in cell biology. Recently, we have established single-molecule force spectroscopy
to observe directly the stepwise folding of the Na+/H+antiporter NhaA from Escherichia
coli in vitro. Here, we improved this approach significantly to track the folding
intermediates of asingle NhaA polypeptide forming structural segments such as
the Na+-binding site, transmembrane α-helices, and helical pairs. The folding
rates of structural segments ranged from 0.31 s−1 to 47 s−1, providing detailed
insight into a distinct folding hierarchy of an unfolded polypeptide into the
native membrane protein structure. In some cases, however, the folding chain formed
stable and kinetically trapped non-native structures, which could be assigned
to misfolding events of the antiporter.
author:
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Christine
full_name: Ziegler, Christine
last_name: Ziegler
- first_name: Werner
full_name: Kühlbrandt, Werner
last_name: Kühlbrandt
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Kedrov A, Janovjak HL, Ziegler C, Kühlbrandt W, Mueller D. Observing folding
pathways and kinetics of a single sodium-proton antiporter from Escherichia coli.
Journal of Molecular Biology. 2006;355(1):2-8. doi:10.1016/j.jmb.2005.10.028
apa: Kedrov, A., Janovjak, H. L., Ziegler, C., Kühlbrandt, W., & Mueller, D.
(2006). Observing folding pathways and kinetics of a single sodium-proton antiporter
from Escherichia coli. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2005.10.028
chicago: Kedrov, Alexej, Harald L Janovjak, Christine Ziegler, Werner Kühlbrandt,
and Daniel Mueller. “Observing Folding Pathways and Kinetics of a Single Sodium-Proton
Antiporter from Escherichia Coli.” Journal of Molecular Biology. Elsevier,
2006. https://doi.org/10.1016/j.jmb.2005.10.028.
ieee: A. Kedrov, H. L. Janovjak, C. Ziegler, W. Kühlbrandt, and D. Mueller, “Observing
folding pathways and kinetics of a single sodium-proton antiporter from Escherichia
coli,” Journal of Molecular Biology, vol. 355, no. 1. Elsevier, pp. 2–8,
2006.
ista: Kedrov A, Janovjak HL, Ziegler C, Kühlbrandt W, Mueller D. 2006. Observing
folding pathways and kinetics of a single sodium-proton antiporter from Escherichia
coli. Journal of Molecular Biology. 355(1), 2–8.
mla: Kedrov, Alexej, et al. “Observing Folding Pathways and Kinetics of a Single
Sodium-Proton Antiporter from Escherichia Coli.” Journal of Molecular Biology,
vol. 355, no. 1, Elsevier, 2006, pp. 2–8, doi:10.1016/j.jmb.2005.10.028.
short: A. Kedrov, H.L. Janovjak, C. Ziegler, W. Kühlbrandt, D. Mueller, Journal
of Molecular Biology 355 (2006) 2–8.
date_created: 2018-12-11T12:03:12Z
date_published: 2006-01-06T00:00:00Z
date_updated: 2021-01-12T07:43:19Z
day: '06'
doi: 10.1016/j.jmb.2005.10.028
extern: 1
intvolume: ' 355'
issue: '1'
month: '01'
page: 2 - 8
publication: Journal of Molecular Biology
publication_status: published
publisher: Elsevier
publist_id: '2987'
quality_controlled: 0
status: public
title: Observing folding pathways and kinetics of a single sodium-proton antiporter
from Escherichia coli
type: journal_article
volume: 355
year: '2006'
...
---
_id: '3415'
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: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: David
full_name: Cisneros, David
last_name: Cisneros
- first_name: Tanuj
full_name: Sapra, Tanuj K
last_name: Sapra
- first_name: Jens
full_name: Struckmeier, Jens
last_name: Struckmeier
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Janovjak HL, Kedrov A, Cisneros D, Sapra T, Struckmeier J, Mueller D. Imaging
and detecting molecular interactions of single membrane proteins. Neurobiology
of Aging. 2006;27:546-561. doi:10.1016/j.neurobiolaging.2005.03.031
apa: Janovjak, H. L., Kedrov, A., Cisneros, D., Sapra, T., Struckmeier, J., &
Mueller, D. (2006). Imaging and detecting molecular interactions of single membrane
proteins. Neurobiology of Aging. Elsevier. https://doi.org/10.1016/j.neurobiolaging.2005.03.031
chicago: Janovjak, Harald L, Alexej Kedrov, David Cisneros, Tanuj Sapra, Jens Struckmeier,
and Daniel Mueller. “Imaging and Detecting Molecular Interactions of Single Membrane
Proteins.” Neurobiology of Aging. Elsevier, 2006. https://doi.org/10.1016/j.neurobiolaging.2005.03.031.
ieee: H. L. Janovjak, A. Kedrov, D. Cisneros, T. Sapra, J. Struckmeier, and D. Mueller,
“Imaging and detecting molecular interactions of single membrane proteins,” Neurobiology
of Aging, vol. 27. Elsevier, pp. 546–561, 2006.
ista: Janovjak HL, Kedrov A, Cisneros D, Sapra T, Struckmeier J, Mueller D. 2006.
Imaging and detecting molecular interactions of single membrane proteins. Neurobiology
of Aging. 27, 546–561.
mla: Janovjak, Harald L., et al. “Imaging and Detecting Molecular Interactions of
Single Membrane Proteins.” Neurobiology of Aging, vol. 27, Elsevier, 2006,
pp. 546–61, doi:10.1016/j.neurobiolaging.2005.03.031.
short: H.L. Janovjak, A. Kedrov, D. Cisneros, T. Sapra, J. Struckmeier, D. Mueller,
Neurobiology of Aging 27 (2006) 546–561.
date_created: 2018-12-11T12:03:12Z
date_published: 2006-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:27Z
day: '01'
doi: 10.1016/j.neurobiolaging.2005.03.031
extern: 1
intvolume: ' 27'
month: '01'
page: 546 - 561
publication: Neurobiology of Aging
publication_status: published
publisher: Elsevier
publist_id: '2986'
quality_controlled: 0
status: public
title: Imaging and detecting molecular interactions of single membrane proteins
type: review
volume: 27
year: '2006'
...
---
_id: '3431'
abstract:
- lang: eng
text: Ising models with pairwise interactions are the least structured, or maximum-entropy,
probability distributions that exactly reproduce measured pairwise correlations
between spins. Here we use this equivalence to construct Ising models that describe
the correlated spiking activity of populations of 40 neurons in the retina, and
show that pairwise interactions account for observed higher-order correlations.
By first finding a representative ensemble for observed networks we can create
synthetic networks of 120 neurons, and find that with increasing size the networks
operate closer to a critical point and start exhibiting collective behaviors reminiscent
of spin glasses.
author:
- first_name: Gasper
full_name: Gasper Tkacik
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: E.
full_name: Schneidman, E.
last_name: Schneidman
- first_name: M.
full_name: Berry, M. J.
last_name: Berry
- first_name: William
full_name: Bialek, William S
last_name: Bialek
citation:
ama: Tkačik G, Schneidman E, Berry M, Bialek W. Ising models for networks of real
neurons. ArXiv. 2006:1-4.
apa: Tkačik, G., Schneidman, E., Berry, M., & Bialek, W. (2006). Ising models
for networks of real neurons. ArXiv. ArXiv.
chicago: Tkačik, Gašper, E. Schneidman, M. Berry, and William Bialek. “Ising Models
for Networks of Real Neurons.” ArXiv. ArXiv, 2006.
ieee: G. Tkačik, E. Schneidman, M. Berry, and W. Bialek, “Ising models for networks
of real neurons,” ArXiv. ArXiv, pp. 1–4, 2006.
ista: Tkačik G, Schneidman E, Berry M, Bialek W. 2006. Ising models for networks
of real neurons. ArXiv, 1–4, .
mla: Tkačik, Gašper, et al. “Ising Models for Networks of Real Neurons.” ArXiv,
ArXiv, 2006, pp. 1–4.
short: G. Tkačik, E. Schneidman, M. Berry, W. Bialek, ArXiv (2006) 1–4.
date_created: 2018-12-11T12:03:18Z
date_published: 2006-11-22T00:00:00Z
date_updated: 2021-01-12T07:43:25Z
day: '22'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/q-bio/0611072
month: '11'
oa: 1
page: 1 - 4
publication: ArXiv
publication_status: published
publisher: ArXiv
publist_id: '2969'
quality_controlled: 0
status: public
title: Ising models for networks of real neurons
type: preprint
year: '2006'
...
---
_id: '3437'
abstract:
- lang: eng
text: The mutational landscape model is a theoretical model describing sequence
evolution in natural populations. However, recent experimental work has begun
to test its predictions in laboratory populations of microbes. Several of these
studies have focused on testing the prediction that the effects of beneficial
mutations should be roughly exponentially distributed. The prediction appears
to be borne out by most of these studies, at least qualitatively. Another study
showed that a modified version of the model was able to predict, with reasonable
accuracy, which of a ranked set of beneficial alleles will be fixed next. Although
it remains to be seen whether the mutational landscape model adequately describes
adaptation in organisms other than microbes, together these studies suggest that
adaptive evolution has surprisingly general properties that can be successfully
captured by theoretical models.
author:
- first_name: Andrea
full_name: Betancourt, Andrea J
last_name: Betancourt
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
citation:
ama: 'Betancourt A, Bollback JP. Fitness effects of beneficial mutations: the mutational
landscape model in experimental evolution. Current Opinion in Genetics &
Development. 2006;16(6):618-623. doi:10.1016/j.gde.2006.10.006'
apa: 'Betancourt, A., & Bollback, J. P. (2006). Fitness effects of beneficial
mutations: the mutational landscape model in experimental evolution. Current
Opinion in Genetics & Development. Elsevier. https://doi.org/10.1016/j.gde.2006.10.006'
chicago: 'Betancourt, Andrea, and Jonathan P Bollback. “Fitness Effects of Beneficial
Mutations: The Mutational Landscape Model in Experimental Evolution.” Current
Opinion in Genetics & Development. Elsevier, 2006. https://doi.org/10.1016/j.gde.2006.10.006.'
ieee: 'A. Betancourt and J. P. Bollback, “Fitness effects of beneficial mutations:
the mutational landscape model in experimental evolution,” Current Opinion
in Genetics & Development, vol. 16, no. 6. Elsevier, pp. 618–623, 2006.'
ista: 'Betancourt A, Bollback JP. 2006. Fitness effects of beneficial mutations:
the mutational landscape model in experimental evolution. Current Opinion in Genetics
& Development. 16(6), 618–623.'
mla: 'Betancourt, Andrea, and Jonathan P. Bollback. “Fitness Effects of Beneficial
Mutations: The Mutational Landscape Model in Experimental Evolution.” Current
Opinion in Genetics & Development, vol. 16, no. 6, Elsevier, 2006, pp.
618–23, doi:10.1016/j.gde.2006.10.006.'
short: A. Betancourt, J.P. Bollback, Current Opinion in Genetics & Development
16 (2006) 618–623.
date_created: 2018-12-11T12:03:19Z
date_published: 2006-12-01T00:00:00Z
date_updated: 2021-01-12T07:43:27Z
day: '01'
doi: 10.1016/j.gde.2006.10.006
extern: 1
intvolume: ' 16'
issue: '6'
month: '12'
page: 618 - 623
publication: Current Opinion in Genetics & Development
publication_status: published
publisher: Elsevier
publist_id: '2963'
quality_controlled: 0
status: public
title: 'Fitness effects of beneficial mutations: the mutational landscape model in
experimental evolution'
type: journal_article
volume: 16
year: '2006'
...
---
_id: '3449'
abstract:
- lang: eng
text: We argue that games are expressive enough to encompass (history-based) access
control, (resource) usage control (e.g., dynamic adaptive access control of reputation
systems), accountability based controls (e.g., insurance), controls derived from
rationality assumptions on participants (e.g., network mechanisms), and their
composition. Building on the extensive research into games, we demonstrate that
this expressive power coexists with a formal analysis framework comparable to
that available for access control.
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rhada
full_name: Jagadeesan, Rhada
last_name: Jagadeesan
- first_name: Corin
full_name: Pitcher, Corin
last_name: Pitcher
citation:
ama: 'Chatterjee K, Jagadeesan R, Pitcher C. Games for controls. In: IEEE; 2006:70-82.
doi:10.1109/CSFW.2006.14'
apa: 'Chatterjee, K., Jagadeesan, R., & Pitcher, C. (2006). Games for controls
(pp. 70–82). Presented at the CSF: Computer Security Foundations, IEEE. https://doi.org/10.1109/CSFW.2006.14'
chicago: Chatterjee, Krishnendu, Rhada Jagadeesan, and Corin Pitcher. “Games for
Controls,” 70–82. IEEE, 2006. https://doi.org/10.1109/CSFW.2006.14.
ieee: 'K. Chatterjee, R. Jagadeesan, and C. Pitcher, “Games for controls,” presented
at the CSF: Computer Security Foundations, 2006, pp. 70–82.'
ista: 'Chatterjee K, Jagadeesan R, Pitcher C. 2006. Games for controls. CSF: Computer
Security Foundations, 70–82.'
mla: Chatterjee, Krishnendu, et al. Games for Controls. IEEE, 2006, pp. 70–82,
doi:10.1109/CSFW.2006.14.
short: K. Chatterjee, R. Jagadeesan, C. Pitcher, in:, IEEE, 2006, pp. 70–82.
conference:
name: 'CSF: Computer Security Foundations'
date_created: 2018-12-11T12:03:23Z
date_published: 2006-07-31T00:00:00Z
date_updated: 2021-01-12T07:43:32Z
day: '31'
doi: 10.1109/CSFW.2006.14
extern: 1
month: '07'
page: 70 - 82
publication_status: published
publisher: IEEE
publist_id: '2938'
quality_controlled: 0
status: public
title: Games for controls
type: conference
year: '2006'
...
---
_id: '3463'
abstract:
- lang: eng
text: It is widely accepted that the hippocampus plays a major role in learning
and memory. The mossy fiber synapse between granule cells in the dentate gyrus
and pyramidal neurons in the CA3 region is a key component of the hippocampal
trisynaptic circuit. Recent work, partially based on direct presynaptic patch-clamp
recordings from hippocampal mossy fiber boutons, sheds light on the mechanisms
of synaptic transmission and plasticity at mossy fiber synapses. A high Na(+)
channel density in mossy fiber boutons leads to a large amplitude of the presynaptic
action potential. Together with the fast gating of presynaptic Ca(2+) channels,
this generates a large and brief presynaptic Ca(2+) influx, which can trigger
transmitter release with high efficiency and temporal precision. The large number
of release sites, the large size of the releasable pool of vesicles, and the huge
extent of presynaptic plasticity confer unique strength to this synapse, suggesting
a large impact onto the CA3 pyramidal cell network under specific behavioral conditions.
The characteristic properties of the hippocampal mossy fiber synapse may be important
for pattern separation and information storage in the dentate gyrus-CA3 cell network.
author:
- first_name: Joseph
full_name: Bischofberger, Joseph
last_name: Bischofberger
- first_name: Dominique
full_name: Engel, Dominique
last_name: Engel
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: 'Bischofberger J, Engel D, Frotscher M, Jonas PM. Timing and efficacy of transmitter
release at mossy fiber synapses in the hippocampal network. (Review). Pflugers
Archiv : European Journal of Physiology. 2006;453(3):361-372. doi:10.1007/s00424-006-0093-2'
apa: 'Bischofberger, J., Engel, D., Frotscher, M., & Jonas, P. M. (2006). Timing
and efficacy of transmitter release at mossy fiber synapses in the hippocampal
network. (Review). Pflugers Archiv : European Journal of Physiology. Springer.
https://doi.org/10.1007/s00424-006-0093-2'
chicago: 'Bischofberger, Joseph, Dominique Engel, Michael Frotscher, and Peter M
Jonas. “Timing and Efficacy of Transmitter Release at Mossy Fiber Synapses in
the Hippocampal Network. (Review).” Pflugers Archiv : European Journal of Physiology.
Springer, 2006. https://doi.org/10.1007/s00424-006-0093-2.'
ieee: 'J. Bischofberger, D. Engel, M. Frotscher, and P. M. Jonas, “Timing and efficacy
of transmitter release at mossy fiber synapses in the hippocampal network. (Review),”
Pflugers Archiv : European Journal of Physiology, vol. 453, no. 3. Springer,
pp. 361–372, 2006.'
ista: 'Bischofberger J, Engel D, Frotscher M, Jonas PM. 2006. Timing and efficacy
of transmitter release at mossy fiber synapses in the hippocampal network. (Review).
Pflugers Archiv : European Journal of Physiology. 453(3), 361–372.'
mla: 'Bischofberger, Joseph, et al. “Timing and Efficacy of Transmitter Release
at Mossy Fiber Synapses in the Hippocampal Network. (Review).” Pflugers Archiv :
European Journal of Physiology, vol. 453, no. 3, Springer, 2006, pp. 361–72,
doi:10.1007/s00424-006-0093-2.'
short: 'J. Bischofberger, D. Engel, M. Frotscher, P.M. Jonas, Pflugers Archiv :
European Journal of Physiology 453 (2006) 361–372.'
date_created: 2018-12-11T12:03:28Z
date_published: 2006-12-01T00:00:00Z
date_updated: 2019-04-26T07:22:28Z
day: '01'
doi: 10.1007/s00424-006-0093-2
extern: 1
intvolume: ' 453'
issue: '3'
month: '12'
page: 361 - 372
publication: 'Pflugers Archiv : European Journal of Physiology'
publication_status: published
publisher: Springer
publist_id: '2924'
quality_controlled: 0
status: public
title: Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal
network. (Review)
type: review
volume: 453
year: '2006'
...
---
_id: '3499'
abstract:
- lang: eng
text: 'We study infinite stochastic games played by n-players on a finite graph
with goals specified by sets of infinite traces. The games are concurrent (each
player simultaneously and independently chooses an action at each round), stochastic
(the next state is determined by a probability distribution depending on the current
state and the chosen actions), infinite (the game continues for an infinite number
of rounds), nonzero-sum (the players’ goals are not necessarily conflicting),
and undiscounted. We show that if each player has an upward-closed objective,
then there exists an ε-Nash equilibrium in memoryless strategies, for every ε>0;
and exact Nash equilibria need not exist. Upward-closure of an objective means
that if a set Z of infinitely repeating states is winning, then all supersets
of Z of infinitely repeating states are also winning. Memoryless strategies are
strategies that are independent of history of plays and depend only on the current
state. We also study the complexity of finding values (payoff profile) of an ε-Nash
equilibrium. We show that the values of an ε-Nash equilibrium in nonzero-sum concurrent
games with upward-closed objectives for all players can be computed by computing
ε-Nash equilibrium values of nonzero-sum concurrent games with reachability objectives
for all players and a polynomial procedure. As a consequence we establish that
values of an ε-Nash equilibrium can be computed in TFNP (total functional NP),
and hence in EXPTIME. '
acknowledgement: This research was supported in part by the NSF grants CCR-0225610
and CCR- 0234690, and by the SNSF under the Indo-Swiss Joint Research Programme.
alternative_title:
- 'LNCS '
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Chatterjee K. Nash equilibrium for upward-closed objectives. In: Vol 4207.
Springer; 2006:271-286. doi:10.1007/11874683_18'
apa: 'Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol.
4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_18'
chicago: Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives,”
4207:271–86. Springer, 2006. https://doi.org/10.1007/11874683_18.
ieee: 'K. Chatterjee, “Nash equilibrium for upward-closed objectives,” presented
at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 271–286.'
ista: 'Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer
Science Logic, LNCS , vol. 4207, 271–286.'
mla: Chatterjee, Krishnendu. Nash Equilibrium for Upward-Closed Objectives.
Vol. 4207, Springer, 2006, pp. 271–86, doi:10.1007/11874683_18.
short: K. Chatterjee, in:, Springer, 2006, pp. 271–286.
conference:
name: 'CSL: Computer Science Logic'
date_created: 2018-12-11T12:03:39Z
date_published: 2006-09-28T00:00:00Z
date_updated: 2021-01-12T07:43:52Z
day: '28'
doi: 10.1007/11874683_18
extern: 1
intvolume: ' 4207'
month: '09'
page: 271 - 286
publication_status: published
publisher: Springer
publist_id: '2888'
quality_controlled: 0
status: public
title: Nash equilibrium for upward-closed objectives
type: conference
volume: 4207
year: '2006'
...
---
_id: '3500'
abstract:
- lang: eng
text: The classical algorithm for solving Bu ̈chi games requires time O(n · m) for
game graphs with n states and m edges. For game graphs with constant outdegree,
the best known algorithm has running time O(n2/logn). We present two new algorithms
for Bu ̈chi games. First, we give an algorithm that performs at most O(m) more
work than the classical algorithm, but runs in time O(n) on infinitely many graphs
of constant outdegree on which the classical algorithm requires time O(n2). Second,
we give an algorithm with running time O(n · m · log δ(n)/ log n), where 1 ≤ δ(n)
≤ n is the outdegree of the game graph. Note that this algorithm performs asymptotically
better than the classical algorithm if δ(n) = O(log n).
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327
and the NSF ITR grant CCR-0225610 and the SNSF under the Indo-Swiss Joint Research
Programme.
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Chatterjee K, Henzinger TA, Piterman N. Algorithms for Büchi Games. In: ACM;
2006.'
apa: 'Chatterjee, K., Henzinger, T. A., & Piterman, N. (2006). Algorithms for
Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Algorithms
for Büchi Games.” ACM, 2006.
ieee: 'K. Chatterjee, T. A. Henzinger, and N. Piterman, “Algorithms for Büchi Games,”
presented at the GDV: Games in Design and Verification, 2006.'
ista: 'Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games.
GDV: Games in Design and Verification.'
mla: Chatterjee, Krishnendu, et al. Algorithms for Büchi Games. ACM, 2006.
short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, ACM, 2006.
conference:
name: 'GDV: Games in Design and Verification'
date_created: 2018-12-11T12:03:39Z
date_published: 2006-08-21T00:00:00Z
date_updated: 2021-01-12T07:43:53Z
day: '21'
extern: 1
main_file_link:
- open_access: '0'
url: http://www.cs.le.ac.uk/people/np183/publications/2006/CHP06.pdf
month: '08'
publication_status: published
publisher: ACM
publist_id: '2887'
quality_controlled: 0
status: public
title: Algorithms for Büchi Games
type: conference
year: '2006'
...
---
_id: '3510'
abstract:
- lang: eng
text: Embodiments automatically generate an accurate network of watertight NURBS
patches from polygonal models of objects while automatically detecting and preserving
character lines thereon. These embodiments generate from an initial triangulation
of the surface, a hierarchy of progressively coarser triangulations of the surface
by performing a sequence of edge contractions using a greedy algorithm that selects
edge contractions by their numerical properties. Operations are also performed
to connect the triangulations in the hierarchy using homeomorphisms that preserve
the topology of the initial triangulation in the coarsest triangulation. A desired
quadrangulation of the surface can then be generated by homeomorphically mapping
edges of a coarsest triangulation in the hierarchy back to the initial triangulation.
This quadrangulation is topologically consistent with the initial triangulation
and is defined by a plurality of quadrangular patches. These quadrangular patches
are linked together by a (U, V) mesh that is guaranteed to be continuous at patch
boundaries. A grid is then preferably fit to each of the quadrangles in the resulting
quadrangulation by decomposing each of the quadrangles into k.sup.2 smaller quadrangles.
A watertight NURBS model may be generated from the resulting quadrangulation.
applicant:
- Raindrop Geomagic, Inc.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
- first_name: Dmitry
full_name: Nekhayev, Dmitry
last_name: Nekhayev
- first_name: Michael
full_name: Facello, Michael
last_name: Facello
- first_name: Steven
full_name: Williams, Steven
last_name: Williams
citation:
ama: Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. Method, apparatus
and computer program products for automatically generating NURBS models of triangulated
surfaces using homeomorphism. 2006.
apa: Edelsbrunner, H., Fu, P., Nekhayev, D., Facello, M., & Williams, S. (2006).
Method, apparatus and computer program products for automatically generating NURBS
models of triangulated surfaces using homeomorphism.
chicago: Edelsbrunner, Herbert, Ping Fu, Dmitry Nekhayev, Michael Facello, and Steven
Williams. “Method, Apparatus and Computer Program Products for Automatically Generating
NURBS Models of Triangulated Surfaces Using Homeomorphism,” 2006.
ieee: H. Edelsbrunner, P. Fu, D. Nekhayev, M. Facello, and S. Williams, “Method,
apparatus and computer program products for automatically generating NURBS models
of triangulated surfaces using homeomorphism.” 2006.
ista: Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. 2006. Method, apparatus
and computer program products for automatically generating NURBS models of triangulated
surfaces using homeomorphism.
mla: Edelsbrunner, Herbert, et al. Method, Apparatus and Computer Program Products
for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism.
2006.
short: H. Edelsbrunner, P. Fu, D. Nekhayev, M. Facello, S. Williams, (2006).
date_created: 2018-12-11T12:03:42Z
date_published: 2006-02-07T00:00:00Z
date_updated: 2022-01-05T12:58:26Z
day: '07'
extern: '1'
ipc: G06F 7/60 ; G06F 17/10 ; G06F 101/00
ipn: US6996505B1
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US6996505
month: '02'
oa: 1
oa_version: Published Version
publication_date: 2006-02-07
publist_id: '2877'
status: public
title: Method, apparatus and computer program products for automatically generating
NURBS models of triangulated surfaces using homeomorphism
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2006'
...
---
_id: '3511'
abstract:
- lang: eng
text: 'Methods, apparatus and computer program products provide efficient techniques
for designing and printing shells of hearing-aid devices with a high degree of
quality assurance and reliability and with a reduced number of manual and time
consuming production steps and operations. These techniques also preferably provide
hearing-aid shells having internal volumes that can approach a maximum allowable
ratio of internal volume relative to external volume. These high internal volumes
facilitate the inclusion of hearing-aid electrical components having higher degrees
of functionality and/or the use of smaller and less conspicuous hearing-aid shells.
A preferred method includes operations to generate a watertight digital model
of a hearing-aid shell by thickening a three-dimensional digital model of a shell
surface in a manner that eliminates self-intersections and results in a thickened
model having an internal volume that is a high percentage of an external volume
of the model. '
acknowledgement: sold to Siemens and Phonak
applicant:
- Phonak AG
article_processing_charge: No
author:
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
- first_name: Dmitry
full_name: Nekhayev, Dmitry
last_name: Nekhayev
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Fu P, Nekhayev D, Edelsbrunner H. Manufacturing methods and systems for rapid
production of hearing-aid shells. 2006.
apa: Fu, P., Nekhayev, D., & Edelsbrunner, H. (2006). Manufacturing methods
and systems for rapid production of hearing-aid shells.
chicago: Fu, Ping, Dmitry Nekhayev, and Herbert Edelsbrunner. “Manufacturing Methods
and Systems for Rapid Production of Hearing-Aid Shells,” 2006.
ieee: P. Fu, D. Nekhayev, and H. Edelsbrunner, “Manufacturing methods and systems
for rapid production of hearing-aid shells.” 2006.
ista: Fu P, Nekhayev D, Edelsbrunner H. 2006. Manufacturing methods and systems
for rapid production of hearing-aid shells.
mla: Fu, Ping, et al. Manufacturing Methods and Systems for Rapid Production
of Hearing-Aid Shells. 2006.
short: P. Fu, D. Nekhayev, H. Edelsbrunner, (2006).
date_created: 2018-12-11T12:03:43Z
date_published: 2006-05-23T00:00:00Z
date_updated: 2022-01-05T13:03:56Z
day: '23'
extern: '1'
ipc: G06F 9/00
ipn: US7050876B1
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US7050876B1
month: '05'
oa: 1
oa_version: Published Version
publication_date: 2006-05-23
publist_id: '2876'
status: public
title: Manufacturing methods and systems for rapid production of hearing-aid shells
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2006'
...
---
_id: '3512'
abstract:
- lang: eng
text: Methods, apparatus and computer program products provide efficient techniques
for reconstructing surfaces from data point sets. These techniques include reconstructing
surfaces from sets of scanned data points that have preferably undergone preprocessing
operations to improve their quality by, for example, reducing noise and removing
outliers. These techniques include reconstructing a dense and locally two-dimensionally
distributed 3D point set (e.g., point cloud) by merging stars in two-dimensional
weighted Delaunay triangulations within estimated tangent planes. The techniques
include determining a plurality of stars from a plurality of points p.sub.i in
a 3D point set S that at least partially describes the 3D surface, by projecting
the plurality of points p.sub.i onto planes T.sub.i that are each estimated to
be tangent about a respective one of the plurality of points p.sub.i. The plurality
of stars are then merged into a digital model of the 3D surface.
applicant:
- Geomagic Inc.
article_processing_charge: No
author:
- first_name: Yates
full_name: Fletcher, Yates
last_name: Fletcher
- first_name: Tobias
full_name: Gloth, Tobias
last_name: Gloth
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
citation:
ama: Fletcher Y, Gloth T, Edelsbrunner H, Fu P. Method, apparatus and computer products
that reconstruct surfaces from data points. 2006.
apa: Fletcher, Y., Gloth, T., Edelsbrunner, H., & Fu, P. (2006). Method, apparatus
and computer products that reconstruct surfaces from data points.
chicago: Fletcher, Yates, Tobias Gloth, Herbert Edelsbrunner, and Ping Fu. “Method,
Apparatus and Computer Products That Reconstruct Surfaces from Data Points,” 2006.
ieee: Y. Fletcher, T. Gloth, H. Edelsbrunner, and P. Fu, “Method, apparatus and
computer products that reconstruct surfaces from data points.” 2006.
ista: Fletcher Y, Gloth T, Edelsbrunner H, Fu P. 2006. Method, apparatus and computer
products that reconstruct surfaces from data points.
mla: Fletcher, Yates, et al. Method, Apparatus and Computer Products That Reconstruct
Surfaces from Data Points. 2006.
short: Y. Fletcher, T. Gloth, H. Edelsbrunner, P. Fu, (2006).
date_created: 2018-12-11T12:03:43Z
date_published: 2006-04-04T00:00:00Z
date_updated: 2022-01-05T14:00:00Z
day: '04'
extern: '1'
ipc: ' G06T17/20 ; B33Y50/00'
ipn: US7023432B2
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US7023432B2
month: '04'
oa: 1
oa_version: Published Version
publication_date: 2006-04-04
publist_id: '2875'
status: public
title: Method, apparatus and computer products that reconstruct surfaces from data
points
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2006'
...
---
_id: '3522'
abstract:
- lang: eng
text: We observed sharp wave/ripples (SWR) during exploration within brief (<
2.4 s) interruptions of or during theta oscillations. CA1 network responses of
SWRs occurring during exploration (eSWR) and SWRs detected in waking immobility
or sleep were similar. However, neuronal activity during eSWR was location dependent,
and eSWR-related firing was stronger inside the place field than outside. The
eSPW-related firing increase was stronger than the baseline increase inside compared
to outside, suggesting a “supralinear” summation of eSWR and place-selective inputs.
Pairs of cells with similar place fields and/or correlated firing during exploration
showed stronger coactivation during eSWRs and subsequent sleep-SWRs. Sequential
activation of place cells was not required for the reactivation of waking co-firing
patterns; cell pairs with symmetrical cross-correlations still showed reactivated
waking co-firing patterns during sleep-SWRs. We suggest that place-selective firing
during eSWRs facilitates initial associations between cells with similar place
fields that enable place-related ensemble patterns to recur during subsequent
sleep-SWRs.
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
last_name: Senior
- 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, Csicsvari JL. Place-selective firing of CA1 pyramidal
cells during sharp wave/ripple network patterns in exploratory behavior. Neuron.
2006;49(1):143-155. doi:10.1016/j.neuron.2005.10.037
apa: O’Neill, J., Senior, T., & Csicsvari, J. L. (2006). Place-selective firing
of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory
behavior. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2005.10.037
chicago: O’Neill, Joseph, Timothy Senior, and Jozsef L Csicsvari. “Place-Selective
Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory
Behavior.” Neuron. Elsevier, 2006. https://doi.org/10.1016/j.neuron.2005.10.037.
ieee: J. O’Neill, T. Senior, and J. L. Csicsvari, “Place-selective firing of CA1
pyramidal cells during sharp wave/ripple network patterns in exploratory behavior,”
Neuron, vol. 49, no. 1. Elsevier, pp. 143–155, 2006.
ista: O’Neill J, Senior T, Csicsvari JL. 2006. Place-selective firing of CA1 pyramidal
cells during sharp wave/ripple network patterns in exploratory behavior. Neuron.
49(1), 143–155.
mla: O’Neill, Joseph, et al. “Place-Selective Firing of CA1 Pyramidal Cells during
Sharp Wave/Ripple Network Patterns in Exploratory Behavior.” Neuron, vol.
49, no. 1, Elsevier, 2006, pp. 143–55, doi:10.1016/j.neuron.2005.10.037.
short: J. O’Neill, T. Senior, J.L. Csicsvari, Neuron 49 (2006) 143–155.
date_created: 2018-12-11T12:03:46Z
date_published: 2006-01-05T00:00:00Z
date_updated: 2021-01-12T07:44:03Z
day: '05'
doi: 10.1016/j.neuron.2005.10.037
extern: 1
intvolume: ' 49'
issue: '1'
month: '01'
page: 143 - 155
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2863'
quality_controlled: 0
status: public
title: Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network
patterns in exploratory behavior
type: journal_article
volume: 49
year: '2006'
...
---
_id: '3545'
abstract:
- lang: eng
text: The functional organization of the basal ganglia ( BG) is often defined according
to one of two opposing schemes. The first proposes multiple, essentially independent
channels of information processing. The second posits convergence and lateral
integration of striatal channels at the level of the globus pallidus ( GP). We
tested the hypothesis that these proposed aspects of functional connectivity within
the striatopallidal axis are dynamic and related to brain state. Local field potentials
( LFPs) were simultaneously recorded from multiple sites in striatum and GP in
anesthetized rats during slow-wave activity( SWA) and during global activation
evoked by sensory stimulation. Functional connectivity was inferred from comparative
analyses of the internuclear and intranuclear coherence between bipolar derivations
of LFPs. During prominent SWA, as shown in the electrocorticogram and local field
potentials in the basal ganglia, intranuclear coherence, and, thus, lateral functional
connectivity within striatum or globus pallidus was relatively weak. Furthermore,
the temporal coupling of LFPs recorded across these two nuclei involved functional
convergence at the level of GP. Global activation, indicated by a loss of SWA,
was accompanied by a rapid functional reorganization of the striatopallidal axis.
Prominent lateral functional connectivity developed within GP and, to a significantly
more constrained spatial extent, striatum. Additionally, functional convergence
on GP was no longer apparent, despite increased internuclear coherence. These
data demonstrate that functional connectivity within the BG is highly dynamic
and suggest that the relative expression of organizational principles, such as
parallel, independent processing channels, striatopallidal convergence, and lateral
integration within BG nuclei, is dependent on brain state.
author:
- first_name: Peter
full_name: Magill,Peter J
last_name: Magill
- 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
citation:
ama: Magill P, Pogosyan A, Sharott A, Csicsvari JL, Bolam J, Brown P. Changes in
functional connectivity within the rat striatopallidal axis during global brain
activation in vivo. Journal of Neuroscience. 2006;26(23):6318-6329. doi:10.1523/JNEUROSCI.0620-06.2006
apa: Magill, P., Pogosyan, A., Sharott, A., Csicsvari, J. L., Bolam, J., & Brown,
P. (2006). Changes in functional connectivity within the rat striatopallidal axis
during global brain activation in vivo. Journal of Neuroscience. Society
for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0620-06.2006
chicago: Magill, Peter, Alek Pogosyan, Andrew Sharott, Jozsef L Csicsvari, John
Bolam, and Peter Brown. “Changes in Functional Connectivity within the Rat Striatopallidal
Axis during Global Brain Activation in Vivo.” Journal of Neuroscience.
Society for Neuroscience, 2006. https://doi.org/10.1523/JNEUROSCI.0620-06.2006.
ieee: P. Magill, A. Pogosyan, A. Sharott, J. L. Csicsvari, J. Bolam, and P. Brown,
“Changes in functional connectivity within the rat striatopallidal axis during
global brain activation in vivo,” Journal of Neuroscience, vol. 26, no.
23. Society for Neuroscience, pp. 6318–6329, 2006.
ista: Magill P, Pogosyan A, Sharott A, Csicsvari JL, Bolam J, Brown P. 2006. Changes
in functional connectivity within the rat striatopallidal axis during global brain
activation in vivo. Journal of Neuroscience. 26(23), 6318–6329.
mla: Magill, Peter, et al. “Changes in Functional Connectivity within the Rat Striatopallidal
Axis during Global Brain Activation in Vivo.” Journal of Neuroscience,
vol. 26, no. 23, Society for Neuroscience, 2006, pp. 6318–29, doi:10.1523/JNEUROSCI.0620-06.2006.
short: P. Magill, A. Pogosyan, A. Sharott, J.L. Csicsvari, J. Bolam, P. Brown, Journal
of Neuroscience 26 (2006) 6318–6329.
date_created: 2018-12-11T12:03:53Z
date_published: 2006-06-07T00:00:00Z
date_updated: 2021-01-12T07:44:13Z
day: '07'
doi: 10.1523/JNEUROSCI.0620-06.2006
extern: 1
intvolume: ' 26'
issue: '23'
month: '06'
page: 6318 - 6329
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '2840'
quality_controlled: 0
status: public
title: Changes in functional connectivity within the rat striatopallidal axis during
global brain activation in vivo
type: journal_article
volume: 26
year: '2006'
...
---
_id: '3559'
abstract:
- lang: eng
text: Persistent homology is the mathematical core of recent work on shape, including
reconstruction, recognition, and matching. Its per- tinent information is encapsulated
by a pairing of the critical values of a function, visualized by points forming
a diagram in the plane. The original algorithm in [10] computes the pairs from
an ordering of the simplices in a triangulation and takes worst-case time cubic
in the number of simplices. The main result of this paper is an algorithm that
maintains the pairing in worst-case linear time per transposition in the ordering.
A side-effect of the algorithm’s anal- ysis is an elementary proof of the stability
of persistence diagrams [7] in the special case of piecewise-linear functions.
We use the algorithm to compute 1-parameter families of diagrams which we apply
to the study of protein folding trajectories.
acknowledgement: Partially supported by NSF under grant CCR- 00-86013, by DARPA under
grant HR0011-05-1-0007, and by the Lawrence Livermore National Laboratory under
grant B543154.
author:
- first_name: David
full_name: Cohen-Steiner, David
last_name: Cohen Steiner
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozov, Dmitriy
last_name: Morozov
citation:
ama: 'Cohen Steiner D, Edelsbrunner H, Morozov D. Vines and vineyards by updating
persistence in linear time. In: ACM; 2006:119-126. doi:10.1145/1137856.1137877'
apa: 'Cohen Steiner, D., Edelsbrunner, H., & Morozov, D. (2006). Vines and vineyards
by updating persistence in linear time (pp. 119–126). Presented at the SCG: Symposium
on Computational Geometry, ACM. https://doi.org/10.1145/1137856.1137877'
chicago: Cohen Steiner, David, Herbert Edelsbrunner, and Dmitriy Morozov. “Vines
and Vineyards by Updating Persistence in Linear Time,” 119–26. ACM, 2006. https://doi.org/10.1145/1137856.1137877.
ieee: 'D. Cohen Steiner, H. Edelsbrunner, and D. Morozov, “Vines and vineyards by
updating persistence in linear time,” presented at the SCG: Symposium on Computational
Geometry, 2006, pp. 119–126.'
ista: 'Cohen Steiner D, Edelsbrunner H, Morozov D. 2006. Vines and vineyards by
updating persistence in linear time. SCG: Symposium on Computational Geometry,
119–126.'
mla: Cohen Steiner, David, et al. Vines and Vineyards by Updating Persistence
in Linear Time. ACM, 2006, pp. 119–26, doi:10.1145/1137856.1137877.
short: D. Cohen Steiner, H. Edelsbrunner, D. Morozov, in:, ACM, 2006, pp. 119–126.
conference:
name: 'SCG: Symposium on Computational Geometry'
date_created: 2018-12-11T12:03:58Z
date_published: 2006-06-01T00:00:00Z
date_updated: 2021-01-12T07:44:18Z
day: '01'
doi: 10.1145/1137856.1137877
extern: 1
month: '06'
page: 119 - 126
publication_status: published
publisher: ACM
publist_id: '2826'
quality_controlled: 0
status: public
title: Vines and vineyards by updating persistence in linear time
type: conference
year: '2006'
...
---
_id: '3560'
abstract:
- lang: eng
text: We continue the study of topological persistence [5] by investigat- ing the
problem of simplifying a function f in a way that removes topological noise as
determined by its persistence diagram [2]. To state our results, we call a function
g an ε-simplification of another function f if ∥f − g∥∞ ≤ ε, and the persistence
diagrams of g are the same as those of f except all points within L1-distance
at most ε from the diagonal have been removed. We prove that for func- tions f
on a 2-manifold such ε-simplification exists, and we give an algorithm to construct
them in the piecewise linear case.
acknowledgement: Partially supported by NSF under grant CCR-00-86013, by DARPA under
grant HR0011-05-1-0007, and by the Lawrence Livermore National Laboratory under
grant B543154.
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozov, Dmitriy
last_name: Morozov
- first_name: Valerio
full_name: Pascucci, Valerio
last_name: Pascucci
citation:
ama: 'Edelsbrunner H, Morozov D, Pascucci V. Persistence-sensitive simplification
of functions on 2-manifolds. In: ACM; 2006:127-134. doi:10.1145/1137856.1137878'
apa: 'Edelsbrunner, H., Morozov, D., & Pascucci, V. (2006). Persistence-sensitive
simplification of functions on 2-manifolds (pp. 127–134). Presented at the SCG:
Symposium on Computational Geometry, ACM. https://doi.org/10.1145/1137856.1137878'
chicago: Edelsbrunner, Herbert, Dmitriy Morozov, and Valerio Pascucci. “Persistence-Sensitive
Simplification of Functions on 2-Manifolds,” 127–34. ACM, 2006. https://doi.org/10.1145/1137856.1137878.
ieee: 'H. Edelsbrunner, D. Morozov, and V. Pascucci, “Persistence-sensitive simplification
of functions on 2-manifolds,” presented at the SCG: Symposium on Computational
Geometry, 2006, pp. 127–134.'
ista: 'Edelsbrunner H, Morozov D, Pascucci V. 2006. Persistence-sensitive simplification
of functions on 2-manifolds. SCG: Symposium on Computational Geometry, 127–134.'
mla: Edelsbrunner, Herbert, et al. Persistence-Sensitive Simplification of Functions
on 2-Manifolds. ACM, 2006, pp. 127–34, doi:10.1145/1137856.1137878.
short: H. Edelsbrunner, D. Morozov, V. Pascucci, in:, ACM, 2006, pp. 127–134.
conference:
name: 'SCG: Symposium on Computational Geometry'
date_created: 2018-12-11T12:03:58Z
date_published: 2006-06-01T00:00:00Z
date_updated: 2021-01-12T07:44:19Z
day: '01'
doi: 10.1145/1137856.1137878
extern: 1
main_file_link:
- open_access: '0'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.4465
month: '06'
page: 127 - 134
publication_status: published
publisher: ACM
publist_id: '2825'
quality_controlled: 0
status: public
title: Persistence-sensitive simplification of functions on 2-manifolds
type: conference
year: '2006'
...
---
_id: '3594'
author:
- first_name: Josephine
full_name: Pemberton, Josephine M
last_name: Pemberton
- first_name: Graeme
full_name: Swanson, Graeme M
last_name: Swanson
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Suzanne
full_name: Livingstone, Suzanne R
last_name: Livingstone
- first_name: Helen
full_name: Senn, Helen V
last_name: Senn
citation:
ama: Pemberton J, Swanson G, Barton NH, Livingstone S, Senn H. Hybridisation between
red and sika deer in Scotland. Deer. 2006;13(9):22-26.
apa: Pemberton, J., Swanson, G., Barton, N. H., Livingstone, S., & Senn, H.
(2006). Hybridisation between red and sika deer in Scotland. Deer. BDS
.
chicago: Pemberton, Josephine, Graeme Swanson, Nicholas H Barton, Suzanne Livingstone,
and Helen Senn. “Hybridisation between Red and Sika Deer in Scotland.” Deer.
BDS , 2006.
ieee: J. Pemberton, G. Swanson, N. H. Barton, S. Livingstone, and H. Senn, “Hybridisation
between red and sika deer in Scotland,” Deer, vol. 13, no. 9. BDS , pp.
22–26, 2006.
ista: Pemberton J, Swanson G, Barton NH, Livingstone S, Senn H. 2006. Hybridisation
between red and sika deer in Scotland. Deer. 13(9), 22–26.
mla: Pemberton, Josephine, et al. “Hybridisation between Red and Sika Deer in Scotland.”
Deer, vol. 13, no. 9, BDS , 2006, pp. 22–26.
short: J. Pemberton, G. Swanson, N.H. Barton, S. Livingstone, H. Senn, Deer 13 (2006)
22–26.
date_created: 2018-12-11T12:04:08Z
date_published: 2006-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:31Z
day: '01'
extern: 1
intvolume: ' 13'
issue: '9'
month: '01'
page: 22 - 26
publication: Deer
publication_status: published
publisher: 'BDS '
publist_id: '2789'
quality_controlled: 0
status: public
title: Hybridisation between red and sika deer in Scotland
type: review
volume: 13
year: '2006'
...