ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Springer  (262)
  • 1990-1994  (257)
  • 1955-1959  (5)
Collection
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of materials science 29 (1994), S. 1097-1100 
    ISSN: 1573-4803
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Conductive silicon carbide particles were incorporated into an insulating cristobalite ceramic matrix to produce composite materials with a sizeable positive temperature coefficient (PTC) effect. A large drop in resistivity with silicon carbide content at room temperature, or percolation behaviour, was observed. The PTC effect of the composites, which resulted from the thermal expansion of the cristobalite ceramic matrix, was a maximum with five orders of magnitude for the specimen with 25 vol% silicon carbide. The PTC transition temperature of the composites was at 260 °C, which coincided exactly the reversible high-low phase inversion temperature of the cristobalite ceramic matrix.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 1994-02-01
    Print ISSN: 0022-2461
    Electronic ISSN: 1573-4803
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1432-203X
    Keywords: Medicago sativa ; Alfalfa ; Transformation ; Agrobacterium
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract The trait for somatic embryogenesis is being introduced sexually into alfalfa (Medicago sativa) breeding populations to facilitate genetic transformation of this crop. Cocultivation experiments were conducted with an agronomically-improved embryogenic clone from one such population as well as with two other embryogenic clones, one of which was the source of the embryogenic trait in the breeding populations. Transgenic plants were produced from the agronomically-improved clone whereas none were produced from the other two clones. Among the 16 transgenic plants analyzed there was a range in both copy number and number of integration sites for the NPT-II gene; those plants regenerated after a prolonged selection phase in vitro generally had the highest numbers in both respects. There was no evidence of sectoral chimerism of the transgene in a subsample of transgenic plants analyzed by PCR.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 70 (1994), S. 449-461 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract. The responses of “complex” simple cells to sharp and blurred ramp edges were studied. These responses are quite similar to those in the case of lines, which implies that phase information cannot be used to discriminate between ramp edges and lines. Furthermore, if the maximum of the modulus is used as a position estimate, a systematic bias toward the ramp side results, and this bias increases with edge blur. In contrast, a local extremum in the real part of the cell responses provides a precise position estimate, even for strongly blurred edges. Possible multiscale detection strategies are discussed in the context of a syntactical visual reconstruction. This is illustrated by an explanation of Mach bands as perceived at trapezoidal edges, including Ratliff’s Mach-band cancellation stimulus, and criteria for local probability summation in the prediction of Mach-band detection thresholds are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 5 (1990), S. 111-128 
    ISSN: 1432-0541
    Keywords: Rectilinear figure ; Rectilinear partition ; Monotonic histogram ; Dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The problem of partitioning a rectilinear figure into rectangles with minimum length is NP-hard and has bounded heuristics. In this paper we study a related problem,Elimination Problem (EP), in which a rectilinear figure is partitioned into a set of rectilinear figures containing no concave vertices of a fixed direction with minimum length. We show that a heuristic for EP within a factor of 4 from optimal can be computed in timeO(n 2), wheren is the number of vertices of the input figure, and a variant of this heuristic, within a factor of 6 from optimal, can be computed in timeO(n logn). As an application, we give a bounded heuristic for the problem of partitioning a rectilinear figure into histograms of a fixed direction with minimum length. An auxiliary result is that an optimal rectangular partition of a monotonic histogram can be computed in timeO(n 2), using a known speed-up technique in dynamic programming.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 7 (1992), S. 121-135 
    ISSN: 1432-0541
    Keywords: Steiner trees ; Spanning trees ; Steiner ratio ; Convexity ; Hexagonal trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetP be a set ofn points on the euclidean plane. LetL s(P) andL m (P) denote the lengths of the Steiner minimum tree and the minimum spanning tree onP, respectively. In 1968, Gilbert and Pollak conjectured that for anyP,L s (P)≥(√3/2)L m (P). We provide a proof for their conjecture in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 7 (1992), S. 179-191 
    ISSN: 1432-0541
    Keywords: Steiner trees ; Spanning trees ; Steiner ratio ; L p distance ; Bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetL p be the plane with the distanced p (A 1 ,A 2 ) = (¦x 1 −x 2¦ p + ¦y1 −y 2¦p)/1p wherex i andy i are the cartesian coordinates of the pointA i . LetP be a finite set of points inL p . We consider Steiner minimal trees onP. It is proved that, for 1 〈p 〈 ∞, each Steiner point is of degree exactly three. Define the Steiner ratio ϱ p to be inf{L s (P)/L m (P)¦P⊂L p } whereL s (P) andL m (P) are lengths of the Steiner minimal tree and the minimal spanning tree onP, respectively. Hwang showed ϱ1 = 2/3. Chung and Graham proved ϱ2 〉 0.842. We prove in this paper that ϱ{∞} = 2/3 and √(√2/2)ϱ1ϱ2 ≤ ϱp ≤ √3/2 for anyp.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    The VLDB journal 2 (1993), S. 215-241 
    ISSN: 0949-877X
    Keywords: Multidatabases ; replicated data management ; concurrency control ; replica control ; serializability ; resolvable conflicts
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Replication is useful in multidatabase systems (MDBSs) because, as in traditional distributed database systems, it increases data availability in the presence of failures and decreases data retrieval costs by reading local or close copies of data. Concurrency control, however, is more difficult in replicated MDBSs than in ordinary distributed database systems. This is the case not only because local concurrency controllers may schedule global transactions inconsistently, but also because local transactions (at different sites) may access the same replicated data. In this article, we propose a decentralized concurrency control protocol for a replicated MDBS. The proposed strategy supports prompt and consistent updates of replicated data by both local and global applications without a central coordinator.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 9 (1993), S. 351-370 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A minimum Steiner tree for a given setX of points is a network interconnecting the points ofX having minimum possible total length. In this note we investigate various properties of minimum Steiner trees in normed planes, i.e., where the “unit disk” is an arbitrary compact convex centrally symmetric domainD having nonempty interior. We show that if the boundary ofD is strictly convex and differentiable, then each edge of a full minimum Steiner tree is in one of three fixed directions. We also investigate the Steiner ratioρ(D) forD, and show that, for anyD, 0.623〈ρ(D)〈0.8686.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 5 (1990), S. 351-356 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We investigate maximum size sets of lattice points with a given diameter,d, within a given rectilinearly bounded finite regionR inn dimensions, under the Manhattan orL1 metric. We show that when the length ofR in each dimension is an odd integer (as, for example, then-cube) there is, for every integerd, a maximum size set having radiusd/2 about some center, though the center need not be a lattice point. Similar results are obtained whenR has even length in some dimensions, except for a set ofd values whose cardinality is one less than the number of dimensions in whichR has even length. This question is still open for these values.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...