TY - JOUR
AB - A complementary DNA encoding the rat NMDA receptor has been cloned and characterized. The single protein encoded by the cDNA forms a receptor-channel complex that has electrophysiological and pharmacological properties characteristic of the NMDA receptor. This protein has a significant sequence similarity to the AMPA/kainate receptors and contains four putative transmembrane segments following a large extracellular domain. The NMDA receptor messenger RNA is expressed in neuronal cells throughout the brain regions, particularly in the hippocampus, cerebral cortex and cerebellum.
AU - Moriyoshi, Koki
AU - Masu, Masayuki
AU - Ishii, Takahiro
AU - Ryuichi Shigemoto
AU - Mizuno, Noboru
AU - Nakanishi, Shigetada
ID - 2483
IS - 6348
JF - Nature
TI - Molecular cloning and characterization of the rat NMDA receptor
VL - 353
ER -
TY - JOUR
AB - The distribution of cerebral cortical neurons sending projection fibers to the nucleus of the solitary tract (NST), and the topographical distribution of axon terminals of cortico-NST fibers within the NST were examined in the cat by two sets of experiments with horseradish peroxidase (HRP) and HRP conjugated with wheat germ agglutinin (WGA-HRP). First, HRP was injected into the NST. In the cerebral cortex of these cats, neuronal cell bodies were labeled retrogradely in the deep pyramidal cell layer (layer V): After HRP injection centered on the rostral or middle part of the NST, HRP-labeled neuronal cell bodies were distributed mainly in the orbital gyrus and caudal part of the intralimbic cortex, and additionally in the rostral part of the anterior sylvian gyrus. After HRP injection centered on the caudal part of the NST, labeled neuronal cell bodies were seen mainly in the caudoventral part of the intralimbic cortex, and additionally in the orbital gyrus, posterior sigmoid gyrus and rostral part of the anterior sylvian gyrus. The labeling in the intralimbic cortex, orbital gyrus and anterior sylvian gyrus was bilateral with a predominantly ipsilateral distribution, while that in the posterior sigmoid gyrus was bilateral with a clear-cut contralateral dominance. In the second set of experiments, WGA-HRP was injected into the cerebral cortical regions where neuronal cell bodies had been retrogradely labeled with HRP injected into the NST: after WGA-HRP injection into the orbital gyrus, presumed axon terminals in the NST were labeled in the rostral two thirds of the nucleus bilaterally with an ipsilateral predominance. After WGA-HRP injection into the rostral part of the anterior sylvian gyrus, a moderate number of presumed axon terminals were labeled throughout the whole rostrocaudal extent of the NST bilaterally with a slight ipsilateral dominance. After WGA-HRP injection into the middle and caudal parts of the anterior sylvian gyrus, no labeling was found in the NST. After WGA-HRP injection into the caudal part of the intralimbic cortex, presumed terminal labeling in the NST was seen throughout the whole rostrocaudal extent of the nucleus bilaterally with a dominant ipsilateral distribution. After WGA-HRP injection into the posterior sigmoid gyrus, however, no terminal labeling was found in the NST. The results indicate that cortico-NST fibers from the orbital gyrus terminate in the rostral two thirds of the NST, while those from the intralimbic cortex and the rostral part of the anterior sylvian gyrus project to the whole rostrocaudal extent of the NST.
AU - Yasui, Yukihiko
AU - Itoh, Kazuo
AU - Kaneko, Takeshi
AU - Ryuichi Shigemoto
AU - Mizuno, Noboru
ID - 2529
IS - 1
JF - Experimental Brain Research
TI - Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat
VL - 85
ER -
TY - JOUR
AU - Nakanishi, Shigetada
AU - Ohkubo, Hiroaki
AU - Kakizuka, Akira
AU - Yokota, Yoshifumi
AU - Ryuichi Shigemoto
AU - Sasai, Yoshiki
AU - Takumi, Toru
ID - 2530
IS - 1
JF - Recent Progress in Hormone Research
TI - Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel
VL - 46
ER -
TY - JOUR
AB - An ultra-low dose (10-14 M) of opioid peptide [D-Ala2]methionine enkephalinamide (DAMEA) is found to exert an inhibitory effect on the production of reactive oxygen species (respiratory burst) in human neutrophils. The validity of this phenomenon has been verified in a series of studies that comprised 30 experiments. The inhibition has proved to be statistically significant (P<0.001). The dose-response dependence of the effect (10-15-10-9 M) followed a characteristic biphasic pattern (with the maximum effect at ultra-low doses). An opioid antagonist, naloxone partially blocks the inhibitory effect, which indicates that the DAMEA action is at least partially mediated by opioid receptors.
AU - Zaǐtsev, Sergei V
AU - Leonid Sazanov
AU - Koshkin, Aleksei A
AU - Sud'Ina, Galina F
AU - Varfolomeev, Sergei D
ID - 1946
IS - 1
JF - FEBS Letters
TI - Respiratory burst inhibition in human neutrophils by ultra-low doses of [D-Ala2] methionine enkephalinamide
VL - 291
ER -
TY - CONF
AU - Alur, Rajeev
AU - Feder, Tomás
AU - Thomas Henzinger
ID - 4621
TI - The benefits of relaxing punctuality
ER -
TY - JOUR
AB - An algorithm is presented that constructs the convex hull of a set of n points in three dimensions in worst-case time O(n log2h) and storage O(n), where h is the number of extreme points. This is an improvement of the O(nh) time gift-wrapping algorithm and, for certain values of h, of the O(n log n) time divide-and-conquer algorithm.
AU - Herbert Edelsbrunner
AU - Shi, Weiping
ID - 4051
IS - 2
JF - SIAM Journal on Computing
TI - An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
VL - 20
ER -
TY - JOUR
AB - This paper describes an effective procedure for stratifying a real semi-algebraic set into cells of constant description size. The attractive feature of our method is that the number of cells produced is singly exponential in the number of input variables. This compares favorably with the doubly exponential size of Collins' decomposition. Unlike Collins' construction, however, our scheme does not produce a cell complex but only a smooth stratification. Nevertheless, we are able to apply our results in interesting ways to problems of point location and geometric optimization.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
ID - 4052
IS - 1
JF - Theoretical Computer Science
TI - A singly exponential stratification scheme for real semi-algebraic varieties and its applications
VL - 84
ER -
TY - CONF
AB - The zone theorem for an arrangement of n hyperplanes in d-dimensional real space says that the total number of faces bounding the cells intersected by another hyperplane is O(n d–1). This result is the basis of a time-optimal incremental algorithm that constructs a hyperplane arrangement and has a host of other algorithmic and combinatorial applications. Unfortunately, the original proof of the zone theorem, for d ge 3, turned out to contain a serious and irreparable error. This paper presents a new proof of the theorem. Our proof is based on an inductive argument, which also applies in the case of pseudo-hyperplane arrangements. We also briefly discuss the fallacies of the old proof along with some ways of partially saving that approach.
AU - Herbert Edelsbrunner
AU - Seidel, Raimund
AU - Sharir, Micha
ID - 4054
TI - On the zone theorem for hyperplane arrangements
VL - 555
ER -
TY - CONF
AB - It is shown that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time O(n2). The algorithm is reasonably easy to implement and is based on the theorem that there is a triangulation with minmax edge length that contains the relative neighborhood graph of the points as a subgraph. With minor modifications the algorithm works for arbitrary normed metrics.
AU - Herbert Edelsbrunner
AU - Tan, Tiow Seng
ID - 4055
TI - A quadratic time algorithm for the minmax length triangulation
ER -
TY - JOUR
AB - This paper proves that for every n ≥ 4 there is a convex n-gon such that the vertices of 2n - 7 vertex pairs are one unit of distance apart. This improves the previously best lower bound of ⌊ (5n - 5) 3⌋ given by Erdo{combining double acute accent}s and Moser if n ≥ 17.
AU - Herbert Edelsbrunner
AU - Hajnal, Péter
ID - 4056
IS - 2
JF - Journal of Combinatorial Theory Series A
TI - A lower bound on the number of unit distances between the vertices of a convex polygon
VL - 56
ER -
TY - JOUR
AU - Herbert Edelsbrunner
ID - 4057
IS - 2
JF - Journal of Computer and System Sciences
TI - Corrigendum
VL - 42
ER -
TY - CONF
AB - We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running
time of the algorithm is O (nα(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas
AU - Sharir, Micha
AU - Snoeyink, Jack
ID - 4058
TI - Computing a face in an arrangement of line segments
ER -
TY - CONF
AB - Let P be a simple polygon with n vertices. We present a simple decomposition scheme that partitions the interior of P into O(n) so-called geodesic triangles, so that any line segment interior to P crosses at most 2 log n of these triangles. This decomposition can be used to preprocess P in time O(n log n) and storage O(n), so that any ray-shooting query can be answered in time O(log n).The algorithms are fairly simple and easy to implement. We also extend this technique to the case of ray-shooting amidst k polygonal obstacles with a total of n edges, so that a query can be answered in O(radicklog n) time.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Grigni, Michelangelo
AU - Guibas, Leonidas
AU - Hershberger, John
AU - Sharir, Micha
AU - Snoeyink, Jack
ID - 4059
TI - Ray shooting in polygons using geodesic triangulations
VL - 510
ER -
TY - JOUR
AB - We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of N points in Ed in time O(Fd (N,N) logd N), where Fd (n,m) is the time required to compute a bichromatic closest pair among n red and m green points in Ed . If Fd (N,N)=Ω(N1+ε), for some fixed e{open}>0, then the running time improves to O(Fd (N,N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closest pair in expected time O((nm log n log m)2/3+m log2 n+n log2 m) in E3, which yields an O(N4/3 log4/3 N) expected time, algorithm for computing a Euclidean minimum spanning tree of N points in E3. In d≥4 dimensions we obtain expected time O((nm)1-1/([d/2]+1)+ε+m log n+n log m) for the bichromatic closest pair problem and O(N2-2/([d/2]+1)ε) for the Euclidean minimum spanning tree problem, for any positive e{open}.
AU - Agarwal, Pankaj K
AU - Herbert Edelsbrunner
AU - Schwarzkopf, Otfried
AU - Welzl, Emo
ID - 4061
IS - 1
JF - Discrete & Computational Geometry
TI - Euclidean minimum spanning trees and bichromatic closest pairs
VL - 6
ER -
TY - JOUR
AB - We prove that for any set S of n points in the plane and n3-α triangles spanned by the points in S there exists a point (not necessarily in S) contained in at least n3-3α/(c log5 n) of the triangles. This implies that any set of n points in three-dimensional space defines at most {Mathematical expression} halving planes.
AU - Aronov, Boris
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
AU - Wenger, Rephael
ID - 4062
IS - 1
JF - Discrete & Computational Geometry
TI - Points and triangles in the plane and halving planes in space
VL - 6
ER -
TY - CONF
AB - We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-time properties of concurrent and reactive systems. A global, discrete, and asynchronous clock is incorporated into the model by defining the abstract notion of a real-time transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upperbound real-time requirements for transitions. We show how to model real-time systems that communicate either through shared variables or by message passing, and how to represent the important real-time constructs of priorities (interrupts), scheduling, and timeouts in this framework. Two styles for the specification of real-time properties are presented. The first style uses bounded versions of the temporal operators; the real-time requirements expressed in this style are classified ...
AU - Thomas Henzinger
AU - Manna, Zohar
AU - Pnueli,Amir
ID - 4508
TI - Temporal proof methodologies for real-time systems
ER -
TY - THES
AU - Thomas Henzinger
ID - 4516
TI - The Temporal Specification and Verification of Real-time Systems
ER -
TY - JOUR
AU - Alur, Rajeev
AU - Thomas Henzinger
ID - 4592
IS - 3
JF - SIGACT News
TI - Time for logic
VL - 22
ER -
TY - JOUR
AB - Two types of metabolically regulated K channels have been identified for the first time in enzymatically demyelinated fibres of amphibian sciatic nerve using the patch-clamp technique. A maxi K channel with a single-channel conductance of 132 pS (105 mM K on both sides of the membrane, 15°C) is activated both by micromolar concentrations of internal Ca and by depolarization. A second type of K channel with a conductance of 44 pS is inhibited by intracellular adenosine 5'-triphosphate (ATP) with a half-maximal inhibitory concentration (IC50) of 35 μM. It is blocked by submicromolar concentrations of external glibenclamide. Both channels are sensitive to external tetraethylammonium chloride (IC50 = 0.2 mM for the maxi K channel and 4.2 mM for the ATP-sensitive channel). They may be part of a complex feedback system regulating axonal excitability under various metabolic conditions.
AU - Peter Jonas
AU - Koh, Duk S
AU - Kampe, Knut
AU - Hermsteiner, Markus
AU - Vogel, Werner
ID - 3468
IS - 1-2
JF - Pflugers Archiv : European Journal of Physiology
TI - ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability
VL - 418
ER -
TY - CHAP
AU - Herbert Edelsbrunner
AU - Sharir, Micha
ID - 3566
T2 - Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift
TI - A hyperplane incidence problem with applications to counting distances
VL - 4
ER -