S H(S) T canonical distribution P (S) = e βh(s) Z(β) (1) β = (k B T ) 1 k B Z(β) = Tr S e βh(s) partition function free energy F = β 1 ln Z(β)
|
|
- きみかず こうだ
- 7 years ago
- Views:
Transcription
1 58 1 HAL9000 Google Amazon SF 1 [1, ] 1 kaba@dis.titech.ac.jp
2 S H(S) T canonical distribution P (S) = e βh(s) Z(β) (1) β = (k B T ) 1 k B Z(β) = Tr S e βh(s) partition function free energy F = β 1 ln Z(β) H(S)e βh(s) U = Tr H(S)P (S) = Tr S S Z(β) () U = ln Z(β) = (βf ) (3) β β U F S = 1 T (U F ) = k Bβ β ln Z(β) + k B ln Z(β) (4).1. V m N i(= 1,,..., N) q i p i S = {(q 1, p 1 ), (q, p ),..., (q N, p N )} H(S) = N ( pi ) m + Φ(q i) Φ(q) q 0 h Tr S h 3N (N!) 1 N (dq idp i ) Tr S (5) Z(β) = (πmk BT ) 3N/ V N h 3N N! (6) U = 3N ln Z(β) = β β = 3Nk BT Tr S (7)
3 C = U T = k Bβ ln Z(β) β = 3Nk B (8) p p = ( / V )F F = β 1 ln Z(β) pv = Nk B T (9).1.3 Ising model i S i {+1, 1} H(S) = J (ij) S i S j h N S i (10) J > 0 h (ij) J > 0 (1) T c M h lim M h 0 { > 0 T < T c = 0 T > T c (11) phase transtion (3) (7) (8) (10) Tr S h = 0 N [3, 4] N
4 ...1 N x {0, 1} N x y y x x P (x) x P (y x) y P (x) P (y x) y x P (x) P (y x) [5] [ ] y ˆx(y) = (ˆx i (y)) BER(ˆx( )) = 1 N N Pr(ˆx i (y) x i ) (1) BER(ˆx( )) 1 N ( ) Tr min N {P y i(x i y)}p (y) x i {0,1} (13) P (y) = Tr x P (y x)p (x) (14) P (x y) = P (y x)p (x) P (y) (15) P i (x i y) = Tr x\xi P (x y) P (x y) x i x j i marginal posterior distribution A\a A a ˆx opt i (y) = argmax {P i (x i y)} (16) x i {0,1} argmax x {f(x)} f(x) x (16) [ ] x y P (x, y) = P (y x)p (x) = P (x y)p (y) x ˆx(y) N δ(ˆx i(y) x i ) δ( ) 1 0 P (x, y) = P (x y)p (y) N BER(ˆx( )) = 1 N N Pr(ˆx i (y) x i )
5 = 1 N Tr y Tr x = 1 N Tr y = 1 1 N = 1 N 1 1 N N N N δ(ˆx i (y) x i )P (x y)p (y) x i {0,1} (1 δ(ˆx i (y) = x i ))P i (x i y)p (y) N Tr P i (ˆx i (y) y)p (y) y N ( Tr y Tr y ( max x i {0,1} {P i(x i y)}p (y) min x i {0,1} {P i(x i y)}p (y) ) ) (17) y P i (ˆx i (y) y) max {P i(x i y)} (18) x i {0,1} (16) (16) (13).. P (y x) P (x) probabilistic model y x probabilistic inference.3 P (x y) x {0, 1} N N y x
6 y % S {+1, 1} N H(S J) = (ij) J ij S i S j h N S i (19) (19) (10) J ij (ij) P (J ij ) statistical mechanics of disordered systems P (J ij ) (π J ) 1/ exp ( (J ij J 0 ) /( J ) ) pδ(j ij 1)+ (1 p)δ(j ij + 1) (0 < p < 1) frustration.4. (19) J = (J ij ) J P (S J) = 1 exp ( βh(s J)) (0) Z(J, β) Z(J, β) = Tr S exp ( βh(s J)) J S i = Tr S S i P (S J) J [ S i m ] = Tr J ( Tr S S ip (S J) ) m P (J) (1) (i = 1,,..., N; m = 1,,...) J [ ]
7 .4.3 J S J infinite range model [, 6, 7] replica method (1) ( ) m [ S i m ] = lim Tr Tr S n 0 ip (S J) Z n (J, β)p (J) () J S P (S J) = exp( βh(s J))/Z(J, β) Z(J, β) = Tr S exp( βh(s J)) n m = 1,,... N ( ) m Tr Tr S ip (S J) Z n (J, β)p (J) J S ( ) n = Tr Tr J S1 S 1,S,...,S n i Si... Si m exp β H(S a J) P (J) (3) S 1, S,..., S n J repilica P (J) J ( ) ) H(S 1, S,..., S n ) = 1 β ln (Tr J exp β a=1 n H(S a J) a=1 P (J) n (3) n n N n R () (3) cavity method J N P (J) J cavity gauge theory P (J) Nishimori temperature (4).5
8 1..1 (13) performance evaluation approximate inference algorithm [8] 3 mean field approximation 3.1 molecular field approximation [9] h = 0 z 1(a) i S i S i i i j i S j S j S j 1(b) S k (k = 1,,..., N) S k = m S i Hi eff (S i ) = JS i S j = zjms i (5) j i (5) zjm zjm molecular field mean field S i (5) S i m S i = S i {+1, 1} S i e βzjms i cosh(βzjm) = tanh(βzjm) = m (6) m β c = (zj) 1 { > β c ±m (m > 0) β β c m = 0 (7)
9 (a) (b) (c) θ zjm θ θ θ 1: (a) S i {+1, 1} (b) zjm (c) θ (b) (c) m θ β = β c β > β c m 0 u u = 1 N H(S) = J S i S j J S i S j = zj N N m (8) c (ij) (ij) c = u T = k Bβ u β = k BzJβ m m β (6) T = T c = (k B β c ) 1 = zj/k B { 3k B /, T T c 0 c = 0, T T c + 0 (9) (30) 3. T c k B T c /J.7 k B T c /J = 4 T = T c Bethe approximation [10]
10 h = 0 i H(S) = J S i S j = JS i S j J S k S l (ij) j i (kl) k i,l i = JS i S j + H \i (S\S i ) (31) j i H \i (S\S i ) H(S) S i S i H \i (S\S i ) j i θ 1(c) S i θ cavity field H(S) i j i H eff (S i, {S j i }) = JS i S j (3) j i S j θ j i S i {S j i } (3) P (S i, {S j i }) exp ( βh eff (S i, {S j i }) ) x {+1, 1} A R e Ax e Ax = cosh(a) cosh(a) x 1 + x tanh(a) x {+1, 1} = cosh(a) 1 + x tanh(a) (33) = tanh(a) (34) P (S i, {S j i }) S i P (S i ) = P (S i, {S j i }) = 1 + S i tanh(βz ˆθ) {S j i } {+1, 1} z (35) ˆθ = 1 β tanh 1 (tanh(βj) tanh(βθ)) (36) ˆθ effective field cavity bias S i S i = m θ m = S i P (S i ) = tanh(βz ˆθ) (37) S i {+1, 1} θ θ H \i (S\S i ) S i i j i S j S i j z 1 S j {S k j\i } S i S j θ (37) z z 1 tanh(βθ) θ θ = (z 1)ˆθ = 1 β (z 1) tanh 1 (tanh(βj) tanh(βθ)) (38)
11 (38) θ (37) k B T c /J cluster variation method [11, 1] z d z = d N 1 infinite range model H(S) = J N N S i S j h S i (39) i>j N 1 O(N) m = N 1 S i (39) ( Jm H(S) = N + hm + 1 ) ( Jm = N N ) + hm + O(1) (40) ln N! N ln N N m [ 1, 1] S N! (N(1 + ( m)/)! ( (N(1 m)/)! ( ) 1 + m 1 + m = exp N ln + 1 m ln ( 1 m )) ) + O(1) (41) Z(β) = Tr S exp( βh(s)) = +1 1 dm exp ( Nβφ(m; β) + O(1)) (4) φ(m; β) = Jm hm + 1 ( ( ) 1 + m 1 + m ln + 1 m ( )) 1 m ln β (43) (4) N f = 1 ln Z(β) = Nβ min {φ(m; β)} (44) m [ 1,+1]
12 (a) (b) : (a) z = k + 1 = 3 (b) φ(m; β)/ m = 0 m = tanh (β(jm + h)) (45) 3 ( ( )) (N 1)J m = tanh β m + h N (46) N (45) (45) N 3.3. (1) z = k + 1 k Cayley tree (a) Bethe lattice (b) G 0 1 G g G g Z g θ g P (S) = exp(βθ g S)/( cosh (βθ g )) g 1 0 k g 1,,..., k S 0 S 1,..., S k g Z g Z g 1 θ g θ g 1 k k Z g 1 = Zg k β h + J S j S 0 exp(βθ g S j ) cosh (βθ g ) S 0,S 1,S,...,S k exp 3 (45) N 1 P N S i h O(1) φ(m; β) m N 1 P N S i h 0 β > J 1 m = ±m (m > 0) φ(m; β) N 1 P N S i h 0 [ m, +m ] j=1 j=1
13 = ( cosh(βj)) k Zg k ( ) 1 + S0 tanh(βj) tanh(βθ g ) k exp (βhs 0 ) S 0 {+1, 1} ( ) k cosh(βj)z g = cosh(β ˆθ cosh(β(h + kˆθ g )) (47) g ) θ g 1 = h + kˆθ g (48) ˆθ g = 1 β tanh 1 (tanh(βj) tanh(βθ g )) (49) g = 1 k k + 1 k+1 k+1 Z 0 = Z1 k+1 β h + J S j S 0 exp(βθ 1 S j ) cosh (βθ 1 ) S 0,S 1,S,...,S k+1 exp = ( cosh(βj)) k+1 Z1 k+1 ( ) 1 + S0 tanh(βj) tanh(βθ 1 ) k+1 exp (βhs 0 ) S 0 {+1, 1} ( ) k+1 cosh(βj)z 1 = cosh(β ˆθ cosh(β(h + (k + 1)ˆθ 1 )) (50) 1 ) θ 0 = h + (k + 1)ˆθ 1 (51) Z 0 tanh(βθ 0 ) G G (47) (48) (49) θ g ˆθ g j=1 ˆθ = 1 β tanh 1 (tanh(βj) tanh(βθ)) (5) θ = h + kˆθ (53) S c S c = tanh(β(h + (k + 1)ˆθ)) (54) z = k + 1 (5) (53) (38) (54) (37) 4 j=1 4
14 3.3.3 () z( O(1)) [13, 14] d 4 z O(1) O(ln N) N z O(1) L N L N L 1 + z + z(z 1) + z(z 1) z(z 1) L 1 = 1 + z(z 1)L z N (55) z L ln N (N ) (56) ln(z 1) V E G = (V, E) H(S) = h i S i (57) (ij) E J ij S i S j i V J ij h i (ij) i
15 i i S i S i H eff i (S i ) = S i h i + J ij S j = S i h i + J ij m j (58) j i j i S i (57) S j = m j (58) S i P (S i ) = exp( βhi eff (S i ))/( S i {+1, 1} exp( βheff i (S i ))) S i S i = m i e β(h P i+ j i J ijm j )S i m i = S i cosh β(h i + j i J ijm j ) = tanh β h i + J ij m j (59) j i S i {+1, 1} i = 1,,..., N (59) N m 1, m,..., m N N O( N ) naive mean field approximation [15] x i {+1, 1} exp (β ) (ij) x ix j P (x) = (60) Z (β > 0) Z = Tr x exp (β ) (ij) x ix j (ij) p(< 1) α = (1/) ln((1 p)/p) x y P (y x) = N exp (αy i x i ) cosh(α) (61) (60) (61) y x P (y x)p (x) P (x y) = exp β N x i x j + α y i x i (6) P (y) (ij)
16 (a) (b) (c) BER (d) t 3: β 1/.7 p α = (1/) ln((1 p)/p) (a) (b) 0% (c) (d) (63)..1 (6) x i {+1, 1} m i = tanh αy i + β m j (63) j i ˆx i = sign(m i ) = m i / m i 3 α β α β y P (y) = x P (y x)p (x) α β [16]
17 ψ a (.) x i 4: P (x) = (1/Z)ψ 1 (x 1 )ψ (x )ψ 3 (x 3 ) (x 1 = (x 1, x, x 4 ), x = (x, x 4 ), x 3 = (x 3, x 5 )) x 1, x,..., x 5 ψ 1 (x 1 ), ψ (x ), ψ 3 (x 3 ) 4. cavity method [6, 7] 4..1 N x = (x i ) P (x) = 1 ψ a (x a ) (64) Z a 5 ψ a (x a )( 0) x x a (ij) a exp(βjs i S j ) (S i, S j ) x a Z x i i x a a a a (64) factor graph 4 (64) graphical model = 5
18 (64) P i (x i ) = Tr x\xi P (x) a i P i (x i ) = ψ a(x a ) \x i Tr xi a i ψ a(x a ) (65) \x i \xi x i x i x\x i cavity distribution b/ i P \i (x\x i ) = ψ b(x b ) Tr x\xi b/ i ψ (66) b(x b ) (65) x i ψi eff (x i ) = a i ψ a(x a ) \x i x i [ ] x i P (x) = ψ a(x a ) b/ i ψ b(x b ) Tr x a i ψ a(x a ) b/ i ψ b(x b ) Tr x\xi b/ i ψ b(x b ) (66) ( a i P (x) = ψ a(x a ) ) P \i (x\x i ) Tr x ( a i ψ a(x a ) ) (68) P \i (x\x i ) Tr x\ Tr x ( ) = Tr xi { Trx\xi ( ) } (65) (67) 4..3 (65) ψi eff (x i ) = a i ψ a(x a ) P \x i i (x i ) P \i (x\x i ) ψi eff (x i ) P (x) hypertree 5(a) ψi eff (x i ) P i (x i ) a i ψ a (x a ) (a ) x a x j m j a (x j ) a, b, c,... i x a, x b, x c,... x i x i a, b, c,... i 5(b)
19 (a) (b) 5: (a) (b) ( ) ψi eff (x i ) = Tr ψ a (x a ) P \i (x\x i ) x\x i a i = Tr ψ a (x a ) m j a (x j ) (69) x a \x i a i j a\i i a i a O(1) (69) O(1) a ψi a eff (x i) ψ eff i a(x i ) = b i\a Tr ψ b (x b ) m j b (x j ) (70) x b \x i j b\i m i a (x i ) ψi a eff (x i) m i a (x i ) = b i\a Tr xi b i\a ( Tr xb \x i ψ b (x b ) ) j b\i m j b(x j ) ( Tr xb \x i ψ b (x b ) ) (71) j b\i m j b(x j ) m a i (x i ) = α a i Tr x a \x i ψ a (x a ) m i a (x i ) = α i a b i\a j a\i m j a (x j ) (7) m b i (x i ) (73)
20 (a) (b) a i i a 6: (a) (7) (b) (73) (a) (b) (m a i (x i ), m i a (x i )) α a i α i a m a i (x i ) m i a (x i ) m a i (x i ) x i P i (x i ) = α i m a i (x i ) (74) a i α i a j a m j a (x j ) (7) (73) m a i (x i ) m i a (x i ) a i a i O(1) (7) (73) O(1) a i i a (7) (73) (74) (7) (73) (74) belief propagation probability propagation (7) (73) a i (7) a m j a (x j ) Tr xa \x i i m a i (x i ) (73) i m b i (x i ) b i\a a m i a (x i ) 6 sum-product algorithm (7) (73) (74)
21 loopy belief propagation (7) (73) m a i (x i ) m i a (x i ) exp(βj ij S i S j ) exp(βhs i ) ˆθ θ m a i (S i ) = e β ˆθS i /( cosh(β ˆθ)) ψ a (x a ) exp(βj ij S i S j ) e βhs i /( cosh(βh)) ψ a (x a ) exp(βhs i ) m i a (S i ) = e βθs i /( cosh(βθ)) error correcting code low-density parity-check code [17] K m {0, 1} K N(> K) x {0, 1} N (N K) N 0 1 H Hx = 0 (mod ) (75) x mod m x H HG T = 0 (mod ) N K G T x = G T m (mod ) (76) Hx = HG T m = 0m = 0 (mod ) N > K x m 1 N, K H H H µ (µ = 1,,..., N K) 1 i µ i (i = 1,,..., N) 1 µ i S i = ( 1) x i x i = 1 S i (i = 1,,..., N) x {0, 1} N S {+1, 1} N (75) µ ψ µ (S µ ) = 1 + i µ S { i 1 ( ) = (78) 0 ( ) m {0, 1} K S µ=1 (77) P (S) = 1 N K ψ µ (S µ ) (79) Z H Z H = Tr N K S µ=1 ψ µ(s µ ) S 0 < p < 1/
22 ξ {+1, 1} N S ξ β p = (1/) ln((1 p)/p) P (ξ S) = N exp (β p ξ i S i ) cosh(β p ) = 1 ( cosh(β p )) N N ψ i (S i ) (80) ψ i (S i ) = exp(β p ξ i S i ) (79) (80) ξ S P (S ξ) = P (ξ S)P (S) P (ξ) = 1 Z N K µ=1 ψ µ (S µ ) N ψ i (S i ) (81) ξ S..1 (81) ψ µ (S µ ) ψ i (S i ) (81) 7 µ = 1,,..., N K i = 1,,..., N a m a i (S i ) = exp(θ a i S i )/( cosh(θ a i )) m i a (S i ) = exp(θ i a S i )/ ( cosh(θ i a )) (7) θ µ i = tanh 1 tanh(θ j µ ) (ψ µ (S µ ) ) (8) (73) j µ\i θ i i = β p ξ i (ψ i (S i ) ) (83) θ i µ = β p ξ i + ν i\µ θ ν i (84) { +1 if β p ξ i + µ i Ŝ i = θ µ i > 0 1 if β p ξ i + µ i θ µ i < 0 (85) 1 O(1) H O(ln N) H N N 5
23 ψ µ (.) S i ψ(.) i 7: inverse Ising problem i S i {+1, 1} J ij h i J ij h i J ij h i [18, 19, 0] compressed sensing M N α = M/N 1 α < 1 [1] α [, 3] latent variable modeling M N X = (x 1, x,..., x M ) x µ z µ A x µ = Az µ +n µ n µ X A z µ Z = (z 1, z,..., z M ) N = (n 1, n,..., n M ) Z N X X = AZ + N [4, 5, 6] [1] (00) [] (1999) [3] E. Ising, Z. Phys. 31, 53 (195)
24 [4] L. Onsager, Phys. Rev. () 65, 117 (1944) [5] Y. Iba, J. Phys. A 3, 3875 (1999) [6] M. Mézard, G. Parisi and M. A. Virasoro, Spin glass theory and beyond, World Scientific (1987) [7] M. Mézard and A. Montanari, Information, Physics, and Computation, Oxford University Press (009) [8] T. H. L. Watkin, A. Rau and M. Biehl, Rev. Mod. Phys. 65, 499 (1993) [9] P. Weiss, J. Phys. Theor. Appl. 6, 661 (1907) [10] H. A. Bethe, Proc. Roy. Soc. London A 150, 55 (1935) [11] R. Kikuchi, Phys. Rev. 81, 988 (1951) [1] T. Morita, M. Suzuki, K. Wada and M. Kaburagi (eds), Foundations and Applications of Cluster Variation Method and Path Probability Method (Prog. Theor. Phys. Suppl. 115) (1994) [13] M. E. J. Newman, S. H. Strogatz and D. J. Watts, Phys. Rev. E 64, (001) [14] K. Nakagawa and H. Yamaguchi, IEICE Trans. Inf. Syst. E96-D, 433 (013) [15] (006) [16] R. Molina, A. K. Katsaggelos and J. Mateos, IEEE Trans. Image Processing 8, 31 (1999) [17], (00) [18] E. Schneidman, M. J. Berry, R. Segev and W. Bialek, Nature 440, 1007 (006) [19] S. Cocco and R. Monasson, Phys. Rev. Lett 106, (011) [0] H. Huang and Y. Kabashima, Phys. Rev. E 87, 0619 (013) [1] D. L. Donoho, IEEE Trans. on Inf. Theor. 5, 189 (006) [] F. Krzakala, M. Mézard, F. Sausset, Y. F. Sun and L. Zdeborová, Phys. Rev. X, (01) [3] M. C. Angelini, F. Ricci-Tersenghi and Y. Kabashima, in Proc. 50th Annual Allerton Conference, pp (01); arxiv: [4] A. Sakata and Y. Kabashima, EPL (Europhysics Letters) 103, 8008 (013) [5] A. Sakata and Y. Kabashima, in Proc. 013 IEEE International Symposium on Information Theory (Istanbul, Turkey, July 7 1, 013), pp (013); arxiv: [6] F. Krzakala, M. Mézard and L. Zdeborová, in Proc. 013 IEEE International Symposium on Information Theory (Istanbul, Turkey, July 7 1, 013), pp (013); arxiv:
25 11M15133 0.40 0.44 n O(n 2 ) O(n) 0.33 0.52 O(n) 0.36 0.52 O(n) 2 0.48 0.52
26 1 11M15133 25 11M15133 0.40 0.44 n O(n 2 ) O(n) 0.33 0.52 O(n) 0.36 0.52 O(n) 2 0.48 0.52 1 2 2 4 2.1.............................. 4 2.2.................................. 5 2.2.1...........................
More information[ ] (Ising model) 2 i S i S i = 1 (up spin : ) = 1 (down spin : ) (4.38) s z = ±1 4 H 0 = J zn/2 i,j S i S j (4.39) i, j z 5 2 z = 4 z = 6 3
4.2 4.2.1 [ ] (Ising model) 2 i S i S i = 1 (up spin : ) = 1 (down spin : ) (4.38) s z = ±1 4 H 0 = J zn/2 S i S j (4.39) i, j z 5 2 z = 4 z = 6 3 z = 6 z = 8 zn/2 1 2 N i z nearest neighbors of i j=1
More information& 3 3 ' ' (., (Pixel), (Light Intensity) (Random Variable). (Joint Probability). V., V = {,,, V }. i x i x = (x, x,, x V ) T. x i i (State Variable),
.... Deeping and Expansion of Large-Scale Random Fields and Probabilistic Image Processing Kazuyuki Tanaka The mathematical frameworks of probabilistic image processing are formulated by means of Markov
More information<4D6963726F736F667420576F7264202D204850835483938376838B8379815B83578B6594BB2D834A836F815B82D082C88C60202E646F63>
誤 り 訂 正 技 術 の 基 礎 サンプルページ この 本 の 定 価 判 型 などは, 以 下 の URL からご 覧 いただけます http://wwwmorikitacojp/books/mid/081731 このサンプルページの 内 容 は, 第 1 版 発 行 時 のものです http://wwwmorikitacojp/support/ e mail editor@morikitacojp
More informationmain.dvi
1 10,.,,.,,,.,,, 2. 1,, [1].,,,.,,.,,,.. 100,,., [2]. [3,4,5]. [6,7,8,9,10,11]. [12, 13, 14]. 1 E-mail: kau@statp.is.tohoku.ac.jp CDMA [15, 16].. 1970, 1980 90, 1990 30,,. [17, 18]. [19, 20, 21]. [17,
More informationSeptember 9, 2002 ( ) [1] K. Hukushima and Y. Iba, cond-mat/ [2] H. Takayama and K. Hukushima, cond-mat/020
mailto:hukusima@issp.u-tokyo.ac.jp September 9, 2002 ( ) [1] and Y. Iba, cond-mat/0207123. [2] H. Takayama and, cond-mat/0205276. Typeset by FoilTEX Today s Contents Against Temperature Chaos in Spin Glasses
More informationEndoPaper.pdf
Research on Nonlinear Oscillation in the Field of Electrical, Electronics, and Communication Engineering Tetsuro ENDO.,.,, (NLP), 1. 3. (1973 ),. (, ),..., 191, 1970,. 191 1967,,, 196 1967,,. 1967 1. 1988
More information(a) (b) (c) (d) 1: (a) (b) (c) (d) (a) (b) (c) 2: (a) (b) (c) 1(b) [1 10] 1 degree k n(k) walk path 4
1 vertex edge 1(a) 1(b) 1(c) 1(d) 2 (a) (b) (c) (d) 1: (a) (b) (c) (d) 1 2 6 1 2 6 1 2 6 3 5 3 5 3 5 4 4 (a) (b) (c) 2: (a) (b) (c) 1(b) [1 10] 1 degree k n(k) walk path 4 1: Zachary [11] [12] [13] World-Wide
More information,, Andrej Gendiar (Density Matrix Renormalization Group, DMRG) 1 10 S.R. White [1, 2] 2 DMRG ( ) [3, 2] DMRG Baxter [4, 5] 2 Ising 2 1 Ising 1 1 Ising
,, Andrej Gendiar (Density Matrix Renormalization Group, DMRG) 1 10 S.R. White [1, 2] 2 DMRG ( ) [3, 2] DMRG Baxter [4, 5] 2 Ising 2 1 Ising 1 1 Ising Model 1 Ising 1 Ising Model N Ising (σ i = ±1) (Free
More information(Onsager )
05819311 (Onsager ) 1 2 2 Onsager 4 3 11 3.1................ 11 3.2............ 14 3.3................... 16 4 18 4.1........... 18 4.2............. 20 5 25 A 27 A.1................. 27 A.2..............
More informationmain.dvi
CDMA 1 CDMA ( ) CDMA CDMA CDMA 1 ( ) Hopfield [1] Hopfield 1 E-mail: okada@brain.riken.go.jp 1 1: 1 [] Hopfield Sourlas Hopfield [3] Sourlas 1? CDMA.1 DS/BPSK CDMA (Direct Sequence; DS) (Binary Phase-Shift-Keying;
More information( ) 1 1.1? ( ) ( ) ( ) 1.1(a) T m ( ) 1.1(a) T g ( ) T g T g 500 74% ( ) T K ( 1.1(b) 15 T g T g 10 13 T g T g T g [ ] A ( ) exp (1.1) T T 0 Vogel-Fulcher T 0 T 0 T K T K Ortho-Terphenil (OTP) SiO 2 (1.1)
More information1: Pauli 2 Heisenberg [3] 3 r 1, r 2 V (r 1, r 2 )=V (r 2, r 1 ) V (r 1, r 2 ) 5 ϕ(r 1, r 2 ) Schrödinger } { h2 2m ( 1 + 2 )+V (r 1, r 2 ) ϕ(r 1, r 2
Hubbard 2 1 1 Pauli 0 3 Pauli 4 1 Vol. 51, No. 10, 1996, pp. 741 747. 2 http://www.gakushuin.ac.jp/ 881791/ 3 8 4 1 1: Pauli 2 Heisenberg [3] 3 r 1, r 2 V (r 1, r 2 )=V (r 2, r 1 ) V (r 1, r 2 ) 5 ϕ(r
More informationNote5.dvi
12 2011 7 4 2.2.2 Feynman ( ) S M N S M + N S Ai Ao t ij (i Ai, j Ao) N M G = 2e2 t ij 2 (8.28) h i μ 1 μ 2 J 12 J 12 / μ 2 μ 1 (8.28) S S (8.28) (8.28) 2 ( ) (collapse) j 12-1 2.3 2.3.1 Onsager S B S(B)
More information1 s 1 H(s 1 ) N s 1, s,, s N H({s 1,, s N }) = N H(s k ) k=1 Z N =Tr {s1,,s N }e βh({s 1,,s N }) =Tr s1 Tr s Tr sn e β P k H(s k) N = Tr sk e βh(s k)
19 1 14 007 3 1 1 Ising 4.1................................. 4................................... 5 3 9 3.1........................ 9 3................... 9 3.3........................ 11 4 14 4.1 Legendre..............................
More informationI.2 z x, y i z = x + iy. x, y z (real part), (imaginary part), x = Re(z), y = Im(z). () i. (2) 2 z = x + iy, z 2 = x 2 + iy 2,, z ± z 2 = (x ± x 2 ) +
I..... z 2 x, y z = x + iy (i ). 2 (x, y). 2.,,.,,. (), ( 2 ),,. II ( ).. z, w = f(z). z f(z), w. z = x + iy, f(z) 2 x, y. f(z) u(x, y), v(x, y), w = f(x + iy) = u(x, y) + iv(x, y).,. 2. z z, w w. D, D.
More information8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) 10.1 10.2 Carathéodory 10.3 Fubini 1 Introduction [1],, [2],, [3],, [4],, [5],, [6],, [7],, [8],, [1, 2, 3] 1980
% 100% 1 Introduction 2 (100%) 2.1 2.2 2.3 3 (100%) 3.1 3.2 σ- 4 (100%) 4.1 4.2 5 (100%) 5.1 5.2 5.3 6 (100%) 7 (40%) 8 Fubini (90%) 2006.11.20 1 8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) 10.1 10.2 Carathéodory
More information2 (March 13, 2010) N Λ a = i,j=1 x i ( d (a) i,j x j ), Λ h = N i,j=1 x i ( d (h) i,j x j ) B a B h B a = N i,j=1 ν i d (a) i,j, B h = x j N i,j=1 ν i
1. A. M. Turing [18] 60 Turing A. Gierer H. Meinhardt [1] : (GM) ) a t = D a a xx µa + ρ (c a2 h + ρ 0 (0 < x < l, t > 0) h t = D h h xx νh + c ρ a 2 (0 < x < l, t > 0) a x = h x = 0 (x = 0, l) a = a(x,
More informationPart. 4. () 4.. () 4.. 3 5. 5 5.. 5 5.. 6 5.3. 7 Part 3. 8 6. 8 6.. 8 6.. 8 7. 8 7.. 8 7.. 3 8. 3 9., 34 9.. 34 9.. 37 9.3. 39. 4.. 4.. 43. 46.. 46..
Cotets 6 6 : 6 6 6 6 6 6 7 7 7 Part. 8. 8.. 8.. 9..... 3. 3 3.. 3 3.. 7 3.3. 8 Part. 4. () 4.. () 4.. 3 5. 5 5.. 5 5.. 6 5.3. 7 Part 3. 8 6. 8 6.. 8 6.. 8 7. 8 7.. 8 7.. 3 8. 3 9., 34 9.. 34 9.. 37 9.3.
More informationL. S. Abstract. Date: last revised on 9 Feb translated to Japanese by Kazumoto Iguchi. Original papers: Received May 13, L. Onsager and S.
L. S. Abstract. Date: last revised on 9 Feb 01. translated to Japanese by Kazumoto Iguchi. Original papers: Received May 13, 1953. L. Onsager and S. Machlup, Fluctuations and Irreversibel Processes, Physical
More informationb.dvi
, 0 1 2 1.1 [2, 3] : : : : : : : : : : : : : : : : 3 2, 6 2.1 : : : : : : : : : : : : : : : 7 2.2 : : : : : : : : : : : : : : : : : : : 15 2.3, : : : : 18 3 23 4 31 5 35 6 46 6.1 Borel. : : : : : : : :
More informationturbo 1993code Berrou 1) 2[dB] SNR 05[dB] 1) interleaver parallel concatenated convolutional code ch
1 -- 2 6 LDPC 2012 3 1993 1960 30 LDPC 2 LDPC LDPC LDPC 6-1 LDPC 6-2 6-3 c 2013 1/(13) 1 -- 2 -- 6 6--1 2012 3 turbo 1993code Berrou 1) 2[dB] SNR 05[dB] 1) 6 1 2 1 1 interleaver 2 2 2 parallel concatenated
More information163 KdV KP Lax pair L, B L L L 1/2 W 1 LW = ( / x W t 1, t 2, t 3, ψ t n ψ/ t n = B nψ (KdV B n = L n/2 KP B n = L n KdV KP Lax W Lax τ KP L ψ τ τ Cha
63 KdV KP Lax pair L, B L L L / W LW / x W t, t, t 3, ψ t n / B nψ KdV B n L n/ KP B n L n KdV KP Lax W Lax τ KP L ψ τ τ Chapter 7 An Introduction to the Sato Theory Masayui OIKAWA, Faculty of Engneering,
More information1 8, : 8.1 1, 2 z = ax + by + c ax by + z c = a b +1 x y z c = 0, (0, 0, c), n = ( a, b, 1). f = n i=1 a ii x 2 i + i<j 2a ij x i x j = ( x, A x), f =
1 8, : 8.1 1, z = ax + by + c ax by + z c = a b +1 x y z c = 0, (0, 0, c), n = ( a, b, 1). f = a ii x i + i
More information( [1]) (1) ( ) 1: ( ) 2 2.1,,, X Y f X Y (a mapping, a map) X ( ) x Y f(x) X Y, f X Y f : X Y, X f Y f : X Y X Y f f 1 : X 1 Y 1 f 2 : X 2 Y 2 2 (X 1
2013 5 11, 2014 11 29 WWW ( ) ( ) (2014/7/6) 1 (a mapping, a map) (function) ( ) ( ) 1.1 ( ) X = {,, }, Y = {, } f( ) =, f( ) =, f( ) = f : X Y 1.1 ( ) (1) ( ) ( 1 ) (2) 1 function 1 ( [1]) (1) ( ) 1:
More informationII (Percolation) ( 3-4 ) 1. [ ],,,,,,,. 2. [ ],.. 3. [ ],. 4. [ ] [ ] G. Grimmett Percolation Springer-Verlag New-York [ ] 3
II (Percolation) 12 9 27 ( 3-4 ) 1 [ ] 2 [ ] 3 [ ] 4 [ ] 1992 5 [ ] G Grimmett Percolation Springer-Verlag New-York 1989 6 [ ] 3 1 3 p H 2 3 2 FKG BK Russo 2 p H = p T (=: p c ) 3 2 Kesten p c =1/2 ( )
More information1).1-5) - 9 -
- 8 - 1).1-5) - 9 - ε = ε xx 0 0 0 ε xx 0 0 0 ε xx (.1 ) z z 1 z ε = ε xx ε x y 0 - ε x y ε xx 0 0 0 ε zz (. ) 3 xy ) ε xx, ε zz» ε x y (.3 ) ε ij = ε ij ^ (.4 ) 6) xx, xy ε xx = ε xx + i ε xx ε xy = ε
More information46 Y 5.1.1 Y Y Y 3.1 R Y Figures 5-1 5-3 3.2mm Nylon Glass Y (X > X ) X Y X Figure 5-1 X min Y Y d Figure 5-3 X =X min Y X =10 Y Y Y 5.1.2 Y Figure 5-
45 5 5.1 Y 3.2 Eq. (3) 1 R [s -1 ] ideal [s -1 ] Y [-] Y [-] ideal * [-] S [-] 3 R * ( ω S ) = ω Y = ω 3-1a ideal ideal X X R X R (X > X ) ideal * X S Eq. (3-1a) ( X X ) = Y ( X ) R > > θ ω ideal X θ =
More information都道府県別経済財政モデル(平成27年度版)_02
-1 (--- 10-2 ---- 4.- 5-3 () 10 13 3 5-4 () 13 16 14-5 () 11 30-1 10 1. 1() Cw j C SNA 47 47 Chi LikL i k1 47 Chi k1 ij Cw j Ch i C SNA L ij j i SNA i j - 2 - -2 5-5 19-3 4 3 4-5 - 3 - 茨 - 4 - -1 (---
More information平成 15 年度 ( 第 25 回 ) 数学入門公開講座テキスト ( 京都大学数理解析研究所, 平成 ~8 15 月年 78 日開催月 4 日 ) X 2 = 1 ( ) f 1 (X 1,..., X n ) = 0,..., f r (X 1,..., X n ) = 0 X = (
1 1.1 X 2 = 1 ( ) f 1 (X 1,..., X n ) = 0,..., f r (X 1,..., X n ) = 0 X = (X 1,..., X n ) ( ) X 1,..., X n f 1,..., f r A T X + XA XBR 1 B T X + C T QC = O X 1.2 X 1,..., X n X i X j X j X i = 0, P i
More information1 : ( ) ( ) ( ) ( ) ( ) etc (SCA)
START: 17th Symp. Auto. Decentr. Sys., Jan. 28, 2005 Symplectic cellular automata as a test-bed for research on the emergence of natural systems 1 : ( ) ( ) ( ) ( ) ( ) etc (SCA) 2 SCA 2.0 CA ( ) E.g.
More information地域総合研究第40巻第1号
* abstract This paper attempts to show a method to estimate joint distribution for income and age with copula function. Further, we estimate the joint distribution from National Survey of Family Income
More information5 36 5................................................... 36 5................................................... 36 5.3..............................
9 8 3............................................. 3.......................................... 4.3............................................ 4 5 3 6 3..................................................
More information1 1 3 1.1 (Frequecy Tabulatios)................................ 3 1........................................ 8 1.3.....................................
1 1 3 1.1 (Frequecy Tabulatios)................................ 3 1........................................ 8 1.3........................................... 1 17.1................................................
More information8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) Carathéodory 10.3 Fubini 1 Introduction 1 (1) (2) {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a
% 100% 1 Introduction 2 (100%) 2.1 2.2 2.3 3 (100%) 3.1 3.2 σ- 4 (100%) 4.1 4.2 5 (100%) 5.1 5.2 5.3 6 (100%) 7 (40%) 8 Fubini (90%) 2007.11.5 1 8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) 10.1 10.2 Carathéodory
More information1 Introduction 1 (1) (2) (3) () {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a, b] lim f n (x) f(x) (1) f(x)? (2) () f(x)? b lim a f n (x)dx = b
1 Introduction 2 2.1 2.2 2.3 3 3.1 3.2 σ- 4 4.1 4.2 5 5.1 5.2 5.3 6 7 8. Fubini,,. 1 1 Introduction 1 (1) (2) (3) () {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a, b] lim f n (x) f(x) (1) f(x)?
More information1 -- 9 -- 3 3--1 LMS NLMS 2009 2 LMS Least Mean Square LMS Normalized LMS NLMS 3--1--1 3 1 AD 3 1 h(n) y(n) d(n) FIR w(n) n = 0, 1,, N 1 N N = 2 3--1-
1 -- 9 3 2009 2 LMS NLMS RLS FIR IIR 3-1 3-2 3-3 3-4 c 2011 1/(13) 1 -- 9 -- 3 3--1 LMS NLMS 2009 2 LMS Least Mean Square LMS Normalized LMS NLMS 3--1--1 3 1 AD 3 1 h(n) y(n) d(n) FIR w(n) n = 0, 1,, N
More informationばらつき抑制のための確率最適制御
( ) http://wwwhayanuemnagoya-uacjp/ fujimoto/ 2011 3 9 11 ( ) 2011/03/09-11 1 / 46 Outline 1 2 3 4 5 ( ) 2011/03/09-11 2 / 46 Outline 1 2 3 4 5 ( ) 2011/03/09-11 3 / 46 (1/2) r + Controller - u Plant y
More information1 913 10301200 A B C D E F G H J K L M 1A1030 10 : 45 1A1045 11 : 00 1A1100 11 : 15 1A1115 11 : 30 1A1130 11 : 45 1A1145 12 : 00 1B1030 1B1045 1C1030
1 913 9001030 A B C D E F G H J K L M 9:00 1A0900 9:15 1A0915 9:30 1A0930 9:45 1A0945 10 : 00 1A1000 10 : 15 1B0900 1B0915 1B0930 1B0945 1B1000 1C0900 1C0915 1D0915 1C0930 1C0945 1C1000 1D0930 1D0945 1D1000
More information1 1 ( ) ( 1.1 1.1.1 60% mm 100 100 60 60% 1.1.2 A B A B A 1
1 21 10 5 1 E-mail: qliu@res.otaru-uc.ac.jp 1 1 ( ) ( 1.1 1.1.1 60% mm 100 100 60 60% 1.1.2 A B A B A 1 B 1.1.3 boy W ID 1 2 3 DI DII DIII OL OL 1.1.4 2 1.1.5 1.1.6 1.1.7 1.1.8 1.2 1.2.1 1. 2. 3 1.2.2
More information( ) ) ) ) 5) 1 J = σe 2 6) ) 9) 1955 Statistical-Mechanical Theory of Irreversible Processes )
( 3 7 4 ) 2 2 ) 8 2 954 2) 955 3) 5) J = σe 2 6) 955 7) 9) 955 Statistical-Mechanical Theory of Irreversible Processes 957 ) 3 4 2 A B H (t) = Ae iωt B(t) = B(ω)e iωt B(ω) = [ Φ R (ω) Φ R () ] iω Φ R (t)
More information¼§À�ÍýÏÀ – Ê×ÎòÅŻҼ§À�¤È¥¹¥Ô¥ó¤æ¤é¤®
email: takahash@sci.u-hyogo.ac.jp Spring semester, 2012 Outline 1. 2 / 26 Introduction : (d ) : 4f 1970 ZrZn 2, MnSi, Ni 3 Al, Sc 3 In Stoner-Wohlfarth Moriya-Kawabata (1973) 3 / 26 Properties of Weak
More information1 variation 1.1 imension unit L m M kg T s Q C QT 1 A = C s 1 MKSA F = ma N N = kg m s 1.1 J E = 1 mv W = F x J = kg m s 1 = N m 1.
1.1 1. 1.3.1..3.4 3.1 3. 3.3 4.1 4. 4.3 5.1 5. 5.3 6.1 6. 6.3 7.1 7. 7.3 1 1 variation 1.1 imension unit L m M kg T s Q C QT 1 A = C s 1 MKSA F = ma N N = kg m s 1.1 J E = 1 mv W = F x J = kg m s 1 = N
More informationTitle 絶対温度 <0となり得る点渦系の平衡分布の特性 ( オイラー方程式の数理 : 渦運動 150 年 ) Author(s) 八柳, 祐一 Citation 数理解析研究所講究録 (2009), 1642: Issue Date URL
Title 絶対温度
More informationII No.01 [n/2] [1]H n (x) H n (x) = ( 1) r n! r!(n 2r)! (2x)n 2r. r=0 [2]H n (x) n,, H n ( x) = ( 1) n H n (x). [3] H n (x) = ( 1) n dn x2 e dx n e x2
II No.1 [n/] [1]H n x) H n x) = 1) r n! r!n r)! x)n r r= []H n x) n,, H n x) = 1) n H n x) [3] H n x) = 1) n dn x e dx n e x [4] H n+1 x) = xh n x) nh n 1 x) ) d dx x H n x) = H n+1 x) d dx H nx) = nh
More informationHierarchical model and triviality of $\phi_{4}^{4}$ abstract (Takashi Hara) (Tetsuya Hattori) $\mathrm{w}\mathrm{a}\mathrm{t}\mat
1134 2000 70-80 70 Hierarchical model and triviality of $\phi_{4}^{4}$ abstract (Takashi Hara) (Tetsuya Hattori) $\mathrm{w}\mathrm{a}\mathrm{t}\mathrm{a}\mathrm{n}\mathrm{a}\mathrm{b}\mathrm{e}$ (Hiroshi
More informationJune 2016 i (statistics) F Excel Numbers, OpenOffice/LibreOffice Calc ii *1 VAR STDEV 1 SPSS SAS R *2 R R R R *1 Excel, Numbers, Microsoft Office, Apple iwork, *2 R GNU GNU R iii URL http://ruby.kyoto-wu.ac.jp/statistics/training/
More information(a) (b) (c) Canny (d) 1 ( x α, y α ) 3 (x α, y α ) (a) A 2 + B 2 + C 2 + D 2 + E 2 + F 2 = 1 (3) u ξ α u (A, B, C, D, E, F ) (4) ξ α (x 2 α, 2x α y α,
[II] Optimization Computation for 3-D Understanding of Images [II]: Ellipse Fitting 1. (1) 2. (2) (edge detection) (edge) (zero-crossing) Canny (Canny operator) (3) 1(a) [I] [II] [III] [IV ] E-mail sugaya@iim.ics.tut.ac.jp
More information2 G(k) e ikx = (ik) n x n n! n=0 (k ) ( ) X n = ( i) n n k n G(k) k=0 F (k) ln G(k) = ln e ikx n κ n F (k) = F (k) (ik) n n= n! κ n κ n = ( i) n n k n
. X {x, x 2, x 3,... x n } X X {, 2, 3, 4, 5, 6} X x i P i. 0 P i 2. n P i = 3. P (i ω) = i ω P i P 3 {x, x 2, x 3,... x n } ω P i = 6 X f(x) f(x) X n n f(x i )P i n x n i P i X n 2 G(k) e ikx = (ik) n
More information特集_03-07.Q3C
3-7 Error Detection and Authentication in Quantum Key Distribution YAMAMURA Akihiro and ISHIZUKA Hirokazu Detecting errors in a raw key and authenticating a private key are crucial for quantum key distribution
More informationi Γ
018 4 10 i 1 1.1.............................. 1.......................... 3 1.3............................ 6 1.4............................ 7 8.1 Γ.................................... 8.......................
More informationit-ken_open.key
深層学習技術の進展 ImageNet Classification 画像認識 音声認識 自然言語処理 機械翻訳 深層学習技術は これらの分野において 特に圧倒的な強みを見せている Figure (Left) Eight ILSVRC-2010 test Deep images and the cited4: from: ``ImageNet Classification with Networks et
More informationn ξ n,i, i = 1,, n S n ξ n,i n 0 R 1,.. σ 1 σ i .10.14.15 0 1 0 1 1 3.14 3.18 3.19 3.14 3.14,. ii 1 1 1.1..................................... 1 1............................... 3 1.3.........................
More informationiBookBob:Users:bob:Documents:CurrentData:flMŠÍ…e…L…X…g:Statistics.dvi
4 4 9............................................... 3.3......................... 4.4................. 5.5............................ 7 9..................... 9.............................3................................4..........................5.............................6...........................
More information50. (km) A B C C 7 B A 0
49... 5 A B C. (. )?.. A A B C. A 4 0 50. (km) A B C..9 7. 4.5.9. 5. 7.5.0 4..4 7. 5.5 5.0 4. 4.. 8. 7 8.8 9.8. 8 5. 5.7.7 9.4 4. 4.7 0 4. 7. 8.0 4.. 5.8.4.8 8.5. 8 9 5 C 7 B 5 8 7 4 4 A 0 0 0 4 5 7 8
More information4. C i k = 2 k-means C 1 i, C 2 i 5. C i x i p [ f(θ i ; x) = (2π) p 2 Vi 1 2 exp (x µ ] i) t V 1 i (x µ i ) 2 BIC BIC = 2 log L( ˆθ i ; x i C i ) + q
x-means 1 2 2 x-means, x-means k-means Bayesian Information Criterion BIC Watershed x-means Moving Object Extraction Using the Number of Clusters Determined by X-means Clustering Naoki Kubo, 1 Kousuke
More informationuntitled
,, 2 2.,, A, PC/AT, MB, 5GB,,,, ( ) MB, GB 2,5,, 8MB, A, MB, GB 2 A,,,? x MB, y GB, A (), x + 2y () 4 (,, ) (hanba@eee.u-ryukyu.ac.jp), A, x + 2y() x y, A, MB ( ) 8 MB ( ) 5GB ( ) ( ), x x x 8 (2) y y
More information1 4 1 ( ) ( ) ( ) ( ) () 1 4 2
7 1995, 2017 7 21 1 2 2 3 3 4 4 6 (1).................................... 6 (2)..................................... 6 (3) t................. 9 5 11 (1)......................................... 11 (2)
More information(Basic of Proability Theory). (Probability Spacees ad Radom Variables , (Expectatios, Meas) (Weak Law
I (Radom Walks ad Percolatios) 3 4 7 ( -2 ) (Preface),.,,,...,,.,,,,.,.,,.,,. (,.) (Basic of Proability Theory). (Probability Spacees ad Radom Variables...............2, (Expectatios, Meas).............................
More information7 9 7..................................... 9 7................................ 3 7.3...................................... 3 A A. ω ν = ω/π E = hω. E
B 8.9.4, : : MIT I,II A.P. E.F.,, 993 I,,, 999, 7 I,II, 95 A A........................... A........................... 3.3 A.............................. 4.4....................................... 5 6..............................
More informationesba.dvi
Ehrenberg-Siday-Bohm-Aharonov 1. Aharonov Bohm 1) 0 A 0 A A = 0 Z ϕ = e A(r) dr C R C e I ϕ 1 ϕ 2 = e A dr = eφ H Φ Φ 1 Aharonov-Bohm Aharonov Bohm 10 Ehrenberg Siday 2) Ehrenberg-Siday-Bohm-Aharonov ESBA(
More information: : : : ) ) 1. d ij f i e i x i v j m a ij m f ij n x i =
1 1980 1) 1 2 3 19721960 1965 2) 1999 1 69 1980 1972: 55 1999: 179 2041999: 210 211 1999: 211 3 2003 1987 92 97 3) 1960 1965 1970 1985 1990 1995 4) 1. d ij f i e i x i v j m a ij m f ij n x i = n d ij
More information高齢化の経済分析.pdf
( 2 65 1995 14.8 2050 33.4 1 2 3 1 7 3 2 1980 3 79 4 ( (1992 1 ( 6069 8 7079 5 80 3 80 1 (1 (Sample selection bias 1 (1 1* 80 1 1 ( (1 0.628897 150.5 0.565148 17.9 0.280527 70.9 0.600129 31.5 0.339812
More information薄膜結晶成長の基礎4.dvi
4 464-8602 1 [1] 2 (STM: scanning tunneling microscope) (AFM: atomic force microscope) 1 ( ) 4 LPE(liquid phase epitaxy) 4.1 - - - - (Burton Cabrera Frank) BCF [2] P f = (4.1) 2πmkB T 1 Makio Uwaha. E-mail:uwaha@nagoya-u.jp;
More information?
240-8501 79-2 Email: nakamoto@ynu.ac.jp 1 3 1.1...................................... 3 1.2?................................. 6 1.3..................................... 8 1.4.......................................
More information(interval estimation) 3 (confidence coefficient) µ σ/sqrt(n) 4 P ( (X - µ) / (σ sqrt N < a) = α a α X α µ a σ sqrt N X µ a σ sqrt N 2
7 2 1 (interval estimation) 3 (confidence coefficient) µ σ/sqrt(n) 4 P ( (X - µ) / (σ sqrt N < a) = α a α X α µ a σ sqrt N X µ a σ sqrt N 2 (confidence interval) 5 X a σ sqrt N µ X a σ sqrt N - 6 P ( X
More information1 IDC Wo rldwide Business Analytics Technology and Services 2013-2017 Forecast 2 24 http://www.soumu.go.jp/johotsusintokei/whitepaper/ja/h24/pdf/n2010000.pdf 3 Manyika, J., Chui, M., Brown, B., Bughin,
More informationIA hara@math.kyushu-u.ac.jp Last updated: January,......................................................................................................................................................................................
More information情報理論 第5回 情報量とエントロピー
5 () ( ) ( ) ( ) p(a) a I(a) p(a) p(a) I(a) p(a) I(a) (2) (self information) p(a) = I(a) = 0 I(a) = 0 I(a) a I(a) = log 2 p(a) = log 2 p(a) bit 2 (log 2 ) (3) I(a) 7 6 5 4 3 2 0 0.5 p(a) p(a) = /2 I(a)
More informationhttp://www2.math.kyushu-u.ac.jp/~hara/lectures/lectures-j.html 2 N(ε 1 ) N(ε 2 ) ε 1 ε 2 α ε ε 2 1 n N(ɛ) N ɛ ɛ- (1.1.3) n > N(ɛ) a n α < ɛ n N(ɛ) a n
http://www2.math.kyushu-u.ac.jp/~hara/lectures/lectures-j.html 1 1 1.1 ɛ-n 1 ɛ-n lim n a n = α n a n α 2 lim a n = 1 n a k n n k=1 1.1.7 ɛ-n 1.1.1 a n α a n n α lim n a n = α ɛ N(ɛ) n > N(ɛ) a n α < ɛ
More informationφ 4 Minimal subtraction scheme 2-loop ε 2008 (University of Tokyo) (Atsuo Kuniba) version 21/Apr/ Formulas Γ( n + ɛ) = ( 1)n (1 n! ɛ + ψ(n + 1)
φ 4 Minimal subtraction scheme 2-loop ε 28 University of Tokyo Atsuo Kuniba version 2/Apr/28 Formulas Γ n + ɛ = n n! ɛ + ψn + + Oɛ n =,, 2, ψn + = + 2 + + γ, 2 n ψ = γ =.5772... Euler const, log + ax x
More information( ) I( ) TA: ( M2)
( ) I( ) TA: ( M) 015 7 17 , 7 ( ) I( ).., M. (hatomura@spin.phys.s.u-tokyo.ac.jp).,,.. Keywords: 1. (gas-liquid phase transition). (critical point) 3. (lattice gas model) (Ising model) H = ϕ 0 i,j n i
More informationA A = a 41 a 42 a 43 a 44 A (7) 1 (3) A = M 12 = = a 41 (8) a 41 a 43 a 44 (3) n n A, B a i AB = A B ii aa
1 2 21 2 2 [ ] a 11 a 12 A = a 21 a 22 (1) A = a 11 a 22 a 12 a 21 (2) 3 3 n n A A = n ( 1) i+j a ij M ij i =1 n (3) j=1 M ij A i j (n 1) (n 1) 2-1 3 3 A A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33
More informationLINEAR ALGEBRA I Hiroshi SUZUKI Department of Mathematics International Christian University
LINEAR ALGEBRA I Hiroshi SUZUKI Department of Mathematics International Christian University 2002 2 2 2 2 22 2 3 3 3 3 3 4 4 5 5 6 6 7 7 8 8 9 Cramer 9 0 0 E-mail:hsuzuki@icuacjp 0 3x + y + 2z 4 x + y
More information行列代数2010A
a ij i j 1) i +j i, j) ij ij 1 j a i1 a ij a i a 1 a j a ij 1) i +j 1,j 1,j +1 a i1,1 a i1,j 1 a i1,j +1 a i1, a i +1,1 a i +1.j 1 a i +1,j +1 a i +1, a 1 a,j 1 a,j +1 a, ij i j 1,j 1,j +1 ij 1) i +j a
More informationexample2_time.eps
Google (20/08/2 ) ( ) Random Walk & Google Page Rank Agora on Aug. 20 / 67 Introduction ( ) Random Walk & Google Page Rank Agora on Aug. 20 2 / 67 Introduction Google ( ) Random Walk & Google Page Rank
More informationGrund.dvi
24 24 23 411M133 i 1 1 1.1........................................ 1 2 4 2.1...................................... 4 2.2.................................. 6 2.2.1........................... 6 2.2.2 viterbi...........................
More informationAHPを用いた大相撲の新しい番付編成
5304050 2008/2/15 1 2008/2/15 2 42 2008/2/15 3 2008/2/15 4 195 2008/2/15 5 2008/2/15 6 i j ij >1 ij ij1/>1 i j i 1 ji 1/ j ij 2008/2/15 7 1 =2.01/=0.5 =1.51/=0.67 2008/2/15 8 1 2008/2/15 9 () u ) i i i
More information0 1-4. 1-5. (1) + b = b +, (2) b = b, (3) + 0 =, (4) 1 =, (5) ( + b) + c = + (b + c), (6) ( b) c = (b c), (7) (b + c) = b + c, (8) ( + b)c = c + bc (9
1-1. 1, 2, 3, 4, 5, 6, 7,, 100,, 1000, n, m m m n n 0 n, m m n 1-2. 0 m n m n 0 2 = 1.41421356 π = 3.141516 1-3. 1 0 1-4. 1-5. (1) + b = b +, (2) b = b, (3) + 0 =, (4) 1 =, (5) ( + b) + c = + (b + c),
More information2 4 2 3 4 3 [12] 2 3 4 5 1 1 [5, 6, 7] [5, 6] [7] 1 [8] 1 1 [9] 1 [10, 11] [10] [11] 1 [13, 14] [13] [14] [13, 14] [10, 11, 13, 14] 1 [12]
Walking Person Recognition by Matching Video Fragments Masashi Nishiyama, Mayumi Yuasa, Tomokazu Wakasugi, Tomoyuki Shibata, Osamu Yamaguchi ( ), Corporate Research and Development Center, TOSHIBA Corporation
More information20 $P_{S}=v_{0}\tau_{0}/r_{0}$ (3) $v_{0}$ $r_{0}$ $l(r)$ $l(r)=p_{s}r$ $[3 $ $1+P_{s}$ $P_{s}\ll 1$ $P_{s}\gg 1$ ( ) $P_{s}$ ( ) 2 (2) (2) $t=0$ $P(t
1601 2008 19-27 19 (Kentaro Kanatani) (Takeshi Ogasawara) (Sadayoshi Toh) Graduate School of Science, Kyoto University 1 ( ) $2 $ [1, ( ) 2 2 [3, 4] 1 $dt$ $dp$ $dp= \frac{dt}{\tau(r)}=(\frac{r_{0}}{r})^{\beta}\frac{dt}{\tau_{0}}$
More information( ) URL: December 2, 2003
( ) URL: http://dbs.c.u-tokyo.ac.jp/~fukushima mailto:hukusima@phys.c.u-tokyo.ac.jp December 2, 2003 Today s Contents Summary 2003/12/02 1 Cannella Mydosh(1972) Edwards Anderson(1975): Model Hamiltonian:
More information1 1 1 1 1 1 2 f z 2 C 1, C 2 f 2 C 1, C 2 f(c 2 ) C 2 f(c 1 ) z C 1 f f(z) xy uv ( u v ) = ( a b c d ) ( x y ) + ( p q ) (p + b, q + d) 1 (p + a, q + c) 1 (p, q) 1 1 (b, d) (a, c) 2 3 2 3 a = d, c = b
More informationDVIOUT-fujin
2005 Limit Distribution of Quantum Walks and Weyl Equation 2006 3 2 1 2 2 4 2.1...................... 4 2.2......................... 5 2.3..................... 6 3 8 3.1........... 8 3.2..........................
More information格子QCD実践入門
-- nakamura at riise.hiroshima-u.ac.jp or nakamura at an-pan.org 2013.6.26-27 1. vs. 2. (1) 3. QCD QCD QCD 4. (2) 5. QCD 2 QCD 1981 QCD Parisi, Stamatescu, Hasenfratz, etc 2 3 (Cut-Off) = +Cut-Off a p
More informationNosé Hoover 1.2 ( 1) (a) (b) 1:
1 watanabe@cc.u-tokyo.ac.jp 1 1.1 Nosé Hoover 1. ( 1) (a) (b) 1: T ( f(p x, p y, p z ) exp p x + p y + p ) z (1) mk B T p x p y p = = z = 1 m m m k BT () k B T = 1.3 0.04 0.03 0.0 0.01 0-5 -4-3 - -1 0
More informationTwist knot orbifold Chern-Simons
Twist knot orbifold Chern-Simons 1 3 M π F : F (M) M ω = {ω ij }, Ω = {Ω ij }, cs := 1 4π 2 (ω 12 ω 13 ω 23 + ω 12 Ω 12 + ω 13 Ω 13 + ω 23 Ω 23 ) M Chern-Simons., S. Chern J. Simons, F (M) Pontrjagin 2.,
More information橡超弦理論はブラックホールの謎を解けるか?
1999 3 (Can String Theory Solve the Puzzles of Black Holes?) 305-0801 1-1 makoto.natsuume@kek.jp D-brane 1 Schwarzschild 60 80 2 [1] 1 1 1 2 2 [2] 25 2.2 2 2.1 [7,8] Schwarzschild 2GM/c 2 Schwarzschild
More informationII K116 : January 14, ,. A = (a ij ) ij m n. ( ). B m n, C n l. A = max{ a ij }. ij A + B A + B, AC n A C (1) 1. m n (A k ) k=1,... m n A, A k k
: January 14, 28..,. A = (a ij ) ij m n. ( ). B m n, C n l. A = max{ a ij }. ij A + B A + B, AC n A C (1) 1. m n (A k ) k=1,... m n A, A k k, A. lim k A k = A. A k = (a (k) ij ) ij, A k = (a ij ) ij, i,
More information16) 12) 14) n x i, (1 i < n) x 1 = x 2 = = x n. (6) L = D A (1) D = diag(d 1,d 2,,d n ) n n A d i = j i a i j 9) 0 a 12 a 13 a 14 A = a 21 0 a
1 1, 2 Evolutionary Optimized Synchronization Networks TOSHIHIKO YAMAMOTO 1 and AKIRA NAMATAME 1 Collective behavior in nature, the interaction between agents and factors, there is consensus problem as
More informationAccuracy Improvement by Compound Discriminant Functions for Resembling Character Recognition Takashi NAKAJIMA, Tetsushi WAKABAYASHI, Fumitaka KIMURA,
Journal Article / 学 術 雑 誌 論 文 混 合 識 別 関 数 による 類 似 文 字 認 識 の 高 精 度 化 Accuracy improvement by compoun for resembling character recogn 中 嶋, 孝 ; 若 林, 哲 史 ; 木 村, 文 隆 ; 三 宅, 康 二 Nakajima, Takashi; Wakabayashi,
More information