@article{2535,
abstract = {We report the molecular characterization of two novel rat helix-loop-helix (HLH) proteins, designated HES-1 and HES-3, that show structural homology to the Drosophila hairy and Enhancer of split [E(spl)] proteins, both of which are required for normal neurogenesis. HES-1 mRNA, expressed in various tissues of both embryos and adults, is present at a high level in the epithelial cells, including the embryonal neuroepithelial cells, as well as in the mesoderm-derived tissues such as the embryonal muscle. In contrast, HES-3 mRNA is produced exclusively in cerebellar Purkinje cells. HES-1 represses transcription by binding to the N box, which is a recognition sequence of E(spl) proteins. Interestingly, neither HES-1 nor HES-3 alone interacts efficiently with the E box, but each protein decreases the transcription induced by E-box-binding HLH activators such as E47. Furthermore, HES-1 also inhibits the functions of MyoD and MASH1 and effectively diminishes the myogenic conversion of C3H10T1/2 cells induced by MyoD. These results suggest that HES-1 may play an important role in mammalian development by negatively acting on the two different sequences while HES-3 acts as a repressor in a specific type of neurons.},
author = {Sasai, Yoshiki and Kageyama, Ryoichiro and Tagawa, Yoshiaki and Ryuichi Shigemoto and Nakanishi, Shigetada},
journal = {Genes and Development},
number = {12 B},
pages = {2620 -- 2634},
publisher = {Cold Spring Harbor Laboratory Press},
title = {{Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split}},
doi = {10.1101/gad.6.12b.2620},
volume = {6},
year = {1992},
}
@article{4043,
abstract = {It is shown 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). The algorithm is fairly easy to implement and is based on the edge-insertion scheme that iteratively improves an arbitrary initial triangulation. It can be extended to the case where edges are prescribed, and, within the same time- and space-bounds, it can lexicographically minimize the sorted angle vector if the point set is in general position. Experimental results on the efficiency of the algorithm and the quality of the triangulations obtained are included.},
author = {Herbert Edelsbrunner and Tan, Tiow Seng and Waupotitsch, Roman},
journal = {SIAM Journal on Scientific Computing},
number = {4},
pages = {994 -- 1008},
publisher = {Society for Industrial and Applied Mathematics },
title = {{An O(n^2 log n) time algorithm for the MinMax angle triangulation}},
doi = {10.1137/0913058},
volume = {13},
year = {1992},
}
@article{4046,
abstract = {The main contribution of this work is an O(n log n + k)-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.},
author = {Chazelle, Bernard and Herbert Edelsbrunner},
journal = {Journal of the ACM},
number = {1},
pages = {1 -- 54},
publisher = {ACM},
title = {{An optimal algorithm for intersecting line segments in the plane}},
doi = {10.1145/147508.147511},
volume = {39},
year = {1992},
}
@article{4047,
abstract = {Arrangements of curves in the plane are fundamental to many problems in computational and combinatorial geometry (e.g. motion planning, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results include a generalization of the zone theorem of Edelsbrunner (1986) and Chazelle (1985) to arrangements of curves (in which we show that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves) and an application of that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements.},
author = {Herbert Edelsbrunner and Guibas, Leonidas and Pach, János and Pollack, Richard and Seidel, Raimund and Sharir, Micha},
journal = {Theoretical Computer Science},
number = {2},
pages = {319 -- 336},
publisher = {Elsevier},
title = {{Arrangements of curves in the plane - topology, combinatorics, and algorithms}},
doi = {10.1016/0304-3975(92)90319-B},
volume = {92},
year = {1992},
}
@article{4048,
abstract = {Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires OMEGA(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set.},
author = {Aggarwal, Alok and Herbert Edelsbrunner and Raghavan, Prabhakar and Tiwari, Prasoon},
journal = {Information Processing Letters},
number = {1},
pages = {55 -- 60},
publisher = {Elsevier},
title = {{Optimal time bounds for some proximity problems in the plane}},
doi = {10.1016/0020-0190(92)90133-G},
volume = {42},
year = {1992},
}
@inproceedings{4049,
abstract = {The edge-insertion paradigm improves a triangulation of a finite point set in R2
iteratively by adding a new edge, deleting intersecting old edges, and retriangulating
the resulting two polygonal regions. After presenting an abstract view of the paradigm,
this paper shows that it can be used to obtain polynomial time algorithms for several
types of optimal triangulations.},
author = {Bern, Marshall and Herbert Edelsbrunner and Eppstein, David and Mitchell, Stephen and Tan, Tiow Seng},
pages = {46 -- 60},
publisher = {Springer},
title = {{Edge insertion for optimal triangulations}},
doi = {10.1007/BFb0023816},
volume = {583},
year = {1992},
}
@article{4050,
author = {Herbert Edelsbrunner},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {217 -- 217},
publisher = {Springer},
title = {{Guest editor's foreword}},
doi = {10.1007/BF02293046},
volume = {8},
year = {1992},
}
@article{4053,
abstract = {We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m2/3n2/3+nα(n)+nlog m). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is Ω(m2/3n2/3+nα(n)). In addition, we show that the number of edges bounding any m faces in an arrangement of n line segments with a total of t intersecting pairs is O(m2/3t1/3+nα(t/n)+nmin{log m,log t/n}), almost matching the lower bound of Ω(m2/3t1/3+nα(t/n)) demonstrated in this paper.},
author = {Aronov, Boris and Herbert Edelsbrunner and Guibas, Leonidas J and Sharir, Micha},
journal = {Combinatorica},
number = {3},
pages = {261 -- 274},
publisher = {Springer},
title = {{The number of edges of many faces in a line segment arrangement}},
doi = {10.1007/BF01285815},
volume = {12},
year = {1992},
}
@article{4195,
abstract = {The effects of tri-iodothyronine (T3), which are known to affect cerebellar development, were tested on neuronal survival and differentiation of cultured cerebellar granule neurons. T3 in physiological concentrations increased both granule neuron survival after three days in culture and synaptic vesicle protein formation, as shown by immunostaining with antibodies against synaptophysin. Likewise, T3 increased the mRNA level for synapsin(I), but not that for GAP43 in granule neurons. Antibodies against microtubule associated protein Tau, which is expressed in developing neurites, showed that T3 also enhanced neurite formation.},
author = {Heisenberg, Carl-Philipp and Thoenen, Hans and Lindholm, Dan},
journal = {Neuroreport},
number = {8},
pages = {685 -- 688},
publisher = {Lippincott, Williams & Wilkins},
title = {{Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons}},
volume = {3},
year = {1992},
}
@article{4305,
abstract = {The common shrew (Sorex araneus) is subdivided into several karyotypic races in Britain. Two of these races meet near Oxford to form the "Oxford-Hermitage" hybrid zone. We present a model which describes this system as a "tension zone," i.e., a set of clines maintained by a balance between dispersal and selection against chromosomal heterozygotes. The Oxford and Hermitage races differ by Robertsonian fusions with monobrachial homology (kq, no versus ko), and so F1 hybrids between them would have low fertility. However, the acrocentric karyotype is found at high frequency within the hybrid zone, so that complex Robertsonian heterozygotes (kq no/q ko n) are replaced by more fertile combinations, such as (kq no/k q n o). This suggests that the hybrid zone has been modified so as to increase hybrid fitness. Mathematical analysis and simulation show that, if selection against complex heterozygotes is sufficiently strong relative to selection against simple heterozygotes, acrocentrics increase, and displace the clines for kq and no from the cline for ko. Superimposed on this separation is a tendency for the hybrid zone to move m favor of the Oxford (kq no) race. We compare the model with estimates of linkage disequilibrium and cline shape made from field data.},
author = {Hatfield, Todd and Nicholas Barton and Searle, Jeremy B},
journal = {Evolution; International Journal of Organic Evolution},
number = {4},
pages = {1129 -- 1145},
publisher = {Wiley-Blackwell},
title = {{A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus)}},
volume = {46},
year = {1992},
}
@misc{4306,
author = {Nicholas Barton and Goldman, Nick G},
booktitle = {Nature},
pages = {440 -- 441},
publisher = {Nature Publishing Group},
title = {{Genetics and geography}},
doi = {10.1038/357440a0},
volume = {357},
year = {1992},
}
@inbook{4307,
author = {Nicholas Barton},
booktitle = {Animal dispersal: small mammals as a model},
editor = {Stenseth, Nils C and Lidicker, William Z},
pages = {37 -- 60},
publisher = {Chapman Hall},
title = {{The genetic consequences of dispersal}},
year = {1992},
}
@article{4308,
author = {Nicholas Barton},
journal = {Evolution; International Journal of Organic Evolution},
number = {2},
pages = {551 -- 557},
publisher = {Wiley-Blackwell},
title = {{On the spread of new gene combinations in the third phase of Wright's shifting balance}},
volume = {46},
year = {1992},
}
@inproceedings{4504,
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
pages = {545 -- 558},
publisher = {Springer},
title = {{What good are digital clocks?}},
doi = {10.1007/3-540-55719-9_103},
volume = {623},
year = {1992},
}
@inproceedings{4505,
abstract = {We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space.
For this purpose, we introduce a mu-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed mu-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs--those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory.},
author = {Thomas Henzinger and Nicollin, Xavier and Sifakis, Joseph and Yovine, Sergio},
pages = {394 -- 406},
publisher = {IEEE},
title = {{Symbolic model checking for real-time systems}},
doi = {10.1109/LICS.1992.185551},
year = {1992},
}
@inbook{4507,
abstract = {We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upperbound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction with the timed execution of concurrent processes. Our treatment covers both processes that are executed in parallel on separate processors and communicate either through shared variables or by message passing, and processes that time-share a limited number of processors under a given scheduling policy. Often it is this scheduling policy that determines if a system meets its real-time requirements. Thus we explicitly address such questions as time-outs, interrupts, static and dynamic priorities.},
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
booktitle = {Real Time: Theory in Practice},
pages = {226 -- 251},
publisher = {Springer},
title = {{Timed transition systems}},
doi = {10.1007/BFb0031995},
volume = {600},
year = {1992},
}
@article{4517,
abstract = {It has been observed repeatedly that the standard safety-liveness classification for properties of reactive systems does not fit for real-time properties. This is because the implicit “liveliness” of time shifts the spectrum towards the safety side. While, for example, response—that “something good” will happen eventually—is a classical liveness property, bounded response—that “something good” will happen soon, within a certain amount of time—has many characteristics of safety. We account for this phenomenon formally by defining safety and liveness relative to a given condition, such as the progress of time.},
author = {Thomas Henzinger},
journal = {Information Processing Letters},
number = {3},
pages = {135 -- 141},
publisher = {Elsevier},
title = {{Sooner Is Safer Than Later}},
doi = {10.1016/0020-0190(92)90005-G},
volume = {43},
year = {1992},
}
@inbook{4593,
abstract = {We survey logic-based and automata-based languages and techniques for the specification and verification of real-time systems. In particular, we discuss three syntactic extensions of temporal logic: time-bounded operators, freeze quantification, and time variables. We also discuss the extension of finite-state machines with clocks and the extension of transition systems with time bounds on the transitions. All of the resulting notations can be interpreted over a variety of different models of time and computation, including linear and branching time, interleaving and true concurrency, discrete and continuous time. For each choice of syntax and semantics, we summarize the results that are known about expressive power, algorithmic finite-state verification, and deductive verification.},
author = {Alur, Rajeev and Thomas Henzinger},
booktitle = {Real Time: Theory in Practice},
pages = {74 -- 106},
publisher = {Springer},
title = {{Logics and models of real time: A survey}},
doi = {10.1007/BFb0031984},
volume = {600},
year = {1992},
}
@inproceedings{4594,
abstract = {The authors introduce two-way timed automata-timed automata that can move back and forth while reading a timed word. Two-wayness in its unrestricted form leads, like nondeterminism, to the undecidability of language inclusion. However, if they restrict the number of times an input symbol may be revisited, then two-wayness is both harmless and desirable. The authors show that the resulting class of bounded two-way deterministic timed automata is closed under all boolean operations, has decidable (PSPACE-complete) emptiness and inclusion problems, and subsumes all decidable real-time logics we know. They obtain a strict hierarchy of real-time properties: deterministic timed automata can accept more languages as the bound on the number of times an input symbol may be revisited is increased. This hierarchy is also enforced by the number of alternations between past and future operators in temporal logic. The combination of the results leads to a decision procedure for a real-time logic with past operators
},
author = {Alur, Rajeev and Thomas Henzinger},
pages = {177 -- 186},
publisher = {IEEE},
title = {{Back to the future: Towards a theory of timed regular languages}},
doi = {10.1109/SFCS.1992.267774},
year = {1992},
}
@article{2714,
author = {László Erdös},
journal = {Acta Mathematica Hungarica},
number = {1-2},
pages = {11 -- 24},
publisher = {Springer},
title = {{On some problems of P. Turán concerning power sums of complex numbers}},
doi = {10.1007/BF00052086},
volume = {59},
year = {1992},
}