@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},
}
@article{2529,
abstract = {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.},
author = {Yasui, Yukihiko and Itoh, Kazuo and Kaneko, Takeshi and Ryuichi Shigemoto and Mizuno, Noboru},
journal = {Experimental Brain Research},
number = {1},
pages = {75 -- 84},
publisher = {Springer},
title = {{Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat}},
doi = {10.1007/BF00229988},
volume = {85},
year = {1991},
}
@article{3647,
abstract = {A method is developed that describes the effects on an arbitrary number of autosomal loci of selection on haploid and diploid stages, of nonrandom mating between haploid individuals, and of recombination. We provide exact recursions for the dynamics of allele frequencies and linkage disequilibria (nonrandom associations of alleles across loci). When selection is weak relative to recombination, our recursions provide simple approximations for the linkage disequilibria among arbitrary combinations of loci. We show how previous models of sex-independent natural selection on diploids, assortative mating between haploids, and sexual selection on haploids can be analyzed in this framework. Using our weak-selection approximations, we derive new results concerning the coevolution of male traits and female preferences under natural and sexual selection. In particular, we provide general expressions for the intensity of linkage-disequilibrium induced selection experienced by loci that contribute to female preferences for specific male traits. Our general results support the previous observation that these indirect selection forces are so weak that they are unlikely to dominate the evolution of preference-producing loci.},
author = {Nicholas Barton and Turelli, Michael},
journal = {Genetics},
number = {1},
pages = {229 -- 255},
publisher = {Genetics Society of America},
title = {{Natural and sexual selection on many loci}},
volume = {127},
year = {1991},
}
@article{4051,
abstract = {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.},
author = {Herbert Edelsbrunner and Shi, Weiping},
journal = {SIAM Journal on Computing},
number = {2},
pages = {259 -- 269},
publisher = {SIAM},
title = {{An O(n log^2 h) time algorithm for the three-dimensional convex hull problem}},
doi = {10.1137/0220016 },
volume = {20},
year = {1991},
}
@article{4056,
abstract = {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.},
author = {Herbert Edelsbrunner and Hajnal, Péter},
journal = {Journal of Combinatorial Theory Series A},
number = {2},
pages = {312 -- 316},
publisher = {Elsevier},
title = {{A lower bound on the number of unit distances between the vertices of a convex polygon}},
doi = {10.1016/0097-3165(91)90042-F},
volume = {56},
year = {1991},
}
@inproceedings{4621,
author = {Alur, Rajeev and Feder, Tomás and Thomas Henzinger},
pages = {139 -- 152},
publisher = {ACM},
title = {{The benefits of relaxing punctuality}},
year = {1991},
}
@article{2481,
abstract = {The family of mammalian tachykinin receptors consists of substance P receptor (SPR), neuromedin K receptor (NKR) and substance K receptor (SKR). In this investigation, tissue and regional distributions of the mRNAs for the three rat tachykinin receptors were investigated by blot-hybridization and RNase-protection analyses using the previously cloned receptor cDNAs. SPR mRNA is widely distributed in both the nervous system and peripheral tissues and is expressed abundantly in the hypothalamus and olfactory buld, as well as in the urinary bladder, salivary glands and small and large intestines. In contrast, NKR mRNA is predominantly expressed in the nervous system, particularly in the cortex, hypothalamus and cerebellum, whereas SKR mRNA expression is restricted to the peripheral tissues, being abundant in the urinary bladder, large intestine, stomach and adenal glands. Thus, the mRNAs for the three tachykinin receptors show distinct patterns of expression between the nervous system and peripheral tissues. Blot-hybridization analysis in combination with S1 nuclease protection and primer-extension analyses revealed that there are two large forms of SKR mRNA expressed commonly in the peripheral tissues, and two additional small forms of the mRNA expressed specifically in the adrenal gland and eye. These analyses also showed that the multiple forms of SKR mRNA differ in the lengths of the 5' mRNA portions, and that the two small forms of the mRNA, if translated, encode a truncated SKR polypeptide lacking the first two transmembrane domains. This investigation thus provides the comprehensive analysis of the distribution and mode of expression of the mRNAs for the multiple peptide receptors and offers a new basis on which to interpret the diverse functions of multiple tachykinin peptides in the CNS and peripheral tissues.},
author = {Tsuchida, Kunihiro and Ryuichi Shigemoto and Yokota, Yoshifumi and Nakanishi, Shigetada},
journal = {European Journal of Biochemistry},
number = {3},
pages = {751 -- 757},
publisher = {Wiley-Blackwell},
title = {{Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors}},
doi = {10.1111/j.1432-1033.1990.tb19396.x},
volume = {193},
year = {1990},
}
@article{3650,
abstract = {Hybrid zones can yield estimates of natural selection and gene flow. The width of a cline in gene frequency is approximately proportional to gene flow (σ) divided by the square root of per-locus selection ( &s). Gene flow also causes gametic correlations (linkage disequilibria) between genes that differ across hybrid zones. Correlations are stronger when the hybrid zone is narrow, and rise to a maximum roughly equal to s. Thus cline width and gametic correlations combine to give estimates of gene flow and selection. These indirect measures of σ and s are especially useful because they can be made from collections, and require no field experiments. The method was applied to hybrid zones between color pattern races in a pair of Peruvian Heliconius butterfly species. The species are Mullerian mimics of one another, and both show the same changes in warning color pattern across their respective hybrid zones. The expectations of cline width and gametic correlation were generated using simulations of clines stabilized by strong frequency-dependent selection. In the hybrid zone in Heliconius erato, clines at three major color pattern loci were between 8.5 and 10.2 km wide, and the pairwise gametic correlations peaked at R & 0.35. These measures suggest that s & 0.23 per locus, and that σ & 2.6 km. In erato, the shapes of the clines agreed with that expected on the basis of dominance. Heliconius melpomene has a nearly coincident hybrid zone. In this species, cline widths at four major color pattern loci varied between 11.7 and 13.4 km. Pairwise gametic correlations peaked near R & 1.00 for tightly linked genes, and at R & 0.40 for unlinked genes, giving s & 0.25 per locus and σ & 3.7 km. In melpomene, cline shapes did not perfectly fit theoretical shapes based on dominance; this deviation might be explained by long-distance migration and/or strong epistasis. Compared with erato, sample sizes in melpomene are lower and the genetics of its color patterns are less well understood. In spite of these problems, selection and gene flow are clearly of the same order of magnitude in the two species. The relatively high per locus selection coefficients agree with ``major gene'' theories for the evolution of Mullerian mimicry, but the genetic architecture of the color patterns does not. These results show that the genetics and evolution of mimicry are still only sketchily understood.},
author = {Mallet, James L and Nicholas Barton and Lamas,Gerado M and Santisteban, José C and Muedas, Manuel M and Eeley, Harriet},
journal = {Genetics},
number = {4},
pages = {921 -- 936},
publisher = {Genetics Society of America},
title = {{Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones}},
volume = {124},
year = {1990},
}
@article{4064,
abstract = {Given a set of data points pi = (xi, yi ) for 1 ≤ i ≤ n, the least median of squares regression line is a line y = ax + b for which the median of the squared residuals is a minimum over all choices of a and b. An algorithm is described that computes such a line in O(n 2) time and O(n) memory space, thus improving previous upper bounds on the problem. This algorithm is an application of a general method built on top of the topological sweep of line arrangements.},
author = {Herbert Edelsbrunner and Souvaine, Diane L},
journal = {Journal of the American Statistical Association},
number = {409},
pages = {115 -- 119},
publisher = {American Statistical Association},
title = {{Computing least median of squares regression lines and guided topological sweep}},
doi = {10.1080/01621459.1990.10475313},
volume = {85},
year = {1990},
}
@article{4069,
abstract = {Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.},
author = {Herbert Edelsbrunner},
journal = {Combinatorica},
number = {3},
pages = {251 -- 260},
publisher = {Springer},
title = {{An acyclicity theorem for cell complexes in d dimension}},
doi = {10.1007/BF02122779},
volume = {10},
year = {1990},
}
@inproceedings{4071,
abstract = {We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.},
author = {Herbert Edelsbrunner and Tan, Tiow Seng and Waupotitsch, Roman},
pages = {44 -- 52},
publisher = {ACM},
title = {{An O(n^2log n) time algorithm for the MinMax angle triangulation}},
doi = {10.1145/98524.98535},
year = {1990},
}