---
_id: '3808'
abstract:
- lang: eng
text: Action potentials in central neurons are initiated near the axon initial segment,
propagate into the axon, and finally invade the presynaptic terminals, where they
trigger transmitter release. Voltage-gated Na(+) channels are key determinants
of excitability, but Na(+) channel density and properties in axons and presynaptic
terminals of cortical neurons have not been examined yet. In hippocampal mossy
fiber boutons, which emerge from parent axons en passant, Na(+) channels are very
abundant, with an estimated number of approximately 2000 channels per bouton.
Presynaptic Na(+) channels show faster inactivation kinetics than somatic channels,
suggesting differences between subcellular compartments of the same cell. Computational
analysis of action potential propagation in axon-multibouton structures reveals
that Na(+) channels in boutons preferentially amplify the presynaptic action potential
and enhance Ca(2+) inflow, whereas Na(+) channels in axons control the reliability
and speed of propagation. Thus, presynaptic and axonal Na(+) channels contribute
differentially to mossy fiber synaptic transmission.
author:
- first_name: Dominique
full_name: Engel, Dominique
last_name: Engel
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Engel D, Jonas PM. Presynaptic action potential amplification by voltage-gated
Na+ channels in hippocampal mossy fiber boutons. Neuron. 2005;45(3):405-417.
doi:10.1016/j.neuron.2004.12.048
apa: Engel, D., & Jonas, P. M. (2005). Presynaptic action potential amplification
by voltage-gated Na+ channels in hippocampal mossy fiber boutons. Neuron.
Elsevier. https://doi.org/10.1016/j.neuron.2004.12.048
chicago: Engel, Dominique, and Peter M Jonas. “Presynaptic Action Potential Amplification
by Voltage-Gated Na+ Channels in Hippocampal Mossy Fiber Boutons.” Neuron.
Elsevier, 2005. https://doi.org/10.1016/j.neuron.2004.12.048
.
ieee: D. Engel and P. M. Jonas, “Presynaptic action potential amplification by voltage-gated
Na+ channels in hippocampal mossy fiber boutons,” Neuron, vol. 45, no.
3. Elsevier, pp. 405–17, 2005.
ista: Engel D, Jonas PM. 2005. Presynaptic action potential amplification by voltage-gated
Na+ channels in hippocampal mossy fiber boutons. Neuron. 45(3), 405–17.
mla: Engel, Dominique, and Peter M. Jonas. “Presynaptic Action Potential Amplification
by Voltage-Gated Na+ Channels in Hippocampal Mossy Fiber Boutons.” Neuron,
vol. 45, no. 3, Elsevier, 2005, pp. 405–17, doi:10.1016/j.neuron.2004.12.048 .
short: D. Engel, P.M. Jonas, Neuron 45 (2005) 405–17.
date_created: 2018-12-11T12:05:17Z
date_published: 2005-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:21Z
day: '01'
doi: '10.1016/j.neuron.2004.12.048 '
extern: 1
intvolume: ' 45'
issue: '3'
month: '01'
page: 405 - 17
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2400'
quality_controlled: 0
status: public
title: Presynaptic action potential amplification by voltage-gated Na+ channels in
hippocampal mossy fiber boutons
type: journal_article
volume: 45
year: '2005'
...
---
_id: '3142'
abstract:
- lang: eng
text: Assembly of neuronal circuits is controlled by the sequential acquisition
of neuronal subpopulation-specific identities at progressive developmental steps.
Whereas neuronal features involved in initial phases of differentiation are already
established at cell-cycle exit, recent findings, based mainly on work in the peripheral
nervous system, suggest that the timely integration of signals encountered en
route to targets and from the target region itself is essential to control late
steps in connectivity. As neurons project towards their targets they require target-derived
signals to establish mature axonal projections and acquire neuronal traits such
as the expression of distinct combinations of neurotransmitters. Recent evidence
presented in this review shows that this principle, of a signaling interplay between
target-derived signals and neuronal cell bodies, is often mediated through transcriptional
events and is evolutionarily conserved.
author:
- first_name: Simon
full_name: Simon Hippenmeyer
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Ina
full_name: Kramer, Ina
last_name: Kramer
- first_name: Silvia
full_name: Arber, Silvia
last_name: Arber
citation:
ama: 'Hippenmeyer S, Kramer I, Arber S. Control of neuronal phenotype: What targets
tell the cell bodies. Trends in Neurosciences. 2004;27(8):482-488. doi:10.1016/j.tins.2004.05.012'
apa: 'Hippenmeyer, S., Kramer, I., & Arber, S. (2004). Control of neuronal phenotype:
What targets tell the cell bodies. Trends in Neurosciences. Elsevier. https://doi.org/10.1016/j.tins.2004.05.012'
chicago: 'Hippenmeyer, Simon, Ina Kramer, and Silvia Arber. “Control of Neuronal
Phenotype: What Targets Tell the Cell Bodies.” Trends in Neurosciences.
Elsevier, 2004. https://doi.org/10.1016/j.tins.2004.05.012.'
ieee: 'S. Hippenmeyer, I. Kramer, and S. Arber, “Control of neuronal phenotype:
What targets tell the cell bodies,” Trends in Neurosciences, vol. 27, no.
8. Elsevier, pp. 482–488, 2004.'
ista: 'Hippenmeyer S, Kramer I, Arber S. 2004. Control of neuronal phenotype: What
targets tell the cell bodies. Trends in Neurosciences. 27(8), 482–488.'
mla: 'Hippenmeyer, Simon, et al. “Control of Neuronal Phenotype: What Targets Tell
the Cell Bodies.” Trends in Neurosciences, vol. 27, no. 8, Elsevier, 2004,
pp. 482–88, doi:10.1016/j.tins.2004.05.012.'
short: S. Hippenmeyer, I. Kramer, S. Arber, Trends in Neurosciences 27 (2004) 482–488.
date_created: 2018-12-11T12:01:38Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2019-04-26T07:22:25Z
day: '01'
doi: 10.1016/j.tins.2004.05.012
extern: 1
intvolume: ' 27'
issue: '8'
month: '08'
page: 482 - 488
publication: Trends in Neurosciences
publication_status: published
publisher: Elsevier
publist_id: '3555'
quality_controlled: 0
status: public
title: 'Control of neuronal phenotype: What targets tell the cell bodies'
type: review
volume: 27
year: '2004'
...
---
_id: '3894'
abstract:
- lang: eng
text: We study infinite stochastic games played by n-players on a finite graph with
goals given by sets of infinite traces. The games are stochastic (each player
simultaneously and independently chooses an action at each round, and the next
state is determined by a probability distribution depending on the current state
and the chosen actions), infinite (the game continues for an infinite number of
rounds), nonzero sum (the players' goals are not necessarily conflicting), and
undiscounted. We show that if each player has a reachability objective, that is,
if the goal for each player i is to visit some subset R-i of the states, then
there exists an epsilon-Nash equilibrium in memoryless strategies, for every epsilon
> 0. However, exact Nash equilibria need not exist. We study the complexity
of finding such Nash equilibria, and show that the payoff of some epsilon-Nash
equilibrium in memoryless strategies can be epsilon-approximated in NP. We study
the important subclass of n-player turn-based probabilistic games, where at each
state at most one player has a nontrivial choice of moves. For turn-based probabilistic
games, we show the existence of epsilon-Nash equilibria in pure strategies for
games where the objective of player i is a Borel set B-i of infinite traces. However,
exact Nash equilibria may not exist. For the special case of omega-regular objectives,
we show exact Nash equilibria exist, and can be computed in NP when the omega-regular
objectives are expressed as parity objectives.
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
ONR grant N00014-02-1-0671, NSF grants CCR-9988172 and CCR-0225610
alternative_title:
- 'LNCS '
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
- first_name: Marcin
full_name: Jurdziński, Marcin
last_name: Jurdziński
citation:
ama: 'Chatterjee K, Majumdar R, Jurdziński M. On Nash equilibria in stochastic games.
In: Vol 3210. Springer; 2004:26-40. doi:10.1007/978-3-540-30124-0_6'
apa: 'Chatterjee, K., Majumdar, R., & Jurdziński, M. (2004). On Nash equilibria
in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science
Logic, Springer. https://doi.org/10.1007/978-3-540-30124-0_6'
chicago: Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziński. “On Nash
Equilibria in Stochastic Games,” 3210:26–40. Springer, 2004. https://doi.org/10.1007/978-3-540-30124-0_6.
ieee: 'K. Chatterjee, R. Majumdar, and M. Jurdziński, “On Nash equilibria in stochastic
games,” presented at the CSL: Computer Science Logic, 2004, vol. 3210, pp. 26–40.'
ista: 'Chatterjee K, Majumdar R, Jurdziński M. 2004. On Nash equilibria in stochastic
games. CSL: Computer Science Logic, LNCS , vol. 3210, 26–40.'
mla: Chatterjee, Krishnendu, et al. On Nash Equilibria in Stochastic Games.
Vol. 3210, Springer, 2004, pp. 26–40, doi:10.1007/978-3-540-30124-0_6.
short: K. Chatterjee, R. Majumdar, M. Jurdziński, in:, Springer, 2004, pp. 26–40.
conference:
name: 'CSL: Computer Science Logic'
corr_author: '1'
date_created: 2018-12-11T12:05:45Z
date_published: 2004-09-09T00:00:00Z
date_updated: 2024-10-09T20:54:09Z
day: '09'
doi: 10.1007/978-3-540-30124-0_6
extern: 1
intvolume: ' 3210'
month: '09'
page: 26 - 40
publication_status: published
publisher: Springer
publist_id: '2264'
quality_controlled: 0
status: public
title: On Nash equilibria in stochastic games
type: conference
volume: 3210
year: '2004'
...
---
_id: '4236'
article_processing_charge: No
author:
- first_name: Harold
full_name: de Vladar, Harold
id: 2A181218-F248-11E8-B48F-1D18A9856A87
last_name: de Vladar
orcid: 0000-0002-5985-7653
citation:
ama: de Vladar H. Métodos no lineales y sus aplicaciones en dinámicas aleatorias
de poblaciones celulares. 2004.
apa: de Vladar, H. (2004). Métodos no lineales y sus aplicaciones en dinámicas
aleatorias de poblaciones celulares. Centro de estudios avazados, IVIC.
chicago: Vladar, Harold de. “Métodos No Lineales y Sus Aplicaciones En Dinámicas
Aleatorias de Poblaciones Celulares.” Centro de estudios avazados, IVIC, 2004.
ieee: H. de Vladar, “Métodos no lineales y sus aplicaciones en dinámicas aleatorias
de poblaciones celulares,” Centro de estudios avazados, IVIC, 2004.
ista: de Vladar H. 2004. Métodos no lineales y sus aplicaciones en dinámicas aleatorias
de poblaciones celulares. Centro de estudios avazados, IVIC.
mla: de Vladar, Harold. Métodos No Lineales y Sus Aplicaciones En Dinámicas Aleatorias
de Poblaciones Celulares. Centro de estudios avazados, IVIC, 2004.
short: H. de Vladar, Métodos No Lineales y Sus Aplicaciones En Dinámicas Aleatorias
de Poblaciones Celulares, Centro de estudios avazados, IVIC, 2004.
date_created: 2018-12-11T12:07:46Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2025-07-01T12:02:56Z
day: '01'
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
publication_status: published
publisher: Centro de estudios avazados, IVIC
publist_id: '1877'
status: public
title: Métodos no lineales y sus aplicaciones en dinámicas aleatorias de poblaciones
celulares
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2004'
...
---
_id: '4599'
abstract:
- lang: eng
text: 'State-space explosion is a fundamental obstacle in the formal verification
of designs and protocols. Several techniques for combating this problem have emerged
in the past few years, among which two are significant: partial-order reduction
and symbolic state-space search. In asynchronous systems, interleavings of independent
concurrent events are equivalent, and only a representative interleaving needs
to be explored to verify local properties. Partial-order methods exploit this
redundancy and visit only a subset of the reachable states. Symbolic techniques,
on the other hand, capture the transition relation of a system and the set of
reachable states as boolean functions. In many cases, these functions can be represented
compactly using binary decision diagrams (BDDs). Traditionally, the two techniques
have been practiced by two different schools—partial-order methods with enumerative
depth-first search for the analysis of asynchronous network protocols, and symbolic
breadth-first search for the analysis of synchronous hardware designs. We combine
both approaches and develop a method for using partial-order reduction techniques
in symbolic BDD-based invariant checking. We present theoretical results to prove
the correctness of the method, and experimental results to demonstrate its efficacy.'
acknowledgement: Gerard Holzmann provided us with information on SPIN. Ken McMillan
and Doron Peled contributed through discussions. The VIS group at UC Berkeley and
Rajeev Ranjan in particular helped with the experiments.
article_processing_charge: No
article_type: original
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Robert
full_name: Brayton, Robert
last_name: Brayton
- 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: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction
in symbolic state-space exploration. Formal Methods in System Design. 2001;18(2):97-116.
doi:10.1023/A:1008767206905
apa: Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (2001).
Partial-order reduction in symbolic state-space exploration. Formal Methods
in System Design. Springer. https://doi.org/10.1023/A:1008767206905
chicago: Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram
Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration.” Formal
Methods in System Design. Springer, 2001. https://doi.org/10.1023/A:1008767206905.
ieee: R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order
reduction in symbolic state-space exploration,” Formal Methods in System Design,
vol. 18, no. 2. Springer, pp. 97–116, 2001.
ista: Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 2001. Partial-order
reduction in symbolic state-space exploration. Formal Methods in System Design.
18(2), 97–116.
mla: Alur, Rajeev, et al. “Partial-Order Reduction in Symbolic State-Space Exploration.”
Formal Methods in System Design, vol. 18, no. 2, Springer, 2001, pp. 97–116,
doi:10.1023/A:1008767206905.
short: R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, Formal Methods
in System Design 18 (2001) 97–116.
date_created: 2018-12-11T12:09:41Z
date_published: 2001-03-01T00:00:00Z
date_updated: 2023-05-08T12:22:38Z
day: '01'
doi: 10.1023/A:1008767206905
extern: '1'
intvolume: ' 18'
issue: '2'
language:
- iso: eng
month: '03'
oa_version: None
page: 97 - 116
publication: Formal Methods in System Design
publication_identifier:
issn:
- 0925-9856
publication_status: published
publisher: Springer
publist_id: '108'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial-order reduction in symbolic state-space exploration
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 18
year: '2001'
...
---
_id: '11694'
abstract:
- lang: eng
text: We consider exploration problems where a robot has to construct a complete
map of an unknown environment. We assume that the environment is modeled by a
directed, strongly connected graph. The robot's task is to visit all nodes and
edges of the graph using the minimum number R of edge traversals. Deng and Papadimitriou
[Proceedings of the 31st Symposium on the Foundations of Computer Science, 1990,
pp. 356-361] showed an upper bound for R ofd O(d)m and Koutsoupias (reported by
Deng and Papadimitriou) gave a lower bound of Ω≠(d2m), where m is the number of
edges in the graph and d is the minimum number of edges that have to be added
to make the graph Eulerian. We give the 1rst subexponential algorithm for this
exploration problem, which achieves an upper bound of dO(logd)m. We also show
a matching lower bound of d≠(logd)m for our algorithm. Additionally, we give lower
bounds of 2≠(d)m, respectively, d≠(logd)m for various other natural exploration
algorithms.
acknowledgement: We thank Prabhakar Raghavan for bringing to our attention the literature
on the s-t connectivity problem. We also thank an anonymous referee for many helpful
comments which improved the presentation of the paper.
article_processing_charge: No
article_type: original
author:
- first_name: Susanne
full_name: Albers, Susanne
last_name: Albers
- 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: Albers S, Henzinger M. Exploring unknown environments. SIAM Journal on Computing.
2000;29(4):1164-1188. doi:10.1137/s009753979732428x
apa: 'Albers, S., & Henzinger, M. (2000). Exploring unknown environments. SIAM
Journal on Computing. El Paso, TX, United States: Society for Industrial and
Applied Mathematics. https://doi.org/10.1137/s009753979732428x'
chicago: Albers, Susanne, and Monika Henzinger. “Exploring Unknown Environments.”
SIAM Journal on Computing. Society for Industrial and Applied Mathematics,
2000. https://doi.org/10.1137/s009753979732428x.
ieee: S. Albers and M. Henzinger, “Exploring unknown environments,” SIAM Journal
on Computing, vol. 29, no. 4. Society for Industrial and Applied Mathematics,
pp. 1164–1188, 2000.
ista: Albers S, Henzinger M. 2000. Exploring unknown environments. SIAM Journal
on Computing. 29(4), 1164–1188.
mla: Albers, Susanne, and Monika Henzinger. “Exploring Unknown Environments.” SIAM
Journal on Computing, vol. 29, no. 4, Society for Industrial and Applied Mathematics,
2000, pp. 1164–88, doi:10.1137/s009753979732428x.
short: S. Albers, M. Henzinger, SIAM Journal on Computing 29 (2000) 1164–1188.
conference:
end_date: 1997-05-06
location: El Paso, TX, United States
name: 'STOC97: 29th Annual Symposium on Theory of Computing'
start_date: 1997-05-04
date_created: 2022-07-29T09:04:36Z
date_published: 2000-07-01T00:00:00Z
date_updated: 2024-11-06T12:09:07Z
day: '01'
doi: 10.1137/s009753979732428x
extern: '1'
intvolume: ' 29'
issue: '4'
keyword:
- directed graph
- exploration algorithm
language:
- iso: eng
month: '07'
oa_version: None
page: 1164-1188
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exploring unknown environments
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2000'
...
---
_id: '2593'
abstract:
- lang: eng
text: In cat and monkey, lamina I cells can be classified into three basic morphological
types (fusiform, pyramidal, and multipolar), and recent intracellular labeling
evidence in the cat indicates that fusiform and multipolar lamina I cells are
two different types of nociceptive cells, whereas pyramidal cells are innocuous
thermoreceptive-specific. Because earlier observations indicated that only nociceptive
dorsal horn neurons respond to substance P (SP), we examined which morphological
types of lamina I neurons express receptors for SP (NK-1r). We categorized NK-1r-
immunoreactive (IR) lamina I neurons in serial horizontal sections from the cervical
and lumbar enlargements of four monkeys. Consistent results were obtained by two
independent teams of observers. Nearly all NK-1r-IR cells were fusiform (42%)
or multipolar (43%), but only 6% were pyramidal (with 9% unclassified). We obtained
similar findings in three monkeys in which we used double-labeling immunocytochemistry
to identify NK-1r-IR and spinothalamic lamina I neurons retrogradely labeled with
cholera toxin subunit b from the thalamus; most NK-1r-IR lamina I spinothalamic
neurons were fusiform (48%) or multipolar (33%), and only 10% were pyramidal.
In contrast, most (~75%) pyramidal and some (~25%) fusiform and multipolar lamina
I spinothalamic neurons did not display NK-1r immunoreactivity. These data indicate
that most fusiform and multipolar lamina I neurons in the monkey can express NK-1r,
consistent with the idea that both types are nociceptive, whereas only a small
proportion of lamina I pyramidal cells express this receptor, consistent with
the previous finding that they are nonnociceptive. However, these findings also
indicate that not all nociceptive lamina I neurons express receptors for SP.
acknowledgement: This study was supported by National Institute of Health Grants NS
34022 to Y.D.K. and NS 25616 to A.D.C., by Canadian Medical Research Council (MRC)
Grants MT 12942 to Y.D.K. and MT 12170 to A.R.S., and by the Barrow Neurological
Foundation. Y.D.K. is a Scholar of the Canadian MRC. We thank A. Constantin and
A. Forster for expert technical assistance and Dr. M. Wikstrom for generously supplying
monoclonal antibodies against CTb.
article_processing_charge: No
article_type: original
author:
- first_name: Xiao
full_name: Yu, Xiao
last_name: Yu
- first_name: En
full_name: Zhang, En
last_name: Zhang
- first_name: Arthur
full_name: Craig, Arthur
last_name: Craig
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Alfredo
full_name: Ribeiro Da Silva, Alfredo
last_name: Ribeiro Da Silva
- first_name: Yves
full_name: De Koninck, Yves
last_name: De Koninck
citation:
ama: Yu X, Zhang E, Craig A, Shigemoto R, Ribeiro Da Silva A, De Koninck Y. NK-1
receptor immunoreactivity in distinct morphological types of lamina I neurons
of the primate spinal cord. Journal of Neuroscience. 1999;19(9):3545-3555.
doi:10.1523/JNEUROSCI.19-09-03545.1999
apa: Yu, X., Zhang, E., Craig, A., Shigemoto, R., Ribeiro Da Silva, A., & De
Koninck, Y. (1999). NK-1 receptor immunoreactivity in distinct morphological types
of lamina I neurons of the primate spinal cord. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999
chicago: Yu, Xiao, En Zhang, Arthur Craig, Ryuichi Shigemoto, Alfredo Ribeiro Da
Silva, and Yves De Koninck. “NK-1 Receptor Immunoreactivity in Distinct Morphological
Types of Lamina I Neurons of the Primate Spinal Cord.” Journal of Neuroscience.
Society for Neuroscience, 1999. https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999.
ieee: X. Yu, E. Zhang, A. Craig, R. Shigemoto, A. Ribeiro Da Silva, and Y. De Koninck,
“NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons
of the primate spinal cord,” Journal of Neuroscience, vol. 19, no. 9. Society
for Neuroscience, pp. 3545–3555, 1999.
ista: Yu X, Zhang E, Craig A, Shigemoto R, Ribeiro Da Silva A, De Koninck Y. 1999.
NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons
of the primate spinal cord. Journal of Neuroscience. 19(9), 3545–3555.
mla: Yu, Xiao, et al. “NK-1 Receptor Immunoreactivity in Distinct Morphological
Types of Lamina I Neurons of the Primate Spinal Cord.” Journal of Neuroscience,
vol. 19, no. 9, Society for Neuroscience, 1999, pp. 3545–55, doi:10.1523/JNEUROSCI.19-09-03545.1999.
short: X. Yu, E. Zhang, A. Craig, R. Shigemoto, A. Ribeiro Da Silva, Y. De Koninck,
Journal of Neuroscience 19 (1999) 3545–3555.
date_created: 2018-12-11T11:58:34Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2023-03-27T09:54:40Z
day: '01'
doi: 10.1523/JNEUROSCI.19-09-03545.1999
extern: '1'
external_id:
pmid:
- '10212314'
intvolume: ' 19'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782224/
month: '05'
oa: 1
oa_version: None
page: 3545 - 3555
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '4305'
quality_controlled: '1'
scopus_import: '1'
status: public
title: NK-1 receptor immunoreactivity in distinct morphological types of lamina I
neurons of the primate spinal cord
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '1999'
...
---
_id: '4204'
abstract:
- lang: eng
text: During the development of the zebrafish nervous system both noi, a zebrafish
pax2 homolog, and ace, a zebrafish fgf8 homolog, are required for development
of the midbrain and cerebellum. Here we describe a dominant mutation, aussicht
(aus), in which the expression of noi and ace is upregulated, In aus mutant embryos,
ace is upregulated at many sites in the embryo, while Itoi expression is only
upregulated in regions of the forebrain and midbrain which also express ace. Subsequent
to the alterations in noi and ace expression, aus mutants exhibit defects in the
differentiation of the forebrain, midbrain and eyes. Within the forebrain, the
formation of the anterior and postoptic commissures is delayed and the expression
of markers within the pretectal area is reduced. Within the midbrain, En and wnt1
expression is expanded. In heterozygous aus embryos, there is ectopic outgrowth
of neural retina in the temporal half of the eyes, whereas in putative homozygous
aus embryos, the ventral retina is reduced and the pigmented retinal epithelium
is expanded towards the midline, The observation that ans mutant embryos exhibit
widespread upregulation of ace raised the possibility that aus might represent
an allele of the ace gene itself. However, by crossing carriers for both aus and
ace, we were able to generate homozygous ace mutant embryos that also exhibited
the aus phenotype, This indicated that aus is not tightly linked to ace and is
unlikely to be a mutation directly affecting the ace locus. However, increased
Ace activity may underly many aspects of the aus phenotype and we show that the
upregulation of noi in the forebrain of aus mutants is partially dependent upon
functional Ace activity. Conversely, increased ace expression in the forebrain
of arcs mutants is not dependent upon functional Noi activity. We conclude that
aus represents a mutation involving a locus normally required for the regulation
of ace expression during embryogenesis.
acknowledgement: "We thank Corinne Houart, Michael Brand and the late Nigel Holder
for comments and advice on this study, many colleagues for providing probes used
in this analysis, other members of our laboratories for suggestions throughout the
course of the work and Michael Brand, Jörg Rauch and Pascal Haffter for providing
data prior to publication. We also would like to thank Christiane Nüsslein-Volhard
in whose laboratory the mutant described in this study was initially isolated.\r\nThis
study was supported by grants from The Wellcome Trust and\r\nBBSRC. C. P. H. was
supported by Fellowships from EMBO and the\r\nEC, and S. W. W. is a Wellcome Trust
Senior Research Fellow.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Caroline
full_name: Brennan, Caroline
last_name: Brennan
- first_name: Stephen
full_name: Wilson, Stephen
last_name: Wilson
citation:
ama: Heisenberg C-PJ, Brennan C, Wilson S. Zebrafish aussicht mutant embryos exhibit
widespread overexpression of ace (fgf8) and coincident defects in CNS development.
Development. 1999;126(10):2129-2140. doi:10.1242/dev.126.10.2129
apa: Heisenberg, C.-P. J., Brennan, C., & Wilson, S. (1999). Zebrafish aussicht
mutant embryos exhibit widespread overexpression of ace (fgf8) and coincident
defects in CNS development. Development. Company of Biologists. https://doi.org/10.1242/dev.126.10.2129
chicago: Heisenberg, Carl-Philipp J, Caroline Brennan, and Stephen Wilson. “Zebrafish
Aussicht Mutant Embryos Exhibit Widespread Overexpression of Ace (Fgf8) and Coincident
Defects in CNS Development.” Development. Company of Biologists, 1999.
https://doi.org/10.1242/dev.126.10.2129.
ieee: C.-P. J. Heisenberg, C. Brennan, and S. Wilson, “Zebrafish aussicht mutant
embryos exhibit widespread overexpression of ace (fgf8) and coincident defects
in CNS development,” Development, vol. 126, no. 10. Company of Biologists,
pp. 2129–2140, 1999.
ista: Heisenberg C-PJ, Brennan C, Wilson S. 1999. Zebrafish aussicht mutant embryos
exhibit widespread overexpression of ace (fgf8) and coincident defects in CNS
development. Development. 126(10), 2129–2140.
mla: Heisenberg, Carl-Philipp J., et al. “Zebrafish Aussicht Mutant Embryos Exhibit
Widespread Overexpression of Ace (Fgf8) and Coincident Defects in CNS Development.”
Development, vol. 126, no. 10, Company of Biologists, 1999, pp. 2129–40,
doi:10.1242/dev.126.10.2129.
short: C.-P.J. Heisenberg, C. Brennan, S. Wilson, Development 126 (1999) 2129–2140.
date_created: 2018-12-11T12:07:34Z
date_published: 1999-05-15T00:00:00Z
date_updated: 2022-09-06T08:38:01Z
day: '15'
doi: 10.1242/dev.126.10.2129
extern: '1'
external_id:
pmid:
- '10207138'
intvolume: ' 126'
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 2129 - 2140
pmid: 1
publication: Development
publication_identifier:
issn:
- 0950-1991
publication_status: published
publisher: Company of Biologists
publist_id: '1914'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zebrafish aussicht mutant embryos exhibit widespread overexpression of ace
(fgf8) and coincident defects in CNS development
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 126
year: '1999'
...
---
_id: '4608'
abstract:
- lang: eng
text: 'State space explosion is a fundamental obstacle in formal verification of
designs and protocols. Several techniques for combating this problem have emerged
in the past few years, among which two are significant: partial-order reductions
and symbolic state space search. In asynchronous systems, interleavings of independent
concurrent events are equivalent, and only a representative interleaving needs
to be explored to verify local properties. Partial-order methods exploit this
redundancy and visit only a subset of the reachable states. Symbolic techniques,
on the other hand, capture the transition relation of a system and the set of
reachable states as boolean functions. In many cases, these functions can be represented
compactly using binary decision diagrams (BDDs). Traditionally, the two techniques
have been practiced by two different schools—partial-order methods with enumerative
depth-first search for the analysis of asynchronous network protocols, and symbolic
breadth-first search for the analysis of synchronous hardware designs. We combine
both approaches and develop a method for using partial-order reduction techniques
in symbolic BDD-based invariant checking. We present theoretical results to prove
the correctness of the method, and experimental results to demonstrate its efficacy.'
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 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 Semiconductor Research Corporation contracts DC-324.036
and DC-324.005.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Robert
full_name: Brayton, Robert
last_name: Brayton
- 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: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: 'Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction
in symbolic state-space exploration. In: 9th International Conference on Computer
Aided Verification. Vol 1254. Springer; 1997:340-351. doi:10.1007/3-540-63166-6_34'
apa: 'Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (1997).
Partial-order reduction in symbolic state-space exploration. In 9th International
Conference on Computer Aided Verification (Vol. 1254, pp. 340–351). Haifa,
Israel: Springer. https://doi.org/10.1007/3-540-63166-6_34'
chicago: Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram
Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration.” In 9th
International Conference on Computer Aided Verification, 1254:340–51. Springer,
1997. https://doi.org/10.1007/3-540-63166-6_34.
ieee: R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order
reduction in symbolic state-space exploration,” in 9th International Conference
on Computer Aided Verification, Haifa, Israel, 1997, vol. 1254, pp. 340–351.
ista: 'Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 1997. Partial-order
reduction in symbolic state-space exploration. 9th International Conference on
Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1254,
340–351.'
mla: Alur, Rajeev, et al. “Partial-Order Reduction in Symbolic State-Space Exploration.”
9th International Conference on Computer Aided Verification, vol. 1254,
Springer, 1997, pp. 340–51, doi:10.1007/3-540-63166-6_34.
short: R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, in:, 9th International
Conference on Computer Aided Verification, Springer, 1997, pp. 340–351.
conference:
end_date: 1997-06-25
location: Haifa, Israel
name: 'CAV: Computer Aided Verification'
start_date: 1997-06-22
date_created: 2018-12-11T12:09:44Z
date_published: 1997-01-01T00:00:00Z
date_updated: 2022-08-16T14:09:54Z
day: '01'
doi: 10.1007/3-540-63166-6_34
extern: '1'
intvolume: ' 1254'
language:
- iso: eng
month: '01'
oa_version: None
page: 340 - 351
publication: 9th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540631668'
publication_status: published
publisher: Springer
publist_id: '99'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial-order reduction in symbolic state-space exploration
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1254
year: '1997'
...