About the Project

relaxation times for proteins

AdvancedHelp

(0.002 seconds)

1—10 of 176 matching pages

1: 8.24 Physical Applications
§8.24(i) Incomplete Gamma Functions
The function γ ( a , x ) appears in: discussions of power-law relaxation times in complex physical systems (Sornette (1998)); logarithmic oscillations in relaxation times for proteins (Metzler et al. (1999)); Gaussian orbitals and exponential (Slater) orbitals in quantum chemistry (Shavitt (1963), Shavitt and Karplus (1965)); population biology and ecological systems (Camacho et al. (2002)). …
2: Guide to Searching the DLMF
Query relaxation
If a query does not return any hits, the DLMF search system relaxes the query to match and retrieve what may be intended by the original query. … To find more effectively the information you need, especially equations, you may at times wish to specify what you want with descriptive words that characterize the contents but do not occur literally. …
3: How to Cite
4: Bibliography M
  • R. Metzler, J. Klafter, and J. Jortner (1999) Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems. Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
  • 5: 20.10 Integrals
    20.10.1 0 x s 1 θ 2 ( 0 | i x 2 ) d x = 2 s ( 1 2 s ) π s / 2 Γ ( 1 2 s ) ζ ( s ) , s > 1 ,
    20.10.2 0 x s 1 ( θ 3 ( 0 | i x 2 ) 1 ) d x = π s / 2 Γ ( 1 2 s ) ζ ( s ) , s > 1 ,
    20.10.3 0 x s 1 ( 1 θ 4 ( 0 | i x 2 ) ) d x = ( 1 2 1 s ) π s / 2 Γ ( 1 2 s ) ζ ( s ) , s > 0 .
    6: 18.32 OP’s with Respect to Freud Weights
    These conditions on Q ( x ) have been strengthened and also relaxed in literature. …
    7: 21.1 Special Notation
    g , h positive integers.
    g × × × ( g times).
    g × × × ( g times).
    g × h set of all g × h matrices with integer elements.
    𝟎 g g × g zero matrix.
    Uppercase boldface letters are g × g real or complex matrices. …
    8: 35.2 Laplace Transform
    35.2.1 g ( 𝐙 ) = 𝛀 etr ( 𝐙 𝐗 ) f ( 𝐗 ) d 𝐗 ,
    If g j is the Laplace transform of f j , j = 1 , 2 , then g 1 g 2 is the Laplace transform of the convolution f 1 f 2 , where
    35.2.3 f 1 f 2 ( 𝐓 ) = 𝟎 < 𝐗 < 𝐓 f 1 ( 𝐓 𝐗 ) f 2 ( 𝐗 ) d 𝐗 .
    9: 26.12 Plane Partitions
    An equivalent definition is that a plane partition is a finite subset of × × with the property that if ( r , s , t ) π and ( 1 , 1 , 1 ) ( h , j , k ) ( r , s , t ) , then ( h , j , k ) must be an element of π . … We define the r × s × t box B ( r , s , t ) as …
    26.12.9 ( h = 1 r j = 1 s h + j + t 1 h + j 1 ) 2 ;
    26.12.10 ( h = 1 r j = 1 s h + j + t 1 h + j 1 ) ( h = 1 r + 1 j = 1 s h + j + t 1 h + j 1 ) ;
    26.12.11 ( h = 1 r + 1 j = 1 s h + j + t 1 h + j 1 ) ( h = 1 r j = 1 s + 1 h + j + t 1 h + j 1 ) .
    10: 35.5 Bessel Functions of Matrix Argument
    35.5.5 𝟎 < 𝐗 < 𝐓 A ν 1 ( 𝐒 1 𝐗 ) | 𝐗 | ν 1 A ν 2 ( 𝐒 2 ( 𝐓 𝐗 ) ) | 𝐓 𝐗 | ν 2 d 𝐗 = | 𝐓 | ν 1 + ν 2 + 1 2 ( m + 1 ) A ν 1 + ν 2 + 1 2 ( m + 1 ) ( ( 𝐒 1 + 𝐒 2 ) 𝐓 ) , ν j , ( ν j ) > 1 , j = 1 , 2 ; 𝐒 1 , 𝐒 2 𝓢 ; 𝐓 𝛀 .
    35.5.7 𝛀 A ν 1 ( 𝐓 𝐗 ) B ν 2 ( 𝐒 𝐗 ) | 𝐗 | ν 1 d 𝐗 = 1 A ν 1 + ν 2 ( 𝟎 ) | 𝐒 | ν 2 | 𝐓 + 𝐒 | ( ν 1 + ν 2 + 1 2 ( m + 1 ) ) , ( ν 1 + ν 2 ) > 1 ; 𝐒 , 𝐓 𝛀 .