Library

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
Filter
  • Electronic Resource  (3)
  • 1995-1999  (1)
  • 1985-1989  (2)
Source
Material
  • Electronic Resource  (3)
Years
Year
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    An inverse problem in crystallography (1985)
    College Park, Md. : American Institute of Physics (AIP)
    Journal of Mathematical Physics 26 (1985), S. 2717-2720 
    Details
    ISSN: 1089-7658
    Source: AIP Digital Archive
    Topics: Mathematics , Physics
    Notes: Coordinate-independent formulations are derived for the conditions satisfied by the elastic modulus tensor of materials with trigonal, hexagonal, and cubic symmetry. Analogous results for two-dimensional modulus tensors are also derived.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1063/1.526741
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A comparison of six cypovirus isolates by cross-hybridisation of their dsRNA genome segments (1999)
    Springer
    Archives of virology 144 (1999), S. 561-576 
    Details
    ISSN: 1432-8798
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Summary.  Genetic relationships between the genome segments of six cypovirus (CPV) isolates were analysed by RNA cross-hybridisation. These included three type 1 viruses and single isolates of types 2, 5 and 12, which collectively are identical to those previously compared by serology and electrophoresis [Mertens et al. (1989), J Gen Virol 70: 173–185]. Since only genome segment 10 of three cypovirus types and segments 8 and 9 of a single virus strain (of type 1) have currently been sequenced, this initial study provides some additional information on sequence variation / similarity in each of the ten genome segments. The RNA of the type 1 viruses showed high levels of cross-hybridisation. Significant but much lower levels of cross-hybridisation were detected between type 1 and the related type 12 CPV. However, only very low levels of cross-hybridisation were detected between the other pairs of viruses. Apart from evidence of a slightly higher level of sequence similarity between the largest segments, the RNA sequence appeared to vary uniformly across the whole genome. There was no evidence for any type specific RNA sequences restricted to individual genome segment(s). The sequence variation, reflected in the levels of RNA sequence similarity and cross hybridisation, correlates well with serological data, showing large differences between CPV types and supports the continued use of electropherotype as one of the ‘species parameters’ for the classification of cypoviruses.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s007050050525
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Optimal coverage of convex regions (1986)
    Springer
    Journal of optimization theory and applications 51 (1986), S. 321-343 
    Details
    ISSN: 1573-2878
    Keywords: Coverage problems ; convex hulls ; Monte Carlo optimization ; nonconvex programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of the coverage of convex regions with polygons and quadratic configurations of minimal volume is considered. The regions are presented as inequality constraints of a linear or nonlinear programming problem. It is shown that the problem of the optimal coverage with an arbitrary polygon can be reduced to a convex one of coverage with a multidimensional rectangle. If, however, rotation of the coordinate system is allowed, an additional nonconvex problem must be solved. It is also shown that, to find the minimal covering hypersphere or hyperellipsoid, one has to solve two convex programming problems. Algorithms and examples illustrating the feasibility of the proposed methods are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00939828
    Library Location Call Number Volume/Issue/Year 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...