ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Bounded time-stamps (1993)
    Springer
    Distributed computing 6 (1993), S. 205-209 
    Details
    ISSN: 1432-0452
    Keywords: Time-stamps ; Bounded protocols ; Precedence relation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary Time-stamps are labels which a system adds to its data items. These labels enable the system to keep track of the temporal precedence relations among its data elements. Many distributed protocols and some applications use the natural numbers as time-stamps. The natural numbers however are not useful for bounded protocols. In this paper we develop a theory ofbounded time-stamps. Time-stamp schemes are defined and the complexity of their implementation is analyzed. This indicates a direction for developing a general tool for converting time-stamp based protocols to bounded protocols.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242708
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Geometric optimization andD P -completeness (1989)
    Springer
    Discrete & computational geometry 4 (1989), S. 3-13 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we show a number of natural geometric optimization problems in the plane to becomplete for a classD P . The classD p contains both NP and Co-NP and is contained in Δ 2 P =P NP. Completeness inD p is exhibited under many-one and positive reductions. Further anOptP(O(logn)) result is also obtained for some of these optimization problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02187711
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Oxidative peptide (and amide) formation from Schiff base complexes (1982)
    Springer
    Journal of molecular evolution 19 (1982), S. 1-8 
    Details
    ISSN: 1432-1432
    Keywords: Pre-biotic ; Schiff base ; Amide bond ; Genetic code ; Origin of life
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Summary One hypothesis of the origin of pre-modern forms of life is that the original replicating molecules were specific polypeptides which acted as templates for the assembly of poly-Schiff bases complementary to the template, and that these polymers were then oxidized to peptide linkages, probably by photo-produced oxidants. A double cycle of such anti-parallel complementary replication would yield the original peptide polymer. If this model were valid, the Schiff base between an N-acyl alpha amino aldehyde and an amino acid should yield a dipeptide in aqueous solution in the presence of an appropriate oxidant. In the present study it is shown that the substituted dipeptide, N-acetyl-tyrosyl-tyrosine, is produced in high yield in aqueous solution at pH 9 through the action of H2O2 on the Schiff-base complex between N-acetyl-tyrosinal and tyrosine and that a great variety of N-acyl amino acids are formed from amino acids and aliphatic aldehydes under similar conditions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02100218
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Foreword (1994)
    Springer
    Machine learning 14 (1994), S. 5-5 
    Details
    ISSN: 0885-6125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1022690520014
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Foreword (1994)
    Springer
    Machine learning 14 (1994), S. 5-5 
    Details
    ISSN: 0885-6125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00993159
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Partial regularity of energy minimizing harmonic maps into a complete manifold (1995)
    Springer
    Calculus of variations and partial differential equations 3 (1995), S. 513-529 
    Details
    ISSN: 1432-0835
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we study energy minimizing harmonic maps into a complete Riemannian manifold. We prove that the singular set of such a map has Hausdorff dimension at mostn−2, wheren is the dimension of the domain. We will also give an example of an energy minimizing map from surface to surface that has a singular point. Thus then−2 dimension estimate is optimal, in contrast to then−3 dimension estimate of Schoen-Uhlenbeck [SU] for compact targets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01187899
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Partial regularity of energy minimizing harmonic maps into a complete manifold (1995)
    Springer
    Calculus of variations and partial differential equations 3 (1995), S. 513-529 
    Details
    ISSN: 1432-0835
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. In this paper, we study energy minimizing harmonic maps into a complete Riemannian manifold. We prove that the singular set of such a map has Hausdorff dimension at most $n-2$ , where $n$ is the dimension of the domain. We will also give an example of an energy minimizing map from surface to surface that has a singular point. Thus the $n - 2$ dimension estimate is optimal, in contrast to the $n - 3$ dimension estimate of Schoen-Uhlenbeck [SU] for compact targets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01187899
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Images of Hankel operators (1997)
    Springer
    Integral equations and operator theory 28 (1997), S. 87-96 
    Details
    ISSN: 1420-8989
    Keywords: 47B35 ; 30C40
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01198798
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    DNA sequencing and string learning (1996)
    Springer
    Theory of computing systems 29 (1996), S. 387-405 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In laboratories the majority of large-scale DNA sequencing is done following theshotgun strategy, which is to sequence large amount of relatively short fragments randomly and then heuristically find a shortest common superstring of the fragments [26]. We study mathematical frameworks, under plausible assumptions, suitable for massive automated DNA sequencing and for analyzing DNA sequencing algorithms. We model the DNA sequencing problem as learning a string from its randomly drawn substrings. Under certain restrictions, this may be viewed as string learning in Valiant's distribution-free learning model and in this case we give an efficient learning algorithm and a quantitative bound on how many examples suffice. One major obstacle to our approach turns out to be a quite well-known open question on how to approximate a shortest common superstring of a set of strings, raised by a number of authors in the last 10 years [9], [29], [30]. We give the firstprovably good algorithm which approximates a shortest superstring of lengthn by a superstring of lengthO(n logn). The algorithm works equally well even in the presence of negative examples, i.e., when merging of some strings is prohibited.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01192694
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Statistical properties of finite sequences with high Kolmogorov complexity (1994)
    Springer
    Theory of computing systems 27 (1994), S. 365-376 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We investigate to what extent finite binary sequences with high Kolmogorov complexity are normal (all blocks of equal length occur equally frequently), and the maximal length of all-zero or all-one runs which occur with certainty.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01192146
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...