@inbook{3566,
author = {Herbert Edelsbrunner and Sharir, Micha},
booktitle = {Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift},
pages = {253 -- 263},
publisher = {American Mathematical Society},
title = {{A hyperplane incidence problem with applications to counting distances}},
volume = {4},
year = {1991},
}
@article{3648,
abstract = {We investigate the probability of fixation of a chromosome rearrangement in a subdivided population, concentrating on the limit where migration is so large relative to selection (m ≫ s) that the population can be thought of as being continuously distributed. We study two demes, and one- and two-dimensional populations. For two demes, the probability of fixation in the limit of high migration approximates that of a population with twice the size of a single deme: migration therefore greatly reduces the fixation probability. However, this behavior does not extend to a large array of demes. Then, the fixation probability depends primarily on neighborhood size (Nb), and may be appreciable even with strong selection and free gene flow (≈exp(-B·Nb) in one dimension, ≈exp(-B\cdotNb) in two dimensions). Our results are close to those for the more tractable case of a polygenic character under disruptive selection.},
author = {Nicholas Barton and Rouhani, Shahin},
journal = {Evolution},
number = {3},
pages = {499 -- 517},
publisher = {Wiley-Blackwell},
title = {{The probability of fixation of a new karyotype in a continuous population}},
volume = {45},
year = {1991},
}
@article{4052,
abstract = {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.},
author = {Chazelle, Bernard and Herbert Edelsbrunner and Guibas, Leonidas J and Sharir, Micha},
journal = {Theoretical Computer Science},
number = {1},
pages = {77 -- 105},
publisher = {Elsevier},
title = {{A singly exponential stratification scheme for real semi-algebraic varieties and its applications}},
doi = {10.1016/0304-3975(91)90261-Y},
volume = {84},
year = {1991},
}
@article{4057,
author = {Herbert Edelsbrunner},
journal = {Journal of Computer and System Sciences},
number = {2},
pages = {249 -- 251},
publisher = {Elsevier},
title = {{Corrigendum}},
doi = {10.1016/0022-0000(91)90013-U},
volume = {42},
year = {1991},
}
@article{1946,
abstract = {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.},
author = {Zaǐtsev, Sergei V and Leonid Sazanov and Koshkin, Aleksei A and Sud'Ina, Galina F and Varfolomeev, Sergei D},
journal = {FEBS Letters},
number = {1},
pages = {84 -- 86},
publisher = {Elsevier},
title = {{Respiratory burst inhibition in human neutrophils by ultra-low doses of [D-Ala2] methionine enkephalinamide}},
doi = {10.1016/0014-5793(91)81109-L},
volume = {291},
year = {1991},
}
@article{2482,
abstract = {The complementary DNA of a metabotropic glutamate receptor coupled to inositol phosphate/Ca2+ signal transduction has been cloned and characterized. This receptor shows no sequence similarity to conventional G protein-coupled receptors and has a unique structure with large hydrophilic sequences at both sides of seven putative membrane-spanning domains. Abundant expression of this messenger RNA is observed in neuronal cells in hippocampal dentate gyrus and CA2-3 and in cerebellar Purkinje cells, suggesting the importance of this receptor in specific hippocampal and cerebellar functions.},
author = {Masu, Masayuki and Tanabe, Yasuto and Tsuchida, Kunihiro and Ryuichi Shigemoto and Nakanishi, Shigetada},
journal = {Nature},
number = {6312},
pages = {760 -- 765},
publisher = {Nature Publishing Group},
title = {{Sequence and expression of a metabotropic glutamate receptor}},
doi = {10.1038/349760a0},
volume = {349},
year = {1991},
}
@inbook{3567,
author = {Herbert Edelsbrunner},
booktitle = {Discrete & Computational Geometry},
pages = {77 -- 93},
publisher = {Springer},
title = {{Lines in space – A collection of results}},
volume = {6},
year = {1991},
}
@inproceedings{4058,
abstract = {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.},
author = {Chazelle, Bernard and Herbert Edelsbrunner and Guibas, Leonidas and Sharir, Micha and Snoeyink, Jack},
pages = {441 -- 448},
publisher = {SIAM},
title = {{Computing a face in an arrangement of line segments}},
year = {1991},
}
@inproceedings{4508,
abstract = {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 ...},
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
pages = {353 -- 366},
publisher = {ACM},
title = {{Temporal proof methodologies for real-time systems}},
doi = {10.1145/99583.99629},
year = {1991},
}
@article{2483,
abstract = {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.},
author = {Moriyoshi, Koki and Masu, Masayuki and Ishii, Takahiro and Ryuichi Shigemoto and Mizuno, Noboru and Nakanishi, Shigetada},
journal = {Nature},
number = {6348},
pages = {31 -- 37},
publisher = {Nature Publishing Group},
title = {{Molecular cloning and characterization of the rat NMDA receptor}},
doi = {10.1038/354031a0},
volume = {353},
year = {1991},
}
@inproceedings{4054,
abstract = {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.},
author = {Herbert Edelsbrunner and Seidel, Raimund and Sharir, Micha},
pages = {108 -- 123},
publisher = {Springer},
title = {{On the zone theorem for hyperplane arrangements}},
doi = {10.1007/BFb0038185},
volume = {555},
year = {1991},
}
@inproceedings{4059,
abstract = {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.},
author = {Chazelle, Bernard and Herbert Edelsbrunner and Grigni, Michelangelo and Guibas, Leonidas and Hershberger, John and Sharir, Micha and Snoeyink, Jack},
pages = {661 -- 673},
publisher = {Springer},
title = {{Ray shooting in polygons using geodesic triangulations}},
doi = {10.1007/3-540-54233-7_172},
volume = {510},
year = {1991},
}
@article{4061,
abstract = {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}.},
author = {Agarwal, Pankaj K and Herbert Edelsbrunner and Schwarzkopf, Otfried and Welzl, Emo},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {407 -- 422},
publisher = {Springer},
title = {{Euclidean minimum spanning trees and bichromatic closest pairs}},
doi = {10.1007/BF02574698},
volume = {6},
year = {1991},
}
@article{4592,
author = {Alur, Rajeev and Thomas Henzinger},
journal = {SIGACT News},
number = {3},
pages = {6 -- 12},
publisher = {ACM},
title = {{Time for logic}},
volume = {22},
year = {1991},
}
@phdthesis{4516,
author = {Thomas Henzinger},
publisher = {Stanford University},
title = {{The Temporal Specification and Verification of Real-time Systems }},
year = {1991},
}
@article{2530,
author = {Nakanishi, Shigetada and Ohkubo, Hiroaki and Kakizuka, Akira and Yokota, Yoshifumi and Ryuichi Shigemoto and Sasai, Yoshiki and Takumi, Toru},
journal = {Recent Progress in Hormone Research},
number = {1},
pages = {59 -- 83},
publisher = {The Endocrine Society},
title = {{Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel}},
volume = {46},
year = {1991},
}
@article{3646,
abstract = {We compare the pattern of morphological and electrophoretic variation in the hybrid zone between Bombina bombina and B. variegata across two transects: one near Cracow and one 200 km away, near Przemysl in southeastern Poland. Morphological variation across the Przemysl transect had been surveyed more than 50 years ago; though we found a significant shift at one site, there is no evidence for gross movement over this period. Morphological and electrophoretic changes coincide, and the average shape of the clines is the same across both transects. At the center, most of the change in frequency of six diagnostic allozymes occurs within w = 6.05 km (2-unit support limits 5.56-6.54 km). These steep gradients are generated not by selection on the allozymes themselves, but by associations with other loci: though these markers are unlinked, they are in strong linkage disequilibrium with each other [R = D/ = 0.22 (0.15-0.29) at the center]. Disequilibria are broken up as alleles diffuse away from the zone and flow into the new genetic background. The net barrier to the flow of genes from bombina into variegata, which is generated by these disequilibria, is B = 51 (22-81) km. The fitness of hybrids must be substantially reduced to produce such a barrier [W̄H/W̄P = 0.58 (0.54-0.68)], and this selection must be spread over many loci [N = 55 (26-88)]. Alleles introgress significantly less far than would be expected from the age of the zone and the estimated dispersal rate [σ = 0.99 (0.82-1.14) km gen.-1/2]: this implies selection of se = 0.37 (0.15-0.58)% on the enzymes themselves. There is weak but significant linkage disequilibrium well away from the center of the zone; this, together with the presence of parental and F1 genotypes, suggests some long-range migration. However, such migration is not likely to cause significant introgression.
},
author = {Szymura, Jacek M and Nicholas Barton},
journal = {Evolution},
number = {2},
pages = {237 -- 261},
publisher = {Wiley-Blackwell},
title = {{The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci}},
volume = {45},
year = {1991},
}
@article{3468,
abstract = {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.
},
author = {Peter Jonas and Koh, Duk S and Kampe, Knut and Hermsteiner, Markus and Vogel, Werner},
journal = {Pflugers Archiv : European Journal of Physiology},
number = {1-2},
pages = {68 -- 73},
publisher = {Springer},
title = {{ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability}},
doi = {10.1007/BF00370453},
volume = {418},
year = {1991},
}
@inproceedings{4055,
abstract = {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.},
author = {Herbert Edelsbrunner and Tan, Tiow Seng},
pages = {414 -- 423},
publisher = {IEEE},
title = {{A quadratic time algorithm for the minmax length triangulation}},
doi = {10.1109/SFCS.1991.185400},
year = {1991},
}
@article{4062,
abstract = {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.},
author = {Aronov, Boris and Chazelle, Bernard and Herbert Edelsbrunner and Guibas, Leonidas J and Sharir, Micha and Wenger, Rephael},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {435 -- 442},
publisher = {Springer},
title = {{Points and triangles in the plane and halving planes in space}},
doi = {10.1007/BF02574700},
volume = {6},
year = {1991},
}