? (EM),, EM? (, 2004/ 2002) von Mises-Fisher ( 2004) HMM (MacKay 1997) LDA (Blei et al. 2001) PCFG ( 2004)... Variational Bayesian methods for Natural
|
|
- しまな むらかわ
- 5 years ago
- Views:
Transcription
1 SLC Internal tutorial Daichi Mochihashi ATR SLC (Tue) 13:15 Room 1 Variational Bayesian methods for Natural Language Processing p.1/30
2 ? (EM),, EM? (, 2004/ 2002) von Mises-Fisher ( 2004) HMM (MacKay 1997) LDA (Blei et al. 2001) PCFG ( 2004)... Variational Bayesian methods for Natural Language Processing p.2/30
3 EM VB-EM LDA VB-HMM Variational Bayesian methods for Natural Language Processing p.3/30
4 : Jensen f(x), f(e[x]) E[f(x)] (1) log(x), x = f(x) log p(x)f(x)dx p(x)logf(x)dx. (2) KL D(p q) = p(x)log p(x) dx 0. (3) q(x) p = q. Variational Bayesian methods for Natural Language Processing p.4/30
5 : D, p(d) = p(d, θ)dθ (4) = p(d θ)p(θ)dθ. (5) p(d θ),p(θ) : ( ) θ : : D, p(θ D). p(θ D) p(θ, D) =p(d θ)p(θ). (6) θ D Variational Bayesian methods for Natural Language Processing p.5/30
6 p(θ D), d p(d D) = p(d θ)p(θ D)dθ. (7) p(d θ) : p(θ D) : θ. p(d D) =p(d ˆθ). (8) θ = ˆθ p(θ D) =δ(ˆθ) δ p(θ D), Variational Bayesian methods for Natural Language Processing p.6/30
7 D z, p(d θ) = p(d, z θ)dz. (9) (6) θ = ˆθ z. EM. z D Variational Bayesian methods for Natural Language Processing p.7/30
8 EM (1) Jensen, log p(d θ) = log p(d, z θ)dz (10) p(d, z θ) =log q(z D, ˆθ) dz (11) q(z D, ˆθ) p(d, z θ) q(z D, ˆθ)log dz = F (q(z),θ) (12) q(z D, ˆθ), F (q(z),θ). E step: M step: q(z) = arg max q(z) ˆθ =argmax θ F (q(z),θ), (13) F (q(z),θ). (14) Variational Bayesian methods for Natural Language Processing p.8/30
9 EM (2) E step F (q(z),θ)= = = q(z D, q(z D, q(z D, p(d, z θ) ˆθ)log dz (15) q(z D, ˆθ) ˆθ)log p(z D, θ)p(d θ) q(z D, ˆθ) dz (16) q(z D, ˆθ) ˆθ)log dz +logp(d θ) (17) p(z D, θ) = D(q(z D, ˆθ) p(z D, θ)) +logp(d θ) (18) q(z D, ˆθ) =p(z D, θ) (19) (E ). Variational Bayesian methods for Natural Language Processing p.9/30
10 EM (3) M step F (q(z),θ)= q(z D, p(d, z θ) ˆθ)log dz (20) q(z D, ˆθ) = log p(d, z θ) q(z D,ˆθ) + H(q(z D, ˆθ)) (21), F (q(z),θ) θ,, Q(θ) = log p(d, z θ) q(z D,ˆθ) (Q ) (22) Q(θ) θ =0 (23) θ ˆθ. (M ) Variational Bayesian methods for Natural Language Processing p.10/30
11 EM ( ) log p(d θ) F (q(z),θ)= q(z D, p(d, z θ) ˆθ)log dz (24) q(z D, ˆθ), F (q(z),θ) q(z),θ (EM )., log p(d θ) F (q(z),θ) (25) = q(z D, ˆθ)logp(D θ)dz p(d, z θ) q(z D, ˆθ)log dz (26) q(z D, ˆθ) q(z D, ˆθ) = q(z D, ˆθ)log dz (27) p(z D, θ) = D(q(z D, ˆθ) p(z D, θ)) 0. (28) KL. Variational Bayesian methods for Natural Language Processing p.11/30
12 Example: PLSI (1/3) w d, z p(d, w, z) =p(z)p(d z)p(w z) (29) p(d z). d z w = w 1 w 2 w n W = {w 1, w 2,...,w D }, D = {1, 2,...,D}, p(z) p(w z) p(d,w,z)= p(d, w d, z d ) (30) d = p(d, w dn,z dn ) (31) d n = p(z dn )p(d z dn )p(w dn z dn ) (32) d n [ log p(zdn )+log p(d z dn )+log p(w dn z dn ) ]. w log p(d,w,z)= d n (33) Variational Bayesian methods for Natural Language Processing p.12/30
13 Example: PLSI (2/3) Q log p(d, z θ) p(z D,θ), Q(z) = log p(d,w,z) p(z D,W ) (34) = d [ p(z d, w dn )logp(z dn ) n z + z + z p(z d, w dn )logp(d z dn ) ] p(z d, w dn )logp(w dn z dn ). (35) δq/δθ, δq δp(z) = d p(z) d n p(z d, w dn) p(z) p(z d, w dn ) n d + λ =0 (36) n(d, w)p(z d, w) (37) w Variational Bayesian methods for Natural Language Processing p.13/30
14 Example: PLSI (3/3), p(d z) n p(z d, w dn ) w n(d, w)p(z d, w) (38) p(w z) d p(z d, w dn ) n d n(d, w)p(z d, w). (39) p(z d, w) p(z, d, w) =p(z)p(d z)p(w z). (40), d θ(d) =p(z d) (41) p(z)p(d z) (42). Variational Bayesian methods for Natural Language Processing p.14/30
15 EM θ given, z 1 (z ).. Variational Bayesian methods for Natural Language Processing p.15/30
16 p(d) = p(d, z, θ)dzdθ. (43) (26) z,θ p(z D),p(θ D). p(d, z, θ) log p(d) = log q(z,θ D) q(z,θ D) p(d, z, θ) q(z,θ D)log q(z,θ D) θ z D dzdθ (44) dzdθ (45) z,θ, q(z,θ D) =q(z)q(θ) (46), Variational Bayesian methods for Natural Language Processing p.16/30
17 log p(d) = q(z,θ D)log q(z)q(θ)log p(d, z, θ) q(z,θ D) dzdθ (47) p(d, zθ) dzdθ (48) q(z)q(θ) = F (q). ( ) (49) (, variational lower bound) F (q) q(z),q(θ). Variational Bayesian methods for Natural Language Processing p.17/30
18 Maximize w.r.t. q(z) ( L = F (q)+λ = δl δq(z) = = q(z)q(θ)log ) q(z)dz 1 ( p(d, z, θ) q(z)q(θ) dzdθ + λ ) q(z)dz 1 q(θ) [ log p(d, z, θ) log q(θ) log q(z) 1 ] dzdθ + λ (50), q(θ) [ log p(d, z θ)+logp(θ) log q(θ) log q(z) 1 ] dzdθ + λ = log p(d, z θ) q(θ) log q(z)+(const.)+λ =0 (51) q(z) exp log p(d, z θ) q(θ). (52) Variational Bayesian methods for Natural Language Processing p.18/30
19 Maximize w.r.t. q(θ) ( L = F (q)+λ = δl δq(θ) = = q(z)q(θ)log ) q(θ)dθ 1 ( p(d, z, θ) q(z)q(θ) dzdθ + λ ) q(θ)dθ 1 q(z) [ log p(d, z, θ) log q(θ) log q(z) 1 ] dzdθ + λ (53) (54) q(z) [ log p(d, z θ)+logp(θ) log q(θ) log q(z) 1 ] dzdθ + λ = log p(d, z θ) +logp(θ) log q(θ)+(const.)+λ =0 q(z) (55) q(θ) p(θ)exp log p(d, z θ) q(z). (56) Variational Bayesian methods for Natural Language Processing p.19/30
20 D, z, θ,. log p(d) = log p(d, z, θ)dzdθ (57) p(d, z, θ) q(z)q(θ)log dzdθ = F (q). q(z)q(θ) (58) F (q) q(z), q(θ), q(z) exp log p(d, z θ) q(θ) q(θ) p(θ)exp log p(d, z θ) q(z) (VB-E step) (59) (VB-M step) (60) VB-EM. Variational Bayesian methods for Natural Language Processing p.20/30
21 (1) VB-EM : q(z) exp log p(d, z θ) q(θ) q(θ) p(θ)exp log p(d, z θ) q(z) (VB-E step) (61) (VB-M step) (62) q(θ) =δ(ˆθ), (44) q(z) p(d, z ˆθ) p(z D, ˆθ) (63) EM E-step. Variational Bayesian methods for Natural Language Processing p.21/30
22 (2), log p(d) F (q) = q(z,θ)logp(d)dzdθ = = log p(d) F (q). (64) q(z,θ)log p(d, z, θ) q(z,θ) (65) dzdθ (66) q(z,θ) [ log p(d) log p(z,θ D) log p(d)+logq(z,θ) ] dzdθ q(z,θ)log q(z,θ) p(z,θ D) (67) dzdθ (68) = D(q(z,θ) p(z,θ D)) 0. (69), q(z,θ) =q(z)q(θ). Variational Bayesian methods for Natural Language Processing p.22/30
23 (3) F (q) = ( = = = log log log q(z)q(θ)log p(d, z, θ) q(z)q(θ) p(d, z θ) p(θ) q(z)q(θ)log q(z) q(θ) p(d, z θ) q(z) p(d, z θ) q(z) p(d, z θ) q(z) q(z)q(θ) dzdθ (70) dzdθ (71) q(θ)log q(θ) dθ (72) p(θ) D(q(θ D) p(θ)) q(z)q(θ) }{{} ( ) q(z)q(θ) ˆθ 2 log N }{{} MDL, BIC +logp(ˆθ) }{{} (const.) KL,. ) (73) (74) Variational Bayesian methods for Natural Language Processing p.23/30
24 (2), log p(d) F (q). (75) KL ( ). δf/δq(z),δf/δq(θ) VB-EM. q(z),q(θ) ( ) q(θ) δ, EM p(θ) q(θ D) KL- N MDL/BIC Variational Bayesian methods for Natural Language Processing p.24/30
25 : LDA β PLSI d θ = p(z d) α θ z w N, D θ ( ) : β = p(w z), p(w α, β) = p(θ α) n p(θ) Dir(θ α) (76) p(w n θ, β)dθ (77) = Γ( k α k) k Γ(α k). k θ α k 1 k (θ z β zv ) wv n dθ n z v (78) Variational Bayesian methods for Natural Language Processing p.25/30
26 : LDA (2) log p(w α, β) = log p(w,z,θ α, β)dθ (79) z =log z p(w,z,θ α, β) q(z,θ γ,ψ) dθ (80) q(z,θ γ,ψ) q(z,θ γ,ψ)log z p(w,z,θ α, β) q(z,θ γ,ψ) q(z,θ w,γ,ψ)=q(θ γ) n q(z n w n,ψ), dθ (81) log p(w α, β) log p(θ α) q(θ γ) + n log p(zn θ) q(θ γ),q(z n w n,ψ) log p(wn z n,β) q(z n w n,ψ) + n log q(θ γ) q(θ γ) n log q(zn w n,ψ) q(z n w n,ψ). (82) Variational Bayesian methods for Natural Language Processing p.26/30
27 VB-HMM y = y 1 y 2 y T, s = s 1 s 2 s T, HMM π (1 K) C (K K) A (K W ) log p(y) =log dπ dπ da da dc s dc s p(π, A, C)p(y, s π, A, C) (83) q(π, A, C, s) log p(π, A, C)p(y, s π, A, C) q(π, A, C, s) (84). Variational Bayesian methods for Natural Language Processing p.27/30
28 VB-HMM (2) π,c, A Dir(α), Dir(β), Dir(γ), VB-Estep: π k exp ( Ψ(α k ) Ψ( k α k )) (85) A ij exp ( Ψ(β ij) Ψ( j β ij) ) (86) C ij exp ( Ψ(γij) Ψ( γij) ) (87) j VB-Mstep: α, β, γ α,β,γ Forward-Backward. Beal, M.J. (2003) Variational Algorithms for Approximate Bayesian Inference. PhD thesis, Gatsby UCL. Chapter.3. Variational Bayesian methods for Natural Language Processing p.28/30
29 , (or, ) Gibbs sampling, MCMC,,, (LDA, 3 ( )) EP (Expectation Propagation) (Minka 2001), Power EP (Minka 2004) VB EP KL- Power EP α- Variational Bayesian methods for Natural Language Processing p.29/30
30 Readings Hagai Attias. A Variational Bayesian Framework for Graphical Models. In NIPS 1999, Thomas Minka. Expectation-Maximization as lower bound maximization, minka/papers/em.html. Radford M. Neal and Geoffrey E. Hinton. A View of the EM Algorithm that Justifies Incremental, Sparse, and other Variants. in Learning in Graphical Models, pages Dordrecht: Kluwer Academic Publishers, Zoubin Ghahramani. Unsupervised Learning. in Advanced Lectures on Machine Learning LNAI Springer-Verlag, Berlin, zoubin/course04/ul.pdf. Variational Bayesian methods for Natural Language Processing p.30/30
1 (Berry,1975) 2-6 p (S πr 2 )p πr 2 p 2πRγ p p = 2γ R (2.5).1-1 : : : : ( ).2 α, β α, β () X S = X X α X β (.1) 1 2
2005 9/8-11 2 2.2 ( 2-5) γ ( ) γ cos θ 2πr πρhr 2 g h = 2γ cos θ ρgr (2.1) γ = ρgrh (2.2) 2 cos θ θ cos θ = 1 (2.2) γ = 1 ρgrh (2.) 2 2. p p ρgh p ( ) p p = p ρgh (2.) h p p = 2γ r 1 1 (Berry,1975) 2-6
More informationohpmain.dvi
fujisawa@ism.ac.jp 1 Contents 1. 2. 3. 4. γ- 2 1. 3 10 5.6, 5.7, 5.4, 5.5, 5.8, 5.5, 5.3, 5.6, 5.4, 5.2. 5.5 5.6 +5.7 +5.4 +5.5 +5.8 +5.5 +5.3 +5.6 +5.4 +5.2 =5.5. 10 outlier 5 5.6, 5.7, 5.4, 5.5, 5.8,
More information201711grade1ouyou.pdf
2017 11 26 1 2 52 3 12 13 22 23 32 33 42 3 5 3 4 90 5 6 A 1 2 Web Web 3 4 1 2... 5 6 7 7 44 8 9 1 2 3 1 p p >2 2 A 1 2 0.6 0.4 0.52... (a) 0.6 0.4...... B 1 2 0.8-0.2 0.52..... (b) 0.6 0.52.... 1 A B 2
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 informationN cos s s cos ψ e e e e 3 3 e e 3 e 3 e
3 3 5 5 5 3 3 7 5 33 5 33 9 5 8 > e > f U f U u u > u ue u e u ue u ue u e u e u u e u u e u N cos s s cos ψ e e e e 3 3 e e 3 e 3 e 3 > A A > A E A f A A f A [ ] f A A e > > A e[ ] > f A E A < < f ; >
More information6 2 2 x y x y t P P = P t P = I P P P ( ) ( ) ,, ( ) ( ) cos θ sin θ cos θ sin θ, sin θ cos θ sin θ cos θ y x θ x θ P
6 x x 6.1 t P P = P t P = I P P P 1 0 1 0,, 0 1 0 1 cos θ sin θ cos θ sin θ, sin θ cos θ sin θ cos θ x θ x θ P x P x, P ) = t P x)p ) = t x t P P ) = t x = x, ) 6.1) x = Figure 6.1 Px = x, P=, θ = θ P
More informationOverview (Gaussian Process) GPLVM GPDM 2 / 59
daichi@ism.ac.jp 2015-3-3( ) 1 / 59 Overview (Gaussian Process) GPLVM GPDM 2 / 59 (Gaussian Process) y 2 1 0 1 2 3 8 6 4 2 0 2 4 6 8 x x y (regressor) D = { (x (n), y (n) ) } N, n=1 x (n+1) y (n+1), (
More information.2 ρ dv dt = ρk grad p + 3 η grad (divv) + η 2 v.3 divh = 0, rote + c H t = 0 dive = ρ, H = 0, E = ρ, roth c E t = c ρv E + H c t = 0 H c E t = c ρv T
NHK 204 2 0 203 2 24 ( ) 7 00 7 50 203 2 25 ( ) 7 00 7 50 203 2 26 ( ) 7 00 7 50 203 2 27 ( ) 7 00 7 50 I. ( ν R n 2 ) m 2 n m, R = e 2 8πε 0 hca B =.09737 0 7 m ( ν = ) λ a B = 4πε 0ħ 2 m e e 2 = 5.2977
More informationmeiji_resume_1.PDF
β β β (q 1,q,..., q n ; p 1, p,..., p n ) H(q 1,q,..., q n ; p 1, p,..., p n ) Hψ = εψ ε k = k +1/ ε k = k(k 1) (x, y, z; p x, p y, p z ) (r; p r ), (θ; p θ ), (ϕ; p ϕ ) ε k = 1/ k p i dq i E total = E
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 informationPart () () Γ Part ,
Contents a 6 6 6 6 6 6 6 7 7. 8.. 8.. 8.3. 8 Part. 9. 9.. 9.. 3. 3.. 3.. 3 4. 5 4.. 5 4.. 9 4.3. 3 Part. 6 5. () 6 5.. () 7 5.. 9 5.3. Γ 3 6. 3 6.. 3 6.. 3 6.3. 33 Part 3. 34 7. 34 7.. 34 7.. 34 8. 35
More informationI A A441 : April 15, 2013 Version : 1.1 I Kawahira, Tomoki TA (Shigehiro, Yoshida )
I013 00-1 : April 15, 013 Version : 1.1 I Kawahira, Tomoki TA (Shigehiro, Yoshida) http://www.math.nagoya-u.ac.jp/~kawahira/courses/13s-tenbou.html pdf * 4 15 4 5 13 e πi = 1 5 0 5 7 3 4 6 3 6 10 6 17
More information0 ϕ ( ) (x) 0 ϕ (+) (x)ϕ d 3 ( ) (y) 0 pd 3 q (2π) 6 a p a qe ipx e iqy 0 2Ep 2Eq d 3 pd 3 q 0 (2π) 6 [a p, a q]e ipx e iqy 0 2Ep 2Eq d 3 pd 3 q (2π)
( ) 2 S 3 ( ) ( ) 0 O 0 O ( ) O ϕ(x) ϕ (x) d 3 p (2π) 3 2Ep (a p e ipx + b pe +ipx ) ϕ (+) (x) + ϕ ( ) (x) d 3 p (2π) 3 2Ep (a pe +ipx + b p e ipx ) ϕ ( ) (x) + ϕ (+) (x) (px p 0 x 0 p x E p t p x, E p
More information20 4 20 i 1 1 1.1............................ 1 1.2............................ 4 2 11 2.1................... 11 2.2......................... 11 2.3....................... 19 3 25 3.1.............................
More informationKullback-Leibler
Kullback-Leibler 206 6 6 http://www.math.tohoku.ac.jp/~kuroki/latex/206066kullbackleibler.pdf 0 2 Kullback-Leibler 3. q i.......................... 3.2........... 3.3 Kullback-Leibler.............. 4.4
More informationGmech08.dvi
145 13 13.1 13.1.1 0 m mg S 13.1 F 13.1 F /m S F F 13.1 F mg S F F mg 13.1: m d2 r 2 = F + F = 0 (13.1) 146 13 F = F (13.2) S S S S S P r S P r r = r 0 + r (13.3) r 0 S S m d2 r 2 = F (13.4) (13.3) d 2
More information(Compton Scattering) Beaming 1 exp [i (k x ωt)] k λ k = 2π/λ ω = 2πν k = ω/c k x ωt ( ω ) k α c, k k x ωt η αβ k α x β diag( + ++) x β = (ct, x) O O x
Compton Scattering Beaming exp [i k x ωt] k λ k π/λ ω πν k ω/c k x ωt ω k α c, k k x ωt η αβ k α x β diag + ++ x β ct, x O O x O O v k α k α β, γ k γ k βk, k γ k + βk k γ k k, k γ k + βk 3 k k 4 k 3 k
More information統計学のポイント整理
.. September 17, 2012 1 / 55 n! = n (n 1) (n 2) 1 0! = 1 10! = 10 9 8 1 = 3628800 n k np k np k = n! (n k)! (1) 5 3 5 P 3 = 5! = 5 4 3 = 60 (5 3)! n k n C k nc k = npk k! = n! k!(n k)! (2) 5 3 5C 3 = 5!
More informationスライド 1
61 SAS SAS LOHAS 18 18 12 01 LOHAS ( ) ( ) LOHAS 29% 35% LOHAS LOHAS 18 5 20 60 GMO 500 Yes No Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 LOHAS Q25 LOHAS / 2
More information四変数基本対称式の解放
The second-thought of the Galois-style way to solve a quartic equation Oomori, Yasuhiro in Himeji City, Japan Jan.6, 013 Abstract v ρ (v) Step1.5 l 3 1 6. l 3 7. Step - V v - 3 8. Step1.3 - - groupe groupe
More informationsimx simxdx, cosxdx, sixdx 6.3 px m m + pxfxdx = pxf x p xf xdx = pxf x p xf x + p xf xdx 7.4 a m.5 fx simxdx 8 fx fx simxdx = πb m 9 a fxdx = πa a =
II 6 ishimori@phys.titech.ac.jp 6.. 5.4.. f Rx = f Lx = fx fx + lim = lim x x + x x f c = f x + x < c < x x x + lim x x fx fx x x = lim x x f c = f x x < c < x cosmx cosxdx = {cosm x + cosm + x} dx = [
More informationKullback-Leibler
Kullback-Leibler Saov 206 6 6 http://www.math.tohoku.ac.jp/~kuroki/latex/206066kullbackleibler.pdf 0 3 Kullback-Leibler 4........................... 4.2........... 5.3 Kullback-Leibler.............. 5.4
More information1 1.1 ( ). z = a + bi, a, b R 0 a, b 0 a 2 + b 2 0 z = a + bi = ( ) a 2 + b 2 a a 2 + b + b 2 a 2 + b i 2 r = a 2 + b 2 θ cos θ = a a 2 + b 2, sin θ =
1 1.1 ( ). z = + bi,, b R 0, b 0 2 + b 2 0 z = + bi = ( ) 2 + b 2 2 + b + b 2 2 + b i 2 r = 2 + b 2 θ cos θ = 2 + b 2, sin θ = b 2 + b 2 2π z = r(cos θ + i sin θ) 1.2 (, ). 1. < 2. > 3. ±,, 1.3 ( ). A
More information(1.2) T D = 0 T = D = 30 kn 1.2 (1.4) 2F W = 0 F = W/2 = 300 kn/2 = 150 kn 1.3 (1.9) R = W 1 + W 2 = = 1100 N. (1.9) W 2 b W 1 a = 0
1 1 1.1 1.) T D = T = D = kn 1. 1.4) F W = F = W/ = kn/ = 15 kn 1. 1.9) R = W 1 + W = 6 + 5 = 11 N. 1.9) W b W 1 a = a = W /W 1 )b = 5/6) = 5 cm 1.4 AB AC P 1, P x, y x, y y x 1.4.) P sin 6 + P 1 sin 45
More informationzz + 3i(z z) + 5 = 0 + i z + i = z 2i z z z y zz + 3i (z z) + 5 = 0 (z 3i) (z + 3i) = 9 5 = 4 z 3i = 2 (3i) zz i (z z) + 1 = a 2 {
04 zz + iz z) + 5 = 0 + i z + i = z i z z z 970 0 y zz + i z z) + 5 = 0 z i) z + i) = 9 5 = 4 z i = i) zz i z z) + = a {zz + i z z) + 4} a ) zz + a + ) z z) + 4a = 0 4a a = 5 a = x i) i) : c Darumafactory
More information°ÌÁê¿ô³ØII
July 14, 2007 Brouwer f f(x) = x x f(z) = 0 2 f : S 2 R 2 f(x) = f( x) x S 2 3 3 2 - - - 1. X x X U(x) U(x) x U = {U(x) x X} X 1. U(x) A U(x) x 2. A U(x), A B B U(x) 3. A, B U(x) A B U(x) 4. A U(x),
More informationKullback-Leibler
Kullback-Leible Sanov 206 6 6 http://www.math.tohoku.ac.jp/~kuoki/latex/206066kullbackleible.pdf 0 2 Kullback-Leible 3........................... 3.2........... 4.3 Kullback-Leible.............. 4.4 Kullback-Leible......................
More information21 2 26 i 1 1 1.1............................ 1 1.2............................ 3 2 9 2.1................... 9 2.2.......... 9 2.3................... 11 2.4....................... 12 3 15 3.1..........
More informationx () g(x) = f(t) dt f(x), F (x) 3x () g(x) g (x) f(x), F (x) (3) h(x) = x 3x tf(t) dt.9 = {(x, y) ; x, y, x + y } f(x, y) = xy( x y). h (x) f(x), F (x
[ ] IC. f(x) = e x () f(x) f (x) () lim f(x) lim f(x) x + x (3) lim f(x) lim f(x) x + x (4) y = f(x) ( ) ( s46). < a < () a () lim a log xdx a log xdx ( ) n (3) lim log k log n n n k=.3 z = log(x + y ),
More informationPRML pdf PRML (http://critter.sakura.ne.jp) N x t y(x, w) = w 0 + w 1 x + w 2 x w M x m = M w j x j (1.1) j=0 E(w) = 1 {y(x n, w) t n } 2
critter twitter ( PRML) PRML PRML PRML PRML 1. 2. 3. PRML PRML 110 PRML 700 1 PRML pdf PRML (http://critter.sakura.ne.jp) 1 1.1 N x t y(x, w) = w 0 + w 1 x + w 2 x 2 + + w M x m = M w j x j (1.1) j=0 E(w)
More information03.Œk’ì
HRS KG NG-HRS NG-KG AIC Fama 1965 Mandelbrot Blattberg Gonedes t t Kariya, et. al. Nagahara ARCH EngleGARCH Bollerslev EGARCH Nelson GARCH Heynen, et. al. r n r n =σ n w n logσ n =α +βlogσ n 1 + v n w
More informationB ver B
B ver. 2017.02.24 B Contents 1 11 1.1....................... 11 1.1.1............. 11 1.1.2.......................... 12 1.2............................. 14 1.2.1................ 14 1.2.2.......................
More informationJuly 28, H H 0 H int = H H 0 H int = H int (x)d 3 x Schrödinger Picture Ψ(t) S =e iht Ψ H O S Heisenberg Picture Ψ H O H (t) =e iht O S e i
July 8, 4. H H H int H H H int H int (x)d 3 x Schrödinger Picture Ψ(t) S e iht Ψ H O S Heisenberg Picture Ψ H O H (t) e iht O S e iht Interaction Picture Ψ(t) D e iht Ψ(t) S O D (t) e iht O S e ih t (Dirac
More information3 filename=quantum-3dim110705a.tex ,2 [1],[2],[3] [3] U(x, y, z; t), p x ˆp x = h i x, p y ˆp y = h i y, p z ˆp z = h
filename=quantum-dim110705a.tex 1 1. 1, [1],[],[]. 1980 []..1 U(x, y, z; t), p x ˆp x = h i x, p y ˆp y = h i y, p z ˆp z = h i z (.1) Ĥ ( ) Ĥ = h m x + y + + U(x, y, z; t) (.) z (U(x, y, z; t)) (U(x,
More informationy = x x R = 0. 9, R = σ $ = y x w = x y x x w = x y α ε = + β + x x x y α ε = + β + γ x + x x x x' = / x y' = y/ x y' =
y x = α + β + ε =,, ε V( ε) = E( ε ) = σ α $ $ β w ( 0) σ = w σ σ y α x ε = + β + w w w w ε / w ( w y x α β ) = α$ $ W = yw βwxw $β = W ( W) ( W)( W) w x x w x x y y = = x W y W x y x y xw = y W = w w
More information1 filename=mathformula tex 1 ax 2 + bx + c = 0, x = b ± b 2 4ac, (1.1) 2a x 1 + x 2 = b a, x 1x 2 = c a, (1.2) ax 2 + 2b x + c = 0, x = b ± b 2
filename=mathformula58.tex ax + bx + c =, x = b ± b 4ac, (.) a x + x = b a, x x = c a, (.) ax + b x + c =, x = b ± b ac. a (.3). sin(a ± B) = sin A cos B ± cos A sin B, (.) cos(a ± B) = cos A cos B sin
More information) ] [ h m x + y + + V x) φ = Eφ 1) z E = i h t 13) x << 1) N n n= = N N + 1) 14) N n n= = N N + 1)N + 1) 6 15) N n 3 n= = 1 4 N N + 1) 16) N n 4
1. k λ ν ω T v p v g k = π λ ω = πν = π T v p = λν = ω k v g = dω dk 1) ) 3) 4). p = hk = h λ 5) E = hν = hω 6) h = h π 7) h =6.6618 1 34 J sec) hc=197.3 MeV fm = 197.3 kev pm= 197.3 ev nm = 1.97 1 3 ev
More informationKalman ( ) 1) (Kalman filter) ( ) t y 0,, y t x ˆx 3) 10) t x Y [y 0,, y ] ) x ( > ) ˆx (prediction) ) x ( ) ˆx (filtering) )
1 -- 5 6 2009 3 R.E. Kalman ( ) H 6-1 6-2 6-3 H Rudolf Emil Kalman IBM IEEE Medal of Honor(1974) (1985) c 2011 1/(23) 1 -- 5 -- 6 6--1 2009 3 Kalman ( ) 1) (Kalman filter) ( ) t y 0,, y t x ˆx 3) 10) t
More informationgr09.dvi
.1, θ, ϕ d = A, t dt + B, t dtd + C, t d + D, t dθ +in θdϕ.1.1 t { = f1,t t = f,t { D, t = B, t =.1. t A, tdt e φ,t dt, C, td e λ,t d.1.3,t, t d = e φ,t dt + e λ,t d + dθ +in θdϕ.1.4 { = f1,t t = f,t {
More information‚åŁÎ“·„´Šš‡ðŠp‡¢‡½‹âfi`fiI…A…‰…S…−…Y…•‡ÌMarkovŸA“½fiI›ð’Í
Markov 2009 10 2 Markov 2009 10 2 1 / 25 1 (GA) 2 GA 3 4 Markov 2009 10 2 2 / 25 (GA) (GA) L ( 1) I := {0, 1} L f : I (0, ) M( 2) S := I M GA (GA) f (i) i I Markov 2009 10 2 3 / 25 (GA) ρ(i, j), i, j I
More informationSO(3) 7 = = 1 ( r ) + 1 r r r r ( l ) (5.17) l = 1 ( sin θ ) + sin θ θ θ ϕ (5.18) χ(r)ψ(θ, ϕ) l ψ = αψ (5.19) l 1 = i(sin ϕ θ l = i( cos ϕ θ l 3 = i ϕ
SO(3) 71 5.7 5.7.1 1 ħ L k l k l k = iϵ kij x i j (5.117) l k SO(3) l z l ± = l 1 ± il = i(y z z y ) ± (z x x z ) = ( x iy) z ± z( x ± i y ) = X ± z ± z (5.118) l z = i(x y y x ) = 1 [(x + iy)( x i y )
More information液晶の物理1:連続体理論(弾性,粘性)
The Physics of Liquid Crystals P. G. de Gennes and J. Prost (Oxford University Press, 1993) Liquid crystals are beautiful and mysterious; I am fond of them for both reasons. My hope is that some readers
More information春期講座 ~ 極限 1 1, 1 2, 1 3, 1 4,, 1 n, n n {a n } n a n α {a n } α {a n } α lim n an = α n a n α α {a n } {a n } {a n } 1. a n = 2 n {a n } 2, 4, 8, 16,
春期講座 ~ 極限 1 1, 1 2, 1 3, 1 4,, 1 n, n n {a n } n a n α {a n } α {a n } α lim an = α n a n α α {a n } {a n } {a n } 1. a n = 2 n {a n } 2, 4, 8, 16, 32, n a n {a n } {a n } 2. a n = 10n + 1 {a n } lim an
More information4 5.............................................. 5............................................ 6.............................................. 7......................................... 8.3.................................................4.........................................4..............................................4................................................4.3...............................................
More informationarctan 1 arctan arctan arctan π = = ( ) π = 4 = π = π = π = =
arctan arctan arctan arctan 2 2000 π = 3 + 8 = 3.25 ( ) 2 8 650 π = 4 = 3.6049 9 550 π = 3 3 30 π = 3.622 264 π = 3.459 3 + 0 7 = 3.4085 < π < 3 + 7 = 3.4286 380 π = 3 + 77 250 = 3.46 5 3.45926 < π < 3.45927
More informationIBM-Mode1 Q: A: cash money It is fine today 2
8. IBM Model-1 @NICT mutiyama@nict.go.jp 1 IBM-Mode1 Q: A: cash money It is fine today 2 e f a P (f, a e) â : â = arg max a P (f, a e) â P (f, a e) 3 θ P (f e, θ) θ f d = { f, e } L(θ d) = log f,e d P
More information医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.
医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009192 このサンプルページの内容は, 第 2 版 1 刷発行時のものです. i 2 t 1. 2. 3 2 3. 6 4. 7 5. n 2 ν 6. 2 7. 2003 ii 2 2013 10 iii 1987
More information,. Black-Scholes u t t, x c u 0 t, x x u t t, x c u t, x x u t t, x + σ x u t, x + rx ut, x rux, t 0 x x,,.,. Step 3, 7,,, Step 6., Step 4,. Step 5,,.
9 α ν β Ξ ξ Γ γ o δ Π π ε ρ ζ Σ σ η τ Θ θ Υ υ ι Φ φ κ χ Λ λ Ψ ψ µ Ω ω Def, Prop, Th, Lem, Note, Remark, Ex,, Proof, R, N, Q, C [a, b {x R : a x b} : a, b {x R : a < x < b} : [a, b {x R : a x < b} : a,
More information2019 1 5 0 3 1 4 1.1.................... 4 1.1.1......................... 4 1.1.2........................ 5 1.1.3................... 5 1.1.4........................ 6 1.1.5......................... 6 1.2..........................
More informationax 2 + bx + c = n 8 (n ) a n x n + a n 1 x n a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 4
20 20.0 ( ) 8 y = ax 2 + bx + c 443 ax 2 + bx + c = 0 20.1 20.1.1 n 8 (n ) a n x n + a n 1 x n 1 + + a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 444 ( a, b, c, d
More informationD = [a, b] [c, d] D ij P ij (ξ ij, η ij ) f S(f,, {P ij }) S(f,, {P ij }) = = k m i=1 j=1 m n f(ξ ij, η ij )(x i x i 1 )(y j y j 1 ) = i=1 j
6 6.. [, b] [, d] ij P ij ξ ij, η ij f Sf,, {P ij } Sf,, {P ij } k m i j m fξ ij, η ij i i j j i j i m i j k i i j j m i i j j k i i j j kb d {P ij } lim Sf,, {P ij} kb d f, k [, b] [, d] f, d kb d 6..
More informationSFGÇÃÉXÉyÉNÉgÉãå`.pdf
SFG 1 SFG SFG I SFG (ω) χ SFG (ω). SFG χ χ SFG (ω) = χ NR e iϕ +. ω ω + iγ SFG φ = ±π/, χ φ = ±π 3 χ SFG χ SFG = χ NR + χ (ω ω ) + Γ + χ NR χ (ω ω ) (ω ω ) + Γ cosϕ χ NR χ Γ (ω ω ) + Γ sinϕ. 3 (θ) 180
More informationX G P G (X) G BG [X, BG] S 2 2 2 S 2 2 S 2 = { (x 1, x 2, x 3 ) R 3 x 2 1 + x 2 2 + x 2 3 = 1 } R 3 S 2 S 2 v x S 2 x x v(x) T x S 2 T x S 2 S 2 x T x S 2 = { ξ R 3 x ξ } R 3 T x S 2 S 2 x x T x S 2
More informations = 1.15 (s = 1.07), R = 0.786, R = 0.679, DW =.03 5 Y = 0.3 (0.095) (.708) X, R = 0.786, R = 0.679, s = 1.07, DW =.03, t û Y = 0.3 (3.163) + 0
7 DW 7.1 DW u 1, u,, u (DW ) u u 1 = u 1, u,, u + + + - - - - + + - - - + + u 1, u,, u + - + - + - + - + u 1, u,, u u 1, u,, u u +1 = u 1, u,, u Y = α + βx + u, u = ρu 1 + ɛ, H 0 : ρ = 0, H 1 : ρ 0 ɛ 1,
More informationKullback-Leibler
Kullback-Leibler Saov 206 6 6 http://www.math.tohoku.ac.jp/~kuroki/latex/206066kullbackleibler.pdf : http://www.math.tohoku.ac.jp/~kuroki/latex/206066kullbackleibler/ Ver.0. 0. 0 3 Kullback-Leibler 4...........................
More information1 I
1 I 3 1 1.1 R x, y R x + y R x y R x, y, z, a, b R (1.1) (x + y) + z = x + (y + z) (1.2) x + y = y + x (1.3) 0 R : 0 + x = x x R (1.4) x R, 1 ( x) R : x + ( x) = 0 (1.5) (x y) z = x (y z) (1.6) x y =
More information変 位 変位とは 物体中のある点が変形後に 別の点に異動したときの位置の変化で あり ベクトル量である 変位には 物体の変形の他に剛体運動 剛体変位 が含まれている 剛体変位 P(x, y, z) 平行移動と回転 P! (x + u, y + v, z + w) Q(x + d x, y + dy,
変 位 変位とは 物体中のある点が変形後に 別の点に異動したときの位置の変化で あり ベクトル量である 変位には 物体の変形の他に剛体運動 剛体変位 が含まれている 剛体変位 P(x, y, z) 平行移動と回転 P! (x + u, y + v, z + w) Q(x + d x, y + dy, z + dz) Q! (x + d x + u + du, y + dy + v + dv, z +
More information25 7 18 1 1 1.1 v.s............................. 1 1.1.1.................................. 1 1.1.2................................. 1 1.1.3.................................. 3 1.2................... 3
More informationuntitled
BELLE TOP 12 1 3 2 BELLE 4 2.1 BELLE........................... 4 2.1.1......................... 4 2.1.2 B B........................ 7 2.1.3 B CP............... 8 2.2 BELLE...................... 9 2.3
More informationDirichlet process mixture Dirichlet process mixture 2 /40 MIRU2008 :
Dirichlet Process : joint work with: Max Welling (UC Irvine), Yee Whye Teh (UCL, Gatsby) http://kenichi.kurihara.googlepages.com/miru_workshop.pdf 1 /40 MIRU2008 : Dirichlet process mixture Dirichlet process
More information12/1 ( ) GLM, R MCMC, WinBUGS 12/2 ( ) WinBUGS WinBUGS 12/2 ( ) : 12/3 ( ) :? ( :51 ) 2/ 71
2010-12-02 (2010 12 02 10 :51 ) 1/ 71 GCOE 2010-12-02 WinBUGS kubo@ees.hokudai.ac.jp http://goo.gl/bukrb 12/1 ( ) GLM, R MCMC, WinBUGS 12/2 ( ) WinBUGS WinBUGS 12/2 ( ) : 12/3 ( ) :? 2010-12-02 (2010 12
More informationO x y z O ( O ) O (O ) 3 x y z O O x v t = t = 0 ( 1 ) O t = 0 c t r = ct P (x, y, z) r 2 = x 2 + y 2 + z 2 (t, x, y, z) (ct) 2 x 2 y 2 z 2 = 0
9 O y O ( O ) O (O ) 3 y O O v t = t = 0 ( ) O t = 0 t r = t P (, y, ) r = + y + (t,, y, ) (t) y = 0 () ( )O O t (t ) y = 0 () (t) y = (t ) y = 0 (3) O O v O O v O O O y y O O v P(, y,, t) t (, y,, t )
More informationuntitled
18 1 2,000,000 2,000,000 2007 2 2 2008 3 31 (1) 6 JCOSSAR 2007pp.57-642007.6. LCC (1) (2) 2 10mm 1020 14 12 10 8 6 4 40,50,60 2 0 1998 27.5 1995 1960 40 1) 2) 3) LCC LCC LCC 1 1) Vol.42No.5pp.29-322004.5.
More informationβdxβ r a, < E e uγ r ha d E e r dx e r γd e r βdx 3.2 a = {a} γ = {γ} max E e r dx e r γd e r βdx, 2 s.. dx = qand + σndz, 1 E e r uγ ha d, 3 a arg maxã E e r uγ hã d. 4 3.3 γ = {γ : γ, γ} a = {a : a,
More information³ÎΨÏÀ
2017 12 12 Makoto Nakashima 2017 12 12 1 / 22 2.1. C, D π- C, D. A 1, A 2 C A 1 A 2 C A 3, A 4 D A 1 A 2 D Makoto Nakashima 2017 12 12 2 / 22 . (,, L p - ). Makoto Nakashima 2017 12 12 3 / 22 . (,, L p
More information量子力学 問題
3 : 203 : 0. H = 0 0 2 6 0 () = 6, 2 = 2, 3 = 3 3 H 6 2 3 ϵ,2,3 (2) ψ = (, 2, 3 ) ψ Hψ H (3) P i = i i P P 2 = P 2 P 3 = P 3 P = O, P 2 i = P i (4) P + P 2 + P 3 = E 3 (5) i ϵ ip i H 0 0 (6) R = 0 0 [H,
More information,,,17,,, ( ),, E Q [S T F t ] < S t, t [, T ],,,,,,,,
14 5 1 ,,,17,,,194 1 4 ( ),, E Q [S T F t ] < S t, t [, T ],,,,,,,, 1 4 1.1........................................ 4 5.1........................................ 5.........................................
More information第86回日本感染症学会総会学術集会後抄録(I)
κ κ κ κ κ κ μ μ β β β γ α α β β γ α β α α α γ α β β γ μ β β μ μ α ββ β β β β β β β β β β β β β β β β β β γ β μ μ μ μμ μ μ μ μ β β μ μ μ μ μ μ μ μ μ μ μ μ μ μ β
More information( ) Loewner SLE 13 February
( ) Loewner SLE 3 February 00 G. F. Lawler, Conformally Invariant Processes in the Plane, (American Mathematical Society, 005)., Summer School 009 (009 8 7-9 ) . d- (BES d ) d B t = (Bt, B t,, Bd t ) (d
More information現代物理化学 1-1(4)16.ppt
(pdf) pdf pdf http://www1.doshisha.ac.jp/~bukka/lecture/index.html http://www.doshisha.ac.jp/ Duet -1-1-1 2-a. 1-1-2 EU E = K E + P E + U ΔE K E = 0P E ΔE = ΔU U U = εn ΔU ΔU = Q + W, du = d 'Q + d 'W
More information1 1 sin cos P (primary) S (secondly) 2 P S A sin(ω2πt + α) A ω 1 ω α V T m T m 1 100Hz m 2 36km 500Hz. 36km 1
sin cos P (primary) S (secondly) 2 P S A sin(ω2πt + α) A ω ω α 3 3 2 2V 3 33+.6T m T 5 34m Hz. 34 3.4m 2 36km 5Hz. 36km m 34 m 5 34 + m 5 33 5 =.66m 34m 34 x =.66 55Hz, 35 5 =.7 485.7Hz 2 V 5Hz.5V.5V V
More informationMantel-Haenszelの方法
Mantel-Haenszel 2008 6 12 ) 2008 6 12 1 / 39 Mantel & Haenzel 1959) Mantel N, Haenszel W. Statistical aspects of the analysis of data from retrospective studies of disease. J. Nat. Cancer Inst. 1959; 224):
More information30
3 ............................................2 2...........................................2....................................2.2...................................2.3..............................
More informationst.dvi
9 3 5................................... 5............................. 5....................................... 5.................................. 7.........................................................................
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 information(4) P θ P 3 P O O = θ OP = a n P n OP n = a n {a n } a = θ, a n = a n (n ) {a n } θ a n = ( ) n θ P n O = a a + a 3 + ( ) n a n a a + a 3 + ( ) n a n
3 () 3,,C = a, C = a, C = b, C = θ(0 < θ < π) cos θ = a + (a) b (a) = 5a b 4a b = 5a 4a cos θ b = a 5 4 cos θ a ( b > 0) C C l = a + a + a 5 4 cos θ = a(3 + 5 4 cos θ) C a l = 3 + 5 4 cos θ < cos θ < 4
More informations s U s L e A = P A l l + dl dε = dl l l
P (ε) A o B s= P A s B o Y l o s Y l e = l l 0.% o 0. s e s B 1 s (e) s Y s s U s L e A = P A l l + dl dε = dl l l ε = dε = l dl o + l lo l = log l o + l =log(1+ e) l o Β F Α E YA C Ο D ε YF B YA A YA
More information( ) 2002 1 1 1 1.1....................................... 1 1.1.1................................. 1 1.1.2................................. 1 1.1.3................... 3 1.1.4......................................
More information(5) 75 (a) (b) ( 1 ) v ( 1 ) E E 1 v (a) ( 1 ) x E E (b) (a) (b)
(5) 74 Re, bondar laer (Prandtl) Re z ω z = x (5) 75 (a) (b) ( 1 ) v ( 1 ) E E 1 v (a) ( 1 ) x E E (b) (a) (b) (5) 76 l V x ) 1/ 1 ( 1 1 1 δ δ = x Re x p V x t V l l (1-1) 1/ 1 δ δ δ δ = x Re p V x t V
More informationii 3.,. 4. F. (), ,,. 8.,. 1. (75%) (25%) =7 20, =7 21 (. ). 1.,, (). 3.,. 1. ().,.,.,.,.,. () (12 )., (), 0. 2., 1., 0,.
24(2012) (1 C106) 4 11 (2 C206) 4 12 http://www.math.is.tohoku.ac.jp/~obata,.,,,.. 1. 2. 3. 4. 5. 6. 7.,,. 1., 2007 (). 2. P. G. Hoel, 1995. 3... 1... 2.,,. ii 3.,. 4. F. (),.. 5... 6.. 7.,,. 8.,. 1. (75%)
More information70 5. (isolated system) ( ) E N (closed system) N T (open system) (homogeneous) (heterogeneous) (phase) (phase boundary) (grain) (grain boundary) 5. 1
5 0 1 2 3 (Carnot) (Clausius) 2 5. 1 ( ) ( ) ( ) ( ) 5. 1. 1 (system) 1) 70 5. (isolated system) ( ) E N (closed system) N T (open system) (homogeneous) (heterogeneous) (phase) (phase boundary) (grain)
More informationTOP URL 1
TOP URL http://amonphys.web.fc2.com/ 1 30 3 30.1.............. 3 30.2........................... 4 30.3...................... 5 30.4........................ 6 30.5.................................. 8 30.6...............................
More information( ) ( 40 )+( 60 ) Schrödinger 3. (a) (b) (c) yoshioka/education-09.html pdf 1
2009 1 ( ) ( 40 )+( 60 ) 1 1. 2. Schrödinger 3. (a) (b) (c) http://goofy.phys.nara-wu.ac.jp/ yoshioka/education-09.html pdf 1 1. ( photon) ν λ = c ν (c = 3.0 108 /m : ) ɛ = hν (1) p = hν/c = h/λ (2) h
More information18 I ( ) (1) I-1,I-2,I-3 (2) (3) I-1 ( ) (100 ) θ ϕ θ ϕ m m l l θ ϕ θ ϕ 2 g (1) (2) 0 (3) θ ϕ (4) (3) θ(t) = A 1 cos(ω 1 t + α 1 ) + A 2 cos(ω 2 t + α
18 I ( ) (1) I-1,I-2,I-3 (2) (3) I-1 ( ) (100 ) θ ϕ θ ϕ m m l l θ ϕ θ ϕ 2 g (1) (2) 0 (3) θ ϕ (4) (3) θ(t) = A 1 cos(ω 1 t + α 1 ) + A 2 cos(ω 2 t + α 2 ), ϕ(t) = B 1 cos(ω 1 t + α 1 ) + B 2 cos(ω 2 t
More information* n x 11,, x 1n N(µ 1, σ 2 ) x 21,, x 2n N(µ 2, σ 2 ) H 0 µ 1 = µ 2 (= µ ) H 1 µ 1 µ 2 H 0, H 1 *2 σ 2 σ 2 0, σ 2 1 *1 *2 H 0 H
1 1 1.1 *1 1. 1.3.1 n x 11,, x 1n Nµ 1, σ x 1,, x n Nµ, σ H 0 µ 1 = µ = µ H 1 µ 1 µ H 0, H 1 * σ σ 0, σ 1 *1 * H 0 H 0, H 1 H 1 1 H 0 µ, σ 0 H 1 µ 1, µ, σ 1 L 0 µ, σ x L 1 µ 1, µ, σ x x H 0 L 0 µ, σ 0
More informationO1-1 O1-2 O1-3 O1-4 O1-5 O1-6
O1-1 O1-2 O1-3 O1-4 O1-5 O1-6 O1-7 O1-8 O1-9 O1-10 O1-11 O1-12 O1-13 O1-14 O1-15 O1-16 O1-17 O1-18 O1-19 O1-20 O1-21 O1-22 O1-23 O1-24 O1-25 O1-26 O1-27 O1-28 O1-29 O1-30 O1-31 O1-32 O1-33 O1-34 O1-35
More information.5 z = a + b + c n.6 = a sin t y = b cos t dy d a e e b e + e c e e e + e 3 s36 3 a + y = a, b > b 3 s363.7 y = + 3 y = + 3 s364.8 cos a 3 s365.9 y =,
[ ] IC. r, θ r, θ π, y y = 3 3 = r cos θ r sin θ D D = {, y ; y }, y D r, θ ep y yddy D D 9 s96. d y dt + 3dy + y = cos t dt t = y = e π + e π +. t = π y =.9 s6.3 d y d + dy d + y = y =, dy d = 3 a, b
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 informationnakata/nakata.html p.1/20
http://www.me.titech.ac.jp/ nakata/nakata.html p.1/20 1-(a). Faybusovich(1997) Linear systems in Jordan algebras and primal-dual interior-point algorithms,, Euclid Jordan p.2/20 Euclid Jordan V Euclid
More information入試の軌跡
4 y O x 7 8 6 Typed by L A TEX ε [ ] 6 4 http://kumamoto.s.xrea.com/plan/.. PDF Ctrl +L Ctrl + Ctrl + Ctrl + Alt + Alt + ESC. http://kumamoto.s.xrea.com/nyusi/qdai kiseki ri.pdf 6 i i..................................
More information1 1 x y = y(x) y, y,..., y (n) : n y F (x, y, y,..., y (n) ) = 0 n F (x, y, y ) = 0 1 y(x) y y = G(x, y) y, y y + p(x)y = q(x) 1 p(x) q(
1 1 y = y() y, y,..., y (n) : n y F (, y, y,..., y (n) ) = 0 n F (, y, y ) = 0 1 y() 1.1 1 y y = G(, y) 1.1.1 1 y, y y + p()y = q() 1 p() q() (q() = 0) y + p()y = 0 y y + py = 0 y y = p (log y) = p log
More information08-Note2-web
r(t) t r(t) O v(t) = dr(t) dt a(t) = dv(t) dt = d2 r(t) dt 2 r(t), v(t), a(t) t dr(t) dt r(t) =(x(t),y(t),z(t)) = d 2 r(t) dt 2 = ( dx(t) dt ( d 2 x(t) dt 2, dy(t), dz(t) dt dt ), d2 y(t) dt 2, d2 z(t)
More information