---
_id: '2864'
abstract:
- lang: eng
text: Using an electrospray tandem mass spectrometer as a concentration-sensitive
detector, a method has been developed to quantify femtomole amounts of plant growth
regulators (i.e. isoprenoid type cytokinins, zeatin, dihydrozeatin, isopentenyladenine
and their respective riboside and glucoside analogues) and the second messenger
adenosine 3':5'-cyclic monophosphate (3':5'-cAMP). Miniaturisation of the chromatographic
setup using capillary high performance liquid chromatographic (HPLC) ion spray
mass spectrometry increased the sensitivity to the low femtomole region. Application
of automated capillary column switching allowed the introduction of large injection
volumes into the HPLC system. Aliquots (25 μL) were injected into one dimension
of the HPLC set-up and stacked onto a micro pre-column. By means of mobile phase
switching the pre-column was back-flushed to introduce the analytes onto the analytical
column. For cytokinin analysis positive electrospray ionisation was used and resulted
in 2.5-25 fmol detection limits. Cyclic nucleotides were separated under ion-pair
conditions using tetrabutyl ammonium bromide as ion-pair reagent and were detected
under negative electrospray ionisation conditions. Here a 25 fmol detection limit
was determined. Following this approach, cytokinins and 3':5'-cAMP extracted from
only mg amounts of apical shoot meristem and chloroplasts obtained from Nicotiana
tabacum cv. Petit Havana SR1 were identified and quantified.
acknowledgement: The authors wish to thank J. Dupon for technical and logisticalassistance.
The authors also wish to thank the FWO-Vlaanderen/lotto (grant 32013394), the Flemish government (GOA-action) and the
Grant Agency of the Czech Republic (grant 206/96/K188) for financial support.
article_processing_charge: No
article_type: original
author:
- first_name: Erwin
full_name: Witters, Erwin
last_name: Witters
- first_name: Koen
full_name: Vanhoutte, Koen
last_name: Vanhoutte
- first_name: Walter
full_name: Dewitte, Walter
last_name: Dewitte
- first_name: Ivana
full_name: Macháčková, Ivana
last_name: Macháčková
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Walter
full_name: Van Dongen, Walter
last_name: Van Dongen
- first_name: Eddy
full_name: Esmans, Eddy
last_name: Esmans
- first_name: Henri
full_name: Van Onckelen, Henri
last_name: Van Onckelen
citation:
ama: Witters E, Vanhoutte K, Dewitte W, et al. Analysis of cyclic nucleotides and
cytokinins in minute plant samples using phase system switching capillary electrospray
liquid chromatography tandem mass spectrometry. Phytochemical Analysis.
1999;10(3):143-151. doi:10.1002/(SICI)1099-1565(199905/06)10:3<143::AID-PCA441>3.0.CO;2-G
apa: Witters, E., Vanhoutte, K., Dewitte, W., Macháčková, I., Benková, E., Van Dongen,
W., … Van Onckelen, H. (1999). Analysis of cyclic nucleotides and cytokinins in
minute plant samples using phase system switching capillary electrospray liquid
chromatography tandem mass spectrometry. Phytochemical Analysis. Wiley-Blackwell.
https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3<143::AID-PCA441>3.0.CO;2-G
chicago: Witters, Erwin, Koen Vanhoutte, Walter Dewitte, Ivana Macháčková, Eva Benková,
Walter Van Dongen, Eddy Esmans, and Henri Van Onckelen. “Analysis of Cyclic Nucleotides
and Cytokinins in Minute Plant Samples Using Phase System Switching Capillary
Electrospray Liquid Chromatography Tandem Mass Spectrometry.” Phytochemical
Analysis. Wiley-Blackwell, 1999. https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3<143::AID-PCA441>3.0.CO;2-G.
ieee: E. Witters et al., “Analysis of cyclic nucleotides and cytokinins in
minute plant samples using phase system switching capillary electrospray liquid
chromatography tandem mass spectrometry,” Phytochemical Analysis, vol.
10, no. 3. Wiley-Blackwell, pp. 143–151, 1999.
ista: Witters E, Vanhoutte K, Dewitte W, Macháčková I, Benková E, Van Dongen W,
Esmans E, Van Onckelen H. 1999. Analysis of cyclic nucleotides and cytokinins
in minute plant samples using phase system switching capillary electrospray liquid
chromatography tandem mass spectrometry. Phytochemical Analysis. 10(3), 143–151.
mla: Witters, Erwin, et al. “Analysis of Cyclic Nucleotides and Cytokinins in Minute
Plant Samples Using Phase System Switching Capillary Electrospray Liquid Chromatography
Tandem Mass Spectrometry.” Phytochemical Analysis, vol. 10, no. 3, Wiley-Blackwell,
1999, pp. 143–51, doi:10.1002/(SICI)1099-1565(199905/06)10:3<143::AID-PCA441>3.0.CO;2-G.
short: E. Witters, K. Vanhoutte, W. Dewitte, I. Macháčková, E. Benková, W. Van Dongen,
E. Esmans, H. Van Onckelen, Phytochemical Analysis 10 (1999) 143–151.
date_created: 2018-12-11T12:00:00Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2022-09-09T09:09:22Z
day: '01'
doi: 10.1002/(SICI)1099-1565(199905/06)10:3<143::AID-PCA441>3.0.CO;2-G
extern: '1'
intvolume: ' 10'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 143 - 151
publication: Phytochemical Analysis
publication_identifier:
issn:
- 0958-0344
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3925'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of cyclic nucleotides and cytokinins in minute plant samples using
phase system switching capillary electrospray liquid chromatography tandem mass
spectrometry
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1999'
...
---
_id: '2865'
abstract:
- lang: eng
text: 'Although cytokinins (CKs) affect a number of processes connected with chloroplasts,
it has never been rigorously proven that chloroplasts contain CKs. We isolated
intact chloroplasts from tobacco (Nicotiana tabacum L. cv SR1) and wheat (Triticum
aestivum L. cv Ritmo) leaves and determined their CKs by liquid chromatography/tandem
mass spectroscopy. Chloroplasts from both species contained a whole spectrum of
CKs, including free bases (zeatin and isopentenyladenine), ribosides (zeatin riboside,
and isopentenyladenosine), ribotides (isopentenyladenosine-5′-monophosphate, zeatin
riboside-5′-monophosphate, and dihydrozeatin riboside-5′-monophosphate), and N-glucosides
(zeatin-N 9-glucoside, dihydrozeatin-N 9-glucoside, zeatin-N 7-glucoside, and
isopentenyladenine-N-glucosides). In chloroplasts there was a moderately higher
relative amount of bases, ribosides, and ribotides than in leaves, and a significantly
increased level ofN 9-glucosides of zeatin and dihydrozeatin. Tobacco and wheat
chloroplasts were prepared from leaves at the end of either a dark or light period.
After a dark period, chloroplasts accumulated more CKs than after a light period.
The differences were moderate for free bases and ribosides, but highly significant
for glucosides. Tobacco chloroplasts from dark-treated leaves contained zeatin
riboside-O-glucoside and dihydrozeatin riboside-O-glucoside, as well as a relatively
high CK oxidase activity. These data show that chloroplasts contain a whole spectrum
of CKs and the enzymatic activity necessary for their metabolism. '
acknowledgement: The authors thank Prof. Dennis Baker (Wye College, London) and Dr.
Laura Zonia (Institute of Experimental Botany, Prague) for language correction of
the manuscript and Prof. Miroslav Kamínek (Institute of Experimental Botany, Prague)
for critical reading of the manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Erwin
full_name: Witters, Erwin
last_name: Witters
- first_name: Walter
full_name: Van Dongen, Walter
last_name: Van Dongen
- first_name: Jan
full_name: Kolář, Jan
last_name: Kolář
- first_name: Václav
full_name: Motyka, Václav
last_name: Motyka
- first_name: Břetislav
full_name: Brzobohatý, Břetislav
last_name: Brzobohatý
- first_name: Henri
full_name: Van Onckelen, Henri
last_name: Van Onckelen
- first_name: Ivana
full_name: Macháčková, Ivana
last_name: Macháčková
citation:
ama: Benková E, Witters E, Van Dongen W, et al. Cytokinins in tobacco and wheat
chloroplasts. Occurrence and changes due to light/dark treatment. Plant Physiology.
1999;121(1):245-251. doi:10.1104/pp.121.1.245
apa: Benková, E., Witters, E., Van Dongen, W., Kolář, J., Motyka, V., Brzobohatý,
B., … Macháčková, I. (1999). Cytokinins in tobacco and wheat chloroplasts. Occurrence
and changes due to light/dark treatment. Plant Physiology. American Society
of Plant Biologists. https://doi.org/10.1104/pp.121.1.245
chicago: Benková, Eva, Erwin Witters, Walter Van Dongen, Jan Kolář, Václav Motyka,
Břetislav Brzobohatý, Henri Van Onckelen, and Ivana Macháčková. “Cytokinins in
Tobacco and Wheat Chloroplasts. Occurrence and Changes Due to Light/Dark Treatment.”
Plant Physiology. American Society of Plant Biologists, 1999. https://doi.org/10.1104/pp.121.1.245.
ieee: E. Benková et al., “Cytokinins in tobacco and wheat chloroplasts. Occurrence
and changes due to light/dark treatment,” Plant Physiology, vol. 121, no.
1. American Society of Plant Biologists, pp. 245–251, 1999.
ista: Benková E, Witters E, Van Dongen W, Kolář J, Motyka V, Brzobohatý B, Van Onckelen
H, Macháčková I. 1999. Cytokinins in tobacco and wheat chloroplasts. Occurrence
and changes due to light/dark treatment. Plant Physiology. 121(1), 245–251.
mla: Benková, Eva, et al. “Cytokinins in Tobacco and Wheat Chloroplasts. Occurrence
and Changes Due to Light/Dark Treatment.” Plant Physiology, vol. 121, no.
1, American Society of Plant Biologists, 1999, pp. 245–51, doi:10.1104/pp.121.1.245.
short: E. Benková, E. Witters, W. Van Dongen, J. Kolář, V. Motyka, B. Brzobohatý,
H. Van Onckelen, I. Macháčková, Plant Physiology 121 (1999) 245–251.
date_created: 2018-12-11T12:00:00Z
date_published: 1999-09-01T00:00:00Z
date_updated: 2022-09-07T13:56:12Z
day: '01'
doi: 10.1104/pp.121.1.245
extern: '1'
external_id:
pmid:
- '10482680'
intvolume: ' 121'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC59373/
month: '09'
oa: 1
oa_version: Published Version
page: 245 - 251
pmid: 1
publication: Plant Physiology
publication_identifier:
issn:
- 0032-0889
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3924'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cytokinins in tobacco and wheat chloroplasts. Occurrence and changes due to
light/dark treatment
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 121
year: '1999'
...
---
_id: '3137'
abstract:
- lang: eng
text: This volume provides an overview of glutamate receptors and their role in
excitatory neurotransmission. It focusses on three aspects. First, it describes
the functional, molecular, and pharmacological properties of glutamate receptors
(AMPA, NMDA, and kainate receptors). Second, it gives a survey how these receptors
are involved in synaptic transmission at different glutamatergic synapses in the
mammalian CNS. Finally, it adresses how overactivation of glutamate receptors
can lead to excitotoxic cell death, and emphasizes the importance of glutamate
receptors as potential therapeutical targets. The chapters, written by leading
scientists, give accurate summaries of facets that have emerged recently in this
field. The book demonstrates the strength of a multidisciplinary approach involving
physiology, pharmacology, and molecular biology. It will be useful for other scientists
in and outside the field, lecturers and students at different educational levels.
alternative_title:
- Handbook of Experimental Pharmacology
article_processing_charge: No
citation:
ama: 'Jonas PM, Monyer H, eds. Ionotropic Glutamate Receptors in the CNS.
Vol 141. 1st ed. Berlin ; Heidelberg: Springer; 1999. doi:10.1007/978-3-662-08022-1'
apa: 'Jonas, P. M., & Monyer, H. (Eds.). (1999). Ionotropic Glutamate Receptors
in the CNS (1st ed., Vol. 141). Berlin ; Heidelberg: Springer. https://doi.org/10.1007/978-3-662-08022-1'
chicago: 'Jonas, Peter M, and Hannah Monyer, eds. Ionotropic Glutamate Receptors
in the CNS. 1st ed. Vol. 141. Berlin ; Heidelberg: Springer, 1999. https://doi.org/10.1007/978-3-662-08022-1.'
ieee: 'P. M. Jonas and H. Monyer, Eds., Ionotropic Glutamate Receptors in the
CNS, 1st ed., vol. 141. Berlin ; Heidelberg: Springer, 1999.'
ista: 'Jonas PM, Monyer H eds. 1999. Ionotropic Glutamate Receptors in the CNS 1st
ed., Berlin ; Heidelberg: Springer, XXII, 535p.'
mla: Jonas, Peter M., and Hannah Monyer, editors. Ionotropic Glutamate Receptors
in the CNS. 1st ed., vol. 141, Springer, 1999, doi:10.1007/978-3-662-08022-1.
short: P.M. Jonas, H. Monyer, eds., Ionotropic Glutamate Receptors in the CNS, 1st
ed., Springer, Berlin ; Heidelberg, 1999.
date_created: 2018-12-11T12:01:36Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2021-12-22T11:13:43Z
day: '01'
doi: 10.1007/978-3-662-08022-1
edition: '1'
editor:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Hannah
full_name: Monyer, Hannah
last_name: Monyer
extern: '1'
intvolume: ' 141'
language:
- iso: eng
main_file_link:
- url: http://www.springer.com/biomed/pharmaceutical+science/book/978-3-540-66120-7
month: '01'
oa_version: None
page: XXII, 535
place: Berlin ; Heidelberg
publication_identifier:
eisbn:
- 978-3-662-08022-1
eissn:
- 1865-0325
isbn:
- 978-3-642-08539-0
issn:
- 0171-2004
publication_status: published
publisher: Springer
publist_id: '3560'
quality_controlled: '1'
status: public
title: Ionotropic Glutamate Receptors in the CNS
type: book_editor
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 141
year: '1999'
...
---
_id: '3148'
abstract:
- lang: eng
text: Accurate proteolytic processing of neuropeptide and peptide hormone precursors
by members of the kexin/furin family of proteases is key to determining both the
identities and activities of signaling peptides. Here we identify amontillado
(amon), the Drosophila melanogaster homolog of the mammalian neuropeptide processing
protease PC2, and show that in contrast to vertebrate PC2, amontillado expression
undergoes extensive regulation in the nervous system during development. In situ
hybridization reveals that expression of amontillado is restricted to the final
stages of embryogenesis when it is found in anterior sensory structures and in
only 168 cells in the brain and ventral nerve cord. After larvae hatch from their
egg shells, the sensory structures and most cells in the CNS turn off or substantially
reduce amontillado expression, suggesting that amontillado plays a specific role
late in embryogenesis. Larvae lacking the chromosomal region containing amontillado
show no gross anatomical defects and respond to touch. However, such larvae show
a greatly reduced frequency of a hatching behavior of wild- type Drosophila in
which larvae swing their heads, scraping through the eggshell with their mouth
hooks. Ubiquitous expression of amontillado can restore near wild-type levels
of this behavior, whereas expression of amontillado with an alanine substitution
for the catalytic histidine cannot. These results suggest that amontillado expression
is regulated as part of a programmed modulation of neural signaling that controls
hatching behavior by producing specific neuropeptides in particular neurons at
an appropriate developmental time.
acknowledgement: This research was supported by National Institutes of Health Grant
GM39697 to R.S.F. D.S. was supported in part by National Institutes of Health training
Grant 2T32GM07599. We thank M. A. Krasnow and members of his laboratory, particularly
J. Jarecki, for technical guidance, encouragement, and stimulating scientific discussions.
We thank A. Maghbouleh and the Stanford Statistics Department Consulting Service
for help with statistical analysis. We thank G. Beitel, S. Dietrich, K. Guillemin,
D. Micklem, Y. Nakajima, and members of the Fuller and Krasnow laboratories for
comments on this manuscript. We thank M. Palazzolo for the use of theDrosophila
head cDNA library, D. Kiehart for the use of a Drosophila myosin antibody, and D.
Casso, F.-A. Ramirez-Weber, and T. B. Kornberg for use of the D/TM3SbKrGFP flies.
We thank A. R. Kidd, D. Tolla, and M. Bender and D. Casso, F.-A. Ramirez-Weber and
T. B. Kornberg for communication of results before publication
article_processing_charge: No
article_type: original
author:
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Robert
full_name: Fuller, Robert
last_name: Fuller
citation:
ama: Siekhaus DE, Fuller R. A role for amontillado the Drosophila homolog of the
neuropeptide precursor processing protease PC2 in triggering hatching behavior.
Journal of Neuroscience. 1999;19(16):6942-6954. doi:10.1523/jneurosci.19-16-06942.1999
apa: Siekhaus, D. E., & Fuller, R. (1999). A role for amontillado the Drosophila
homolog of the neuropeptide precursor processing protease PC2 in triggering hatching
behavior. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/jneurosci.19-16-06942.1999
chicago: Siekhaus, Daria E, and Robert Fuller. “A Role for Amontillado the Drosophila
Homolog of the Neuropeptide Precursor Processing Protease PC2 in Triggering Hatching
Behavior.” Journal of Neuroscience. Society for Neuroscience, 1999. https://doi.org/10.1523/jneurosci.19-16-06942.1999.
ieee: D. E. Siekhaus and R. Fuller, “A role for amontillado the Drosophila homolog
of the neuropeptide precursor processing protease PC2 in triggering hatching behavior,”
Journal of Neuroscience, vol. 19, no. 16. Society for Neuroscience, pp.
6942–6954, 1999.
ista: Siekhaus DE, Fuller R. 1999. A role for amontillado the Drosophila homolog
of the neuropeptide precursor processing protease PC2 in triggering hatching behavior.
Journal of Neuroscience. 19(16), 6942–6954.
mla: Siekhaus, Daria E., and Robert Fuller. “A Role for Amontillado the Drosophila
Homolog of the Neuropeptide Precursor Processing Protease PC2 in Triggering Hatching
Behavior.” Journal of Neuroscience, vol. 19, no. 16, Society for Neuroscience,
1999, pp. 6942–54, doi:10.1523/jneurosci.19-16-06942.1999.
short: D.E. Siekhaus, R. Fuller, Journal of Neuroscience 19 (1999) 6942–6954.
date_created: 2018-12-11T12:01:40Z
date_published: 1999-08-15T00:00:00Z
date_updated: 2022-09-07T13:48:41Z
day: '15'
doi: 10.1523/jneurosci.19-16-06942.1999
extern: '1'
external_id:
pmid:
- '10436051 '
intvolume: ' 19'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782853/
month: '08'
oa: 1
oa_version: Published Version
page: 6942 - 6954
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '3547'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A role for amontillado the Drosophila homolog of the neuropeptide precursor
processing protease PC2 in triggering hatching behavior
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '1999'
...
---
_id: '11679'
abstract:
- lang: eng
text: "We are given a set T = {T 1 ,T 2 , . . .,T k } of rooted binary trees, each
T i leaf-labeled by a subset L(Ti)⊂{1,2,...,n} . If T is a tree on {1,2, . . .,n
}, we let T|L denote the minimal subtree of T induced by the nodes of L and all
their ancestors. The consensus tree problem asks whether there exists a tree T
* such that, for every i , T∗|L(Ti) is homeomorphic to T i .\r\n\r\nWe present
algorithms which test if a given set of trees has a consensus tree and if so,
construct one. The deterministic algorithm takes time min{O(N n 1/2 ), O(N+ n
2 log n )}, where N=∑i|Ti| , and uses linear space. The randomized algorithm takes
time O(N log3 n) and uses linear space. The previous best for this problem was
a 1981 O(Nn) algorithm by Aho et al. Our faster deterministic algorithm uses a
new efficient algorithm for the following interesting dynamic graph problem: Given
a graph G with n nodes and m edges and a sequence of b batches of one or more
edge deletions, then, after each batch, either find a new component that has just
been created or determine that there is no such component. For this problem, we
have a simple algorithm with running time O(n 2 log n + b 0 min{n 2 , m log n
}), where b 0 is the number of batches which do not result in a new component.
For our particular application, b0≤1 . If all edges are deleted, then the best
previously known deterministic algorithm requires time O(mn−−√) to solve this
problem. We also present two applications of these consensus tree algorithms which
solve other problems in computational evolutionary biology."
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: V.
full_name: King, V.
last_name: King
- first_name: T.
full_name: Warnow, T.
last_name: Warnow
citation:
ama: Henzinger MH, King V, Warnow T. Constructing a tree from homeomorphic subtrees,
with applications to computational evolutionary biology. Algorithmica.
1999;24:1-13. doi:10.1007/pl00009268
apa: Henzinger, M. H., King, V., & Warnow, T. (1999). Constructing a tree from
homeomorphic subtrees, with applications to computational evolutionary biology.
Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009268
chicago: Henzinger, Monika H, V. King, and T. Warnow. “Constructing a Tree from
Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.”
Algorithmica. Springer Nature, 1999. https://doi.org/10.1007/pl00009268.
ieee: M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic
subtrees, with applications to computational evolutionary biology,” Algorithmica,
vol. 24. Springer Nature, pp. 1–13, 1999.
ista: Henzinger MH, King V, Warnow T. 1999. Constructing a tree from homeomorphic
subtrees, with applications to computational evolutionary biology. Algorithmica.
24, 1–13.
mla: Henzinger, Monika H., et al. “Constructing a Tree from Homeomorphic Subtrees,
with Applications to Computational Evolutionary Biology.” Algorithmica,
vol. 24, Springer Nature, 1999, pp. 1–13, doi:10.1007/pl00009268.
short: M.H. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
date_created: 2022-07-27T15:02:28Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2023-02-21T16:33:24Z
day: '01'
doi: 10.1007/pl00009268
extern: '1'
intvolume: ' 24'
keyword:
- Algorithms
- Data structures
- Evolutionary biology
- Theory of databases
language:
- iso: eng
month: '05'
oa_version: None
page: 1-13
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11927'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Constructing a tree from homeomorphic subtrees, with applications to computational
evolutionary biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '1999'
...
---
_id: '11687'
abstract:
- lang: eng
text: "When using traditional search engines, users have to formulate queries to
describe their information need. This paper discusses a different approach to
Web searching where the input to the search process is not a set of query terms,
but instead is the URL of a page, and the output is a set of related Web pages.
A related Web page is one that addresses the same topic as the original page.
For example, www.washingtonpost.com is a page related to www.nytimes.com, since
both are online newspapers.\r\n\r\nWe describe two algorithms to identify related
Web pages. These algorithms use only the connectivity information in the Web (i.e.,
the links between pages) and not the content of pages or usage information. We
have implemented both algorithms and measured their runtime performance. To evaluate
the effectiveness of our algorithms, we performed a user study comparing our algorithms
with Netscape's `What's Related' service (http://home.netscape.com/escapes/related/).
Our study showed that the precision at 10 for our two algorithms are 73% better
and 51% better than that of Netscape, despite the fact that Netscape uses both
content and usage pattern information in addition to connectivity information."
article_processing_charge: No
article_type: original
author:
- first_name: Jeffrey
full_name: Dean, Jeffrey
last_name: Dean
- 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: Dean J, Henzinger MH. Finding related pages in the world wide Web. Computer
Networks. 1999;31(11-16):1467-1479. doi:10.1016/s1389-1286(99)00022-5
apa: Dean, J., & Henzinger, M. H. (1999). Finding related pages in the world
wide Web. Computer Networks. Elsevier. https://doi.org/10.1016/s1389-1286(99)00022-5
chicago: Dean, Jeffrey, and Monika H Henzinger. “Finding Related Pages in the World
Wide Web.” Computer Networks. Elsevier, 1999. https://doi.org/10.1016/s1389-1286(99)00022-5.
ieee: J. Dean and M. H. Henzinger, “Finding related pages in the world wide Web,”
Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1467–1479, 1999.
ista: Dean J, Henzinger MH. 1999. Finding related pages in the world wide Web. Computer
Networks. 31(11–16), 1467–1479.
mla: Dean, Jeffrey, and Monika H. Henzinger. “Finding Related Pages in the World
Wide Web.” Computer Networks, vol. 31, no. 11–16, Elsevier, 1999, pp. 1467–79,
doi:10.1016/s1389-1286(99)00022-5.
short: J. Dean, M.H. Henzinger, Computer Networks 31 (1999) 1467–1479.
date_created: 2022-07-29T06:55:26Z
date_published: 1999-05-17T00:00:00Z
date_updated: 2022-09-12T09:12:21Z
day: '17'
doi: 10.1016/s1389-1286(99)00022-5
extern: '1'
intvolume: ' 31'
issue: 11-16
keyword:
- Search engines
- Related pages
- Searching paradigms
language:
- iso: eng
month: '05'
oa_version: None
page: 1467-1479
publication: Computer Networks
publication_identifier:
issn:
- 1389-1286
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding related pages in the world wide Web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '1999'
...
---
_id: '11688'
abstract:
- lang: eng
text: Recent research has studied how to measure the size of a search engine, in
terms of the number of pages indexed. In this paper, we consider a different measure
for search engines, namely the quality of the pages in a search engine index.
We provide a simple, effective algorithm for approximating the quality of an index
by performing a random walk on the Web, and we use this methodology to compare
the index quality of several major search engines.
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: Allan
full_name: Heydon, Allan
last_name: Heydon
- first_name: Michael
full_name: Mitzenmacher, Michael
last_name: Mitzenmacher
- first_name: Marc
full_name: Najork, Marc
last_name: Najork
citation:
ama: Henzinger MH, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using
random walks on the web. Computer Networks. 1999;31(11-16):1291-1303. doi:10.1016/s1389-1286(99)00016-x
apa: Henzinger, M. H., Heydon, A., Mitzenmacher, M., & Najork, M. (1999). Measuring
index quality using random walks on the web. Computer Networks. Elsevier.
https://doi.org/10.1016/s1389-1286(99)00016-x
chicago: Henzinger, Monika H, Allan Heydon, Michael Mitzenmacher, and Marc Najork.
“Measuring Index Quality Using Random Walks on the Web.” Computer Networks.
Elsevier, 1999. https://doi.org/10.1016/s1389-1286(99)00016-x.
ieee: M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index
quality using random walks on the web,” Computer Networks, vol. 31, no.
11–16. Elsevier, pp. 1291–1303, 1999.
ista: Henzinger MH, Heydon A, Mitzenmacher M, Najork M. 1999. Measuring index quality
using random walks on the web. Computer Networks. 31(11–16), 1291–1303.
mla: Henzinger, Monika H., et al. “Measuring Index Quality Using Random Walks on
the Web.” Computer Networks, vol. 31, no. 11–16, Elsevier, 1999, pp. 1291–303,
doi:10.1016/s1389-1286(99)00016-x.
short: M.H. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks
31 (1999) 1291–1303.
date_created: 2022-07-29T07:00:28Z
date_published: 1999-05-17T00:00:00Z
date_updated: 2022-09-12T09:13:55Z
day: '17'
doi: 10.1016/s1389-1286(99)00016-x
extern: '1'
intvolume: ' 31'
issue: 11-16
keyword:
- Search engines
- Index quality
- Random walks
- PageRank
language:
- iso: eng
month: '05'
oa_version: None
page: 1291-1303
publication: Computer Networks
publication_identifier:
issn:
- 1389-1286
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Measuring index quality using random walks on the web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '1999'
...
---
_id: '11691'
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
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. In: Proceedings of the 31st Annual
ACM Symposium on Theory of Computing. Association for Computing Machinery;
1999:189-197. doi:10.1145/301250.301300'
apa: 'Goel, A., Henzinger, M. H., Plotkin, S., & Tardos, E. (1999). Scheduling
data transfers in a network and the set scheduling problem. In Proceedings
of the 31st annual ACM symposium on Theory of computing (pp. 189–197). Atlanta,
GA, United States: Association for Computing Machinery. https://doi.org/10.1145/301250.301300'
chicago: Goel, Ashish, Monika H Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling
Data Transfers in a Network and the Set Scheduling Problem.” In Proceedings
of the 31st Annual ACM Symposium on Theory of Computing, 189–97. Association
for Computing Machinery, 1999. https://doi.org/10.1145/301250.301300.
ieee: A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers
in a network and the set scheduling problem,” in Proceedings of the 31st annual
ACM symposium on Theory of computing, Atlanta, GA, United States, 1999, pp.
189–197.
ista: 'Goel A, Henzinger MH, Plotkin S, Tardos E. 1999. Scheduling data transfers
in a network and the set scheduling problem. Proceedings of the 31st annual ACM
symposium on Theory of computing. STOC: Symposium on Theory of Computing, 189–197.'
mla: Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling
Problem.” Proceedings of the 31st Annual ACM Symposium on Theory of Computing,
Association for Computing Machinery, 1999, pp. 189–97, doi:10.1145/301250.301300.
short: A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, in:, Proceedings of the 31st
Annual ACM Symposium on Theory of Computing, Association for Computing Machinery,
1999, pp. 189–197.
conference:
end_date: 1999-05-04
location: ' Atlanta, GA, United States'
name: 'STOC: Symposium on Theory of Computing'
start_date: 1999-05-01
date_created: 2022-07-29T07:43:00Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2023-02-09T11:47:09Z
day: '01'
doi: 10.1145/301250.301300
extern: '1'
keyword:
- Scheduling
- Flow time
language:
- iso: eng
month: '05'
oa_version: None
page: 189-197
publication: Proceedings of the 31st annual ACM symposium on Theory of computing
publication_identifier:
issn:
- 0196-6774
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling data transfers in a network and the set scheduling problem
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1999'
...
---
_id: '11769'
abstract:
- lang: eng
text: "This paper solves a longstanding open problem in fully dynamic algorithms:
We present the first fully dynamic algorithms that maintain connectivity, bipartiteness,
and approximate minimum spanning trees in polylogarithmic time per edge insertion
or deletion. The algorithms are designed using a new dynamic technique that combines
a novel graph decomposition with randomization. They are Las-Vegas type randomized
algorithms which use simple data structures and have a small constant factor.\r\nLet
n denote the number of nodes in the graph. For a sequence of Ω(m0) operations,
where m0 is the number of edges in the initial graph, the expected time for p
updates is O(p log3 n) (througout the paper the logarithms are based 2) for connectivity
and bipartiteness. The worst-case time for one query is O(log n/log log n). For
the k-edge witness problem (“Does the removal of k given edges disconnect the
graph?”) the expected time for p updates is O(p log3 n) and the expected time
for q queries is O(qk log3 n). Given a graph with k different weights, the minimum
spanning tree can be maintained during a sequence of p updates in expected time
O(pk log3 n). This implies an algorithm to maintain a 1 + ε-approximation of the
minimum spanning tree in expected time O((p log3 n logU)/ε) for p updates, where
the weights of the edges are between 1 and U."
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: Valerie
full_name: King, Valerie
last_name: King
citation:
ama: Henzinger MH, King V. Randomized fully dynamic graph algorithms with polylogarithmic
time per operation. Journal of the ACM. 1999;46(4):502-516. doi:10.1145/320211.320215
apa: Henzinger, M. H., & King, V. (1999). Randomized fully dynamic graph algorithms
with polylogarithmic time per operation. Journal of the ACM. Association
for Computing Machinery. https://doi.org/10.1145/320211.320215
chicago: Henzinger, Monika H, and Valerie King. “Randomized Fully Dynamic Graph
Algorithms with Polylogarithmic Time per Operation.” Journal of the ACM.
Association for Computing Machinery, 1999. https://doi.org/10.1145/320211.320215.
ieee: M. H. Henzinger and V. King, “Randomized fully dynamic graph algorithms with
polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4.
Association for Computing Machinery, pp. 502–516, 1999.
ista: Henzinger MH, King V. 1999. Randomized fully dynamic graph algorithms with
polylogarithmic time per operation. Journal of the ACM. 46(4), 502–516.
mla: Henzinger, Monika H., and Valerie King. “Randomized Fully Dynamic Graph Algorithms
with Polylogarithmic Time per Operation.” Journal of the ACM, vol. 46,
no. 4, Association for Computing Machinery, 1999, pp. 502–16, doi:10.1145/320211.320215.
short: M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
date_created: 2022-08-08T12:50:25Z
date_published: 1999-07-01T00:00:00Z
date_updated: 2022-09-12T10:50:08Z
day: '01'
doi: 10.1145/320211.320215
extern: '1'
intvolume: ' 46'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
page: 502-516
publication: Journal of the ACM
publication_identifier:
eissn:
- 1557-735X
issn:
- 0004-5411
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Randomized fully dynamic graph algorithms with polylogarithmic time per operation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '1999'
...
---
_id: '8526'
article_processing_charge: No
article_type: original
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
citation:
ama: Kaloshin V. An extension of the Artin-Mazur theorem. The Annals of Mathematics.
1999;150(2):729-741. doi:10.2307/121093
apa: Kaloshin, V. (1999). An extension of the Artin-Mazur theorem. The Annals
of Mathematics. JSTOR. https://doi.org/10.2307/121093
chicago: Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” The Annals
of Mathematics. JSTOR, 1999. https://doi.org/10.2307/121093.
ieee: V. Kaloshin, “An extension of the Artin-Mazur theorem,” The Annals of Mathematics,
vol. 150, no. 2. JSTOR, pp. 729–741, 1999.
ista: Kaloshin V. 1999. An extension of the Artin-Mazur theorem. The Annals of Mathematics.
150(2), 729–741.
mla: Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” The Annals of
Mathematics, vol. 150, no. 2, JSTOR, 1999, pp. 729–41, doi:10.2307/121093.
short: V. Kaloshin, The Annals of Mathematics 150 (1999) 729–741.
date_created: 2020-09-18T10:50:28Z
date_published: 1999-09-01T00:00:00Z
date_updated: 2021-01-12T08:19:53Z
day: '01'
doi: 10.2307/121093
extern: '1'
intvolume: ' 150'
issue: '2'
keyword:
- Statistics
- Probability and Uncertainty
- Statistics and Probability
language:
- iso: eng
month: '09'
oa_version: None
page: 729-741
publication: The Annals of Mathematics
publication_identifier:
issn:
- 0003-486X
publication_status: published
publisher: JSTOR
quality_controlled: '1'
status: public
title: An extension of the Artin-Mazur theorem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 150
year: '1999'
...
---
_id: '883'
abstract:
- lang: eng
text: Sympatric speciation, the origin of two or more species from a single local
population, has almost certainly been involved in formation of several species
flocks, and may be fairly common in nature. The most straightforward scenario
for sympatric speciation requires disruptive selection favouring two substantially
different phenotypes, and consists of the evolution of reproductive isolation
between them followed by the elimination of all intermediate phenotypes. Here
we use the hypergeometric phenotypic model to show that sympatric speciation is
possible even when fitness and mate choice depend on different quantitative traits,
so that speciation must involve formation of covariance between these traits.
The increase in the number of variable loci affecting fitness facilitates sympatric
speciation, whereas the increase in the number of variable loci affecting mate
choice has the opposite effect. These predictions may enable more cases of sympatric
speciation to be identified.
acknowledgement: This study was supported by a grant from the NSF.
article_processing_charge: No
article_type: original
author:
- first_name: Alexey
full_name: Kondrashov, Alexey
last_name: Kondrashov
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Kondrashov A, Kondrashov F. Interactions among quantitative traits in the course
of sympatric speciation. Nature. 1999;400(6742):351-354. doi:10.1038/22514
apa: Kondrashov, A., & Kondrashov, F. (1999). Interactions among quantitative
traits in the course of sympatric speciation. Nature. Nature Publishing
Group. https://doi.org/10.1038/22514
chicago: Kondrashov, Alexey, and Fyodor Kondrashov. “Interactions among Quantitative
Traits in the Course of Sympatric Speciation.” Nature. Nature Publishing
Group, 1999. https://doi.org/10.1038/22514.
ieee: A. Kondrashov and F. Kondrashov, “Interactions among quantitative traits in
the course of sympatric speciation,” Nature, vol. 400, no. 6742. Nature
Publishing Group, pp. 351–354, 1999.
ista: Kondrashov A, Kondrashov F. 1999. Interactions among quantitative traits in
the course of sympatric speciation. Nature. 400(6742), 351–354.
mla: Kondrashov, Alexey, and Fyodor Kondrashov. “Interactions among Quantitative
Traits in the Course of Sympatric Speciation.” Nature, vol. 400, no. 6742,
Nature Publishing Group, 1999, pp. 351–54, doi:10.1038/22514.
short: A. Kondrashov, F. Kondrashov, Nature 400 (1999) 351–354.
date_created: 2018-12-11T11:49:00Z
date_published: 1999-07-01T00:00:00Z
date_updated: 2023-04-13T10:33:44Z
day: '01'
doi: 10.1038/22514
extern: '1'
external_id:
pmid:
- '10432111'
intvolume: ' 400'
issue: '6742'
language:
- iso: eng
month: '07'
oa_version: None
page: 351 - 354
pmid: 1
publication: Nature
publication_identifier:
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '6761'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interactions among quantitative traits in the course of sympatric speciation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 400
year: '1999'
...
---
_id: '4582'
abstract:
- lang: eng
text: "We present a formal model for concurrent systems. The model represents synchronous
and asynchronous components in a uniform framework that supports compositional
(assume-guarantee) and hierarchical (stepwise-refinement) design and verification.
While synchronous models are based on a notion of atomic computation step, and
asynchronous models remove that notion by introducing stuttering, our model is
based on a flexible notion of what constitutes a computation step: by applying
an abstraction operator to a system, arbitrarily many consecutive steps can be
collapsed into a single step. The abstraction operator, which may turn an asynchronous
system into a synchronous one, allows us to describe systems at various levels
of temporal detail. For describing systems at various levels of spatial detail,
we use a hiding operator that may turn a synchronous system into an asynchronous
one. We illustrate the model with diverse examples from synchronous circuits,
asynchronous shared-memory programs, and synchronous message-passing protocols.\r\n"
acknowledgement: "We thank Albert Benveniste, Bob Kurshan, Ken McMillan, Amir Pnueli,
and the VIS group at UC Berkeley for fruitful discussions. We also thank the anonymous
referees for suggesting improvements. Alur was supported in part by the DARPA/NASA
grant NAG2-1214 and Henzinger was supported in part by the ONR YIP award N00014-95-1-0520,
the\r\nNSF CAREER award CCR-9501708, the NSF grant CCR-9504469, the DARPA/NASA grant
NAG2-1214, and by the SRC contract 97-DC-324.041."
article_processing_charge: No
article_type: original
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Alur R, Henzinger TA. Reactive modules. Formal Methods in System Design.
1999;15(1):7-48. doi:10.1023/A:1008739929481
apa: Alur, R., & Henzinger, T. A. (1999). Reactive modules. Formal Methods
in System Design. Springer. https://doi.org/10.1023/A:1008739929481
chicago: Alur, Rajeev, and Thomas A Henzinger. “Reactive Modules.” Formal Methods
in System Design. Springer, 1999. https://doi.org/10.1023/A:1008739929481.
ieee: R. Alur and T. A. Henzinger, “Reactive modules,” Formal Methods in System
Design, vol. 15, no. 1. Springer, pp. 7–48, 1999.
ista: Alur R, Henzinger TA. 1999. Reactive modules. Formal Methods in System Design.
15(1), 7–48.
mla: Alur, Rajeev, and Thomas A. Henzinger. “Reactive Modules.” Formal Methods
in System Design, vol. 15, no. 1, Springer, 1999, pp. 7–48, doi:10.1023/A:1008739929481.
short: R. Alur, T.A. Henzinger, Formal Methods in System Design 15 (1999) 7–48.
date_created: 2018-12-11T12:09:35Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2022-09-02T08:45:58Z
day: '01'
doi: 10.1023/A:1008739929481
extern: '1'
intvolume: ' 15'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 7 - 48
publication: Formal Methods in System Design
publication_identifier:
issn:
- 0925-9856
publication_status: published
publisher: Springer
publist_id: '125'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reactive modules
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '1999'
...
---
_id: '4601'
abstract:
- lang: eng
text: "Temporal logic comes in two varieties: linear-time temporal logic assumes
implicit universal quantification over all paths that are generated by system
moves; branching-time temporal logic allows explicit existential and universal
quantification over all paths. We introduce a third, more general variety of temporal
logic: alternating-time temporal logic offers selective quantification over those
paths that are possible outcomes of games, such as the game in which the system
and the environment alternate moves. While linear-time and branching-time logics
are natural specification languages for closed systems, alternating-time logics
are natural specification languages for open systems. For example, by preceding
the temporal operator “eventually” with a selective path quantifier, we can specify
that in the game between the system and the environment, the system has a strategy
to reach a certain state. Also the problems of receptiveness, realizability, and
controllability can be formulated as model-checking problems for alternating-time
formulas.\r\nDepending on whether we admit arbitrary nesting of selective path
quantifiers and temporal operators, we obtain the two alternating-time temporal
logics ATL and ATL. We interpret the formulas of ATL and ATL over alternating
transition systems. While in ordinary transition systems, each transition corresponds
to a possible step of the system, in alternating transition systems, each transition
corresponds to a possible move in the game between the system and the environment.
Fair alternating transition systems can capture both synchronous and asynchronous
compositions of open systems. For synchronous systems, the expressive power of
ATL beyond CTL comes at no cost: the model-checking complexity of synchronous
ATL is linear in the size of the system and the length of the formula. The symbolic
model-checking algorithm for CTL extends with few modifications to synchronous
ATL, and with some work, also to asynchronous ATL, whose model-checking complexity
is quadratic. This makes ATL an obvious candidate for the automatic verification
of open systems. In the case of ATL, the model-checking problem is closely related
to the synthesis problem for linear-time formulas, and requires doubly exponential
time for both synchronous and asynchronous systems.\r\nA preliminary version of
this paper appeared in the Proceedings of the 38th IEEE Symposium on Foundations
of Computer Science (FOCS 1997), pp. 100–109."
acknowledgement: This work was supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR
contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA
grant NAG2-892, and by the SRC contract 97-DC-324.041.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Alur R, Henzinger TA, Kupferman O. Alternating-time temporal logic. In: Proceedings
of the International Symposium on Compositionality. Vol 1536. Springer; 1999:23-60.
doi:10.1007/3-540-49213-5_2'
apa: 'Alur, R., Henzinger, T. A., & Kupferman, O. (1999). Alternating-time temporal
logic. In Proceedings of the International Symposium on Compositionality
(Vol. 1536, pp. 23–60). Bad Malente, Germany: Springer. https://doi.org/10.1007/3-540-49213-5_2'
chicago: Alur, Rajeev, Thomas A Henzinger, and Orna Kupferman. “Alternating-Time
Temporal Logic.” In Proceedings of the International Symposium on Compositionality,
1536:23–60. Springer, 1999. https://doi.org/10.1007/3-540-49213-5_2.
ieee: R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,”
in Proceedings of the International Symposium on Compositionality, Bad
Malente, Germany, 1999, vol. 1536, pp. 23–60.
ista: 'Alur R, Henzinger TA, Kupferman O. 1999. Alternating-time temporal logic.
Proceedings of the International Symposium on Compositionality. COMPOS: Compositionality,
LNCS, vol. 1536, 23–60.'
mla: Alur, Rajeev, et al. “Alternating-Time Temporal Logic.” Proceedings of the
International Symposium on Compositionality, vol. 1536, Springer, 1999, pp.
23–60, doi:10.1007/3-540-49213-5_2.
short: R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the International
Symposium on Compositionality, Springer, 1999, pp. 23–60.
conference:
end_date: 1997-09-12
location: Bad Malente, Germany
name: 'COMPOS: Compositionality'
start_date: 1997-09-08
date_created: 2018-12-11T12:09:41Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2022-09-01T14:23:41Z
day: '01'
doi: 10.1007/3-540-49213-5_2
extern: '1'
intvolume: ' 1536'
language:
- iso: eng
month: '01'
oa_version: None
page: 23 - 60
publication: Proceedings of the International Symposium on Compositionality
publication_identifier:
isbn:
- '9783540654933'
publication_status: published
publisher: Springer
publist_id: '106'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Alternating-time temporal logic
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1536
year: '1999'
...
---
_id: '4602'
abstract:
- lang: eng
text: 'Modular techniques for automatic verification attempt to overcome the state-explosion
problem by exploiting the modular structure naturally present in many system designs.
Unlike other tasks in the verification of finite-state systems, current modular
techniques rely heavily on user guidance. In particular, the user is typically
required to construct module abstractions that are neither too detailed as to
render insufficient benefits in state exploration, nor too coarse as to invalidate
the desired systemproperties. In this paper, we construct abstractmodules automatically,
using reachability and controllability information about the concrete modules.
This allows us to leverage automatic verification techniques by applying them
in layers: first we compute on the state spaces of system components, then we
use the results for constructing abstractions, and finally we compute on the abstract
state space of the system. Our experimental results indicate that if reachability
and controllability information is used in the construction of abstractions, the
resulting abstract modules are often significantly smaller than the concrete modules
and can drastically reduce the space and time requirements for verification.'
acknowledgement: This research was supported in part by the NSF CAREER award CCR-9734115,
by the NSF CAREER award CCR-9501708, by the DARPA (NASA Ames) grant NAG2-1214, by
the DARPA (Wright-Patterson AFB) grant F33615-98-C-3614, by the ARO MURI grant DAAH-
04-96-1-0341, and by the Gigascale Silicon Research Center.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: 'Alur R, De Alfaro L, Henzinger TA, Mang F. Automating modular verification.
In: Proceedings of the 10th International Conference on Concurrency Theory.
Vol 1664. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1999:82-97. doi:10.1007/3-540-48320-9_8'
apa: 'Alur, R., De Alfaro, L., Henzinger, T. A., & Mang, F. (1999). Automating
modular verification. In Proceedings of the 10th International Conference on
Concurrency Theory (Vol. 1664, pp. 82–97). Eindhoven, The Netherlands: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-48320-9_8'
chicago: Alur, Rajeev, Luca De Alfaro, Thomas A Henzinger, and Freddy Mang. “Automating
Modular Verification.” In Proceedings of the 10th International Conference
on Concurrency Theory, 1664:82–97. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 1999. https://doi.org/10.1007/3-540-48320-9_8.
ieee: R. Alur, L. De Alfaro, T. A. Henzinger, and F. Mang, “Automating modular verification,”
in Proceedings of the 10th International Conference on Concurrency Theory,
Eindhoven, The Netherlands, 1999, vol. 1664, pp. 82–97.
ista: 'Alur R, De Alfaro L, Henzinger TA, Mang F. 1999. Automating modular verification.
Proceedings of the 10th International Conference on Concurrency Theory. CONCUR:
Concurrency Theory, LNCS, vol. 1664, 82–97.'
mla: Alur, Rajeev, et al. “Automating Modular Verification.” Proceedings of the
10th International Conference on Concurrency Theory, vol. 1664, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 1999, pp. 82–97, doi:10.1007/3-540-48320-9_8.
short: R. Alur, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th
International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 1999, pp. 82–97.
conference:
end_date: 1999-08-27
location: Eindhoven, The Netherlands
name: 'CONCUR: Concurrency Theory'
start_date: 1999-08-24
date_created: 2018-12-11T12:09:42Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2022-09-01T14:15:35Z
day: '01'
doi: 10.1007/3-540-48320-9_8
extern: '1'
intvolume: ' 1664'
language:
- iso: eng
month: '01'
oa_version: None
page: 82 - 97
publication: Proceedings of the 10th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783540664253'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '105'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Automating modular verification
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1664
year: '1999'
...
---
_id: '11895'
abstract:
- lang: eng
text: In this paper we present an analysis of an AltaVista Search Engine query log
consisting of approximately 1 billion entries for search requests over a period
of six weeks. This represents almost 285 million user sessions, each an attempt
to fill a single information need. We present an analysis of individual queries,
query duplication, and query sessions. We also present results of a correlation
analysis of the log entries, studying the interaction of terms within queries.
Our data supports the conjecture that web users differ significantly from the
user assumed in the standard information retrieval literature. Specifically, we
show that web users type in short queries, mostly look at the first 10 results
only, and seldom modify the query. This suggests that traditional information
retrieval techniques may not work well for answering web search requests. The
correlation analysis showed that the most highly correlated items are constituents
of phrases. This result indicates it may be useful for search engines to consider
search terms as parts of phrases even if the user did not explicitly specify them
as such.
article_processing_charge: No
article_type: original
author:
- first_name: Craig
full_name: Silverstein, Craig
last_name: Silverstein
- first_name: Hannes
full_name: Marais, Hannes
last_name: Marais
- 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: Michael
full_name: Moricz, Michael
last_name: Moricz
citation:
ama: Silverstein C, Marais H, Henzinger MH, Moricz M. Analysis of a very large web
search engine query log. ACM SIGIR Forum. 1999;33(1):6-12. doi:10.1145/331403.331405
apa: Silverstein, C., Marais, H., Henzinger, M. H., & Moricz, M. (1999). Analysis
of a very large web search engine query log. ACM SIGIR Forum. Association
for Computing Machinery. https://doi.org/10.1145/331403.331405
chicago: Silverstein, Craig, Hannes Marais, Monika H Henzinger, and Michael Moricz.
“Analysis of a Very Large Web Search Engine Query Log.” ACM SIGIR Forum.
Association for Computing Machinery, 1999. https://doi.org/10.1145/331403.331405.
ieee: C. Silverstein, H. Marais, M. H. Henzinger, and M. Moricz, “Analysis of a
very large web search engine query log,” ACM SIGIR Forum, vol. 33, no.
1. Association for Computing Machinery, pp. 6–12, 1999.
ista: Silverstein C, Marais H, Henzinger MH, Moricz M. 1999. Analysis of a very
large web search engine query log. ACM SIGIR Forum. 33(1), 6–12.
mla: Silverstein, Craig, et al. “Analysis of a Very Large Web Search Engine Query
Log.” ACM SIGIR Forum, vol. 33, no. 1, Association for Computing Machinery,
1999, pp. 6–12, doi:10.1145/331403.331405.
short: C. Silverstein, H. Marais, M.H. Henzinger, M. Moricz, ACM SIGIR Forum 33
(1999) 6–12.
date_created: 2022-08-17T08:53:02Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2023-02-17T14:46:04Z
day: '01'
doi: 10.1145/331403.331405
extern: '1'
intvolume: ' 33'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/331403.331405
month: '01'
oa: 1
oa_version: Published Version
page: 6-12
publication: ACM SIGIR Forum
publication_identifier:
issn:
- 0163-5840
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of a very large web search engine query log
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '1999'
...
---
_id: '11925'
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 NPhard 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\r\nconstant-factor approximation algorithm
for trees, and an O((log log n)*)-factor approximation algorithm for meshes, where
n is the number of nodes in the graph. In the online setting, we give the first
polylogarithrnic competitive online algorithm for tree and mesh topologies. No
polylogarithmic-competitive algorithm is possible on general network topologies
[8] and there\r\nexists a polylogarithmic lower bound on the competitive ratio
of any online algorithm on tree topologies [l]. We prove the same lower bound
for meshes. "
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: Stefano
full_name: Leonardi , Stefano
last_name: 'Leonardi '
citation:
ama: 'Henzinger MH, Leonardi S. Scheduling multicasts on unit-capacity trees
and meshes. In: 10th Annual ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial & Applied Mathematics; 1999:438-447.'
apa: 'Henzinger, M. H., & Leonardi , S. (1999). Scheduling multicasts on unit-capacity
trees and meshes. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms
(pp. 438–447). Baltimore, MD, United States: Society for Industrial & Applied
Mathematics.'
chicago: Henzinger, Monika H, and Stefano Leonardi . “Scheduling Multicasts on
Unit-Capacity Trees and Meshes.” In 10th Annual ACM-SIAM Symposium on Discrete
Algorithms, 438–47. Society for Industrial & Applied Mathematics, 1999.
ieee: M. H. Henzinger and S. Leonardi , “Scheduling multicasts on unit-capacity
trees and meshes,” in 10th Annual ACM-SIAM Symposium on Discrete Algorithms,
Baltimore, MD, United States, 1999, pp. 438–447.
ista: 'Henzinger MH, Leonardi S. 1999. Scheduling multicasts on unit-capacity
trees and meshes. 10th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA:
Symposium on Discrete Algorithms, 438–447.'
mla: Henzinger, Monika H., and Stefano Leonardi . “Scheduling Multicasts on Unit-Capacity
Trees and Meshes.” 10th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial & Applied Mathematics, 1999, pp. 438–47.
short: M.H. Henzinger, S. Leonardi , in:, 10th Annual ACM-SIAM Symposium on Discrete
Algorithms, Society for Industrial & Applied Mathematics, 1999, pp. 438–447.
conference:
end_date: 1999-01-19
location: Baltimore, MD, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 1999-01-17
date_created: 2022-08-18T12:45:50Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2023-02-17T12:08:26Z
day: '01'
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 438-447
publication: 10th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '0898714346'
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling multicasts on unit-capacity trees and meshes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1999'
...
---
_id: '3444'
abstract:
- lang: eng
text: This study examined intermittent, high-frequency (100-200 Hz) oscillatory
patterns in the CA1 region of the hippocampus in the absence of theta activity,
i.e., during and in between sharp wave (SPW) bursts. Pyramidal and interneuronal
activity was phase-locked not only to large amplitude (>7 SD from baseline)
oscillatory events, which are present mainly during SPWs, but to smaller amplitude
(<4 SD) patterns, as well. Large-amplitude events were in the 140-200 Hz, "ripple"
frequency range. Lower-amplitude events, however, contained slower, 100-130 Hz
("slow") oscillatory patterns. Fast ripple waves reversed just below
the CA1 pyramidal layer, whereas slow oscillatory potentials reversed in the stratum
radiatum and/or in the stratum oriens. Parallel CA1-CA3 recordings revealed correlated
CA3 field and unit activity to the slow CA1 waves but not to fast ripple waves.
These findings suggest that fast ripples emerge in the CA1 region, whereas slow
(100-130 Hz) oscillatory patterns are generated in the CA3 region and transferred
to the CA1 field.
article_processing_charge: No
article_type: original
author:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Hajima
full_name: Hirase, Hajima
last_name: Hirase
- first_name: András
full_name: Czurkó, András
last_name: Czurkó
- first_name: Akira
full_name: Mamiya, Akira
last_name: Mamiya
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Csicsvari JL, Hirase H, Czurkó A, Mamiya A, Buzsáki G. Fast network oscillations
in the hippocampal CA1 region of the behaving rat. Journal of Neuroscience.
1999;19(16). doi:10.1523/JNEUROSCI.19-16-j0001.1999
apa: Csicsvari, J. L., Hirase, H., Czurkó, A., Mamiya, A., & Buzsáki, G. (1999).
Fast network oscillations in the hippocampal CA1 region of the behaving rat.
Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999
chicago: Csicsvari, Jozsef L, Hajima Hirase, András Czurkó, Akira Mamiya, and György
Buzsáki. “Fast Network Oscillations in the Hippocampal CA1 Region of the
Behaving Rat.” Journal of Neuroscience. Society for Neuroscience, 1999.
https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999.
ieee: J. L. Csicsvari, H. Hirase, A. Czurkó, A. Mamiya, and G. Buzsáki, “Fast network
oscillations in the hippocampal CA1 region of the behaving rat,” Journal
of Neuroscience, vol. 19, no. 16. Society for Neuroscience, 1999.
ista: Csicsvari JL, Hirase H, Czurkó A, Mamiya A, Buzsáki G. 1999. Fast network
oscillations in the hippocampal CA1 region of the behaving rat. Journal of
Neuroscience. 19(16).
mla: Csicsvari, Jozsef L., et al. “Fast Network Oscillations in the Hippocampal
CA1 Region of the Behaving Rat.” Journal of Neuroscience, vol. 19, no.
16, Society for Neuroscience, 1999, doi:10.1523/JNEUROSCI.19-16-j0001.1999.
short: J.L. Csicsvari, H. Hirase, A. Czurkó, A. Mamiya, G. Buzsáki, Journal of Neuroscience
19 (1999).
date_created: 2018-12-11T12:03:22Z
date_published: 1999-08-15T00:00:00Z
date_updated: 2022-09-07T13:41:18Z
day: '15'
doi: 10.1523/JNEUROSCI.19-16-j0001.1999
extern: '1'
external_id:
pmid:
- '10436076'
intvolume: ' 19'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782850/
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '2943'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast network oscillations in the hippocampal CA1 region of the behaving
rat
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '1999'
...
---
_id: '3445'
abstract:
- lang: eng
text: The medial septal region and the hippocampus are connected reciprocally via
GABAergic neurons, but the physiological role of this loop is still not well understood.
In an attempt to reveal the physiological effects of the hippocamposeptal GABAergic
projection, we cross-correlated hippocampal sharp wave (SPW) ripples or theta
activity and extracellular units recorded in the medial septum and diagonal band
of Broca (MSDB) in freely moving rats. The majority of single MSDB cells (60%)
were significantly suppressed during SPWs. Most cells inhibited during SPW (80%)
fired rhythmically and phase-locked to the negative peak of the CA1 pyramidal
layer theta waves. Because both SPW and the negative peak of local theta waves
correspond to the maximum discharge probability of CA1 pyramidal cells and interneuron
classes, the findings indicate that the activity of medial septal neurons can
be negatively (during SPW) or positively (during theta waves) correlated with
the activity of hippocampal interneurons. We hypothesize that the functional coupling
between medial septal neurons and hippocampal interneurons varies in a state-dependent
manner.
acknowledgement: This work was supported by National Institutes of Health Grants NS34994
and MH54671. We thank Z. Borhegyi, H. Hirase, C. King, and Z. Nadásdy for help and
support and T. F. Freund for his comments on this manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: George
full_name: Dragoi, George
last_name: Dragoi
- first_name: Daniel
full_name: Carpi, Daniel
last_name: Carpi
- first_name: Michael
full_name: Recce, Michael
last_name: Recce
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Dragoi G, Carpi D, Recce M, Csicsvari JL, Buzsáki G. Interactions between hippocampus
and medial septum during sharp waves and theta oscillation in the behaving rat.
Journal of Neuroscience. 1999;19(14):6191-6199. doi:10.1523/JNEUROSCI.19-14-06191.1999
apa: Dragoi, G., Carpi, D., Recce, M., Csicsvari, J. L., & Buzsáki, G. (1999).
Interactions between hippocampus and medial septum during sharp waves and theta
oscillation in the behaving rat. Journal of Neuroscience. Society for Neuroscience.
https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999
chicago: Dragoi, George, Daniel Carpi, Michael Recce, Jozsef L Csicsvari, and György
Buzsáki. “Interactions between Hippocampus and Medial Septum during Sharp Waves
and Theta Oscillation in the Behaving Rat.” Journal of Neuroscience. Society
for Neuroscience, 1999. https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999.
ieee: G. Dragoi, D. Carpi, M. Recce, J. L. Csicsvari, and G. Buzsáki, “Interactions
between hippocampus and medial septum during sharp waves and theta oscillation
in the behaving rat,” Journal of Neuroscience, vol. 19, no. 14. Society
for Neuroscience, pp. 6191–6199, 1999.
ista: Dragoi G, Carpi D, Recce M, Csicsvari JL, Buzsáki G. 1999. Interactions between
hippocampus and medial septum during sharp waves and theta oscillation in the
behaving rat. Journal of Neuroscience. 19(14), 6191–6199.
mla: Dragoi, George, et al. “Interactions between Hippocampus and Medial Septum
during Sharp Waves and Theta Oscillation in the Behaving Rat.” Journal of Neuroscience,
vol. 19, no. 14, Society for Neuroscience, 1999, pp. 6191–99, doi:10.1523/JNEUROSCI.19-14-06191.1999.
short: G. Dragoi, D. Carpi, M. Recce, J.L. Csicsvari, G. Buzsáki, Journal of Neuroscience
19 (1999) 6191–6199.
date_created: 2018-12-11T12:03:22Z
date_published: 1999-07-15T00:00:00Z
date_updated: 2022-09-07T13:37:41Z
day: '15'
doi: 10.1523/JNEUROSCI.19-14-06191.1999
extern: '1'
external_id:
pmid:
- '10407055'
intvolume: ' 19'
issue: '14'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6783073/
month: '07'
oa: 1
oa_version: Published Version
page: 6191 - 6199
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '2942'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interactions between hippocampus and medial septum during sharp waves and theta
oscillation in the behaving rat
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '1999'
...
---
_id: '3456'
abstract:
- lang: eng
text: L-a-amino-3-hydroxy-5-methyl-4-isoxazolepropionate receptors (AMPARs) and
N-methyl-D-aspartate receptors (NMDARs) are the two major types of postsynaptic
glutamate receptors (GluRs) that mediate excitatory synaptic transmission in the
mammalian central nervous system (CNS). Both AMPARs and NMDARs are multimeric
proteins, probably tetramers, formed by a variety of molecularly distinct subunits.
AMPARs can be assembled from four types of subunits, termed GIuR-A, -B, -C, and
-D (or, in an alternative nomenclature, G1uR1, G1uR2, GluR3, and G1uR4). Additional
molecular diversity of AMPARs is generated by alternative splicing of the flip-flop
module and RNA editing at the Q/R and R/G site. NMDARs are heteromers primarily
assembled from NR1 subunits and NR2A, B, C, or D subunits. Various splice variants
have been identified for the NR1 subunit, and a new NR3 subunit has been discovered
recently. Considering all combinatorial possibilities, the molecular diversity
of glutamate-receptor channels is considerable (HOLLMANN, this volume).
alternative_title:
- Handbook of experimental pharmacology
article_processing_charge: No
author:
- first_name: Hannah
full_name: Monyer, Hannah
last_name: Monyer
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Jean
full_name: Rossier, Jean
last_name: Rossier
citation:
ama: 'Monyer H, Jonas PM, Rossier J. Molecular determinants controlling functional
properties of AMPARs and NMDARs in the mammalian CNS. In: Jonas PM, Monyer H,
eds. Ionotropic Glutamate Receptors in the CNS. Vol 141. Springer; 1999:309-339.
doi:10.1007/978-3-662-08022-1_9'
apa: Monyer, H., Jonas, P. M., & Rossier, J. (1999). Molecular determinants
controlling functional properties of AMPARs and NMDARs in the mammalian CNS. In
P. M. Jonas & H. Monyer (Eds.), Ionotropic Glutamate Receptors in the CNS
(Vol. 141, pp. 309–339). Springer. https://doi.org/10.1007/978-3-662-08022-1_9
chicago: Monyer, Hannah, Peter M Jonas, and Jean Rossier. “Molecular Determinants
Controlling Functional Properties of AMPARs and NMDARs in the Mammalian CNS.”
In Ionotropic Glutamate Receptors in the CNS, edited by Peter M Jonas and
Hannah Monyer, 141:309–39. Springer, 1999. https://doi.org/10.1007/978-3-662-08022-1_9.
ieee: H. Monyer, P. M. Jonas, and J. Rossier, “Molecular determinants controlling
functional properties of AMPARs and NMDARs in the mammalian CNS,” in Ionotropic
Glutamate Receptors in the CNS, vol. 141, P. M. Jonas and H. Monyer, Eds.
Springer, 1999, pp. 309–339.
ista: 'Monyer H, Jonas PM, Rossier J. 1999.Molecular determinants controlling functional
properties of AMPARs and NMDARs in the mammalian CNS. In: Ionotropic Glutamate
Receptors in the CNS. Handbook of experimental pharmacology, vol. 141, 309–339.'
mla: Monyer, Hannah, et al. “Molecular Determinants Controlling Functional Properties
of AMPARs and NMDARs in the Mammalian CNS.” Ionotropic Glutamate Receptors
in the CNS, edited by Peter M Jonas and Hannah Monyer, vol. 141, Springer,
1999, pp. 309–39, doi:10.1007/978-3-662-08022-1_9.
short: H. Monyer, P.M. Jonas, J. Rossier, in:, P.M. Jonas, H. Monyer (Eds.), Ionotropic
Glutamate Receptors in the CNS, Springer, 1999, pp. 309–339.
date_created: 2018-12-11T12:03:25Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2022-09-07T13:30:23Z
day: '01'
doi: 10.1007/978-3-662-08022-1_9
editor:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Hannah
full_name: Monyer, Hannah
last_name: Monyer
extern: '1'
intvolume: ' 141'
language:
- iso: eng
month: '01'
oa_version: None
page: 309 - 339
publication: Ionotropic Glutamate Receptors in the CNS
publication_identifier:
isbn:
- '9783642085390'
publication_status: published
publisher: Springer
publist_id: '2931'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular determinants controlling functional properties of AMPARs and NMDARs
in the mammalian CNS
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 141
year: '1999'
...
---
_id: '3457'
abstract:
- lang: eng
text: Principal neurons and interneurons are the two main classes of cells in cortical
neuronal networks. Principal neurons (granule cells or pyramidal neurons) have
transregional axonal projections and release glutamate onto their postsynaptic
target cells. In contrast, interneurons have local, but often extensive, axonal
arborizations and use γ-aminobutyric acid (GABA) as a transmitter. Although interneurons
represent only approximately 10% of the neuronal population, they control the
electrical activity of the entire network (FREUND and BUZSÁKI 1996). Interneurons
forming inhibitory synapses on the somata or axon initial segments of their postsynaptic
target cells are thought to set the threshold of action potential initiation (MILES
et al. 1996) and can synchronize the collective activities of large principal
neuron ensembles (COBB et al. 1995). In contrast, interneurons establishing inhibitory
synapses mainly on dendrites could suppress dendritic Na+ or Ca2+ spikes (BUZSÁKI
et al. 1996; MILES et al. 1996) and, thus, regulate plasticity at glutamatergic
synapses in the cortex (DAVIES et al.1991).
alternative_title:
- Handbook of experimental pharmacology
article_processing_charge: No
author:
- first_name: Jörg
full_name: Geiger, Jörg
last_name: Geiger
- first_name: Arnd
full_name: Roth, Arnd
last_name: Roth
- first_name: Birol
full_name: Taskin, Birol
last_name: Taskin
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: 'Geiger J, Roth A, Taskin B, Jonas PM. Glutamate-mediated synaptic excitation
of cortical interneurons. In: Monyer H, Jonas PM, eds. Ionotropic Glutamate
Receptors in the CNS. Vol 141. Springer; 1999:363-398. doi:10.1007/978-3-662-08022-1_11'
apa: Geiger, J., Roth, A., Taskin, B., & Jonas, P. M. (1999). Glutamate-mediated
synaptic excitation of cortical interneurons. In H. Monyer & P. M. Jonas (Eds.),
Ionotropic Glutamate Receptors in the CNS (Vol. 141, pp. 363–398). Springer.
https://doi.org/10.1007/978-3-662-08022-1_11
chicago: Geiger, Jörg, Arnd Roth, Birol Taskin, and Peter M Jonas. “Glutamate-Mediated
Synaptic Excitation of Cortical Interneurons.” In Ionotropic Glutamate Receptors
in the CNS, edited by Hannah Monyer and Peter M Jonas, 141:363–98. Springer,
1999. https://doi.org/10.1007/978-3-662-08022-1_11.
ieee: J. Geiger, A. Roth, B. Taskin, and P. M. Jonas, “Glutamate-mediated synaptic
excitation of cortical interneurons,” in Ionotropic Glutamate Receptors in
the CNS, vol. 141, H. Monyer and P. M. Jonas, Eds. Springer, 1999, pp. 363–398.
ista: 'Geiger J, Roth A, Taskin B, Jonas PM. 1999.Glutamate-mediated synaptic excitation
of cortical interneurons. In: Ionotropic Glutamate Receptors in the CNS. Handbook
of experimental pharmacology, vol. 141, 363–398.'
mla: Geiger, Jörg, et al. “Glutamate-Mediated Synaptic Excitation of Cortical Interneurons.”
Ionotropic Glutamate Receptors in the CNS, edited by Hannah Monyer and
Peter M Jonas, vol. 141, Springer, 1999, pp. 363–98, doi:10.1007/978-3-662-08022-1_11.
short: J. Geiger, A. Roth, B. Taskin, P.M. Jonas, in:, H. Monyer, P.M. Jonas (Eds.),
Ionotropic Glutamate Receptors in the CNS, Springer, 1999, pp. 363–398.
date_created: 2018-12-11T12:03:26Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2022-09-07T13:25:46Z
day: '01'
doi: 10.1007/978-3-662-08022-1_11
editor:
- first_name: Hannah
full_name: Monyer, Hannah
last_name: Monyer
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
extern: '1'
intvolume: ' 141'
language:
- iso: eng
month: '01'
oa_version: None
page: 363 - 398
publication: Ionotropic Glutamate Receptors in the CNS
publication_identifier:
isbn:
- '9783642085390'
publication_status: published
publisher: Springer
publist_id: '2930'
quality_controlled: '1'
status: public
title: Glutamate-mediated synaptic excitation of cortical interneurons
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 141
year: '1999'
...