Chemical cues and pheromones in the sea lamprey (Petromyzon marinus)

Chemical cues and pheromones guide decisions in organisms throughout the animal kingdom. The neurobiology, function, and evolution of olfaction are particularly well described in insects, and resulting concepts have driven novel approaches to pest control. However, aside from several exceptions, the olfactory biology of vertebrates remains poorly understood. One exception is the sea lamprey (Petromyzon marinus), which relies heavily upon olfaction during reproduction. Here, we provide a broad review of the chemical cues and pheromones used by the sea lamprey during reproduction, including overviews of the sea lamprey olfactory system, chemical cues and pheromones, and potential applications to population management. The critical role of olfaction in mediating the sea lamprey life cycle is evident by a well-developed olfactory system. Sea lamprey use chemical cues and pheromones to identify productive spawning habitat, coordinate spawning behaviors, and avoid risk. Manipulation of olfactory biology offers opportunities for management of populations in the Laurentian Great Lakes, where the sea lamprey is a destructive invader. We suggest that the sea lamprey is a broadly useful organism with which to study vertebrate olfaction because of its simple but well-developed olfactory organ, the dominant role of olfaction in guiding behaviors during reproduction, and the direct implications for vertebrate pest management

Konzept und Studienplan für eine Fachrichtung "Wirtschaftsinformatik" im Studiengang Informatik der TU Berlin

Franck H, Spitta T. Konzept und Studienplan für eine Fachrichtung "Wirtschaftsinformatik" im Studiengang Informatik der TU Berlin. In: Siefkes D, ed. GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974. Lecture Notes in Computer Science. Vol 26. Berlin, Heidelberg: Springer; 1974: 703-712

Wende zur Phantasie Zur Theoriebildung in der Informatik

TIB: RN 2856(90-17) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Ungelogene unlogische Geschichten

SIGLETIB: RN 2856 (85-18) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

On Sets Polynomially Enumerable by Iteration

Sets whose members are enumerated by some Turing machine are called recursively enumerable. We define a set to be polynomially enumerable by iteration if its members are efficiently enumerated by iterated application of some Turing machine. We prove that many complex sets - including all exponential-time complete sets, all NP-complete sets yet obtained by direct construction, and the complements of all such sets - are polynomially enumerable by iteration. These results follow from more general results. In fact, we show that all recursively enumerable sets that are ≤p over 1, si -self-reducible are polynomially enumerable by iteration, and that all recursive sets that are ≤p over 1, si -self-reducible are bi-enumerable. We also show that when the ≤p over 1, si-self-reduction is via a function whose inverse is computable in polynomial time, then the above results not only hold, but also hold with the polynomial enumeration given by a function whose inverse is computable in polynomial time. In the final section of the paper we show that no NP-complete set can be iteratively enumerated in lexicographically increasing order unless the polynomial time hierarchy collapses to NP. We also show that the sets that are monotonically bi-enumerable are "essentially" the same as the sets in parity polynomial time

Completeness proofs for logic programming Refutations and derivations for ground clauses

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman