---
_id: '4492'
abstract:
- lang: eng
text: Hybrid automata model systems with both digital and analog components, such
as embedded control programs. Many verification tasks for such programs can be
expressed as reachability problems for hybrid automata. By improving on previous
decidability and undecidability results, we identify a boundary between decidability
and undecidability for the reachability problem of hybrid automata. On the positive
side, we give an (optimal) PSPACE reachability algorithm for the case of initialized
rectangular automata, where all analog variables follow independent trajectories
within piecewise-linear envelopes and are reinitialized whenever the envelope
changes. Our algorithm is based on the construction of a timed automaton that
contains all reachability information about a given initialized rectangular automaton.
The translation has practical significance for verification, because it guarantees
the termination of symbolic procedures for the reachability analysis of initialized
rectangular automata. The translation also preserves theω-languages of initialized
rectangular automata with bounded nondeterminism. On the negative side, we show
that several slight generalizations of initialized rectangular automata lead to
an undecidable reachability problem. In particular, we prove that the reachability
problem is undecidable for timed automata augmented with a single stopwatch.
acknowledgement: This research was supported in part by the Office of Naval Research
Young Investigator Award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation Grant CCR-9504469, by the
Air Force Office of Scientific Research Contract F49620-93-1-0056, by the Army Research
Office MURI Grant DAAH-04-96-1-0341, by the Army Research Office Contract DAAH-04-94-G-0026,
by the Defense Advanced Research Projects Agency Grant NAG2-892, and by the California
PATH program.
article_processing_charge: No
article_type: original
author:
- 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: Peter
full_name: Kopke, Peter
last_name: Kopke
- first_name: Anuj
full_name: Puri, Anuj
last_name: Puri
- first_name: P.
full_name: Varaiya, P.
last_name: Varaiya
citation:
ama: Henzinger TA, Kopke P, Puri A, Varaiya P. What’s decidable about hybrid automata?
Journal of Computer and System Sciences. 1998;57(1):94-124. doi:10.1006/jcss.1998.1581
apa: Henzinger, T. A., Kopke, P., Puri, A., & Varaiya, P. (1998). What’s decidable
about hybrid automata? Journal of Computer and System Sciences. Elsevier.
https://doi.org/10.1006/jcss.1998.1581
chicago: Henzinger, Thomas A, Peter Kopke, Anuj Puri, and P. Varaiya. “What’s Decidable
about Hybrid Automata?” Journal of Computer and System Sciences. Elsevier,
1998. https://doi.org/10.1006/jcss.1998.1581.
ieee: T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about
hybrid automata?,” Journal of Computer and System Sciences, vol. 57, no.
1. Elsevier, pp. 94–124, 1998.
ista: Henzinger TA, Kopke P, Puri A, Varaiya P. 1998. What’s decidable about hybrid
automata? Journal of Computer and System Sciences. 57(1), 94–124.
mla: Henzinger, Thomas A., et al. “What’s Decidable about Hybrid Automata?” Journal
of Computer and System Sciences, vol. 57, no. 1, Elsevier, 1998, pp. 94–124,
doi:10.1006/jcss.1998.1581.
short: T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, Journal of Computer and System
Sciences 57 (1998) 94–124.
date_created: 2018-12-11T12:09:08Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T14:29:15Z
day: '01'
doi: 10.1006/jcss.1998.1581
extern: '1'
intvolume: ' 57'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0022000098915811
month: '01'
oa: 1
oa_version: Published Version
page: 94 - 124
publication: Journal of Computer and System Sciences
publication_identifier:
isbn:
- 0022-0000
publication_status: published
publisher: Elsevier
publist_id: '237'
quality_controlled: '1'
status: public
title: What's decidable about hybrid automata?
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 57
year: '1998'
...
---
_id: '4515'
abstract:
- lang: eng
text: We summarize and reorganize some of the last decade's research on real-time
extensions of temporal logic. Our main focus is on tableau constructions for model
checking linear temporal formulas with timing constraints. In particular, we find
that a great deal of real-time verification can be performed in polynomial space,
but also that considerable care must be exercised in order to keep the real-time
verification problem in polynomial space, or even decidable.
acknowledgement: This research was supported in part by the Office of Naval Research
Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the
Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research
Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation
contract 97-DC-324.041.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: 'Henzinger TA. It’s about time: Real-time logics reviewed. In: Proceedings
of the 9th Interantional Conference on Concurrency Theory. Vol 1466. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 1998:439-454. doi:10.1007/BFb0055640'
apa: 'Henzinger, T. A. (1998). It’s about time: Real-time logics reviewed. In Proceedings
of the 9th Interantional Conference on Concurrency Theory (Vol. 1466, pp.
439–454). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055640'
chicago: 'Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed.” In
Proceedings of the 9th Interantional Conference on Concurrency Theory,
1466:439–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. https://doi.org/10.1007/BFb0055640.'
ieee: 'T. A. Henzinger, “It’s about time: Real-time logics reviewed,” in Proceedings
of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998,
vol. 1466, pp. 439–454.'
ista: 'Henzinger TA. 1998. It’s about time: Real-time logics reviewed. Proceedings
of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency
Theory, LNCS, vol. 1466, 439–454.'
mla: 'Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed.” Proceedings
of the 9th Interantional Conference on Concurrency Theory, vol. 1466, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–54, doi:10.1007/BFb0055640.'
short: T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency
Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–454.
conference:
end_date: 1998-09-11
location: Nice, France
name: 'CONCUR: Concurrency Theory'
start_date: 1998-09-08
date_created: 2018-12-11T12:09:15Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T14:24:08Z
day: '01'
doi: 10.1007/BFb0055640
extern: '1'
intvolume: ' 1466'
language:
- iso: eng
month: '01'
oa_version: None
page: 439 - 454
publication: Proceedings of the 9th Interantional Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-540-64896-3
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '214'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'It''s about time: Real-time logics reviewed'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1466
year: '1998'
...
---
_id: '4603'
abstract:
- lang: eng
text: Alternating transition systems are a general model for composite systems which
allow the study of collaborative as well as adversarial relationships between
individual system components. Unlike in labeled transition systems, where each
transition corresponds to a possible step of the system (which may involve some
or all components), in alternating transition systems, each transition corresponds
to a possible move in a game between the components. In this paper, we study refinement
relations between alternating transition systems, such as “Does the implementation
refine the set A of specification components without constraining the components
not in A?” In particular, we generalize the definitions of the simulation and
trace containment preorders from labeled transition systems to alternating transition
systems. The generalizations are called alternating simulation and alternating
trace containment. Unlike existing refinement relations, they allow the refinement
of individual components within the context of a composite system description.
We show that, like ordinary simulation, alternating simulation can be checked
in polynomial time using a fixpoint computation algorithm. While ordinary trace
containment is PSPACE-complete, we establish alternating trace containment to
be EXPTIME-complete. Finally, we present logical characterizations for the two
preorders in terms of ATL, a temporal logic capable of referring to games between
system components.
acknowledgement: This work is supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grants CCR-9504469, CCR-9628400,
and CCR-9700061, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341,
by the SRC contract 97-DC-324.041, and by a grant from the Intel Corporation.
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
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: 'Alur R, Henzinger TA, Kupferman O, Vardi M. Alternating refinement relations.
In: Proceedings of the 9th Interantional Conference on Concurrency Theory.
Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:163-178. doi:10.1007/BFb0055622'
apa: 'Alur, R., Henzinger, T. A., Kupferman, O., & Vardi, M. (1998). Alternating
refinement relations. In Proceedings of the 9th Interantional Conference on
Concurrency Theory (Vol. 1466, pp. 163–178). Nice, France: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055622'
chicago: Alur, Rajeev, Thomas A Henzinger, Orna Kupferman, and Moshe Vardi. “Alternating
Refinement Relations.” In Proceedings of the 9th Interantional Conference on
Concurrency Theory, 1466:163–78. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
1998. https://doi.org/10.1007/BFb0055622.
ieee: R. Alur, T. A. Henzinger, O. Kupferman, and M. Vardi, “Alternating refinement
relations,” in Proceedings of the 9th Interantional Conference on Concurrency
Theory, Nice, France, 1998, vol. 1466, pp. 163–178.
ista: 'Alur R, Henzinger TA, Kupferman O, Vardi M. 1998. Alternating refinement
relations. Proceedings of the 9th Interantional Conference on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 1466, 163–178.'
mla: Alur, Rajeev, et al. “Alternating Refinement Relations.” Proceedings of
the 9th Interantional Conference on Concurrency Theory, vol. 1466, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–78, doi:10.1007/BFb0055622.
short: R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Proceedings of the
9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 1998, pp. 163–178.
conference:
end_date: 1998-09-11
location: Nice, France
name: 'CONCUR: Concurrency Theory'
start_date: 1998-09-08
date_created: 2018-12-11T12:09:42Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T09:50:34Z
day: '01'
doi: 10.1007/BFb0055622
extern: '1'
intvolume: ' 1466'
language:
- iso: eng
month: '01'
oa_version: None
page: 163 - 178
publication: Proceedings of the 9th Interantional Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-540-64896-3
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '104'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Alternating refinement relations
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1466
year: '1998'
...
---
_id: '4604'
acknowledgement: This research 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 ARO MURI
grant DAAH-04-96-1-0341, 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: Freddy
full_name: Mang, Freddy
last_name: Mang
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
- first_name: Serdar
full_name: Tasiran, Serdar
last_name: Tasiran
citation:
ama: 'Alur R, Henzinger TA, Mang F, Qadeer S, Rajamani S, Tasiran S. Mocha: Modularity
in model checking. In: Proceedings of the 10th International Conference on
Computer Aided Verification. Vol 1427. Springer; 1998:521-525. doi:10.1007/BFb0028774'
apa: 'Alur, R., Henzinger, T. A., Mang, F., Qadeer, S., Rajamani, S., & Tasiran,
S. (1998). Mocha: Modularity in model checking. In Proceedings of the 10th
International Conference on Computer Aided Verification (Vol. 1427, pp. 521–525).
Vancouver, Canada: Springer. https://doi.org/10.1007/BFb0028774'
chicago: 'Alur, Rajeev, Thomas A Henzinger, Freddy Mang, Shaz Qadeer, Sriram Rajamani,
and Serdar Tasiran. “Mocha: Modularity in Model Checking.” In Proceedings of
the 10th International Conference on Computer Aided Verification, 1427:521–25.
Springer, 1998. https://doi.org/10.1007/BFb0028774.'
ieee: 'R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran,
“Mocha: Modularity in model checking,” in Proceedings of the 10th International
Conference on Computer Aided Verification, Vancouver, Canada, 1998, vol. 1427,
pp. 521–525.'
ista: 'Alur R, Henzinger TA, Mang F, Qadeer S, Rajamani S, Tasiran S. 1998. Mocha:
Modularity in model checking. Proceedings of the 10th International Conference
on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427,
521–525.'
mla: 'Alur, Rajeev, et al. “Mocha: Modularity in Model Checking.” Proceedings
of the 10th International Conference on Computer Aided Verification, vol.
1427, Springer, 1998, pp. 521–25, doi:10.1007/BFb0028774.'
short: R. Alur, T.A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, S. Tasiran, in:,
Proceedings of the 10th International Conference on Computer Aided Verification,
Springer, 1998, pp. 521–525.
conference:
end_date: 1998-07-02
location: Vancouver, Canada
name: 'CAV: Computer Aided Verification'
start_date: 1998-06-28
date_created: 2018-12-11T12:09:42Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T09:06:21Z
day: '01'
doi: 10.1007/BFb0028774
extern: '1'
intvolume: ' 1427'
language:
- iso: eng
month: '01'
oa_version: None
page: 521 - 525
publication: Proceedings of the 10th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540646082'
publication_status: published
publisher: Springer
publist_id: '103'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mocha: Modularity in model checking'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1427
year: '1998'
...
---
_id: '4606'
abstract:
- lang: eng
text: "In formal design verification, successful model checking is typically preceded
by a laborious manual process of constructing design abstractions. We present
a methodology for partially—and in some cases, fully—bypassing the abstraction
process. For this purpose, we provide to the designer abstraction operators which,
if used judiciously in the description of a design, structure the corresponding
state space hierarchically. This structure can then be exploited by verification
tools, and makes possible the automatic and exhaustive exploration of state spaces
that would otherwise be out of scope for existing model checkers.\r\nSpecifically,
we present the following contributions:\r\n- \t A temporal abstraction operator
that aggregates transitions and hides intermediate steps. Mathematically, our
abstraction operator is a function that maps a flat transition system into a two-level
hierarchy where each atomic upper-level transition expands into an entire lower-level
transition system. For example, an arithmetic operation may expand into a sequence
of bit operations.\r\n- \t A BDD-based algorithm for the symbolic exploration
of multi-level hierarchies of transition systems. The algorithm traverses a level-n
transition by expanding the corresponding level-(n − 1) transition system on-the-fly.
The level-n successors of a state are determined by computing a level-(n − 1)
reach set, which is then immediately released from memory. In this fashion, we
can exhaustively explore hierarchically structured state spaces whose flat counterparts
cause memory overflows.\r\n- \t We experimentally demonstrate the efficiency of
our method with three examples—a multiplier, a cache coherence protocol, and a
multiprocessor system. In the first two examples, we obtain significant improvements
in run times and peak BDD sizes over traditional state-space search. The third
example cannot be model checked at all using conventional methods (without manual
abstractions), but can be analyzed fully automatically using transition hierarchies."
acknowledgement: "This research was supported in part by the Office of Naval Research
Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the
Air Force Office of Scientific Research contract F49620-93-1-0056, by the Army Research
Office MURI grant DAAH-04-96-1-0341, by the Advanced Research Projects Agency grant
NAG2-892, and by the Semiconductor Research Corporation contract 95-DC-324.036.\r\n"
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: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: 'Alur R, Henzinger TA, Rajamani S. Symbolic exploration of transition hierarchies.
In: Proceedings of the 4th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. Vol 1384. Springer; 1998:330-344.
doi:10.1007/BFb0054181'
apa: 'Alur, R., Henzinger, T. A., & Rajamani, S. (1998). Symbolic exploration
of transition hierarchies. In Proceedings of the 4th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems (Vol.
1384, pp. 330–344). Lisbon, Portugal: Springer. https://doi.org/10.1007/BFb0054181'
chicago: Alur, Rajeev, Thomas A Henzinger, and Sriram Rajamani. “Symbolic Exploration
of Transition Hierarchies.” In Proceedings of the 4th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, 1384:330–44.
Springer, 1998. https://doi.org/10.1007/BFb0054181.
ieee: R. Alur, T. A. Henzinger, and S. Rajamani, “Symbolic exploration of transition
hierarchies,” in Proceedings of the 4th International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal,
1998, vol. 1384, pp. 330–344.
ista: 'Alur R, Henzinger TA, Rajamani S. 1998. Symbolic exploration of transition
hierarchies. Proceedings of the 4th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 1384, 330–344.'
mla: Alur, Rajeev, et al. “Symbolic Exploration of Transition Hierarchies.” Proceedings
of the 4th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, vol. 1384, Springer, 1998, pp. 330–44, doi:10.1007/BFb0054181.
short: R. Alur, T.A. Henzinger, S. Rajamani, in:, Proceedings of the 4th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems,
Springer, 1998, pp. 330–344.
conference:
end_date: 1998-04-04
location: Lisbon, Portugal
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 1998-03-28
date_created: 2018-12-11T12:09:43Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T08:44:36Z
day: '01'
doi: 10.1007/BFb0054181
extern: '1'
intvolume: ' 1384'
language:
- iso: eng
month: '01'
oa_version: None
page: 330 - 344
publication: Proceedings of the 4th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems
publication_identifier:
isbn:
- '9783540643562'
publication_status: published
publisher: Springer
publist_id: '102'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic exploration of transition hierarchies
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1384
year: '1998'
...
---
_id: '4639'
abstract:
- lang: eng
text: 'An open system can be modeled as a two-player game between the system and
its environment. At each round of the game, player 1 (the system) and player 2
(the environment) independently and simultaneously choose moves, and the two choices
determine the next state of the game. Properties of open systems can be modeled
as objectives of these two-player games. For the basic objective of reachability-can
player 1 force the game to a given set of target states?-there are three types
of winning states, according to the degree of certainty with which player 1 can
reach the target. From type-1 states, player 1 has a deterministic strategy to
always reach the target. From type-2 states, player 1 has a randomized strategy
to reach the target with probability 1. From type-3 states, player 1 has for every
real ε>0 a randomized strategy to reach the target with probability greater
than 1-ε. We show that for finite state spaces, all three sets of winning states
can be computed in polynomial time: type-1 states in linear time, and type-2 and
type-3 states in quadratic time. The algorithms to compute the three sets of winning
states also enable the construction of the winning and spoiling strategies. Finally,
we apply our results by introducing a temporal logic in which all three kinds
of winning conditions can be specified, and which can be model checked in polynomial
time. This logic, called Randomized ATL, is suitable for reasoning about randomized
behavior in open (two-agent) as well as multi-agent systems'
article_processing_charge: No
author:
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'De Alfaro L, Henzinger TA, Kupferman O. Concurrent reachability games. In:
Proceedings 39th Annual Symposium on Foundations of Computer Science.
IEEE; 1998:564-575. doi:10.1109/SFCS.1998.743507
'
apa: 'De Alfaro, L., Henzinger, T. A., & Kupferman, O. (1998). Concurrent reachability
games. In Proceedings 39th Annual Symposium on Foundations of Computer Science
(pp. 564–575). Palo Alto, CA, United States of America: IEEE. https://doi.org/10.1109/SFCS.1998.743507 '
chicago: De Alfaro, Luca, Thomas A Henzinger, and Orna Kupferman. “Concurrent Reachability
Games.” In Proceedings 39th Annual Symposium on Foundations of Computer Science,
564–75. IEEE, 1998. https://doi.org/10.1109/SFCS.1998.743507
.
ieee: L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability
games,” in Proceedings 39th Annual Symposium on Foundations of Computer Science,
Palo Alto, CA, United States of America, 1998, pp. 564–575.
ista: 'De Alfaro L, Henzinger TA, Kupferman O. 1998. Concurrent reachability games. Proceedings
39th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of
Computer Science, 564–575.'
mla: De Alfaro, Luca, et al. “Concurrent Reachability Games.” Proceedings 39th
Annual Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–75,
doi:10.1109/SFCS.1998.743507
.
short: L. De Alfaro, T.A. Henzinger, O. Kupferman, in:, Proceedings 39th Annual
Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–575.
conference:
end_date: 1998-11-11
location: Palo Alto, CA, United States of America
name: 'FOCS: Foundations of Computer Science'
start_date: 1998-11-08
date_created: 2018-12-11T12:09:53Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-22T14:09:02Z
day: '01'
doi: '10.1109/SFCS.1998.743507 '
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 564 - 575
publication: ' Proceedings 39th Annual Symposium on Foundations of Computer Science'
publication_identifier:
isbn:
- '0818691727'
publication_status: published
publisher: IEEE
publist_id: '68'
quality_controlled: '1'
status: public
title: Concurrent reachability games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1998'
...
---
_id: '2583'
abstract:
- lang: eng
text: Substance P receptor (SPR)-immunoreactive neurons projecting to the periaqueductal
gray (PAG) were examined in the rat spinal trigeminal nucleus and spinal cord
by a retrograde tracing method combined with immunofluorescence histochemistry.
After injection of Fluoro-gold (FG) into the PAG, SPR-immunoreactive neurons labeled
with FG were observed mainly in the lateral spinal nucleus and lamina I of the
medullary and spinal dorsal horns and additionally in laminae V and X of the spinal
cord.
acknowledgement: "The authors are grateful for the support of Dr Kajitaro Morita of
the Morita Clinic of Internal Medicine and Pediatrics at Kadoma, Osaka and for the
help of Yue-Ping Yuan and Akira Uesugi with photography. This work was supported
in part by Grants-in-Aid from the National Natural Science Foundation of China (39600045)
and the Ministry of Education, Sci-\r\nence, Sports and Culture of Japan (09480211,
08458245)."
article_processing_charge: No
article_type: original
author:
- first_name: Jin
full_name: Li, Jin
last_name: Li
- first_name: Yu
full_name: Ding, Yu
last_name: Ding
- first_name: Kang
full_name: Xiong, Kang
last_name: Xiong
- first_name: Ji
full_name: Li, Ji
last_name: Li
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Noboru
full_name: Mizuno, Noboru
last_name: Mizuno
citation:
ama: 'Li J, Ding Y, Xiong K, Li J, Shigemoto R, Mizuno N. Substance P receptor (NK1)-immunoreactive
neurons projecting to the periaqueductal gray: Distribution in the spinal trigeminal
nucleus and the spinal cord of the rat. Neuroscience Research. 1998;30(3):219-225.
doi:10.1016/S0168-0102(97)00132-6'
apa: 'Li, J., Ding, Y., Xiong, K., Li, J., Shigemoto, R., & Mizuno, N. (1998).
Substance P receptor (NK1)-immunoreactive neurons projecting to the periaqueductal
gray: Distribution in the spinal trigeminal nucleus and the spinal cord of the
rat. Neuroscience Research. Elsevier. https://doi.org/10.1016/S0168-0102(97)00132-6'
chicago: 'Li, Jin, Yu Ding, Kang Xiong, Ji Li, Ryuichi Shigemoto, and Noboru Mizuno.
“Substance P Receptor (NK1)-Immunoreactive Neurons Projecting to the Periaqueductal
Gray: Distribution in the Spinal Trigeminal Nucleus and the Spinal Cord of the
Rat.” Neuroscience Research. Elsevier, 1998. https://doi.org/10.1016/S0168-0102(97)00132-6.'
ieee: 'J. Li, Y. Ding, K. Xiong, J. Li, R. Shigemoto, and N. Mizuno, “Substance
P receptor (NK1)-immunoreactive neurons projecting to the periaqueductal gray:
Distribution in the spinal trigeminal nucleus and the spinal cord of the rat,”
Neuroscience Research, vol. 30, no. 3. Elsevier, pp. 219–225, 1998.'
ista: 'Li J, Ding Y, Xiong K, Li J, Shigemoto R, Mizuno N. 1998. Substance P receptor
(NK1)-immunoreactive neurons projecting to the periaqueductal gray: Distribution
in the spinal trigeminal nucleus and the spinal cord of the rat. Neuroscience
Research. 30(3), 219–225.'
mla: 'Li, Jin, et al. “Substance P Receptor (NK1)-Immunoreactive Neurons Projecting
to the Periaqueductal Gray: Distribution in the Spinal Trigeminal Nucleus and
the Spinal Cord of the Rat.” Neuroscience Research, vol. 30, no. 3, Elsevier,
1998, pp. 219–25, doi:10.1016/S0168-0102(97)00132-6.'
short: J. Li, Y. Ding, K. Xiong, J. Li, R. Shigemoto, N. Mizuno, Neuroscience Research
30 (1998) 219–225.
date_created: 2018-12-11T11:58:31Z
date_published: 1998-03-01T00:00:00Z
date_updated: 2022-09-01T12:19:44Z
day: '01'
doi: 10.1016/S0168-0102(97)00132-6
extern: '1'
external_id:
pmid:
- '9593332'
intvolume: ' 30'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 219 - 225
pmid: 1
publication: Neuroscience Research
publication_identifier:
issn:
- 0168-0102
publication_status: published
publisher: Elsevier
publist_id: '4315'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Substance P receptor (NK1)-immunoreactive neurons projecting to the periaqueductal
gray: Distribution in the spinal trigeminal nucleus and the spinal cord of the rat'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 30
year: '1998'
...
---
_id: '2584'
abstract:
- lang: eng
text: The distributions of two alternative splicing variants of metabotropic glutamate
receptor mGluR7, mGluR7a and mGluR7b, were examined immunohistochemically in the
rat and mouse by using variant-specific antibodies raised against C-terminal portions
of rat mGluR7a and human mGluR7b. Many regions throughout the central nervous
system (CNS) showed mGluR7-like immunoreactivities (LI). The distribution patterns
of mGluR7-LI in the rat were substantially the same as those in the mouse, although
some species differences were observed in a few regions. Intense mGluR7a-LI was
seen in the main and accessory olfactory bulbs, anterior olfactory nucleus, islands
of Calleja, superficial layers of the olfactory tubercle, piriform cortex and
entorhinal cortex, periamygdaloid cortex, amygdalohippocampal area, hippocampus,
layer I of the neocortical regions, globus pallidus, superficial layers of the
superior colliculus, locus coeruleus, and superficial layers of the medullary
and spinal dorsal horns. The distribution of mGluR7b was more restricted. It was
intense in the islands of Calleja, substantia innominata, hippocampus, ventral
pallidum, and globus pallidus. The medial habenular nucleus also showed intense
mGluR7a-LI in the rat but not in the mouse. For both mGluR7a- and mGluR7b-LI,
localization in the active zones of presynaptic axon terminals was confirmed electron
microscopically at synapses of both the asymmetrical and symmetrical types. It
is noteworthy that mGluR7a-LI is seen preferentially in relay nuclei of the sensory
pathways and that both mGluR7a- and mGluR7b-LI are observed not only in presumed
glutamatergic axon terminals, but also in non-glutamatergic axon terminals including
presumed inhibitory ones. Thus, mGluR7 may play roles not only as an autoreceptor
in glutamatergic axon terminals, but also as a presynaptic heteroreceptor in non-glutamatergic
axon terminals in various CNS regions.
acknowledgement: The authors are grateful for photographic help of Mr.Akira
Uesugi, and the support of Dr. Kajitaro Morita inMorita Clinic of Internal Medicine
and Pediatrics, Kadoma,Osaka, Japan. The authors also express gratitude for thesupport of Dr. Satoru Fukuchi, Dr. Ritsu Hayashi, Dr.Sohzaburo Hayashi, Dr. Mizuho Katsurada, Dr. HitoshiKawai,
Dr. Yutaka Kitani, Dr. Toshihiko Kuroda, Dr. KeikoKumagai, Dr. Hiroshi Matsubara, Dr. Hiroshi Mat-sushima, Dr. Chisato Minakuchi, Dr. Gonpei Niwa, Dr.Hajime
Oda, Dr. Mashiko Ohbayashi, Dr. Sei-ichi Ohbaya-shi, Dr. Hiroyasu Ohtsuka, Dr. Shigeo
Tamaki, Dr. EizoWatanabe, Dr. Kazuo Yoshino, and Dr. Toshiaki Yoshino.
article_processing_charge: No
article_type: original
author:
- first_name: Ayae
full_name: Kinoshita, Ayae
last_name: Kinoshita
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Hitoshi
full_name: Ohishi, Hitoshi
last_name: Ohishi
- first_name: Herman
full_name: Van Der Putten, Herman
last_name: Van Der Putten
- first_name: Noboru
full_name: Mizuno, Noboru
last_name: Mizuno
citation:
ama: 'Kinoshita A, Shigemoto R, Ohishi H, Van Der Putten H, Mizuno N. Immunohistochemical
localization of metabotropic glutamate receptors, mGluR7a and mGluR7b, in the
central nervous system of the adult rat and mouse: A light and electron microscopic
study. Journal of Comparative Neurology. 1998;393(3):332-352. doi:10.1002/(SICI)1096-9861(19980413)393:3<332::AID-CNE6>3.0.CO;2-2'
apa: 'Kinoshita, A., Shigemoto, R., Ohishi, H., Van Der Putten, H., & Mizuno,
N. (1998). Immunohistochemical localization of metabotropic glutamate receptors,
mGluR7a and mGluR7b, in the central nervous system of the adult rat and mouse:
A light and electron microscopic study. Journal of Comparative Neurology.
Wiley-Blackwell. https://doi.org/10.1002/(SICI)1096-9861(19980413)393:3<332::AID-CNE6>3.0.CO;2-2'
chicago: 'Kinoshita, Ayae, Ryuichi Shigemoto, Hitoshi Ohishi, Herman Van Der Putten,
and Noboru Mizuno. “Immunohistochemical Localization of Metabotropic Glutamate
Receptors, MGluR7a and MGluR7b, in the Central Nervous System of the Adult Rat
and Mouse: A Light and Electron Microscopic Study.” Journal of Comparative
Neurology. Wiley-Blackwell, 1998. https://doi.org/10.1002/(SICI)1096-9861(19980413)393:3<332::AID-CNE6>3.0.CO;2-2.'
ieee: 'A. Kinoshita, R. Shigemoto, H. Ohishi, H. Van Der Putten, and N. Mizuno,
“Immunohistochemical localization of metabotropic glutamate receptors, mGluR7a
and mGluR7b, in the central nervous system of the adult rat and mouse: A light
and electron microscopic study,” Journal of Comparative Neurology, vol.
393, no. 3. Wiley-Blackwell, pp. 332–352, 1998.'
ista: 'Kinoshita A, Shigemoto R, Ohishi H, Van Der Putten H, Mizuno N. 1998. Immunohistochemical
localization of metabotropic glutamate receptors, mGluR7a and mGluR7b, in the
central nervous system of the adult rat and mouse: A light and electron microscopic
study. Journal of Comparative Neurology. 393(3), 332–352.'
mla: 'Kinoshita, Ayae, et al. “Immunohistochemical Localization of Metabotropic
Glutamate Receptors, MGluR7a and MGluR7b, in the Central Nervous System of the
Adult Rat and Mouse: A Light and Electron Microscopic Study.” Journal of Comparative
Neurology, vol. 393, no. 3, Wiley-Blackwell, 1998, pp. 332–52, doi:10.1002/(SICI)1096-9861(19980413)393:3<332::AID-CNE6>3.0.CO;2-2.'
short: A. Kinoshita, R. Shigemoto, H. Ohishi, H. Van Der Putten, N. Mizuno, Journal
of Comparative Neurology 393 (1998) 332–352.
date_created: 2018-12-11T11:58:31Z
date_published: 1998-03-13T00:00:00Z
date_updated: 2022-09-01T12:11:04Z
day: '13'
doi: 10.1002/(SICI)1096-9861(19980413)393:3<332::AID-CNE6>3.0.CO;2-2
extern: '1'
external_id:
pmid:
- '9548554'
intvolume: ' 393'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 332 - 352
pmid: 1
publication: Journal of Comparative Neurology
publication_identifier:
issn:
- 0021-9967
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4314'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Immunohistochemical localization of metabotropic glutamate receptors, mGluR7a
and mGluR7b, in the central nervous system of the adult rat and mouse: A light and
electron microscopic study'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 393
year: '1998'
...
---
_id: '2585'
abstract:
- lang: eng
text: Localization of metabetropic glutamate receptor subtypes, mGluR1, mGluRlu,
mGluR2/3, mGluR4a, mGluR5, mGluR7a, mGluR7b, and mGluR8, was examined in some
of the target areas of projection fibers from the main and accessory olfactory
bulbs (MOB and AOB) by using subtype-specific antibodies. The superficial layer
of the olfactory tubercle and layer Ia of the pitiform cortex, the target areas
of MOB, showed marked mGluR1-, mGluR5-, mGluR7a-, and mGluR8-like immunoreactivities
(-LI), and rather weak mGluR2/3-LI. The periamygdaloid cortical region including
the target areas of both MOB and AOB showed intense mGluR2/3-LI as well as marked
mGluRl-, mGluR5-, mGluR7a-, and mGluRS-LI. No significant mGluR1a-, mGluR4a-,
or mGluR7b-LI was seen in these regions. After transection of the lateral olfactory
tract, mGluR2/3-, mGluR7a-, and mGluR8-LI were reduced markedly in the target
regions on the side ipsilateral to the transection; no significant changes were
detected in mGluR1- or mGIuR5-LI. Double labeling experiments indicated light
and electron microscopically colocalization of mGluR7a- and mGluRS-LI in axon
terminals on dendritic shafts of presumed interneurons in the superficial layer
of the olfactory tubercle and layer Ia of the piriform cortex. Electron microscopically
mGluR2/3-LI was seen in preterminal and terminal portions of axons, whereas mGluR7a-
and mGluRS-LI were associated with presynaptic membrane specialization. Immunolabeled
axon terminals were filled with round synaptic vesicles and constituted asymmetric
synapses with dendritic profiles. The results suggest that glutamate release from
axon terminals of projection fibers from MOB and AOB is regulated presynaptically
and differentially through mGluR2/3, mGluR7a, and/or mGluRS.
acknowledgement: The authors are grateful for photographic help of Mr.Akira
Uesugi. The authors also express their gratitudesfor the support of Dr. Satoru Fukuchi,
Dr. Ritsu Hayashi,Dr. Sohzaburo Hayashi, Dr. Mizuho Katsurada, Dr. Hitoshi Kawai,
Dr. Yutaka Kitani, Dr. Toshihiko Kuroda, Dr.Keiko Kumagai, Dr. Hiroshi Matsubara,
Dr. Hiroshi Matsushima, Dr. Chisato Minakuchi, Dr. Gonpei Niwa, Dr.Hajime Oda,
Dr. Mashiko Ohbayashi, Dr. Seiichi Ohbayashi, Dr. Hiroyasu Ohtsuka, Dr. Shigeo Tamaki,
Dr. EizoWatanabe, Dr. Kazuo Yoshino, and Dr. Toshiaki Yoshino.
article_processing_charge: No
article_type: original
author:
- first_name: Eiki
full_name: Wada, Eiki
last_name: Wada
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Ayae
full_name: Kinoshita, Ayae
last_name: Kinoshita
- first_name: Hitoshi
full_name: Ohishi, Hitoshi
last_name: Ohishi
- first_name: Noboru
full_name: Mizuno, Noboru
last_name: Mizuno
citation:
ama: 'Wada E, Shigemoto R, Kinoshita A, Ohishi H, Mizuno N. Metabotropic glutamate
receptor subtypes in axon terminals of projection fibers from the main and accessory
olfactory bulbs: A light and electron microscopic immunohistochemical study in
the rat. Journal of Comparative Neurology. 1998;393(4):493-504. doi:10.1002/(SICI)1096-9861(19980420)393:4<493::AID-CNE8>3.0.CO;2-W'
apa: 'Wada, E., Shigemoto, R., Kinoshita, A., Ohishi, H., & Mizuno, N. (1998).
Metabotropic glutamate receptor subtypes in axon terminals of projection fibers
from the main and accessory olfactory bulbs: A light and electron microscopic
immunohistochemical study in the rat. Journal of Comparative Neurology.
Wiley-Blackwell. https://doi.org/10.1002/(SICI)1096-9861(19980420)393:4<493::AID-CNE8>3.0.CO;2-W'
chicago: 'Wada, Eiki, Ryuichi Shigemoto, Ayae Kinoshita, Hitoshi Ohishi, and Noboru
Mizuno. “Metabotropic Glutamate Receptor Subtypes in Axon Terminals of Projection
Fibers from the Main and Accessory Olfactory Bulbs: A Light and Electron Microscopic
Immunohistochemical Study in the Rat.” Journal of Comparative Neurology.
Wiley-Blackwell, 1998. https://doi.org/10.1002/(SICI)1096-9861(19980420)393:4<493::AID-CNE8>3.0.CO;2-W.'
ieee: 'E. Wada, R. Shigemoto, A. Kinoshita, H. Ohishi, and N. Mizuno, “Metabotropic
glutamate receptor subtypes in axon terminals of projection fibers from the main
and accessory olfactory bulbs: A light and electron microscopic immunohistochemical
study in the rat,” Journal of Comparative Neurology, vol. 393, no. 4. Wiley-Blackwell,
pp. 493–504, 1998.'
ista: 'Wada E, Shigemoto R, Kinoshita A, Ohishi H, Mizuno N. 1998. Metabotropic
glutamate receptor subtypes in axon terminals of projection fibers from the main
and accessory olfactory bulbs: A light and electron microscopic immunohistochemical
study in the rat. Journal of Comparative Neurology. 393(4), 493–504.'
mla: 'Wada, Eiki, et al. “Metabotropic Glutamate Receptor Subtypes in Axon Terminals
of Projection Fibers from the Main and Accessory Olfactory Bulbs: A Light and
Electron Microscopic Immunohistochemical Study in the Rat.” Journal of Comparative
Neurology, vol. 393, no. 4, Wiley-Blackwell, 1998, pp. 493–504, doi:10.1002/(SICI)1096-9861(19980420)393:4<493::AID-CNE8>3.0.CO;2-W.'
short: E. Wada, R. Shigemoto, A. Kinoshita, H. Ohishi, N. Mizuno, Journal of Comparative
Neurology 393 (1998) 493–504.
date_created: 2018-12-11T11:58:31Z
date_published: 1998-04-20T00:00:00Z
date_updated: 2022-08-31T14:53:58Z
day: '20'
doi: 10.1002/(SICI)1096-9861(19980420)393:4<493::AID-CNE8>3.0.CO;2-W
extern: '1'
external_id:
pmid:
- '9550154'
intvolume: ' 393'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 493 - 504
pmid: 1
publication: Journal of Comparative Neurology
publication_identifier:
issn:
- 0021-9967
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4313'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Metabotropic glutamate receptor subtypes in axon terminals of projection fibers
from the main and accessory olfactory bulbs: A light and electron microscopic immunohistochemical
study in the rat'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 393
year: '1998'
...
---
_id: '2586'
abstract:
- lang: eng
text: The role of inhibitory Golgi cells in cerebellar function was investigated
by selectively ablating Golgi cells expressing human interleukin-2 receptor α
subunit in transgenic mice, using the immunotoxin- mediated cell targeting technique.
Golgi cell disruption caused severe acute motor disorders. These mice showed gradual
recovery but retained a continuing inability to perform compound movements. Optical
and electrical recordings combined with immunocytological analysis indicated that
elimination of Golgi cells not only reduces GABA-mediated inhibition but also
attenuates functional NMDA receptors in granule cells. These results demonstrate
that synaptic integration involving both GABA inhibition and NMDA receptor activation
is essential for compound motor coordination. Furthermore, this integration can
adapt after Golgi cell elimination so as not to evoke overexcitation by the reduction
of NMDA receptors.
acknowledgement: "We thank Kumlesh K Dev for careful reading of this manuscript, Peter
Somogyi and Hirohide Sawada for invaluable advice, and Akira Uesugi for photographic
assistance. This work was supported in part by research grants from the Ministry
of Education, Science and Culture of Japan. the Sankyo Foundation. the Yamanouchi
Founda-tion. the Biomolecular Engineering Research Institute, CREST and the International
Resource Program of the National Cancer Institute. \r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Dai
full_name: Watanabe, Dai
last_name: Watanabe
- first_name: Hitoshi
full_name: Inokawa, Hitoshi
last_name: Inokawa
- first_name: Kouichi
full_name: Hashimoto, Kouichi
last_name: Hashimoto
- first_name: Noboru
full_name: Suzuki, Noboru
last_name: Suzuki
- first_name: Masanobu
full_name: Kano, Masanobu
last_name: Kano
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
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: Keisuke
full_name: Toyama, Keisuke
last_name: Toyama
- first_name: Satoshi
full_name: Kaneko, Satoshi
last_name: Kaneko
- first_name: Mineto
full_name: Yokoi, Mineto
last_name: Yokoi
- first_name: Koki
full_name: Moriyoshi, Koki
last_name: Moriyoshi
- first_name: Misao
full_name: Suzuki, Misao
last_name: Suzuki
- first_name: Kazuto
full_name: Kobayashi, Kazuto
last_name: Kobayashi
- first_name: Toshiharu
full_name: Nagatsu, Toshiharu
last_name: Nagatsu
- first_name: Robert
full_name: Kreitman, Robert
last_name: Kreitman
- first_name: Ira
full_name: Pastan, Ira
last_name: Pastan
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Watanabe D, Inokawa H, Hashimoto K, et al. Ablation of cerebellar Golgi cells
disrupts synaptic integration involving GABA inhibition and NMDA receptor activation
in motor coordination. Cell. 1998;95(1):17-27. doi:10.1016/S0092-8674(00)81779-1
apa: Watanabe, D., Inokawa, H., Hashimoto, K., Suzuki, N., Kano, M., Shigemoto,
R., … Nakanishi, S. (1998). Ablation of cerebellar Golgi cells disrupts synaptic
integration involving GABA inhibition and NMDA receptor activation in motor coordination.
Cell. Cell Press. https://doi.org/10.1016/S0092-8674(00)81779-1
chicago: Watanabe, Dai, Hitoshi Inokawa, Kouichi Hashimoto, Noboru Suzuki, Masanobu
Kano, Ryuichi Shigemoto, Tomoo Hirano, et al. “Ablation of Cerebellar Golgi Cells
Disrupts Synaptic Integration Involving GABA Inhibition and NMDA Receptor Activation
in Motor Coordination.” Cell. Cell Press, 1998. https://doi.org/10.1016/S0092-8674(00)81779-1.
ieee: D. Watanabe et al., “Ablation of cerebellar Golgi cells disrupts synaptic
integration involving GABA inhibition and NMDA receptor activation in motor coordination,”
Cell, vol. 95, no. 1. Cell Press, pp. 17–27, 1998.
ista: Watanabe D, Inokawa H, Hashimoto K, Suzuki N, Kano M, Shigemoto R, Hirano
T, Toyama K, Kaneko S, Yokoi M, Moriyoshi K, Suzuki M, Kobayashi K, Nagatsu T,
Kreitman R, Pastan I, Nakanishi S. 1998. Ablation of cerebellar Golgi cells disrupts
synaptic integration involving GABA inhibition and NMDA receptor activation in
motor coordination. Cell. 95(1), 17–27.
mla: Watanabe, Dai, et al. “Ablation of Cerebellar Golgi Cells Disrupts Synaptic
Integration Involving GABA Inhibition and NMDA Receptor Activation in Motor Coordination.”
Cell, vol. 95, no. 1, Cell Press, 1998, pp. 17–27, doi:10.1016/S0092-8674(00)81779-1.
short: D. Watanabe, H. Inokawa, K. Hashimoto, N. Suzuki, M. Kano, R. Shigemoto,
T. Hirano, K. Toyama, S. Kaneko, M. Yokoi, K. Moriyoshi, M. Suzuki, K. Kobayashi,
T. Nagatsu, R. Kreitman, I. Pastan, S. Nakanishi, Cell 95 (1998) 17–27.
date_created: 2018-12-11T11:58:32Z
date_published: 1998-10-02T00:00:00Z
date_updated: 2022-08-31T13:46:20Z
day: '02'
doi: 10.1016/S0092-8674(00)81779-1
extern: '1'
external_id:
pmid:
- '9778244 '
intvolume: ' 95'
issue: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 17 - 27
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Cell Press
publist_id: '4312'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ablation of cerebellar Golgi cells disrupts synaptic integration involving
GABA inhibition and NMDA receptor activation in motor coordination
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 95
year: '1998'
...
---
_id: '2588'
abstract:
- lang: eng
text: "B-type receptors for the neurotransmitter GABA (γ-aminobutyric acid) inhibit
neuronal activity through G-protein-coupled second-messenger systems, which regulate
the release of neurotransmitters and the activity of ion channels and adenylyl
cyclase. Physiological and biochemical studies show that there are differences
in drug efficiencies at different GABA(B) receptors, so it is expected that GABA(B)-receptor
(GABA(B)R) subtypes exist. Two GABA(B)-receptor splice variants have been cloned
(GABA(B)R1a and GABA(B)R1b), but native GABA(B) receptors and recombinant receptors
showed unexplained differences in agonist-binding potencies. Moreover, the activation
of presumed effector ion channels in heterologous cells expressing the recombinant
receptors proved difficult. Here we describe a new GABA(B) receptor subtype, GABA(B)R2,
which does not bind available GABA(B) antagonists with measurable potency. GABA(B)R1a,
GABA(B)R1b and GABA(B)R2 alone do not activate Kir3-type potassium channels efficiently,
but co- expression of these receptors yields a robust coupling to activation of
Kir3 channels. We provide evidence for the assembly of heteromeric GABA(B) receptors
in vivo and show that GABA(B)R2 and GABA(B)R1a/b proteins immunoprecipitate and
localize together at dendritic spines. The heteromeric receptor complexes exhibit
a significant increase in agonist- and partial- agonist-binding potencies as compared
with individual receptors and probably represent the predominant native GABA(B)
receptor. Heteromeric assembly among G-protein-coupled receptors has not, to our
knowledge, been described before.\r\n"
acknowledgement: We thank D. Ristig, A. Begrich, I. Meigel and S. Leonhard for technical
assistance.
article_processing_charge: No
article_type: original
author:
- first_name: Klemens
full_name: Kaupmann, Klemens
last_name: Kaupmann
- first_name: Barbara
full_name: Malitschek, Barbara
last_name: Malitschek
- first_name: Valérie
full_name: Schuler, Valérie
last_name: Schuler
- first_name: Jacob
full_name: Heid, Jacob
last_name: Heid
- first_name: Wolfgang
full_name: Froestl, Wolfgang
last_name: Froestl
- first_name: Pascal
full_name: Beck, Pascal
last_name: Beck
- first_name: Johannes
full_name: Mosbacher, Johannes
last_name: Mosbacher
- first_name: Serge
full_name: Bischoff, Serge
last_name: Bischoff
- first_name: Ákos
full_name: Kulik, Ákos
last_name: Kulik
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Andreas
full_name: Karschin, Andreas
last_name: Karschin
- first_name: Bernhard
full_name: Bettler, Bernhard
last_name: Bettler
citation:
ama: Kaupmann K, Malitschek B, Schuler V, et al. GABA(B)-receptor subtypes assemble
into functional heteromeric complexes. Nature. 1998;396(6712):683-687.
doi:10.1038/25360
apa: Kaupmann, K., Malitschek, B., Schuler, V., Heid, J., Froestl, W., Beck, P.,
… Bettler, B. (1998). GABA(B)-receptor subtypes assemble into functional heteromeric
complexes. Nature. Nature Publishing Group. https://doi.org/10.1038/25360
chicago: Kaupmann, Klemens, Barbara Malitschek, Valérie Schuler, Jacob Heid, Wolfgang
Froestl, Pascal Beck, Johannes Mosbacher, et al. “ GABA(B)-Receptor Subtypes Assemble
into Functional Heteromeric Complexes.” Nature. Nature Publishing Group,
1998. https://doi.org/10.1038/25360.
ieee: K. Kaupmann et al., “ GABA(B)-receptor subtypes assemble into functional
heteromeric complexes,” Nature, vol. 396, no. 6712. Nature Publishing Group,
pp. 683–687, 1998.
ista: Kaupmann K, Malitschek B, Schuler V, Heid J, Froestl W, Beck P, Mosbacher
J, Bischoff S, Kulik Á, Shigemoto R, Karschin A, Bettler B. 1998. GABA(B)-receptor
subtypes assemble into functional heteromeric complexes. Nature. 396(6712), 683–687.
mla: Kaupmann, Klemens, et al. “ GABA(B)-Receptor Subtypes Assemble into Functional
Heteromeric Complexes.” Nature, vol. 396, no. 6712, Nature Publishing Group,
1998, pp. 683–87, doi:10.1038/25360.
short: K. Kaupmann, B. Malitschek, V. Schuler, J. Heid, W. Froestl, P. Beck, J.
Mosbacher, S. Bischoff, Á. Kulik, R. Shigemoto, A. Karschin, B. Bettler, Nature
396 (1998) 683–687.
date_created: 2018-12-11T11:58:32Z
date_published: 1998-12-17T00:00:00Z
date_updated: 2022-08-31T12:43:05Z
day: '17'
doi: 10.1038/25360
extern: '1'
external_id:
pmid:
- '9872317'
intvolume: ' 396'
issue: '6712'
language:
- iso: eng
month: '12'
oa_version: None
page: 683 - 687
pmid: 1
publication: Nature
publication_identifier:
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '4309'
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' GABA(B)-receptor subtypes assemble into functional heteromeric complexes'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 396
year: '1998'
...
---
_id: '2589'
abstract:
- lang: eng
text: Immunoreactivity for the substance P receptor (NK1 receptor) has been investigated
by light and electron microscopy in the dorsal vagal complexes of adult rats and
cats. The general pattern of NK1 immunoreactivity was similar for both rat and
cat. Numerous NK1-immunoreactive neurons were present in the area postrema, the
nucleus of the solitary tract, and the dorsal motor nucleus of the vagus nerve.
The density of labelled neurons differed between the subnuclei of the nucleus
of the solitary tract. Overall, the efferent neurons of the dorsal motor nucleus
of the vagus nerve highly expressed NK1 when compared to neurons in the nucleus
of the solitary tract. The results are discussed with reference to the viscerotopic
organisation of the dorsal vagal complex. Ultrastructural analysis demonstrated
that NK1 immunoreactivity was present only at the membrane surface of somatic
and dendritic profiles of neurons. No labelling was found in axon terminals, axons,
or glial processes. NK1 immunoreactivity, as revealed by a preembedding immunogold
technique in serial ultrathin sections; was preferentially located at nonsynaptic
sites. A semiquantitative study suggested that the density of NK1 receptors is
statistically higher at membrane sites free of any contact (synaptic or not) with
axon terminals. The subcellular localisation of NK1 immunoreactivity was similar
for neurons of both rat and cat. These results suggest that in the dorsal vagal
complex, substance P might act on NK1 receptors through a process of volume transmission.
acknowledgement: The authors thank Dr. Wolfgang A.A. Kunze for his helpin the English
reviewing of the manuscript. The authorsthank Drs. Nadine Clerc, Jean-Pierre Kessler,
WolfgangA.A. Kunze, Jean-Jacques Puizillout, and Fabien Tell fortheir constructive
discussions and critiques of the manu-script. This study was supported by CNRS (FR45/UPR9024).
article_processing_charge: No
article_type: original
author:
- first_name: Agnès
full_name: Baude, Agnès
last_name: Baude
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: 'Baude A, Shigemoto R. Cellular and subcellular distribution of substance P
receptor immunoreactivity in the dorsal vagal complex of the rat and cat: A light
and electron microscope study. Journal of Comparative Neurology. 1998;402(2):181-196.
doi:10.1002/(SICI)1096-9861(19981214)402:2<181::AID-CNE4>3.0.CO;2-B'
apa: 'Baude, A., & Shigemoto, R. (1998). Cellular and subcellular distribution
of substance P receptor immunoreactivity in the dorsal vagal complex of the rat
and cat: A light and electron microscope study. Journal of Comparative Neurology.
Wiley-Blackwell. https://doi.org/10.1002/(SICI)1096-9861(19981214)402:2<181::AID-CNE4>3.0.CO;2-B'
chicago: 'Baude, Agnès, and Ryuichi Shigemoto. “Cellular and Subcellular Distribution
of Substance P Receptor Immunoreactivity in the Dorsal Vagal Complex of the Rat
and Cat: A Light and Electron Microscope Study.” Journal of Comparative Neurology.
Wiley-Blackwell, 1998. https://doi.org/10.1002/(SICI)1096-9861(19981214)402:2<181::AID-CNE4>3.0.CO;2-B.'
ieee: 'A. Baude and R. Shigemoto, “Cellular and subcellular distribution of substance
P receptor immunoreactivity in the dorsal vagal complex of the rat and cat: A
light and electron microscope study,” Journal of Comparative Neurology,
vol. 402, no. 2. Wiley-Blackwell, pp. 181–196, 1998.'
ista: 'Baude A, Shigemoto R. 1998. Cellular and subcellular distribution of substance
P receptor immunoreactivity in the dorsal vagal complex of the rat and cat: A
light and electron microscope study. Journal of Comparative Neurology. 402(2),
181–196.'
mla: 'Baude, Agnès, and Ryuichi Shigemoto. “Cellular and Subcellular Distribution
of Substance P Receptor Immunoreactivity in the Dorsal Vagal Complex of the Rat
and Cat: A Light and Electron Microscope Study.” Journal of Comparative Neurology,
vol. 402, no. 2, Wiley-Blackwell, 1998, pp. 181–96, doi:10.1002/(SICI)1096-9861(19981214)402:2<181::AID-CNE4>3.0.CO;2-B.'
short: A. Baude, R. Shigemoto, Journal of Comparative Neurology 402 (1998) 181–196.
date_created: 2018-12-11T11:58:32Z
date_published: 1998-12-14T00:00:00Z
date_updated: 2022-08-31T12:57:30Z
day: '14'
doi: 10.1002/(SICI)1096-9861(19981214)402:2<181::AID-CNE4>3.0.CO;2-B
extern: '1'
external_id:
pmid:
- '9845242 '
intvolume: ' 402'
issue: '2'
language:
- iso: eng
month: '12'
oa_version: None
page: 181 - 196
pmid: 1
publication: Journal of Comparative Neurology
publication_identifier:
issn:
- 0021-9967
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4310'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Cellular and subcellular distribution of substance P receptor immunoreactivity
in the dorsal vagal complex of the rat and cat: A light and electron microscope
study'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 402
year: '1998'
...
---
_id: '2590'
abstract:
- lang: eng
text: Unipolar brush cells (UBCs) are a class of small neurons that are densely
concentrated in the granular layers of the vestibulocerebellar cortex and dorsal
cochlear nucleus. The UBCs form giant synapses with individual mossy fibre rosettes
on the dendrioles which make up their brush formations and are provided with numerous,
unusual non-synaptic appendages. In accord with the glutamatergic nature of mossy
fibres, our previous post-embedding immunocytochemical studies indicated that
various ionotropic glutamate receptor subunits are localized at the post-synaptic
densities of the giant synapses, whereas the non-synaptic appendages are immunonegative.
On the contrary, the metabotropic glutamate receptors mGluR1α and mGluR2/3 are
situated at the non-synaptic appendages and are lacking at the post-synaptic densities.
Other authors, however, have shown that antibodies to these metabotropic receptors
stain both appendages and post-synaptic densities. In the present study, we have
re-evaluated the distribution of metabotropic glutamate receptors in the UBCs
of the cerebellum and the cochlear nuclear complex by light and electron microscopic
pre-embedding immunocytochemistry with subtype-specific antibodies. We confirm
that UBCs dendritic brushes are densely immunostained by antibody to mGluR1α particularly
in the cerebellum and that antibody to mGluR2/3 labels at least a percentage of
the UBC brushes in both the cerebellum and cochlear nuclei. At the ultrastructural
level, it appears that mGluR1α and mGluR2/3 immunoreactivities are not associated
with the post-synaptic densities of the giant mossy fibre-UBC synapses, but instead
are concentrated on the non-synaptic appendages of the cerebellar UBCs. The non-synaptic
appendages, therefore, may be an important avenue for regulating the excitability
of UBCs and mediating glutamate effects on their still unknown intracellular signal
transduction cascades. We also show that the pre-synaptic densities of UBC dendrodendritic
junctions are mGluR2/3 positive. As previously demonstrated, antibodies to mGluR1α
and mGluR2/3 label subsets of Golgi cells. Antibody to mGluR5 does not stain UBCs
in the cerebellum and cochlear nucleus and reveals the somatodendritic compartment
of Golgi cells situated in the core of the cerebellar granular layer, whilst cochlear
nucleus Golgi cells are mGluR5 negative.
acknowledgement: The authors wish to thank Dr R. L. Huganir and coworkers for kindly
providing an aliquot of their mGluR1a antibody and Dr N. Traverse Slater for helpful
comments on the manuscript. The study was supported by US-PHS grants NS 09904 and
DC 01805 (to E.M.).
article_processing_charge: No
article_type: original
author:
- first_name: Dick
full_name: Jaarsma, Dick
last_name: Jaarsma
- first_name: Maria
full_name: Diño, Maria
last_name: Diño
- first_name: Hitoshi
full_name: Ohishi, Hitoshi
last_name: Ohishi
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Enrico
full_name: Mugnaini, Enrico
last_name: Mugnaini
citation:
ama: Jaarsma D, Diño M, Ohishi H, Shigemoto R, Mugnaini E. Metabotropic glutamate
receptors are associated with non-synaptic appendages of unipolar brush cells
in rat cerebellar cortex and cochlear nuclear complex. Journal of Neurocytology.
1998;27(5):303-327. doi:10.1023/A:1006982023657
apa: Jaarsma, D., Diño, M., Ohishi, H., Shigemoto, R., & Mugnaini, E. (1998). Metabotropic
glutamate receptors are associated with non-synaptic appendages of unipolar brush
cells in rat cerebellar cortex and cochlear nuclear complex. Journal of Neurocytology.
Kluwer. https://doi.org/10.1023/A:1006982023657
chicago: Jaarsma, Dick, Maria Diño, Hitoshi Ohishi, Ryuichi Shigemoto, and Enrico
Mugnaini. “ Metabotropic Glutamate Receptors Are Associated with Non-Synaptic
Appendages of Unipolar Brush Cells in Rat Cerebellar Cortex and Cochlear Nuclear
Complex.” Journal of Neurocytology. Kluwer, 1998. https://doi.org/10.1023/A:1006982023657.
ieee: D. Jaarsma, M. Diño, H. Ohishi, R. Shigemoto, and E. Mugnaini, “ Metabotropic
glutamate receptors are associated with non-synaptic appendages of unipolar brush
cells in rat cerebellar cortex and cochlear nuclear complex,” Journal of Neurocytology,
vol. 27, no. 5. Kluwer, pp. 303–327, 1998.
ista: Jaarsma D, Diño M, Ohishi H, Shigemoto R, Mugnaini E. 1998. Metabotropic
glutamate receptors are associated with non-synaptic appendages of unipolar brush
cells in rat cerebellar cortex and cochlear nuclear complex. Journal of Neurocytology.
27(5), 303–327.
mla: Jaarsma, Dick, et al. “ Metabotropic Glutamate Receptors Are Associated with
Non-Synaptic Appendages of Unipolar Brush Cells in Rat Cerebellar Cortex and Cochlear
Nuclear Complex.” Journal of Neurocytology, vol. 27, no. 5, Kluwer, 1998,
pp. 303–27, doi:10.1023/A:1006982023657.
short: D. Jaarsma, M. Diño, H. Ohishi, R. Shigemoto, E. Mugnaini, Journal of Neurocytology
27 (1998) 303–327.
date_created: 2018-12-11T11:58:33Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-31T12:30:14Z
day: '01'
doi: 10.1023/A:1006982023657
extern: '1'
external_id:
pmid:
- '9923978 '
intvolume: ' 27'
issue: '5'
language:
- iso: eng
month: '01'
oa_version: None
page: 303 - 327
pmid: 1
publication: Journal of Neurocytology
publication_identifier:
issn:
- 0300-4864
publication_status: published
publisher: Kluwer
publist_id: '4308'
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' Metabotropic glutamate receptors are associated with non-synaptic appendages
of unipolar brush cells in rat cerebellar cortex and cochlear nuclear complex'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 27
year: '1998'
...
---
_id: '2695'
abstract:
- lang: eng
text: 'We study a quantum particle in a random potential in two scaling limits:
the low density limit (or Boltzman-Grad) and the weak coupling limit. The low
density limit is the quantum analogue of the Lorentz gas. In both cases, the phase
space density of the quantum evolution defined through the Wigner transform or
the Husimi function converges weakly to a linear Boltz-mann equation with collision
kernel given by the quantum scattering cross section. '
alternative_title:
- Contemporary Mathematics
article_processing_charge: No
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: 'Erdös L, Yau H. Linear Boltzmann equation as scaling limit of quantum Lorentz
gas. In: Advances in Differential Equations and Mathematical Physics. Vol
217. American Mathematical Society; 1998:137-155. doi:10.1090/conm/217'
apa: Erdös, L., & Yau, H. (1998). Linear Boltzmann equation as scaling limit
of quantum Lorentz gas. In Advances in Differential Equations and Mathematical
Physics (Vol. 217, pp. 137–155). American Mathematical Society. https://doi.org/10.1090/conm/217
chicago: Erdös, László, and Horng Yau. “Linear Boltzmann Equation as Scaling Limit
of Quantum Lorentz Gas.” In Advances in Differential Equations and Mathematical
Physics, 217:137–55. American Mathematical Society, 1998. https://doi.org/10.1090/conm/217.
ieee: L. Erdös and H. Yau, “Linear Boltzmann equation as scaling limit of quantum
Lorentz gas,” in Advances in Differential Equations and Mathematical Physics,
vol. 217, American Mathematical Society, 1998, pp. 137–155.
ista: 'Erdös L, Yau H. 1998.Linear Boltzmann equation as scaling limit of quantum
Lorentz gas. In: Advances in Differential Equations and Mathematical Physics.
Contemporary Mathematics, vol. 217, 137–155.'
mla: Erdös, László, and Horng Yau. “Linear Boltzmann Equation as Scaling Limit of
Quantum Lorentz Gas.” Advances in Differential Equations and Mathematical Physics,
vol. 217, American Mathematical Society, 1998, pp. 137–55, doi:10.1090/conm/217.
short: L. Erdös, H. Yau, in:, Advances in Differential Equations and Mathematical
Physics, American Mathematical Society, 1998, pp. 137–155.
date_created: 2018-12-11T11:59:07Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-31T11:46:40Z
day: '01'
doi: 10.1090/conm/217
extern: '1'
intvolume: ' 217'
language:
- iso: eng
month: '01'
oa_version: None
page: 137 - 155
publication: Advances in Differential Equations and Mathematical Physics
publication_identifier:
issn:
- 0271-4132
publication_status: published
publisher: American Mathematical Society
publist_id: '4202'
quality_controlled: '1'
status: public
title: Linear Boltzmann equation as scaling limit of quantum Lorentz gas
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 217
year: '1998'
...
---
_id: '2728'
abstract:
- lang: eng
text: We obtain the Lifschitz tail, i.e. the exact low energy asymptotics of the
integrated density of states (IDS) of the two-dimensional magnetic Schrödinger
operator with a uniform magnetic field and random Poissonian impurities. The single
site potential is repulsive and it has a finite but nonzero range. We show that
the IDS is a continuous function of the energy at the bottom of the spectrum.
This result complements the earlier (nonrigorous) calculations by Brézin, Gross
and Itzykson which predict that the IDS is discontinuous at the bottom of the
spectrum for zero range (Dirac delta) impurities at low density. We also elucidate
the reason behind this apparent controversy. Our methods involve magnetic localization
techniques (both in space and energy) in addition to a modified version of the
"enlargement of obstacles" method developed by A.-S. Sznitman.
acknowledgement: The author is grateful to Professor A.-S. Sznitman for explaining
him his work and for fruitful discussions, and to the referee for pointing out errors
and for many helpful comments.This work has been initiated and later on completed
at the Forschungsinstitut für Mathematik, ETH Zürich.
article_processing_charge: No
article_type: original
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: 'Erdös L. Lifschitz tail in a magnetic field: The nonclassical regime. Probability
Theory and Related Fields. 1998;112(3):321-371. doi:10.1007/s004400050193'
apa: 'Erdös, L. (1998). Lifschitz tail in a magnetic field: The nonclassical regime.
Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s004400050193'
chicago: 'Erdös, László. “Lifschitz Tail in a Magnetic Field: The Nonclassical Regime.”
Probability Theory and Related Fields. Springer, 1998. https://doi.org/10.1007/s004400050193.'
ieee: 'L. Erdös, “Lifschitz tail in a magnetic field: The nonclassical regime,”
Probability Theory and Related Fields, vol. 112, no. 3. Springer, pp. 321–371,
1998.'
ista: 'Erdös L. 1998. Lifschitz tail in a magnetic field: The nonclassical regime.
Probability Theory and Related Fields. 112(3), 321–371.'
mla: 'Erdös, László. “Lifschitz Tail in a Magnetic Field: The Nonclassical Regime.”
Probability Theory and Related Fields, vol. 112, no. 3, Springer, 1998,
pp. 321–71, doi:10.1007/s004400050193.'
short: L. Erdös, Probability Theory and Related Fields 112 (1998) 321–371.
date_created: 2018-12-11T11:59:17Z
date_published: 1998-11-01T00:00:00Z
date_updated: 2022-08-30T08:17:54Z
day: '01'
doi: 10.1007/s004400050193
extern: '1'
intvolume: ' 112'
issue: '3'
language:
- iso: eng
month: '11'
oa_version: None
page: 321 - 371
publication: Probability Theory and Related Fields
publication_identifier:
issn:
- 0044-3719
publication_status: published
publisher: Springer
publist_id: '4163'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lifschitz tail in a magnetic field: The nonclassical regime'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 112
year: '1998'
...
---
_id: '11680'
abstract:
- lang: eng
text: 'We present a model for edge updates with restricted randomness in dynamic
graph algorithms and a general technique for analyzing the expected running time
of an update operation. This model is able to capture the average case in many
applications, since (1) it allows restrictions on the set of edges which can be
used for insertions and (2) the type (insertion or deletion) of each update operation
is arbitrary, i.e., not random. We use our technique to analyze existing and new
dynamic algorithms for the following problems: maximum cardinality matching, minimum
spanning forest, connectivity, 2-edge connectivity, k -edge connectivity, k -vertex
connectivity, and bipartiteness. Given a random graph G with m 0 edges and n vertices
and a sequence of l update operations such that the graph contains m i edges after
operation i , the expected time for performing the updates for any l is O(llogn+∑li=1n/m−−√i)
in the case of minimum spanning forests, connectivity, 2-edge connectivity, and
bipartiteness. The expected time per update operation is O(n) in the case of maximum
matching. We also give improved bounds for k -edge and k -vertex connectivity.
Additionally we give an insertions-only algorithm for maximum cardinality matching
with worst-case O(n) amortized time per insertion.'
acknowledgement: The authors would like to thank Emo Welzl for helpful discussions.
article_processing_charge: No
article_type: original
author:
- first_name: D.
full_name: Alberts, D.
last_name: Alberts
- 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: Alberts D, Henzinger MH. Average-case analysis of dynamic graph algorithms.
Algorithmica. 1998;20:31-60. doi:10.1007/pl00009186
apa: Alberts, D., & Henzinger, M. H. (1998). Average-case analysis of dynamic
graph algorithms. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009186
chicago: Alberts, D., and Monika H Henzinger. “Average-Case Analysis of Dynamic
Graph Algorithms.” Algorithmica. Springer Nature, 1998. https://doi.org/10.1007/pl00009186.
ieee: D. Alberts and M. H. Henzinger, “Average-case analysis of dynamic graph algorithms,”
Algorithmica, vol. 20. Springer Nature, pp. 31–60, 1998.
ista: Alberts D, Henzinger MH. 1998. Average-case analysis of dynamic graph algorithms.
Algorithmica. 20, 31–60.
mla: Alberts, D., and Monika H. Henzinger. “Average-Case Analysis of Dynamic Graph
Algorithms.” Algorithmica, vol. 20, Springer Nature, 1998, pp. 31–60, doi:10.1007/pl00009186.
short: D. Alberts, M.H. Henzinger, Algorithmica 20 (1998) 31–60.
date_created: 2022-07-28T06:50:51Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2023-02-21T16:33:27Z
day: '01'
doi: 10.1007/pl00009186
extern: '1'
intvolume: ' 20'
keyword:
- Dynamic graph algorithm
- Average-case analysis
- Minimum spanning forest
- Connectivity
- Bipartiteness
- Maximum matching.
language:
- iso: eng
month: '01'
oa_version: None
page: 31-60
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11928'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Average-case analysis of dynamic graph algorithms
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '1998'
...
---
_id: '11681'
abstract:
- lang: eng
text: We prove lower bounds on the complexity of maintaining fully dynamic k -edge
or k -vertex connectivity in plane graphs and in (k-1) -vertex connected graphs.
We show an amortized lower bound of Ω (log n / {k (log log n} + log b)) per edge
insertion, deletion, or query operation in the cell probe model, where b is the
word size of the machine and n is the number of vertices in G . We also show an
amortized lower bound of Ω (log n /(log log n + log b)) per operation for fully
dynamic planarity testing in embedded graphs. These are the first lower bounds
for fully dynamic connectivity problems.
acknowledgement: .
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: M. L.
full_name: Fredman, M. L.
last_name: Fredman
citation:
ama: Henzinger MH, Fredman ML. Lower bounds for fully dynamic connectivity problems
in graphs. Algorithmica. 1998;22(3):351-362. doi:10.1007/pl00009228
apa: Henzinger, M. H., & Fredman, M. L. (1998). Lower bounds for fully dynamic
connectivity problems in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009228
chicago: Henzinger, Monika H, and M. L. Fredman. “Lower Bounds for Fully Dynamic
Connectivity Problems in Graphs.” Algorithmica. Springer Nature, 1998.
https://doi.org/10.1007/pl00009228.
ieee: M. H. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity
problems in graphs,” Algorithmica, vol. 22, no. 3. Springer Nature, pp.
351–362, 1998.
ista: Henzinger MH, Fredman ML. 1998. Lower bounds for fully dynamic connectivity
problems in graphs. Algorithmica. 22(3), 351–362.
mla: Henzinger, Monika H., and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity
Problems in Graphs.” Algorithmica, vol. 22, no. 3, Springer Nature, 1998,
pp. 351–62, doi:10.1007/pl00009228.
short: M.H. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
date_created: 2022-07-28T06:58:36Z
date_published: 1998-11-01T00:00:00Z
date_updated: 2022-09-12T09:03:36Z
day: '01'
doi: 10.1007/pl00009228
extern: '1'
intvolume: ' 22'
issue: '3'
keyword:
- Dynamic planarity testing
- Dynamic connectivity testing
- Lower bounds
- Cell probe model
language:
- iso: eng
month: '11'
oa_version: None
page: 351-362
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lower bounds for fully dynamic connectivity problems in graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '1998'
...
---
_id: '11682'
abstract:
- lang: eng
text: We consider the parametric minimum spanning tree problem, in which we are
given a graph with edge weights that are linear functions of a parameter /spl
lambda/ and wish to compute the sequence of minimum spanning trees generated as
/spl lambda/ varies. We also consider the kinetic minimum spanning tree problem,
in which /spl lambda/ represents time and the graph is subject in addition to
changes such as edge insertions, deletions, and modifications of the weight functions
as time progresses. We solve both problems in time O(n/sup 2/3/log/sup 4/3/) per
combinatorial change in the tree (or randomized O(n/sup 2/3/log/sup 4/3/ n) per
change). Our time bounds reduce to O(n/sup 1/2/log/sup 3/2/ n) per change (O(n/sup
1/2/log n) randomized) for planar graphs or other minor-closed families of graphs,
and O(n/sup 1/4/log/sup 3/2/ n) per change (O(n/sup 1/4/ log n) randomized) for
planar graphs with weight changes but no insertions or deletions.
article_processing_charge: No
author:
- first_name: P. K.
full_name: Agarwal, P. K.
last_name: Agarwal
- first_name: D.
full_name: EppsteinL. J. Guibas, D.
last_name: EppsteinL. J. Guibas
- 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: 'Agarwal PK, EppsteinL. J. Guibas D, Henzinger MH. Parametric and kinetic minimum
spanning trees. In: Proceedings of the 39th Annual Symposium on Foundations
of Computer Science. ; 1998:596-605. doi:10.1109/SFCS.1998.743510'
apa: Agarwal, P. K., EppsteinL. J. Guibas, D., & Henzinger, M. H. (1998). Parametric
and kinetic minimum spanning trees. In Proceedings of the 39th Annual Symposium
on Foundations of Computer Science (pp. 596–605). Palo Alto, CA, United States.
https://doi.org/10.1109/SFCS.1998.743510
chicago: Agarwal, P. K., D. EppsteinL. J. Guibas, and Monika H Henzinger. “Parametric
and Kinetic Minimum Spanning Trees.” In Proceedings of the 39th Annual Symposium
on Foundations of Computer Science, 596–605, 1998. https://doi.org/10.1109/SFCS.1998.743510.
ieee: P. K. Agarwal, D. EppsteinL. J. Guibas, and M. H. Henzinger, “Parametric and
kinetic minimum spanning trees,” in Proceedings of the 39th Annual Symposium
on Foundations of Computer Science, Palo Alto, CA, United States, 1998, pp.
596–605.
ista: Agarwal PK, EppsteinL. J. Guibas D, Henzinger MH. 1998. Parametric and kinetic
minimum spanning trees. Proceedings of the 39th Annual Symposium on Foundations
of Computer Science. Annual IEEE Symposium on Foundations of Computer Science,
596–605.
mla: Agarwal, P. K., et al. “Parametric and Kinetic Minimum Spanning Trees.” Proceedings
of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp.
596–605, doi:10.1109/SFCS.1998.743510.
short: P.K. Agarwal, D. EppsteinL. J. Guibas, M.H. Henzinger, in:, Proceedings of
the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 596–605.
conference:
end_date: 1998-11-11
location: Palo Alto, CA, United States
name: Annual IEEE Symposium on Foundations of Computer Science
start_date: 1998-11-08
date_created: 2022-07-28T07:21:34Z
date_published: 1998-09-01T00:00:00Z
date_updated: 2023-02-09T11:28:52Z
day: '01'
doi: 10.1109/SFCS.1998.743510
extern: '1'
language:
- iso: eng
month: '09'
oa_version: None
page: 596-605
publication: Proceedings of the 39th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- 0-8186-9172-7
issn:
- 0272-5428
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parametric and kinetic minimum spanning trees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1998'
...
---
_id: '11926'
abstract:
- lang: eng
text: "We present the first polylog-competitive online algorithm for the general
multicast problem in the throughput model. The ratio of the number of requests
accepted by the optimum offline alaorithm to the exoected number of reauests accepted
by our algorithm is O(jlog n + log log M)(log n + log M) log n), where M is the
number of multicast groups and n is the number of nodes in the nraoh. We show
that this is close to optimum by presenting-an*R(log nlog M) lower\r\nbound on
this ratio for anv randomized online algorithm against an oblivious adversary,
when M is much lar&r than the link capacities. Our lower bound applies even in
the restricted case where the link capacities are much larger than bandwidth requested
by a single multicast. We also present a simple proof showing that it is impossible
to be competitive against an adaptive online adversary. As in the previous online
routing algorithms, our algorithm uses edge-costs when deciding on which is the
best path to use. In contrast to the nrevious comnetitive aleorithms in the throughput
modei, our cost is-not a direct function of the edne load. The new cost definition
allows us to decouple the effects of routing and admission decisions of different
multicast groups. "
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
citation:
ama: 'Goel A, Henzinger MH, Plotkin S. An online throughput-competitive algorithm
for multicast routing and admission control. In: 9th Annual ACM SIAM Symposium
on Discrete Algorithms. Society for Industrial and Applied Mathematics; 1998:97-106.'
apa: 'Goel, A., Henzinger, M. H., & Plotkin, S. (1998). An online throughput-competitive
algorithm for multicast routing and admission control. In 9th Annual ACM SIAM
Symposium on Discrete Algorithms (pp. 97–106). San Francisco, CA, United States:
Society for Industrial and Applied Mathematics.'
chicago: Goel, Ashish, Monika H Henzinger, and Serge Plotkin. “An Online Throughput-Competitive
Algorithm for Multicast Routing and Admission Control.” In 9th Annual ACM SIAM
Symposium on Discrete Algorithms, 97–106. Society for Industrial and Applied
Mathematics, 1998.
ieee: A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive
algorithm for multicast routing and admission control,” in 9th Annual ACM SIAM
Symposium on Discrete Algorithms, San Francisco, CA, United States, 1998,
pp. 97–106.
ista: 'Goel A, Henzinger MH, Plotkin S. 1998. An online throughput-competitive algorithm
for multicast routing and admission control. 9th Annual ACM SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 97–106.'
mla: Goel, Ashish, et al. “An Online Throughput-Competitive Algorithm for Multicast
Routing and Admission Control.” 9th Annual ACM SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 1998, pp. 97–106.
short: A. Goel, M.H. Henzinger, S. Plotkin, in:, 9th Annual ACM SIAM Symposium on
Discrete Algorithms, Society for Industrial and Applied Mathematics, 1998, pp.
97–106.
conference:
end_date: 1998-01-27
location: San Francisco, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 1998-01-25
date_created: 2022-08-19T06:22:30Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2023-02-21T16:27:22Z
day: '01'
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 97-106
publication: 9th Annual ACM SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '0898714109'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11763'
relation: later_version
status: public
scopus_import: '1'
status: public
title: An online throughput-competitive algorithm for multicast routing and admission
control
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1998'
...
---
_id: '8527'
abstract:
- lang: eng
text: We introduce a new potential-theoretic definition of the dimension spectrum of
a probability measure for q > 1 and explain its relation to prior definitions.
We apply this definition to prove that if and is a Borel probability measure
with compact support in , then under almost every linear transformation from to
, the q-dimension of the image of is ; in particular, the q-dimension of is
preserved provided . We also present results on the preservation of information
dimension and pointwise dimension. Finally, for and q > 2 we give examples for
which is not preserved by any linear transformation into . All results for typical
linear transformations are also proved for typical (in the sense of prevalence)
continuously differentiable functions.
article_processing_charge: No
article_type: original
author:
- first_name: Brian R
full_name: Hunt, Brian R
last_name: Hunt
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
citation:
ama: Hunt BR, Kaloshin V. How projections affect the dimension spectrum of fractal
measures. Nonlinearity. 1997;10(5):1031-1046. doi:10.1088/0951-7715/10/5/002
apa: Hunt, B. R., & Kaloshin, V. (1997). How projections affect the dimension
spectrum of fractal measures. Nonlinearity. IOP Publishing. https://doi.org/10.1088/0951-7715/10/5/002
chicago: Hunt, Brian R, and Vadim Kaloshin. “How Projections Affect the Dimension
Spectrum of Fractal Measures.” Nonlinearity. IOP Publishing, 1997. https://doi.org/10.1088/0951-7715/10/5/002.
ieee: B. R. Hunt and V. Kaloshin, “How projections affect the dimension spectrum
of fractal measures,” Nonlinearity, vol. 10, no. 5. IOP Publishing, pp.
1031–1046, 1997.
ista: Hunt BR, Kaloshin V. 1997. How projections affect the dimension spectrum of
fractal measures. Nonlinearity. 10(5), 1031–1046.
mla: Hunt, Brian R., and Vadim Kaloshin. “How Projections Affect the Dimension Spectrum
of Fractal Measures.” Nonlinearity, vol. 10, no. 5, IOP Publishing, 1997,
pp. 1031–46, doi:10.1088/0951-7715/10/5/002.
short: B.R. Hunt, V. Kaloshin, Nonlinearity 10 (1997) 1031–1046.
date_created: 2020-09-18T10:50:41Z
date_published: 1997-06-19T00:00:00Z
date_updated: 2021-01-12T08:19:53Z
day: '19'
doi: 10.1088/0951-7715/10/5/002
extern: '1'
intvolume: ' 10'
issue: '5'
keyword:
- Mathematical Physics
- General Physics and Astronomy
- Applied Mathematics
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '06'
oa_version: None
page: 1031-1046
publication: Nonlinearity
publication_identifier:
issn:
- 0951-7715
- 1361-6544
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
status: public
title: How projections affect the dimension spectrum of fractal measures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '1997'
...