Search Results - (Author, Cooperation:M. Teichmann)

Showing 1 - 7 results of 7, query time: 0.14s Refine Results
  1. 1
  2. 2
    Staff View
    Publication Date:
    2014-07-22
    Publisher:
    Nature Publishing Group (NPG)
    Print ISSN:
    0028-0836
    Electronic ISSN:
    1476-4687
    Topics:
    Biology
    Chemistry and Pharmacology
    Medicine
    Natural Sciences in General
    Physics
    Keywords:
    Animals ; Binding Sites ; Cell Line, Tumor ; Down-Regulation/*genetics ; E-Box Elements/genetics ; Gene Expression Regulation, Neoplastic/*genetics ; Genes, myc/*genetics ; Humans ; Kruppel-Like Transcription Factors/metabolism ; Mice ; Neoplasms/*genetics ; Nuclear Proteins/metabolism ; Promoter Regions, Genetic/genetics ; Protein Inhibitors of Activated STAT/metabolism ; Proto-Oncogene Proteins c-myc/genetics/metabolism ; RNA Polymerase II/metabolism ; *Transcriptome ; Up-Regulation/*genetics
    Published by:
    Latest Papers from Table of Contents or Articles in Press
  3. 3
    Staff View
    ISSN:
    0168-9002
    Source:
    Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics:
    Physics
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  4. 4
    Arndt, P. ; Draht, D. ; Teichmann, M.

    Amsterdam : Elsevier
    Staff View
    ISSN:
    0168-9002
    Source:
    Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics:
    Physics
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  5. 5
    Schömer, E. ; Sellen, J. ; Teichmann, M. ; Chee Yap
    Springer
    Published 2000
    Staff View
    ISSN:
    1432-0541
    Keywords:
    Key words. Geometric optimization, Parametric search, ε-Approximation algorithms, Smallest enclosing cylinder, Best-fit line.
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Computer Science
    Mathematics
    Notes:
    Abstract. This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in time O(n 4 log O(1) n) in an algebraic complexity model. We also achieve a time of O(n 4 L⋅μ(L)) in a bit complexity model where L is the maximum bit size of input numbers and μ(L) is the complexity of multiplying two L bit integers. These and several other results highlight a general linearization technique which transforms nonlinear problems into some higher-dimensional but linear problems. The technique is reminiscent of the use of Plücker coordinates, and is used here in conjunction with Megiddo's parametric searching. We further report on experimental work comparing the practicality of an exact with that of a numerical strategy.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  6. 6
    Teichmann, M. ; Mishra, B.
    Springer
    Published 2000
    Staff View
    ISSN:
    1432-0541
    Keywords:
    Key words. Multifinger robot hands, Grasping, Closure grasps, Grasp metrics, Fixturing, Polytope covering, Approximate geometric algorithms.
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Computer Science
    Mathematics
    Notes:
    Abstract. Given an object with n points on its boundary where fingers can be placed, we give algorithms to select a ``strong'' grasp with the least number c of fingers (up to a logarithmic factor) using several measures of goodness. Along similar lines, given an integer c , we find the ``best'' κ c log c finger grasp for a small constant κ . In addition, we generalize existing measures for the case of frictionless assemblies of many objects in contact. We also give an approximation scheme which guarantees a grasp quality close to the overall optimal value where fingers are not restricted to preselected points. These problems translate into a collection of convex set covering problems where we either minimize the cover size or maximize the scaling factor of an inscribed geometric object L . We present an algorithmic framework which handles these problems in a uniform way and give approximation algorithms for specific instances of L including convex polytopes and balls. The framework generalizes an algorithm for polytope covering and approximation by Clarkson [Cla] in two different ways. Let $\gamma = 1/{\lfloor d/2 \rfloor}$ , where d is the dimension of the Euclidean space containing L . For both types of problems, when L is a polytope, we get the same expected time bounds (with a minor improvement), and for a ball, the expected running time is $O(n^{1+\delta} + (nc)^{1/(1+\gamma/(1+\delta))} + c \log(n/c) (c \log c)^{\lfloor d/2 \rfloor} )$ for fixed d , and arbitrary positive δ . We improve this bound if we allow in addition a different kind of approximation for the optimal radius. We also give bounds when d is not a constant.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses
  7. 7
    Staff View
    ISSN:
    1432-1912
    Keywords:
    Lung metabolism ; Surfactant system of the lung ; Phospholipids ; Phospholipidosis
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Medicine
    Notes:
    Summary The incorporation of lauric acid, palmitic acid and oleic acid into phospholipids of lung and liver has been studied in tissue slices of control rabbits and of rabbits treated with bromhexine or ambroxol in doses of 10 mg/kg. A marked increase (up to 200% of the controls) of palmitic acid incorporation into phosphatidylcholine (lecithin) and phosphatidyl-ethanolamine of the lung was found whereas the incorporation rate of palmitic acid into lecithin and phosphatidylethanolamine of the liver displayed no significant change. The incorporation of lauric acid and oleic acid into lung phospholipids was not accelerated. The observed effects were more marked in short time experiments (analysis 2 h after drug injection) than after treatments for 7 days. It is concluded that the phospholipid synthesis is stimulated by the drugs especially in the lungs. This seems to be of particular interest with respect to the surfactant system of the lung and might have some therapeutic relevance.
    Type of Medium:
    Electronic Resource
    URL:
    Articles: DFG German National Licenses