---
_id: '11122'
abstract:
- lang: eng
text: Nuclear pore complexes (NPCs) are large multiprotein assemblies that allow
traffic between the cytoplasm and the nucleus. During mitosis in higher eukaryotes,
the Nuclear Envelope (NE) breaks down and NPCs disassemble. How NPCs reassemble
and incorporate into the NE upon mitotic exit is poorly understood. We demonstrate
a function for the conserved Nup107-160 complex in this process. Partial in vivo
depletion of Nup133 or Nup107 via RNAi in HeLa cells resulted in reduced levels
of multiple nucleoporins and decreased NPC density in the NE. Immunodepletion
of the entire Nup107-160 complex from in vitro nuclear assembly reactions produced
nuclei with a continuous NE but no NPCs. This phenotype was reversible only if
Nup107-160 complex was readded before closed NE formation. Depletion also prevented
association of FG-repeat nucleoporins with chromatin. We propose a stepwise model
in which postmitotic NPC assembly initiates on chromatin via early recruitment
of the Nup107-160 complex.
article_processing_charge: No
article_type: original
author:
- first_name: Tobias C.
full_name: Walther, Tobias C.
last_name: Walther
- first_name: Annabelle
full_name: Alves, Annabelle
last_name: Alves
- first_name: Helen
full_name: Pickersgill, Helen
last_name: Pickersgill
- first_name: Isabelle
full_name: Loı̈odice, Isabelle
last_name: Loı̈odice
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Vincent
full_name: Galy, Vincent
last_name: Galy
- first_name: Bastian B.
full_name: Hülsmann, Bastian B.
last_name: Hülsmann
- first_name: Thomas
full_name: Köcher, Thomas
last_name: Köcher
- first_name: Matthias
full_name: Wilm, Matthias
last_name: Wilm
- first_name: Terry
full_name: Allen, Terry
last_name: Allen
- first_name: Iain W.
full_name: Mattaj, Iain W.
last_name: Mattaj
- first_name: Valérie
full_name: Doye, Valérie
last_name: Doye
citation:
ama: Walther TC, Alves A, Pickersgill H, et al. The conserved Nup107-160 complex
is critical for nuclear pore complex assembly. Cell. 2003;113(2):195-206.
doi:10.1016/s0092-8674(03)00235-6
apa: Walther, T. C., Alves, A., Pickersgill, H., Loı̈odice, I., Hetzer, M., Galy,
V., … Doye, V. (2003). The conserved Nup107-160 complex is critical for nuclear
pore complex assembly. Cell. Elsevier. https://doi.org/10.1016/s0092-8674(03)00235-6
chicago: Walther, Tobias C., Annabelle Alves, Helen Pickersgill, Isabelle Loı̈odice,
Martin Hetzer, Vincent Galy, Bastian B. Hülsmann, et al. “The Conserved Nup107-160
Complex Is Critical for Nuclear Pore Complex Assembly.” Cell. Elsevier,
2003. https://doi.org/10.1016/s0092-8674(03)00235-6.
ieee: T. C. Walther et al., “The conserved Nup107-160 complex is critical
for nuclear pore complex assembly,” Cell, vol. 113, no. 2. Elsevier, pp.
195–206, 2003.
ista: Walther TC, Alves A, Pickersgill H, Loı̈odice I, Hetzer M, Galy V, Hülsmann
BB, Köcher T, Wilm M, Allen T, Mattaj IW, Doye V. 2003. The conserved Nup107-160
complex is critical for nuclear pore complex assembly. Cell. 113(2), 195–206.
mla: Walther, Tobias C., et al. “The Conserved Nup107-160 Complex Is Critical for
Nuclear Pore Complex Assembly.” Cell, vol. 113, no. 2, Elsevier, 2003,
pp. 195–206, doi:10.1016/s0092-8674(03)00235-6.
short: T.C. Walther, A. Alves, H. Pickersgill, I. Loı̈odice, M. Hetzer, V. Galy,
B.B. Hülsmann, T. Köcher, M. Wilm, T. Allen, I.W. Mattaj, V. Doye, Cell 113 (2003)
195–206.
date_created: 2022-04-07T07:57:10Z
date_published: 2003-04-17T00:00:00Z
date_updated: 2022-07-18T08:57:42Z
day: '17'
doi: 10.1016/s0092-8674(03)00235-6
extern: '1'
external_id:
pmid:
- '12705868'
intvolume: ' 113'
issue: '2'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
month: '04'
oa_version: Published Version
page: 195-206
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: The conserved Nup107-160 complex is critical for nuclear pore complex assembly
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 113
year: '2003'
...
---
_id: '11764'
abstract:
- lang: eng
text: In this paper we consider the online ftp problem. The goal is to service a
sequence of file transfer requests given bandwidth constraints of the underlying
communication network. The main result of the paper is a technique that leads
to algorithms that optimize several natural metrics, such as max-stretch, total
flow time, max flow time, and total completion time. In particular, we show how
to achieve optimum total flow time and optimum max-stretch if we increase the
capacity of the underlying network by a logarithmic factor. We show that the resource
augmentation is necessary by proving polynomial lower bounds on the max-stretch
and total flow time for the case where online and offline algorithms are using
same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the
resource augmentation factor necessary in order to keep the total flow time and
max-stretch within a constant factor of optimum.
article_processing_charge: No
article_type: original
author:
- first_name: Ashish
full_name: Goel, Ashish
last_name: Goel
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Serge
full_name: Plotkin, Serge
last_name: Plotkin
- first_name: Eva
full_name: Tardos, Eva
last_name: Tardos
citation:
ama: Goel A, Henzinger MH, Plotkin S, Tardos E. Scheduling data transfers in a network
and the set scheduling problem. Journal of Algorithms. 2003;48(2):314-332.
doi:10.1016/s0196-6774(03)00054-3
apa: Goel, A., Henzinger, M. H., Plotkin, S., & Tardos, E. (2003). Scheduling
data transfers in a network and the set scheduling problem. Journal of Algorithms.
Elsevier. https://doi.org/10.1016/s0196-6774(03)00054-3
chicago: Goel, Ashish, Monika H Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling
Data Transfers in a Network and the Set Scheduling Problem.” Journal of Algorithms.
Elsevier, 2003. https://doi.org/10.1016/s0196-6774(03)00054-3.
ieee: A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers
in a network and the set scheduling problem,” Journal of Algorithms, vol.
48, no. 2. Elsevier, pp. 314–332, 2003.
ista: Goel A, Henzinger MH, Plotkin S, Tardos E. 2003. Scheduling data transfers
in a network and the set scheduling problem. Journal of Algorithms. 48(2), 314–332.
mla: Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling
Problem.” Journal of Algorithms, vol. 48, no. 2, Elsevier, 2003, pp. 314–32,
doi:10.1016/s0196-6774(03)00054-3.
short: A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, Journal of Algorithms 48
(2003) 314–332.
date_created: 2022-08-08T12:09:32Z
date_published: 2003-09-01T00:00:00Z
date_updated: 2022-09-12T09:45:06Z
day: '01'
doi: 10.1016/s0196-6774(03)00054-3
extern: '1'
intvolume: ' 48'
issue: '2'
language:
- iso: eng
month: '09'
oa_version: None
page: 314-332
publication: Journal of Algorithms
publication_identifier:
issn:
- 0196-6774
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling data transfers in a network and the set scheduling problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2003'
...
---
_id: '11766'
abstract:
- lang: eng
text: 'This paper studies the multicast routing and admission control problem on
unit-capacity tree and mesh topologies in the throughput model. The problem is
a generalization of the edge-disjoint paths problem and is NP-hard both on trees
and meshes. We study both the offline and the online version of the problem: In
the offline setting, we give the first constant-factor approximation algorithm
for trees, and an -factor approximation algorithm for meshes. In the online setting,
we give the first polylogarithmic competitive online algorithm for tree and mesh
topologies. No polylogarithmic-competitive algorithm is possible on general network
topologies (Lower bounds for on-line graph problems with application to on-line
circuits and optical routing, in: Proceedings of the 28th ACM Symposium on Theory
of Computing, 1996, pp. 531–540) and there exists a polylogarithmic lower bound
on the competitive ratio of any online algorithm on tree topologies (Making commitments
in the face of uncertainity: how to pick a winner almost every time, in: Proceedings
of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 519–530). We
prove the same lower bound for meshes.'
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
citation:
ama: Henzinger MH, Leonardi S. Scheduling multicasts on unit-capacity trees and
meshes. Journal of Computer and System Sciences. 2003;66(3):567-611. doi:10.1016/s0022-0000(03)00043-6
apa: Henzinger, M. H., & Leonardi, S. (2003). Scheduling multicasts on unit-capacity
trees and meshes. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/s0022-0000(03)00043-6
chicago: Henzinger, Monika H, and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity
Trees and Meshes.” Journal of Computer and System Sciences. Elsevier, 2003.
https://doi.org/10.1016/s0022-0000(03)00043-6.
ieee: M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees
and meshes,” Journal of Computer and System Sciences, vol. 66, no. 3. Elsevier,
pp. 567–611, 2003.
ista: Henzinger MH, Leonardi S. 2003. Scheduling multicasts on unit-capacity trees
and meshes. Journal of Computer and System Sciences. 66(3), 567–611.
mla: Henzinger, Monika H., and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity
Trees and Meshes.” Journal of Computer and System Sciences, vol. 66, no.
3, Elsevier, 2003, pp. 567–611, doi:10.1016/s0022-0000(03)00043-6.
short: M.H. Henzinger, S. Leonardi, Journal of Computer and System Sciences 66 (2003)
567–611.
date_created: 2022-08-08T12:24:35Z
date_published: 2003-05-01T00:00:00Z
date_updated: 2023-02-10T08:03:31Z
day: '01'
doi: 10.1016/s0022-0000(03)00043-6
extern: '1'
intvolume: ' 66'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/S0022-0000(03)00043-6
month: '05'
oa: 1
oa_version: Published Version
page: 567-611
publication: Journal of Computer and System Sciences
publication_identifier:
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling multicasts on unit-capacity trees and meshes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2003'
...
---
_id: '11860'
abstract:
- lang: eng
text: Many daily activities present information in the form of a stream of text,
and often people can benefit from additional information on the topic discussed.
TV broadcast news can be treated as one such stream of text; in this paper we
discuss finding news articles on the web that are relevant to news currently being
broadcast.We evaluated a variety of algorithms for this problem, looking at the
impact of inverse document frequency, stemming, compounds, history, and query
length on the relevance and coverage of news articles returned in real time during
a broadcast. We also evaluated several postprocessing techniques for improving
the precision, including reranking using additional terms, reranking by document
similarity, and filtering on document similarity. For the best algorithm, 84%-91%
of the articles found were relevant, with at least 64% of the articles being on
the exact topic of the broadcast. In addition, a relevant article was found for
at least 70% of the topics.
article_number: 1-10
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
- first_name: Bay-Wei
full_name: Chang, Bay-Wei
last_name: Chang
- first_name: Brian
full_name: Milch, Brian
last_name: Milch
- first_name: Sergey
full_name: Brin, Sergey
last_name: Brin
citation:
ama: 'Henzinger MH, Chang B-W, Milch B, Brin S. Query-free news search. In: Proceedings
of the 12th International Conference on World Wide Web. Association for Computing
Machinery; 2003. doi:10.1145/775152.775154'
apa: 'Henzinger, M. H., Chang, B.-W., Milch, B., & Brin, S. (2003). Query-free
news search. In Proceedings of the 12th international conference on World Wide
Web. Budapest, Hungary: Association for Computing Machinery. https://doi.org/10.1145/775152.775154'
chicago: Henzinger, Monika H, Bay-Wei Chang, Brian Milch, and Sergey Brin. “Query-Free
News Search.” In Proceedings of the 12th International Conference on World
Wide Web. Association for Computing Machinery, 2003. https://doi.org/10.1145/775152.775154.
ieee: M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,”
in Proceedings of the 12th international conference on World Wide Web,
Budapest, Hungary, 2003.
ista: 'Henzinger MH, Chang B-W, Milch B, Brin S. 2003. Query-free news search. Proceedings
of the 12th international conference on World Wide Web. WWW: International Conference
on World Wide Web, 1–10.'
mla: Henzinger, Monika H., et al. “Query-Free News Search.” Proceedings of the
12th International Conference on World Wide Web, 1–10, Association for Computing
Machinery, 2003, doi:10.1145/775152.775154.
short: M.H. Henzinger, B.-W. Chang, B. Milch, S. Brin, in:, Proceedings of the 12th
International Conference on World Wide Web, Association for Computing Machinery,
2003.
conference:
end_date: 2003-05-24
location: Budapest, Hungary
name: 'WWW: International Conference on World Wide Web'
start_date: 2003-05-20
date_created: 2022-08-16T08:55:05Z
date_published: 2003-05-01T00:00:00Z
date_updated: 2023-02-21T16:32:40Z
day: '01'
doi: 10.1145/775152.775154
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
publication: Proceedings of the 12th international conference on World Wide Web
publication_identifier:
isbn:
- 978-158113680-7
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '11904'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Query-free news search
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '11897'
abstract:
- lang: eng
text: "This paper addresses the problem of topic distillation on the World Wide
Web, namely, given a typical user query to find quality documents related to the
query topic. Connectivity analysis has been shown to be useful in identifying
high quality pages within a topic specific graph of hyperlinked documents. The
essence of our approach is to augment a previous connectivity analysis based algorithm
with content analysis. We identify three problems with the existing approach and
devise algorithms to tackle them. The results of a user evaluation are reported
that show an improvement of precision at 10\r\ndocuments by at least 45% over
pure connectivity analysis. "
article_processing_charge: No
author:
- first_name: Krishna
full_name: Bharat, Krishna
last_name: Bharat
- 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: 'Bharat K, Henzinger MH. Improved algorithms for topic distillation in a hyperlinked
environment. In: 21st Annual International ACM SIGIR Conference on Research
and Development in Information Retrieval. Association for Computing Machinery;
2003:104–111. doi:10.1145/290941.290972'
apa: 'Bharat, K., & Henzinger, M. H. (2003). Improved algorithms for topic distillation
in a hyperlinked environment. In 21st annual international ACM SIGIR conference
on Research and development in information retrieval (pp. 104–111). Melbourne,
Australia: Association for Computing Machinery. https://doi.org/10.1145/290941.290972'
chicago: Bharat, Krishna, and Monika H Henzinger. “Improved Algorithms for Topic
Distillation in a Hyperlinked Environment.” In 21st Annual International ACM
SIGIR Conference on Research and Development in Information Retrieval, 104–111.
Association for Computing Machinery, 2003. https://doi.org/10.1145/290941.290972.
ieee: K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation
in a hyperlinked environment,” in 21st annual international ACM SIGIR conference
on Research and development in information retrieval, Melbourne, Australia,
2003, pp. 104–111.
ista: 'Bharat K, Henzinger MH. 2003. Improved algorithms for topic distillation
in a hyperlinked environment. 21st annual international ACM SIGIR conference on
Research and development in information retrieval. SIGIR: International Conference
on Research and Development in Information Retrieval, 104–111.'
mla: Bharat, Krishna, and Monika H. Henzinger. “Improved Algorithms for Topic Distillation
in a Hyperlinked Environment.” 21st Annual International ACM SIGIR Conference
on Research and Development in Information Retrieval, Association for Computing
Machinery, 2003, pp. 104–111, doi:10.1145/290941.290972.
short: K. Bharat, M.H. Henzinger, in:, 21st Annual International ACM SIGIR Conference
on Research and Development in Information Retrieval, Association for Computing
Machinery, 2003, pp. 104–111.
conference:
end_date: 1998-08-28
location: Melbourne, Australia
name: 'SIGIR: International Conference on Research and Development in Information
Retrieval'
start_date: 1998-08-24
date_created: 2022-08-17T08:56:18Z
date_published: 2003-08-01T00:00:00Z
date_updated: 2023-02-17T14:47:44Z
day: '01'
doi: 10.1145/290941.290972
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 104–111
publication: 21st annual international ACM SIGIR conference on Research and development
in information retrieval
publication_identifier:
isbn:
- 978-1-58113-015-7
issn:
- '01635840'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved algorithms for topic distillation in a hyperlinked environment
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '11909'
abstract:
- lang: eng
text: This article presents a high-level discussion of some problems that are unique
to web search engines. The goal is to raise awareness and stimulate research in
these areas.
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
- first_name: Rajeev
full_name: Motwani, Rajeev
last_name: Motwani
- first_name: Craig
full_name: Silverstein, Craig
last_name: Silverstein
citation:
ama: 'Henzinger MH, Motwani R, Silverstein C. Challenges in web search engines.
In: 18th International Joint Conference on Artificial Intelligence. Association
for Computing Machinery; 2003:1573-1579.'
apa: 'Henzinger, M. H., Motwani, R., & Silverstein, C. (2003). Challenges in
web search engines. In 18th International Joint Conference on Artificial Intelligence
(pp. 1573–1579). Acapulco, Mexico: Association for Computing Machinery.'
chicago: Henzinger, Monika H, Rajeev Motwani, and Craig Silverstein. “Challenges
in Web Search Engines.” In 18th International Joint Conference on Artificial
Intelligence, 1573–79. Association for Computing Machinery, 2003.
ieee: M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search
engines,” in 18th International Joint Conference on Artificial Intelligence,
Acapulco, Mexico, 2003, pp. 1573–1579.
ista: 'Henzinger MH, Motwani R, Silverstein C. 2003. Challenges in web search engines.
18th International Joint Conference on Artificial Intelligence. IJCAI: International
Joint Conference on Artificial Intelligence, 1573–1579.'
mla: Henzinger, Monika H., et al. “Challenges in Web Search Engines.” 18th International
Joint Conference on Artificial Intelligence, Association for Computing Machinery,
2003, pp. 1573–79.
short: M.H. Henzinger, R. Motwani, C. Silverstein, in:, 18th International Joint
Conference on Artificial Intelligence, Association for Computing Machinery, 2003,
pp. 1573–1579.
conference:
end_date: 2003-08-15
location: Acapulco, Mexico
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2003-08-09
date_created: 2022-08-18T06:40:02Z
date_published: 2003-08-01T00:00:00Z
date_updated: 2023-02-09T12:05:25Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ijcai.org/Proceedings/03/Papers/278.pdf
month: '08'
oa: 1
oa_version: Published Version
page: 1573-1579
publication: 18th International Joint Conference on Artificial Intelligence
publication_identifier:
issn:
- 1045-0823
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Challenges in web search engines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '207'
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. Sums of four biquadrates. Mathematical Proceedings of the Cambridge
Philosophical Society. 2003;134(3):385-395. doi:10.1017/S0305004102006382
apa: Browning, T. D. (2003). Sums of four biquadrates. Mathematical Proceedings
of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/S0305004102006382
chicago: Browning, Timothy D. “Sums of Four Biquadrates.” Mathematical Proceedings
of the Cambridge Philosophical Society. Cambridge University Press, 2003.
https://doi.org/10.1017/S0305004102006382.
ieee: T. D. Browning, “Sums of four biquadrates,” Mathematical Proceedings of
the Cambridge Philosophical Society, vol. 134, no. 3. Cambridge University
Press, pp. 385–395, 2003.
ista: Browning TD. 2003. Sums of four biquadrates. Mathematical Proceedings of the
Cambridge Philosophical Society. 134(3), 385–395.
mla: Browning, Timothy D. “Sums of Four Biquadrates.” Mathematical Proceedings
of the Cambridge Philosophical Society, vol. 134, no. 3, Cambridge University
Press, 2003, pp. 385–95, doi:10.1017/S0305004102006382.
short: T.D. Browning, Mathematical Proceedings of the Cambridge Philosophical Society
134 (2003) 385–395.
date_created: 2018-12-11T11:45:12Z
date_published: 2003-05-01T00:00:00Z
date_updated: 2021-01-12T06:55:07Z
day: '01'
doi: 10.1017/S0305004102006382
extern: '1'
intvolume: ' 134'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 385 - 395
publication: Mathematical Proceedings of the Cambridge Philosophical Society
publication_status: published
publisher: Cambridge University Press
publist_id: '7704'
quality_controlled: '1'
status: public
title: Sums of four biquadrates
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 134
year: '2003'
...
---
_id: '208'
abstract:
- lang: eng
text: For any ε > 0 and any diagonal quadratic form Q ∈ ℤ[x 1, x 2, x 3, x 4]
with a square-free discriminant of modulus Δ Q ≠ 0, we establish the uniform estimate
≪ε B 3/2+ε + B 2+ε/Δ Q 1/6 for the number of rational points of height at most
B lying in the projective surface Q = 0.
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. Counting rational points on diagonal quadratic surfaces. Quarterly
Journal of Mathematics. 2003;54(1):11-31. doi:10.1093/qjmath/54.1.11
apa: Browning, T. D. (2003). Counting rational points on diagonal quadratic surfaces.
Quarterly Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qjmath/54.1.11
chicago: Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.”
Quarterly Journal of Mathematics. Oxford University Press, 2003. https://doi.org/10.1093/qjmath/54.1.11.
ieee: T. D. Browning, “Counting rational points on diagonal quadratic surfaces,”
Quarterly Journal of Mathematics, vol. 54, no. 1. Oxford University Press,
pp. 11–31, 2003.
ista: Browning TD. 2003. Counting rational points on diagonal quadratic surfaces.
Quarterly Journal of Mathematics. 54(1), 11–31.
mla: Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.”
Quarterly Journal of Mathematics, vol. 54, no. 1, Oxford University Press,
2003, pp. 11–31, doi:10.1093/qjmath/54.1.11.
short: T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 11–31.
date_created: 2018-12-11T11:45:13Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2021-01-12T06:55:10Z
day: '01'
doi: 10.1093/qjmath/54.1.11
extern: 1
intvolume: ' 54'
issue: '1'
month: '03'
page: 11 - 31
publication: Quarterly Journal of Mathematics
publication_status: published
publisher: Oxford University Press
publist_id: '7705'
quality_controlled: 0
status: public
title: Counting rational points on diagonal quadratic surfaces
type: journal_article
volume: 54
year: '2003'
...
---
_id: '2337'
alternative_title:
- Contemporary Mathematics
author:
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Lieb É, Seiringer R. Bose-Einstein condensation of dilute gases in traps .
In: Karpeshina Y, Weikard R, Zeng Y, eds. Vol 327. American Mathematical Society;
2003:239-250. doi:10.1090/conm/327/05818'
apa: Lieb, É., & Seiringer, R. (2003). Bose-Einstein condensation of dilute
gases in traps . In Y. Karpeshina, R. Weikard, & Y. Zeng (Eds.) (Vol. 327,
pp. 239–250). Presented at the Differential Equations and Mathematical Physics,
American Mathematical Society. https://doi.org/10.1090/conm/327/05818
chicago: Lieb, Élliott, and Robert Seiringer. “Bose-Einstein Condensation of Dilute
Gases in Traps .” edited by Yulia Karpeshina, Rudi Weikard, and Yanni Zeng, 327:239–50.
American Mathematical Society, 2003. https://doi.org/10.1090/conm/327/05818.
ieee: É. Lieb and R. Seiringer, “Bose-Einstein condensation of dilute gases in traps
,” presented at the Differential Equations and Mathematical Physics, 2003, vol.
327, pp. 239–250.
ista: Lieb É, Seiringer R. 2003. Bose-Einstein condensation of dilute gases in traps
. Differential Equations and Mathematical Physics, Contemporary Mathematics, vol.
327, 239–250.
mla: Lieb, Élliott, and Robert Seiringer. Bose-Einstein Condensation of Dilute
Gases in Traps . Edited by Yulia Karpeshina et al., vol. 327, American Mathematical
Society, 2003, pp. 239–50, doi:10.1090/conm/327/05818.
short: É. Lieb, R. Seiringer, in:, Y. Karpeshina, R. Weikard, Y. Zeng (Eds.), American
Mathematical Society, 2003, pp. 239–250.
conference:
name: Differential Equations and Mathematical Physics
date_created: 2018-12-11T11:57:04Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:52Z
day: '01'
doi: 10.1090/conm/327/05818
editor:
- first_name: Yulia
full_name: Karpeshina, Yulia
last_name: Karpeshina
- first_name: Rudi
full_name: Weikard, Rudi
last_name: Weikard
- first_name: Yanni
full_name: Zeng, Yanni
last_name: Zeng
extern: 1
intvolume: ' 327'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math-ph/0210028
month: '01'
oa: 1
page: 239 - 250
publication_status: published
publisher: American Mathematical Society
publist_id: '4589'
quality_controlled: 0
status: public
title: 'Bose-Einstein condensation of dilute gases in traps '
type: conference
volume: 327
year: '2003'
...
---
_id: '2354'
abstract:
- lang: eng
text: We investigate the ground state properties of a gas of interacting particles
confined in an external potential in three dimensions and subject to rotation
around an axis of symmetry. We consider the Gross-Pitaevskii (GP) limit of a dilute
gas. Analysing both the absolute and the bosonic ground states of the system,
we show, in particular, their different behaviour for a certain range of parameters.
This parameter range is determined by the question whether the rotational symmetry
in the minimizer of the GP functional is broken or not. For the absolute ground
state, we prove that in the GP limit a modified GP functional depending on density
matrices correctly describes the energy and reduced density matrices, independent
of symmetry breaking. For the bosonic ground state this holds true if and only
if the symmetry is unbroken.
author:
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Seiringer R. Ground state asymptotics of a dilute, rotating gas. Journal
of Physics A: Mathematical and Theoretical. 2003;36(37):9755-9778. doi:10.1088/0305-4470/36/37/312'
apa: 'Seiringer, R. (2003). Ground state asymptotics of a dilute, rotating gas.
Journal of Physics A: Mathematical and Theoretical. IOP Publishing Ltd.
https://doi.org/10.1088/0305-4470/36/37/312'
chicago: 'Seiringer, Robert. “Ground State Asymptotics of a Dilute, Rotating Gas.”
Journal of Physics A: Mathematical and Theoretical. IOP Publishing Ltd.,
2003. https://doi.org/10.1088/0305-4470/36/37/312.'
ieee: 'R. Seiringer, “Ground state asymptotics of a dilute, rotating gas,” Journal
of Physics A: Mathematical and Theoretical, vol. 36, no. 37. IOP Publishing
Ltd., pp. 9755–9778, 2003.'
ista: 'Seiringer R. 2003. Ground state asymptotics of a dilute, rotating gas. Journal
of Physics A: Mathematical and Theoretical. 36(37), 9755–9778.'
mla: 'Seiringer, Robert. “Ground State Asymptotics of a Dilute, Rotating Gas.” Journal
of Physics A: Mathematical and Theoretical, vol. 36, no. 37, IOP Publishing
Ltd., 2003, pp. 9755–78, doi:10.1088/0305-4470/36/37/312.'
short: 'R. Seiringer, Journal of Physics A: Mathematical and Theoretical 36 (2003)
9755–9778.'
date_created: 2018-12-11T11:57:10Z
date_published: 2003-09-19T00:00:00Z
date_updated: 2021-01-12T06:56:59Z
day: '19'
doi: 10.1088/0305-4470/36/37/312
extern: 1
intvolume: ' 36'
issue: '37'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math-ph/0306022
month: '09'
oa: 1
page: 9755 - 9778
publication: 'Journal of Physics A: Mathematical and Theoretical'
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '4572'
quality_controlled: 0
status: public
title: Ground state asymptotics of a dilute, rotating gas
type: journal_article
volume: 36
year: '2003'
...
---
_id: '2357'
abstract:
- lang: eng
text: 'The classic Poincaré inequality bounds the L q-norm of a function f in a
bounded domain Ω ⊂ ℝ n in terms of some L p-norm of its gradient in Ω. We generalize
this in two ways: In the first generalization we remove a set Τ from Ω and concentrate
our attention on Λ = Ω \ Τ. This new domain might not even be connected and hence
no Poincaré inequality can generally hold for it, or if it does hold it might
have a very bad constant. This is so even if the volume of Τ is arbitrarily small.
A Poincaré inequality does hold, however, if one makes the additional assumption
that f has a finite L p gradient norm on the whole of Ω, not just on Λ. The important
point is that the Poincaré inequality thus obtained bounds the L q-norm of f in
terms of the L p gradient norm on Λ (not Ω) plus an additional term that goes
to zero as the volume of Τ goes to zero. This error term depends on Τ only through
its volume. Apart from this additive error term, the constant in the inequality
remains that of the ''nice'' domain Ω. In the second generalization we are given
a vector field A and replace ∇ by ∇ + iA(x) (geometrically, a connection on a
U(1) bundle). Unlike the A = 0 case, the infimum of ∥(∇ + iA)f∥ p over all f with
a given ∥f∥ q is in general not zero. This permits an improvement of the inequality
by the addition of a term whose sharp value we derive. We describe some open problems
that arise from these generalizations.'
author:
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jakob
full_name: Yngvason, Jakob
last_name: Yngvason
citation:
ama: Lieb É, Seiringer R, Yngvason J. Poincaré inequalities in punctured domains.
Annals of Mathematics. 2003;158(3):1067-1080. doi:10.4007/annals.2003.158.1067
apa: Lieb, É., Seiringer, R., & Yngvason, J. (2003). Poincaré inequalities in
punctured domains. Annals of Mathematics. Princeton University Press. https://doi.org/10.4007/annals.2003.158.1067
chicago: Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “Poincaré Inequalities
in Punctured Domains.” Annals of Mathematics. Princeton University Press,
2003. https://doi.org/10.4007/annals.2003.158.1067
.
ieee: É. Lieb, R. Seiringer, and J. Yngvason, “Poincaré inequalities in punctured
domains,” Annals of Mathematics, vol. 158, no. 3. Princeton University
Press, pp. 1067–1080, 2003.
ista: Lieb É, Seiringer R, Yngvason J. 2003. Poincaré inequalities in punctured
domains. Annals of Mathematics. 158(3), 1067–1080.
mla: Lieb, Élliott, et al. “Poincaré Inequalities in Punctured Domains.” Annals
of Mathematics, vol. 158, no. 3, Princeton University Press, 2003, pp. 1067–80,
doi:10.4007/annals.2003.158.1067
.
short: É. Lieb, R. Seiringer, J. Yngvason, Annals of Mathematics 158 (2003) 1067–1080.
date_created: 2018-12-11T11:57:11Z
date_published: 2003-11-01T00:00:00Z
date_updated: 2021-01-12T06:57:00Z
day: '01'
doi: '10.4007/annals.2003.158.1067 '
extern: 1
intvolume: ' 158'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math/0205088
month: '11'
oa: 1
page: 1067 - 1080
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University Press
publist_id: '4570'
quality_controlled: 0
status: public
title: Poincaré inequalities in punctured domains
type: journal_article
volume: 158
year: '2003'
...
---
_id: '2358'
abstract:
- lang: eng
text: A study was conducted on the one-dimensional (1D) bosons in three-dimensional
(3D) traps. A rigorous analysis was carried out on the parameter regions in which
various types of 1D or 3D behavior occurred in the ground state. The four parameter
regions include density, transverse, longitudinal dimensions and scattering length.
author:
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jakob
full_name: Yngvason, Jakob
last_name: Yngvason
citation:
ama: Lieb É, Seiringer R, Yngvason J. One-dimensional Bosons in three-dimensional
traps. Physical Review Letters. 2003;91(15):1504011-1504014. doi:10.1103/PhysRevLett.91.150401
apa: Lieb, É., Seiringer, R., & Yngvason, J. (2003). One-dimensional Bosons
in three-dimensional traps. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/PhysRevLett.91.150401
chicago: Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “One-Dimensional Bosons
in Three-Dimensional Traps.” Physical Review Letters. American Physical
Society, 2003. https://doi.org/10.1103/PhysRevLett.91.150401.
ieee: É. Lieb, R. Seiringer, and J. Yngvason, “One-dimensional Bosons in three-dimensional
traps,” Physical Review Letters, vol. 91, no. 15. American Physical Society,
pp. 1504011–1504014, 2003.
ista: Lieb É, Seiringer R, Yngvason J. 2003. One-dimensional Bosons in three-dimensional
traps. Physical Review Letters. 91(15), 1504011–1504014.
mla: Lieb, Élliott, et al. “One-Dimensional Bosons in Three-Dimensional Traps.”
Physical Review Letters, vol. 91, no. 15, American Physical Society, 2003,
pp. 1504011–14, doi:10.1103/PhysRevLett.91.150401.
short: É. Lieb, R. Seiringer, J. Yngvason, Physical Review Letters 91 (2003) 1504011–1504014.
date_created: 2018-12-11T11:57:12Z
date_published: 2003-10-10T00:00:00Z
date_updated: 2021-01-12T06:57:00Z
day: '10'
doi: 10.1103/PhysRevLett.91.150401
extern: 1
intvolume: ' 91'
issue: '15'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/cond-mat/0304071
month: '10'
oa: 1
page: 1504011 - 1504014
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4571'
quality_controlled: 0
status: public
title: One-dimensional Bosons in three-dimensional traps
type: journal_article
volume: 91
year: '2003'
...
---
_id: '2414'
author:
- first_name: Uli
full_name: Uli Wagner
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Wagner U. On k-Sets and Their Applications. 2003. doi:10.3929/ethz-a-004708408
apa: Wagner, U. (2003). On k-Sets and Their Applications. ETH Zurich. https://doi.org/10.3929/ethz-a-004708408
chicago: Wagner, Uli. “On K-Sets and Their Applications.” ETH Zurich, 2003. https://doi.org/10.3929/ethz-a-004708408.
ieee: U. Wagner, “On k-Sets and Their Applications,” ETH Zurich, 2003.
ista: Wagner U. 2003. On k-Sets and Their Applications. ETH Zurich.
mla: Wagner, Uli. On K-Sets and Their Applications. ETH Zurich, 2003, doi:10.3929/ethz-a-004708408.
short: U. Wagner, On K-Sets and Their Applications, ETH Zurich, 2003.
date_created: 2018-12-11T11:57:31Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:20Z
day: '01'
doi: 10.3929/ethz-a-004708408
extern: 1
month: '01'
publication_status: published
publisher: ETH Zurich
publist_id: '4511'
quality_controlled: 0
status: public
title: On k-Sets and Their Applications
type: dissertation
year: '2003'
...
---
_id: '2422'
abstract:
- lang: eng
text: We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number
cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum
number of convex quadrilaterals in any set of n points in general position in
the Euclidean plane. As we see it, the main contribution of this paper is not
so much the concrete numerical improvement over earlier bounds, as the novel method
of proof, which is not based on bounding cr̄(Kn) for some small n.
author:
- first_name: Uli
full_name: Uli Wagner
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Wagner U. On the rectilinear crossing number of complete graphs. In: SIAM;
2003:583-588.'
apa: 'Wagner, U. (2003). On the rectilinear crossing number of complete graphs (pp.
583–588). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.'
chicago: Wagner, Uli. “On the Rectilinear Crossing Number of Complete Graphs,” 583–88.
SIAM, 2003.
ieee: 'U. Wagner, “On the rectilinear crossing number of complete graphs,” presented
at the SODA: Symposium on Discrete Algorithms, 2003, pp. 583–588.'
ista: 'Wagner U. 2003. On the rectilinear crossing number of complete graphs. SODA:
Symposium on Discrete Algorithms, 583–588.'
mla: Wagner, Uli. On the Rectilinear Crossing Number of Complete Graphs.
SIAM, 2003, pp. 583–88.
short: U. Wagner, in:, SIAM, 2003, pp. 583–588.
conference:
name: 'SODA: Symposium on Discrete Algorithms'
date_created: 2018-12-11T11:57:34Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:24Z
day: '01'
extern: 1
main_file_link:
- open_access: '0'
url: http://dl.acm.org/citation.cfm?id=644206
month: '01'
page: 583 - 588
publication_status: published
publisher: SIAM
publist_id: '4503'
quality_controlled: 0
status: public
title: On the rectilinear crossing number of complete graphs
type: conference
year: '2003'
...
---
_id: '2423'
abstract:
- lang: eng
text: A finite set N ⊃ Rd is a weak ε-net for an n-point set X ⊃ Rd (with respect
to convex sets) if N intersects every convex set K with |K ∩ X| ≥ εn. We give
an alternative, and arguably simpler, proof of the fact, first shown by Chazelle
et al. [7], that every point set X in Rd admits a weak ε-net of cardinality O(ε-d
polylog(1/ε)). Moreover, for a number of special point sets (e.g., for points
on the moment curve), our method gives substantially better bounds. The construction
yields an algorithm to construct such weak ε-nets in time O(n ln(1/ε)). We also
prove, by a different method, a near-linear upper bound for points uniformly distributed
on the (d - 1)-dimensional sphere.
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Uli
full_name: Uli Wagner
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Matoušek J, Wagner U. New constructions of weak epsilon-nets. In: ACM; 2003:129-135.
doi:10.1145/777792.777813'
apa: 'Matoušek, J., & Wagner, U. (2003). New constructions of weak epsilon-nets
(pp. 129–135). Presented at the SoCG: Symposium on Computational Geometry, ACM.
https://doi.org/10.1145/777792.777813'
chicago: Matoušek, Jiří, and Uli Wagner. “New Constructions of Weak Epsilon-Nets,”
129–35. ACM, 2003. https://doi.org/10.1145/777792.777813.
ieee: 'J. Matoušek and U. Wagner, “New constructions of weak epsilon-nets,” presented
at the SoCG: Symposium on Computational Geometry, 2003, pp. 129–135.'
ista: 'Matoušek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG:
Symposium on Computational Geometry, 129–135.'
mla: Matoušek, Jiří, and Uli Wagner. New Constructions of Weak Epsilon-Nets.
ACM, 2003, pp. 129–35, doi:10.1145/777792.777813.
short: J. Matoušek, U. Wagner, in:, ACM, 2003, pp. 129–135.
conference:
name: 'SoCG: Symposium on Computational Geometry'
date_created: 2018-12-11T11:57:34Z
date_published: 2003-06-01T00:00:00Z
date_updated: 2021-01-12T06:57:24Z
day: '01'
doi: 10.1145/777792.777813
extern: 1
month: '06'
page: 129 - 135
publication_status: published
publisher: ACM
publist_id: '4502'
quality_controlled: 0
status: public
title: New constructions of weak epsilon-nets
type: conference
year: '2003'
...
---
_id: '2424'
abstract:
- lang: eng
text: We introduce the adaptive neighborhood graph as a data structure for modeling
a smooth manifold M embedded in some (potentially very high-dimensional) Euclidean
space ℝd. We assume that M is known to us only through a finite sample P ⊂ M,
as it is often the case in applications. The adaptive neighborhood graph is a
geometric graph on P. Its complexity is at most min{2O(k)(n, n2}, where n = |P|
and k = dim M, as opposed to the n⌈d/2⌉ complexity of the Delaunay triangulation,
which is often used to model manifolds. We show that we can provably correctly
infer the connectivity of M and the dimension of M from the adaptive neighborhood
graph provided a certain standard sampling condition is fulfilled. The running
time of the dimension detection algorithm is d2O(k7 log k) for each connected
component of M. If the dimension is considered constant, this is a constant-time
operation, and the adaptive neighborhood graph is of linear size. Moreover, the
exponential dependence of the constants is only on the intrinsic dimension k,
not on the ambient dimension d. This is of particular interest if the co-dimension
is high, i.e., if k is much smaller than d, as is the case in many applications.
The adaptive neighborhood graph also allows us to approximate the geodesic distances
between the points in P.
author:
- first_name: Joachim
full_name: Giesen, Joachim
last_name: Giesen
- first_name: Uli
full_name: Uli Wagner
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Giesen J, Wagner U. Shape dimension and intrinsic metric from samples of manifolds
with high co-dimension. In: ACM; 2003:329-337. doi:10.1145/777792.777841'
apa: 'Giesen, J., & Wagner, U. (2003). Shape dimension and intrinsic metric
from samples of manifolds with high co-dimension (pp. 329–337). Presented at the
SoCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777841'
chicago: Giesen, Joachim, and Uli Wagner. “Shape Dimension and Intrinsic Metric
from Samples of Manifolds with High Co-Dimension,” 329–37. ACM, 2003. https://doi.org/10.1145/777792.777841.
ieee: 'J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples
of manifolds with high co-dimension,” presented at the SoCG: Symposium on Computational
Geometry, 2003, pp. 329–337.'
ista: 'Giesen J, Wagner U. 2003. Shape dimension and intrinsic metric from samples
of manifolds with high co-dimension. SoCG: Symposium on Computational Geometry,
329–337.'
mla: Giesen, Joachim, and Uli Wagner. Shape Dimension and Intrinsic Metric from
Samples of Manifolds with High Co-Dimension. ACM, 2003, pp. 329–37, doi:10.1145/777792.777841.
short: J. Giesen, U. Wagner, in:, ACM, 2003, pp. 329–337.
conference:
name: 'SoCG: Symposium on Computational Geometry'
date_created: 2018-12-11T11:57:35Z
date_published: 2003-06-01T00:00:00Z
date_updated: 2021-01-12T06:57:24Z
day: '01'
doi: 10.1145/777792.777841
extern: 1
month: '06'
page: 329 - 337
publication_status: published
publisher: ACM
publist_id: '4501'
quality_controlled: 0
status: public
title: Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
type: conference
year: '2003'
...
---
_id: '2623'
abstract:
- lang: eng
text: Patients with Hodgkin's disease can develop paraneoplastic cerebellar ataxia
because of the generation of autoantibodies against mGluR1 (mGluR1-Abs). Yet,
the pathophysiological mechanisms underlying their motor coordination deficits
remain to be elucidated. Here, we show that application of IgG purified from the
patients' serum to cerebellar slices of mice acutely reduces the basal activity
of Purkinje cells, whereas application to the flocculus of mice in vivo evokes
acute disturbances in the performance of their compensatory eye movements. In
addition, the mGluR1-Abs block induction of long-term depression in cultured mouse
Purkinje cells, whereas the cerebellar motor learning behavior of the patients
is affected in that they show impaired adaptation of their saccadic eye movements.
Finally, postmortem analysis of the cerebellum of a paraneoplastic cerebellar
ataxia patient showed that the number of Purkinje cells was significantly reduced
by approximately two thirds compared with three controls. We conclude that autoantibodies
against mGluR1 can cause cerebellar motor coordination deficits caused by a combination
of rapid effects on both acute and plastic responses of Purkinje cells and chronic
degenerative effects.
author:
- first_name: Michiel
full_name: Coesmans, Michiel P
last_name: Coesmans
- first_name: Peter
full_name: Sillevis-Smitt, Peter A
last_name: Sillevis Smitt
- first_name: David
full_name: Linden, David J
last_name: Linden
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Tomoo
full_name: Hirano, Tomoo
last_name: Hirano
- first_name: Yoshinori
full_name: Yamakawa, Yoshinori
last_name: Yamakawa
- first_name: Adriaan
full_name: Van Alphen, Adriaan M
last_name: Van Alphen
- first_name: Chongde
full_name: Luo, Chongde
last_name: Luo
- first_name: Jos
full_name: Van Der Geest, Jos N
last_name: Van Der Geest
- first_name: Johan
full_name: Kros, Johan M
last_name: Kros
- first_name: Carlo
full_name: Gaillard, Carlo A
last_name: Gaillard
- first_name: Maarten
full_name: Frens, Maarten A
last_name: Frens
- first_name: Chris
full_name: De Zeeuw, Chris I
last_name: De Zeeuw
citation:
ama: Coesmans M, Sillevis Smitt P, Linden D, et al. Mechanisms underlying cerebellar
motor deficits due to mGluR1-autoantibodies. Annals of Neurology. 2003;53(3):325-336.
doi:10.1002/ana.10451
apa: Coesmans, M., Sillevis Smitt, P., Linden, D., Shigemoto, R., Hirano, T., Yamakawa,
Y., … De Zeeuw, C. (2003). Mechanisms underlying cerebellar motor deficits due
to mGluR1-autoantibodies. Annals of Neurology. Wiley-Blackwell. https://doi.org/10.1002/ana.10451
chicago: Coesmans, Michiel, Peter Sillevis Smitt, David Linden, Ryuichi Shigemoto,
Tomoo Hirano, Yoshinori Yamakawa, Adriaan Van Alphen, et al. “Mechanisms Underlying
Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” Annals of Neurology.
Wiley-Blackwell, 2003. https://doi.org/10.1002/ana.10451.
ieee: M. Coesmans et al., “Mechanisms underlying cerebellar motor deficits
due to mGluR1-autoantibodies,” Annals of Neurology, vol. 53, no. 3. Wiley-Blackwell,
pp. 325–336, 2003.
ista: Coesmans M, Sillevis Smitt P, Linden D, Shigemoto R, Hirano T, Yamakawa Y,
Van Alphen A, Luo C, Van Der Geest J, Kros J, Gaillard C, Frens M, De Zeeuw C.
2003. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies.
Annals of Neurology. 53(3), 325–336.
mla: Coesmans, Michiel, et al. “Mechanisms Underlying Cerebellar Motor Deficits
Due to MGluR1-Autoantibodies.” Annals of Neurology, vol. 53, no. 3, Wiley-Blackwell,
2003, pp. 325–36, doi:10.1002/ana.10451.
short: M. Coesmans, P. Sillevis Smitt, D. Linden, R. Shigemoto, T. Hirano, Y. Yamakawa,
A. Van Alphen, C. Luo, J. Van Der Geest, J. Kros, C. Gaillard, M. Frens, C. De
Zeeuw, Annals of Neurology 53 (2003) 325–336.
date_created: 2018-12-11T11:58:44Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2021-01-12T06:58:39Z
day: '01'
doi: 10.1002/ana.10451
extern: 1
intvolume: ' 53'
issue: '3'
month: '03'
page: 325 - 336
publication: Annals of Neurology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4274'
quality_controlled: 0
status: public
title: Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies
type: journal_article
volume: 53
year: '2003'
...
---
_id: '2625'
abstract:
- lang: eng
text: Metabotropic glutamate receptor 1 (mGluR1) plays a crucial role in synaptic
plasticity and motor learning in the cerebellum. We have studied activity-dependent
changes in mGluR1 function in mouse cultured Purkinje neurons. Depolarizing stimulation
potentiated Ca2+ and current responses to an mGluR1 agonist for several hours
in the cultured Purkinje neurons. It also blocked internalization of mGluR1 and
increased the number of mGluR1s on the cell membrane. We found that depolarization
simultaneously increased transcription of Homer1a in Purkinje neurons. Homer1a
inhibited internalization and increased cell-surface expression of mGluR1 when
coexpressed in human embryonic kidney (HEK)-293 cells. Depolarization-induced
Homer1a expression in Purkinje neurons was blocked by a mitogen-activated protein
kinase (MAPK) inhibitor. Changes in internalization and mGluR1-mediated Ca2+ response
were also blocked by inhibition of MAPK activity, suggesting that localization
and activity of mGluR1 were regulated in the same signalling pathway as Homer1a
expression. It is thus suggested that depolarization of the Purkinje neuron leads
to the increment in mGluR1 responsiveness through MAPK activity and induction
of Homer1a expression, which increases active mGluR1 on the cell surface by blocking
internalization of mGluR1.
author:
- first_name: Itsunari
full_name: Minami, Itsunari
last_name: Minami
- first_name: Mineko
full_name: Kengaku, Mineko
last_name: Kengaku
- first_name: Sillevis
full_name: Smitt, Sillevis P
last_name: Smitt
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Tomoo
full_name: Hirano, Tomoo
last_name: Hirano
citation:
ama: Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. Long-term potentiation
of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje
neurons. European Journal of Neuroscience. 2003;17(5):1023-1032. doi:10.1046/j.1460-9568.2003.02499.x
apa: Minami, I., Kengaku, M., Smitt, S., Shigemoto, R., & Hirano, T. (2003).
Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in
mouse cerebellar Purkinje neurons. European Journal of Neuroscience. Wiley-Blackwell.
https://doi.org/10.1046/j.1460-9568.2003.02499.x
chicago: Minami, Itsunari, Mineko Kengaku, Sillevis Smitt, Ryuichi Shigemoto, and
Tomoo Hirano. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced
Homer1a in Mouse Cerebellar Purkinje Neurons.” European Journal of Neuroscience.
Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1460-9568.2003.02499.x.
ieee: I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, and T. Hirano, “Long-term potentiation
of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje
neurons,” European Journal of Neuroscience, vol. 17, no. 5. Wiley-Blackwell,
pp. 1023–1032, 2003.
ista: Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. 2003. Long-term potentiation
of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje
neurons. European Journal of Neuroscience. 17(5), 1023–1032.
mla: Minami, Itsunari, et al. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced
Homer1a in Mouse Cerebellar Purkinje Neurons.” European Journal of Neuroscience,
vol. 17, no. 5, Wiley-Blackwell, 2003, pp. 1023–32, doi:10.1046/j.1460-9568.2003.02499.x.
short: I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, T. Hirano, European Journal
of Neuroscience 17 (2003) 1023–1032.
date_created: 2018-12-11T11:58:44Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2021-01-12T06:58:39Z
day: '01'
doi: 10.1046/j.1460-9568.2003.02499.x
extern: 1
intvolume: ' 17'
issue: '5'
month: '03'
page: 1023 - 1032
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4273'
quality_controlled: 0
status: public
title: Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a
in mouse cerebellar Purkinje neurons
type: journal_article
volume: 17
year: '2003'
...
---
_id: '2626'
abstract:
- lang: eng
text: The expression pattern of metabotropic glutamate receptor Iα (mGluR1α) was
immunohistochemically investigated in substantia nigra dopaminergic neurons of
the macaque monkey. In normal monkeys, mGluR1α immunoreactivity was weakly observed
in the dorsal tier of the substantia nigra pars compacta (SNc-d) where calbindin-D28k-containing
dopaminergic neurons invulnerable to parkinsonian degeneration are specifically
located. On the other hand, mGluR1α was strongly expressed in the ventral tier
of the substantia nigra pars cornpacta (SNc-v). In monkeys treated with the parkinsonism-inducing
drug, I-methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP), mGluR1α expression
was decreased in dopaminergic neurons in the SNc-v that were spared its toxic
action. These results suggest that mGluR1α expression may be involved at least
partly in the vulnerability of dopaminergic neurons to parkinsonian insults.
author:
- first_name: Katsuyuki
full_name: Kaneda, Katsuyuki
last_name: Kaneda
- first_name: Michiko
full_name: Imanishi, Michiko
last_name: Imanishi
- first_name: Atsushi
full_name: Nambu, Atsushi
last_name: Nambu
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Masahiko
full_name: Takada, Masahiko
last_name: Takada
citation:
ama: Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. Differential expression
patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. 2003;14(7):947-950.
doi:10.1097/01.wnr.0000074344.81633.e4
apa: Kaneda, K., Imanishi, M., Nambu, A., Shigemoto, R., & Takada, M. (2003).
Differential expression patterns of mGluR1α in monkey nigral dopamine neurons.
Neuroreport. Lippincott, Williams & Wilkins. https://doi.org/10.1097/01.wnr.0000074344.81633.e4
chicago: Kaneda, Katsuyuki, Michiko Imanishi, Atsushi Nambu, Ryuichi Shigemoto,
and Masahiko Takada. “Differential Expression Patterns of MGluR1α in Monkey Nigral
Dopamine Neurons.” Neuroreport. Lippincott, Williams & Wilkins, 2003.
https://doi.org/10.1097/01.wnr.0000074344.81633.e4.
ieee: K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, and M. Takada, “Differential
expression patterns of mGluR1α in monkey nigral dopamine neurons,” Neuroreport,
vol. 14, no. 7. Lippincott, Williams & Wilkins, pp. 947–950, 2003.
ista: Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. 2003. Differential expression
patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. 14(7), 947–950.
mla: Kaneda, Katsuyuki, et al. “Differential Expression Patterns of MGluR1α in Monkey
Nigral Dopamine Neurons.” Neuroreport, vol. 14, no. 7, Lippincott, Williams
& Wilkins, 2003, pp. 947–50, doi:10.1097/01.wnr.0000074344.81633.e4.
short: K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, M. Takada, Neuroreport 14
(2003) 947–950.
date_created: 2018-12-11T11:58:45Z
date_published: 2003-05-01T00:00:00Z
date_updated: 2021-01-12T06:58:40Z
day: '01'
doi: 10.1097/01.wnr.0000074344.81633.e4
extern: 1
intvolume: ' 14'
issue: '7'
month: '05'
page: 947 - 950
publication: Neuroreport
publication_status: published
publisher: Lippincott, Williams & Wilkins
publist_id: '4272'
quality_controlled: 0
status: public
title: Differential expression patterns of mGluR1α in monkey nigral dopamine neurons
type: journal_article
volume: 14
year: '2003'
...
---
_id: '2627'
abstract:
- lang: eng
text: Despite its implications for higher order functions of the brain, little is
currently known about the molecular basis of left-right asymmetry of the brain.
Here we report that synaptic distribution of N-methyl-D-aspartate (NMDA) receptor
GluRε2 (NR2B) subunits in the adult mouse hippocampus is asymmetrical between
the left and right and between the apical and basal dendrites of single neurons.
These asymmetrical allocations of ε2 subunits differentiate the properties of
NMDA receptors and synaptic plasticity between the left and right hippocampus.
These results provide a molecular basis for the structural and functional asymmetry
of the mature brain.
author:
- first_name: Ryosuke
full_name: Kawakami, Ryosuke
last_name: Kawakami
- first_name: Yoshiaki
full_name: Shinohara, Yoshiaki
last_name: Shinohara
- first_name: Yuichiro
full_name: Kato, Yuichiro
last_name: Kato
- first_name: Hiroyuki
full_name: Sugiyama, Hiroyuki
last_name: Sugiyama
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Isao
full_name: Ito, Isao
last_name: Ito
citation:
ama: Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. Asymmetrical
allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science.
2003;300(5621):990-994. doi:10.1126/science.1082609
apa: Kawakami, R., Shinohara, Y., Kato, Y., Sugiyama, H., Shigemoto, R., & Ito,
I. (2003). Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal
circuitry. Science. American Association for the Advancement of Science.
https://doi.org/10.1126/science.1082609
chicago: Kawakami, Ryosuke, Yoshiaki Shinohara, Yuichiro Kato, Hiroyuki Sugiyama,
Ryuichi Shigemoto, and Isao Ito. “Asymmetrical Allocation of NMDA Receptor Ε2
Subunits in Hippocampal Circuitry.” Science. American Association for the
Advancement of Science, 2003. https://doi.org/10.1126/science.1082609.
ieee: R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, and I. Ito,
“Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry,”
Science, vol. 300, no. 5621. American Association for the Advancement of
Science, pp. 990–994, 2003.
ista: Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. 2003. Asymmetrical
allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science. 300(5621),
990–994.
mla: Kawakami, Ryosuke, et al. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits
in Hippocampal Circuitry.” Science, vol. 300, no. 5621, American Association
for the Advancement of Science, 2003, pp. 990–94, doi:10.1126/science.1082609.
short: R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, I. Ito, Science
300 (2003) 990–994.
date_created: 2018-12-11T11:58:45Z
date_published: 2003-05-09T00:00:00Z
date_updated: 2021-01-12T06:58:40Z
day: '09'
doi: 10.1126/science.1082609
extern: 1
intvolume: ' 300'
issue: '5621'
month: '05'
page: 990 - 994
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '4271'
quality_controlled: 0
status: public
title: Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry
type: journal_article
volume: 300
year: '2003'
...