(note-02) Rademacher 1/57
|
|
- ありみち かいじ
- 4 years ago
- Views:
Transcription
1 (note-02) Rademacher 1/57
2 (x 1, y 1 ),..., (x n, y n ) X Y f : X Y Y = R f Y = {+1, 1}, {1, 2,..., G} f x y 1. (x 1, y 1 ),..., (x n, y n ) f(x i ) ( ) 2. x f(x) Y 2/57
3 (x, y) f(x) f(x) y (, loss) l(f(x), y) l(f(x), y) = (f(x) y) 2 L 1 f(x) y 0-1 l(f(x), y) = 1[f(x) y] f(x) = y loss = 0 f(x) y loss = 1 1, A, 1[ ] 1[A] = 0, A. 3/57
4 f : X Y (x 1, y 1 ),..., (x n, y n ) X Y L(f) = 1 n n l(f(x i ), y i ) X Y D L(f) = E[l(f(x), y)], (x, y) D 4/57
5 2 & 0-1 x R, y {1, 1}, P (x, y) = p(x y)p (y) L(f) 0.4 h(x) = 1 h(x) =1 = P (f(x) = 1, Y = +1) P (f(x) = +1, Y = 1) p(x y = 1) p(x y = 1) = P (f(x) = 1 Y = 1) P (Y = 1) + P (f(x) = 1 Y = 1) P (Y = 1) = [ ] P (Y = 1) + [ ] P (Y = 1) 5/57
6 L(f) f D L(f) L(f) f i.i.d. f L(f) p L(f), n, = [ L(f) f ] [ L(f) f ] ( ) L(f) L(f) 6/57
7 Bayes rule f 0 L(f 0 ) = inf f L(f) inf f : f : X Y f 0 : Bayes error: L(f 0 ) ( ) Bayes rule 7/57
8 Theorem 1. Bayes rule : Bayes rule (x, y) p(x, y) = p(y x)p(x) f 0 (x) = arg min Bayes error : L(f 0 ) = f 0 f Y p(x) l(f, y)p(y x)dy ( min f Y ) l(f, y)p(y x)dy dx (Steinwart, Christmann, Support Vector Machines, Chap.3 ) 8/57
9 L(f) = = L(f(x), y)p(y x)p(x)dydx ( ) p(x) min L(f, y)p(y x)dy dx f Y p(x) L(f 0 (x), y)p(y x)dydx = L(f 0 ). 9/57
10 Y = R l(f, y) = (f y) 2 f 0 (x) = yp(y x)dx. (y f) 2 p(y x)dy = (y f 0 (x)) 2 p(y x)dy + (f 0 (x) f(x)) 2 10/57
11 l(f, y) = f y f 0 (x) p(y x) y note: y f p(y x)dy f = 0 global min. y f p(y x)dy = f (y f)p(y x)dy + f (f y)p(y x)dy = f yp(y x)dy fp (Y f x) + fp (Y f x) f yp(y x)dy. 11/57
12 f L(f x) = fp(f x) P (Y f x) fp(f x) + P (y f x) fp(f x) + fp(f x) = P (Y f x) + P (y f x) L(f x) = 0 P (Y f x) = P (y f x) f p(y x) 12/57
13 2 Y = {+1, 1} p(x, y) = p(y x)p(x) f 0 (x) = +1, p(+1 x) p( 1 x), 1, p( 1 x) > p(+1 x). L(f 0 ) = min{p(x, y)}dx. y 13/57
14 y=±1 1[f y]p(y x) = 1 p(f x) f = { p(+1 x) p( 1 x) f0 (x) = +1, p(+1 x) < p( 1 x) f 0 (x) = 1 L(f 0 ) = (1 max y=±1 p(y x))p(x)dx = min p(y x)p(x)dx y=± /57
15 p(+1 x) x p(y = 1 x) p(y =1 x) p(y x) x h 0 (x) 15/57
16 Y = {1, 2,..., K} p(x, y) = p(y x)p(x) Remark. L(f 0 ) = f 0 (x) = arg max p(y x) y (1 max y p(y x))p(x)dx p(y x)p(x) [Steinwart, A3.16] cf. Polish space. 16/57
17 ( ) H (Empirical risk minimization, ERM): min f H L(f) f ERM (Regularized ERM) f 0 H 17/57
18 Example 1. H = {f 1, f 2 }, L(f1 ) = 2 8, L(f2 ) = 3 8 = f = f 1 h 1 h 2 18/57
19 (Y = R) ϕ : X R d H Lin = {f(x) = w T ϕ(x i ) + b w R d, b R} (2 ) H = {f(x) = sign(g(x)) g H Lin }, sign ( ) Y = {1, 2,..., K}. H = {f(x) = arg max{g 1 (x),..., g K (x)} g 1,..., g K H Lin } 19/57
20 (x 1, y 1 ),..., (x n, y n ) i.i.d. D f 0 (x) ERM, H f L( f) L(f 0 )?? 20/57
21 H Bayes rule f 0 f 0 H f := arg min L(f) f H f = arg min L(f) f H f 0 f. 2 (i) L(f 0 ) L( f) L( f), (ii) L( f) L( f) 21/57
22 L( f) L(f 0 ) L( f) L(f 0 ) = [ L( f) L( f) ] + [ L( f) L(f 0 ) ] ( 0) ( 0) H f 0 22/57
23 : P ( L( f) L( f) < ε ) 1 δ ε δ ε > 0, δ (0, 1) P ( ) i.i.d. (x 1, y 1 ),..., (x n, y n ) δ ε 23/57
24 Lemma 1. P ( L( f) L( f) ε ) P ( L( f) L( f) ε/2 ) + P ( L( f) L( f) ε/2 ) Proof. L( f) L( f) = (L( f) L( f)) + ( L( f) L( f)) + ( L( f) L( f)) (L( f) L( f)) + ( L( f) L( f)) L( f) L( f) ε (i) L( f) L( f) ε/2, (ii) L( f) L( f) ε/2. 24/57
25 Theorem 2 ( ). sup f,y l(f, y) inf f,y l(f, y) M H < 1 δ L( f) < L(f 0 ) + [ L( f) L(f 0 ) ] 2 H M log n δ (1) Proof. Hoeffding Z i = l(f(x i ), y i ) E[ L( f)] = L( f) P ( L( f) L( f)) ε/2 ) e nε 2 /2M 2. 25/57
26 f P ( L( f) L( f) ε/2 ) P ( { ) L(f) L(f) ε/2} f H f H P ( L(f) L(f) ε/2 ) H e nε2 /2M 2. note: l(ĥ(x i), y i ), i = 1,..., n = H 26/57
27 P P ( ) L( f) L( f) ε ( ) L( f) L( f) ε/2 ( H + 1)e nε2 /2M 2 + P ( ) L( f) L( f) ε/2 δ = ( H + 1)e nε2 /2M 2 (1) Remark. Chebyshev s ineq P (4 H +1)M 2 4 M n H +1 δ. nε 2, 27/57
28 2, 0-1 loss (M = 1). X = (0, 1] p(y x)p(x), p(x) = 1, x (0, 1] 0, x a, p(+1 x) =, f 0 (x) = 1, x < a 1, x a, +1, x < a. L(f 0 ) = 0. F K f b,l b, l/k x 1, f b,l (x) = b, 0 < x < l/k, b = ±1, l = 1,..., K. 28/57
29 F K = 2K, f F K, L( f) 1/(2K) a (l/k, (l + 1)/K] f = f 0 f F K F K < 1 δ L( f) < 1 2K + 2 n log 2K + 1 δ 29/57
30 K = n, δ = 1/n 1 1/n L( f) < 1 2 n + 2 log n n log 3n3/2 4, (n 3). n 30/57
31 b H := min f H L(f) L(f 0) v H (n, δ) := M 2 n H + 1 log δ (1) n 1 δ L( f) < L(f 0 ) + b H + v H (n, δ). 31/57
32 H 1, H 2,..., H K H 1 H 2 H K b H1 b H2 b HK n δ v H1 (n, δ) v H2 (n, δ) v HK (n, δ) 32/57
33 L( f) L(f 0 ) + b H + v H (n, δ) min k=1,...,k b H k + v Hk (n, δ) H k prediction error bias+varialce bias variance 1e+01 1e+03 1e+05 H 33/57
34 Rademacher H = 34/57
35 Definition 1 (( ) Rademacher ). H {f f : Z R} S = {z 1,..., z n } Z Rademacher : RS (H) = E σ [sup f H σ 1,..., σ n i.i.d. Ber(1/2), i.e., P (σ i = +1) = P (σ i = 1) = 1/2 1 n ] n σ i f(z i ), E σ [ ] σ 1,..., σ n Rademacher R n (H) = E S [ R S (H)], (z 1,..., z n i.i.d. P ). R n (H) 35/57
36 Rademacher σ 1,..., σ n {+1, 1} G 36/57
37 R n (H) Rademacher 1. H 1 H 2 = R S (H 1 ) R S (H 2 ) 2. c R R S (c H) = c R S (H) c H = {cg : g H} 3. ϕ : R R L R S (ϕ H) L R S (H). ϕ H = {z ϕ(g(z)) : g H} 37/57
38 Proof c = 0 c 0 R S (ch) = E σ [ sup g H = c E σ [ 1 n sup g H n 1 n ] [ σ i cg(z i ) = c E σ n ] σ i g(z i ) sup g H 1 n n ] σ i sign(c)g(z i ) σ i σ i sign(c) 1/2 ±1 3 Foundations of Machine Learning, Lemma /57
39 Rademacher Theorem 3 ( ). H {f : Z [a, b]} Z Z, Z 1,..., Z n i.i.d. P. 1 δ sup f H E[f(Z)] 1 n n f(z i ) log(2/δ) 2R n(h) + (b a). 2n Hoeffding s McDiarmid 39/57
40 { Proof. A(z 1,..., z n ) = sup E[g(Z)] 1 g H n n } g(z i ) A(z 1,..., z n ) A(z 1,..., z n 1, z ) { = sup inf E[g(Z)] 1 n g(z i ) E[f(Z)] + 1 g H f H n n sup g H = sup g H { E[g(Z)] 1 n g(z ) g(z n ) n n g(z i ) E[g(Z)] + 1 n b a n. n 1 n 1 f(z i ) + 1 } n f(z ) g(z i ) + 1 } n g(z ) A(z 1,..., z n 1, z ) A(z 1,..., z n 1, z n ) (b a)/n 40/57
41 A(z 1,..., z n 1, z ) A(z 1,..., z n 1, z n ) b a n McDiarmid s inequality { P A(Z 1,..., Z n ) E[A] (b a) } log(1/δ) 2n 1 δ. (2) E[A] Z Z 1,..., Z n, Z 1,..., Z n 41/57
42 A(Z 1,..., Z n ) = sup g H { E Z 1,...,Z n Z i Z i E Z 1,...,Z n [ sup g H [ 1 n 1 n ] } n g(z i) 1 n g(z i ) n ] n (g(z i) g(z i )). = g(z i ) g(z i) g(z i ) g(z i ) σ 1,..., σ n i.i.d. Ber(1/2) σ i (g(z i ) g(z i)) g(z i ) g(z i) 42/57
43 E Z1,...,Z n [A(Z 1,..., Z n )] [ ] 1 n E Z,Z,σ σ i (g(z n i) g(z i )) E [ sup g H = 2R n (H) 1 n sup g H ] [ n σ i g(z i) + E sup g H 1 n ] n ( σ i )g(z i ) (2) O.K. 43/57
44 Example 2 ( ). H < f H f B (f(z 1 ),..., f(z n )) 2 B n Massart s ineq. R S (H) = E σ [max f H 1 n ] n σ i f(z i ) B n 2 log H n = B 2 log H n R n (H) 44/57
45 Example 3 ( (decision stump)). 1 (R d 2 ) x = (x 1,..., x d ) f(x; s, k, z) = s sign(x k z) {+1, 1}, : s = ±1, k {1,..., d}, z R. : H = { f(x; s, k, z) s = ±1, k = 1,..., d, z R }. 45/57
46 H A = {(f(x 1 ),..., f(x n )) f H} A n A 2nd Massart s ineq. R S (H) = 1 n E σ [ sup s,k,z n ] σ i f(x i ; s, k, z) 2 log(2nd) n 46/57
47 (R d 2 ) l H l ( H 2 ) A l := {(f(x 1 ),..., f(x n )) {±1} n f H l }, l 1 A l (2n k d) A l 1 = 2nd A l 1 (n k : k ) k=1 = A l (2nd) l 1. R n (H l ) 2(l 1) log(2nd) n 47/57
48 0-1 Rademacher G = {1[f(x) y] f H}, f : X {+1, 1}. For S = {(x 1, y 1 ),..., (x n, y n )}, R S (G) = E σ [sup = 1 2 E σ f H [ 1 n sup f H n 1 n ] 1 y i f(x i ) σ i 2 ] n ( y i σ i )f(x i ) = 1 2 R S (H) 48/57
49 H ERM f 0 H 2, L(f 0 ) = 0 L( f) = 0 1 δ L( f) 2 log(2nd) n + log(2/δ) 2n 49/57
50 2 Rademacher y = f 0 (x) + ε, H {f : X [ B, B]}. l(f(x), y) = 1 (y f(x))2 2 (x, y) X [ M, M] (B + M)2 0 l(f(x), y). 2 l(f, y) f = f y B + M, = l(f 1 (x), y) l(f 2 (x), y) (B + M) f 1 (x) f 2 (x). 50/57
51 G = {(x, y) l(f(x), y) : f H} R n (G) (B + M)R n (H) 1 δ L( f) L( f) 2(B + M)R n (H) + (B + M)2 log(2/δ) 2 2n 51/57
52 RKHS Rademacher k RKHS H H B = {f H f B} sup k(x, x) a 2 x X f H B f ab, R m (H B ) ab m 52/57
53 Proof. f = sup x f, k(x, ) f sup x k(x, x) ab. R S (H B ) = E σ [ sup f B 1 m m ] σ i f(x i ) = B [ m E m σ σ i k(x i, ) ] B m = 1 m E σ = B ( [ ] ) 1/2 k(x i, x j )E σ σi σ j m = B m i,j ( m ) 1/2 k(x i, x i ) ab. m [ sup f B ( E σ [ m m f, σ i k(x i, ) ] σ i k(x i, ) 2 ] ) 1/2 53/57
54 (x 1, y 1 ),..., (x m, y m ) X [ M, M] RKHS H 2 l(f(x), y) = 1 2 (f(x) y)2 min f H 1 2m m (y i f(x i )) 2 + λ 2 f 2 f 54/57
55 λ 2 f 2 1 2m m = f M/ λ (y i f(x i )) 2 + λ 2 f 2 1 2m m y 2 i M 2 2 H M/ λ 2 B am/ λ, R m (H M/ λ ) am mλ 55/57
56 L( f) L( f) sup f H M/ λ L(f) L(f) ( 2 am/ ) am λ + M mλ + ( ) 1 O λ m (λ = o(1) ) ( am/ λ + M 2 ) 2 log(1/δ) 2m 56/57
57 f 0 H, λ = λ m λ m 0, λ m m = L( f) L(f0 ) (in prob.) Proof. λ m 0 m f 0 H M/ λm 0 L( f) L(f 0 ) L( f) L( f) + L( f) + λ m 2 f 2 L(f 0 ) λ m 2 f L(f 0 ) L(f 0 ) + λ m 2 f sup f H M/ λ m L( f) L( f) + λ m 2 f 0 2 = O ( ) 1 + λ m λ m m λ m = O(m 1/4 ) 57/57
³ÎΨÏÀ
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 informationAkito Tsuboi June 22, T ϕ T M M ϕ M M ϕ T ϕ 2 Definition 1 X, Y, Z,... 1
Akito Tsuboi June 22, 2006 1 T ϕ T M M ϕ M M ϕ T ϕ 2 Definition 1 X, Y, Z,... 1 1. X, Y, Z,... 2. A, B (A), (A) (B), (A) (B), (A) (B) Exercise 2 1. (X) (Y ) 2. ((X) (Y )) (Z) 3. (((X) (Y )) (Z)) Exercise
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 informationIII 1 (X, d) d U d X (X, d). 1. (X, d).. (i) d(x, y) d(z, y) d(x, z) (ii) d(x, y) d(z, w) d(x, z) + d(y, w) 2. (X, d). F X.. (1), X F, (2) F 1, F 2 F
III 1 (X, d) d U d X (X, d). 1. (X, d).. (i) d(x, y) d(z, y) d(x, z) (ii) d(x, y) d(z, w) d(x, z) + d(y, w) 2. (X, d). F X.. (1), X F, (2) F 1, F 2 F F 1 F 2 F, (3) F λ F λ F λ F. 3., A λ λ A λ. B λ λ
More information(2 X Poisso P (λ ϕ X (t = E[e itx ] = k= itk λk e k! e λ = (e it λ k e λ = e eitλ e λ = e λ(eit 1. k! k= 6.7 X N(, 1 ϕ X (t = e 1 2 t2 : Cauchy ϕ X (t
6 6.1 6.1 (1 Z ( X = e Z, Y = Im Z ( Z = X + iy, i = 1 (2 Z E[ e Z ] < E[ Im Z ] < Z E[Z] = E[e Z] + ie[im Z] 6.2 Z E[Z] E[ Z ] : E[ Z ] < e Z Z, Im Z Z E[Z] α = E[Z], Z = Z Z 1 {Z } E[Z] = α = α [ α ]
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 information() Remrk I = [0, ] [x i, x i ]. (x : ) f(x) = 0 (x : ) ξ i, (f) = f(ξ i )(x i x i ) = (x i x i ) = ξ i, (f) = f(ξ i )(x i x i ) = 0 (f) 0.
() 6 f(x) [, b] 6. Riemnn [, b] f(x) S f(x) [, b] (Riemnn) = x 0 < x < x < < x n = b. I = [, b] = {x,, x n } mx(x i x i ) =. i [x i, x i ] ξ i n (f) = f(ξ i )(x i x i ) i=. (ξ i ) (f) 0( ), ξ i, S, ε >
More informationRiemann-Stieltjes Poland S. Lojasiewicz [1] An introduction to the theory of real functions, John Wiley & Sons, Ltd., Chichester, 1988.,,,,. Riemann-S
Riemnn-Stieltjes Polnd S. Lojsiewicz [1] An introduction to the theory of rel functions, John Wiley & Sons, Ltd., Chichester, 1988.,,,, Riemnn-Stieltjes 1 2 2 5 3 6 4 Jordn 13 5 Riemnn-Stieltjes 15 6 Riemnn-Stieltjes
More informationLebesgue Fubini L p Banach, Hilbert Höld
II (Analysis II) Lebesgue (Applications of Lebesgue Integral Theory) 1 (Seiji HIABA) 1 ( ),,, ( ) 1 1 1.1 1 Lebesgue........................ 1 1.2 2 Fubini...................... 2 2 L p 5 2.1 Banach, Hilbert..............................
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 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 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 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 informationIII III 2010 PART I 1 Definition 1.1 (, σ-),,,, Borel( ),, (σ-) (M, F, µ), (R, B(R)), (C, B(C)) Borel Definition 1.2 (µ-a.e.), (in µ), (in L 1 (µ)). T
III III 2010 PART I 1 Definition 1.1 (, σ-),,,, Borel( ),, (σ-) (M, F, µ), (R, B(R)), (C, B(C)) Borel Definition 1.2 (µ-a.e.), (in µ), (in L 1 (µ)). Theorem 1.3 (Lebesgue ) lim n f n = f µ-a.e. g L 1 (µ)
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 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π, R { 2, 0, 3} , ( R),. R, [ 1, 1] = {x R 1 x 1} 1 0 1, [ 1, 1],, 1 0 1,, ( 1, 1) = {x R 1 < x < 1} [ 1, 1] 1 1, ( 1, 1), 1, 1, R A 1
sup inf (ε-δ 4) 2018 1 9 ε-δ,,,, sup inf,,,,,, 1 1 2 3 3 4 4 6 5 7 6 10 6.1............................................. 11 6.2............................... 13 1 R R 5 4 3 2 1 0 1 2 3 4 5 π( R) 2 1 0
More information2012 IA 8 I p.3, 2 p.19, 3 p.19, 4 p.22, 5 p.27, 6 p.27, 7 p
2012 IA 8 I 1 10 10 29 1. [0, 1] n x = 1 (n = 1, 2, 3,...) 2 f(x) = n 0 [0, 1] 2. 1 x = 1 (n = 1, 2, 3,...) 2 f(x) = n 0 [0, 1] 1 0 f(x)dx 3. < b < c [, c] b [, c] 4. [, b] f(x) 1 f(x) 1 f(x) [, b] 5.
More information..3. Ω, Ω F, P Ω, F, P ). ) F a) A, A,..., A i,... F A i F. b) A F A c F c) Ω F. ) A F A P A),. a) 0 P A) b) P Ω) c) [ ] A, A,..., A i,... F i j A i A
.. Laplace ). A... i),. ω i i ). {ω,..., ω } Ω,. ii) Ω. Ω. A ) r, A P A) P A) r... ).. Ω {,, 3, 4, 5, 6}. i i 6). A {, 4, 6} P A) P A) 3 6. ).. i, j i, j) ) Ω {i, j) i 6, j 6}., 36. A. A {i, j) i j }.
More informationA
A 2563 15 4 21 1 3 1.1................................................ 3 1.2............................................. 3 2 3 2.1......................................... 3 2.2............................................
More informationI, II 1, A = A 4 : 6 = max{ A, } A A 10 10%
1 2006.4.17. A 3-312 tel: 092-726-4774, e-mail: hara@math.kyushu-u.ac.jp, http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office hours: B A I ɛ-δ ɛ-δ 1. 2. A 1. 1. 2. 3. 4. 5. 2. ɛ-δ 1. ɛ-n
More information2016 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 1 16 2 1 () X O 3 (O1) X O, O (O2) O O (O3) O O O X (X, O) O X X (O1), (O2), (O3) (O2) (O3) n (O2) U 1,..., U n O U k O k=1 (O3) U λ O( λ Λ) λ Λ U λ O 0 X 0 (O2) n =
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 informationIII ϵ-n ϵ-n lim n a n = α n a n α 1 lim a n = 0 1 n a k n n k= ϵ-n 1.1
III http://www2.mth.kyushu-u.c.jp/~hr/lectures/lectures-j.html 1 1 1.1 ϵ-n ϵ-n lim n = α n n α 1 lim n = 0 1 n k n k=1 0 1.1.7 ϵ-n 1.1.1 n α n n α lim n = α ϵ Nϵ n > Nϵ n α < ϵ 1.1.1 ϵ n > Nϵ n α < ϵ 1.1.2
More informationB2 ( 19 ) Lebesgue ( ) ( ) 0 This note is c 2007 by Setsuo Taniguchi. It may be used for personal or classroom purposes, but not for commercia
B2 ( 19) Lebesgue ( ) ( 19 7 12 ) 0 This note is c 2007 by Setsuo Taniguchi. It may be used for personal or classroom purposes, but not for commercial purposes. i Riemann f n : [0, 1] R 1, x = k (1 m
More informationB [ 0.1 ] x > 0 x 6= 1 f(x) µ 1 1 xn 1 + sin sin x 1 x 1 f(x) := lim. n x n (1) lim inf f(x) (2) lim sup f(x) x 1 0 x 1 0 (
. 28 4 14 [.1 ] x > x 6= 1 f(x) µ 1 1 xn 1 + sin + 2 + sin x 1 x 1 f(x) := lim. 1 + x n (1) lim inf f(x) (2) lim sup f(x) x 1 x 1 (3) lim inf x 1+ f(x) (4) lim sup f(x) x 1+ [.2 ] [, 1] Ω æ x (1) (2) nx(1
More informationBasic Math. 1 0 [ N Z Q Q c R C] 1, 2, 3,... natural numbers, N Def.(Definition) N (1) 1 N, (2) n N = n +1 N, (3) N (1), (2), n N n N (element). n/ N.
Basic Mathematics 16 4 16 3-4 (10:40-12:10) 0 1 1 2 2 2 3 (mapping) 5 4 ε-δ (ε-δ Logic) 6 5 (Potency) 9 6 (Equivalence Relation and Order) 13 7 Zorn (Axiom of Choice, Zorn s Lemma) 14 8 (Set and Topology)
More information微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. ttp://www.morikita.co.jp/books/mid/00571 このサンプルページの内容は, 初版 1 刷発行時のものです. i ii 014 10 iii [note] 1 3 iv 4 5 3 6 4 x 0 sin x x 1 5 6 z = f(x, y) 1 y = f(x)
More information( )/2 hara/lectures/lectures-j.html 2, {H} {T } S = {H, T } {(H, H), (H, T )} {(H, T ), (T, T )} {(H, H), (T, T )} {1
( )/2 http://www2.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html 1 2011 ( )/2 2 2011 4 1 2 1.1 1 2 1 2 3 4 5 1.1.1 sample space S S = {H, T } H T T H S = {(H, H), (H, T ), (T, H), (T, T )} (T, H) S
More informationx (x, ) x y (, y) iy x y z = x + iy (x, y) (r, θ) r = x + y, θ = tan ( y ), π < θ π x r = z, θ = arg z z = x + iy = r cos θ + ir sin θ = r(cos θ + i s
... x, y z = x + iy x z y z x = Rez, y = Imz z = x + iy x iy z z () z + z = (z + z )() z z = (z z )(3) z z = ( z z )(4)z z = z z = x + y z = x + iy ()Rez = (z + z), Imz = (z z) i () z z z + z z + z.. z
More information2000年度『数学展望 I』講義録
2000 I I IV I II 2000 I I IV I-IV. i ii 3.10 (http://www.math.nagoya-u.ac.jp/ kanai/) 2000 A....1 B....4 C....10 D....13 E....17 Brouwer A....21 B....26 C....33 D....39 E. Sperner...45 F....48 A....53
More informationy π π O π x 9 s94.5 y dy dx. y = x + 3 y = x logx + 9 s9.6 z z x, z y. z = xy + y 3 z = sinx y 9 s x dx π x cos xdx 9 s93.8 a, fx = e x ax,. a =
[ ] 9 IC. dx = 3x 4y dt dy dt = x y u xt = expλt u yt λ u u t = u u u + u = xt yt 6 3. u = x, y, z = x + y + z u u 9 s9 grad u ux, y, z = c c : grad u = u x i + u y j + u k i, j, k z x, y, z grad u v =
More informationZ[i] Z[i] π 4,1 (x) π 4,3 (x) 1 x (x ) 2 log x π m,a (x) 1 x ϕ(m) log x 1.1 ( ). π(x) x (a, m) = 1 π m,a (x) x modm a 1 π m,a (x) 1 ϕ(m) π(x)
3 3 22 Z[i] Z[i] π 4, (x) π 4,3 (x) x (x ) 2 log x π m,a (x) x ϕ(m) log x. ( ). π(x) x (a, m) = π m,a (x) x modm a π m,a (x) ϕ(m) π(x) ϕ(m) x log x ϕ(m) m f(x) g(x) (x α) lim f(x)/g(x) = x α mod m (a,
More informationinkiso.dvi
Ken Urai May 19, 2004 5 27 date-event uncertainty risk 51 ordering preordering X X X (preordering) reflexivity x X x x transitivity x, y, z X x y y z x z asymmetric x y y x x = y X (ordering) completeness
More informationI (Analysis I) Lebesgue (Lebesgue Integral Theory) 1 (Seiji HIRABA) 1 ( ),,, ( )
I (Analysis I) Lebesgue (Lebesgue Integral Theory) 1 (Seiji HIRABA) 1 ( ),,, ( ) 1 (Introduction) 1 1.1... 1 1.2 Riemann Lebesgue... 2 2 (Measurable sets and Measures) 4 2.1 σ-... 4 2.2 Borel... 5 2.3...
More informationDynkin Serre Weyl
Dynkin Naoya Enomoto 2003.3. paper Dynkin Introduction Dynkin Lie Lie paper 1 0 Introduction 3 I ( ) Lie Dynkin 4 1 ( ) Lie 4 1.1 Lie ( )................................ 4 1.2 Killing form...........................................
More information…X…p†[…X’³‚¥›»‡¨‡æ‡Ñ…}…‰…`…J†[…l…‰−w‘K‡Ì‡½‡ß‡Ì“ÅfiK›»…A…‰…S…−…Y…•‡ÆCV†EPR‡Ö‡Ì›žŠp
CV PR 1, 1, 2 1 2 2009-08-31 @ PRMU/CVIM http://www.ibis.t.u-tokyo.ac.jp/ryotat/prmu09/ UT / Tokyo Tech DAL PRMU/CVIM 1 / 58 Outline 1-2 Dual Augmented Lagrangian Proximal minimization Legendre 3 4 UT
More information= π2 6, ( ) = π 4, ( ). 1 ( ( 5) ) ( 9 1 ( ( ) ) (
+ + 3 + 4 +... π 6, ( ) 3 + 5 7 +... π 4, ( ). ( 3 + ( 5) + 7 + ) ( 9 ( ( + 3) 5 + ) ( 7 + 9 + + 3 ) +... log( + ), ) +... π. ) ( 3 + 5 e x dx π.......................................................................
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 information(1) (2) (3) (4) 1
8 3 4 3.................................... 3........................ 6.3 B [, ].......................... 8.4........................... 9........................................... 9.................................
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 information(ii) (iii) z a = z a =2 z a =6 sin z z a dz. cosh z z a dz. e z dz. (, a b > 6.) (z a)(z b) 52.. (a) dz, ( a = /6.), (b) z =6 az (c) z a =2 53. f n (z
B 4 24 7 9 ( ) :,..,,.,. 4 4. f(z): D C: D a C, 2πi C f(z) dz = f(a). z a a C, ( ). (ii), a D, a U a,r D f. f(z) = A n (z a) n, z U a,r, n= A n := 2πi C f(ζ) dζ, n =,,..., (ζ a) n+, C a D. (iii) U a,r
More information20 9 19 1 3 11 1 3 111 3 112 1 4 12 6 121 6 122 7 13 7 131 8 132 10 133 10 134 12 14 13 141 13 142 13 143 15 144 16 145 17 15 19 151 1 19 152 20 2 21 21 21 211 21 212 1 23 213 1 23 214 25 215 31 22 33
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 informationv er.1/ c /(21)
12 -- 1 1 2009 1 17 1-1 1-2 1-3 1-4 2 2 2 1-5 1 1-6 1 1-7 1-1 1-2 1-3 1-4 1-5 1-6 1-7 c 2011 1/(21) 12 -- 1 -- 1 1--1 1--1--1 1 2009 1 n n α { n } α α { n } lim n = α, n α n n ε n > N n α < ε N {1, 1,
More informationI = [a, b] R γ : I C γ(a) = γ(b) z C \ γ(i) 1(4) γ z winding number index Ind γ (z) = φ(b, z) φ(a, z) φ 1(1) (i)(ii) 1 1 c C \ {0} B(c; c ) L c z B(c;
21 1 http://www.ozawa.phys.waseda.ac.jp/index2.html ( ) 1. I = [a, b] R γ : I C γ γ(i) z 0 C \ γ(i) (1) ε > 0 φ : I B(z 0 ; ε) C (i) B(z 0 ; ε) γ(i) = (ii) (t, z) I B(z 0 ; ε) exp(φ(t, z)) = γ(t) z (2)
More informationn=1 1 n 2 = π = π f(z) f(z) 2 f(z) = u(z) + iv(z) *1 f (z) u(x, y), v(x, y) f(z) f (z) = f/ x u x = v y, u y = v x
n= n 2 = π2 6 3 2 28 + 4 + 9 + = π2 6 2 f(z) f(z) 2 f(z) = u(z) + iv(z) * f (z) u(x, y), v(x, y) f(z) f (z) = f/ x u x = v y, u y = v x f x = i f y * u, v 3 3. 3 f(t) = u(t) + v(t) [, b] f(t)dt = u(t)dt
More information2 1 Introduction
1 24 11 26 1 E-mail: toyoizumi@waseda.jp 2 1 Introduction 5 1.1...................... 7 2 8 2.1................ 8 2.2....................... 8 2.3............................ 9 3 10 3.1.........................
More informationall.dvi
38 5 Cauchy.,,,,., σ.,, 3,,. 5.1 Cauchy (a) (b) (a) (b) 5.1: 5.1. Cauchy 39 F Q Newton F F F Q F Q 5.2: n n ds df n ( 5.1). df n n df(n) df n, t n. t n = df n (5.1) ds 40 5 Cauchy t l n mds df n 5.3: t
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 information.3. (x, x = (, u = = 4 (, x x = 4 x, x 0 x = 0 x = 4 x.4. ( z + z = 8 z, z 0 (z, z = (0, 8, (,, (8, 0 3 (0, 8, (,, (8, 0 z = z 4 z (g f(x = g(
06 5.. ( y = x x y 5 y 5 = (x y = x + ( y = x + y = x y.. ( Y = C + I = 50 + 0.5Y + 50 r r = 00 0.5Y ( L = M Y r = 00 r = 0.5Y 50 (3 00 0.5Y = 0.5Y 50 Y = 50, r = 5 .3. (x, x = (, u = = 4 (, x x = 4 x,
More informationr 1 m A r/m i) t ii) m i) t B(t; m) ( B(t; m) = A 1 + r ) mt m ii) B(t; m) ( B(t; m) = A 1 + r ) mt m { ( = A 1 + r ) m } rt r m n = m r m n B
1 1.1 1 r 1 m A r/m i) t ii) m i) t Bt; m) Bt; m) = A 1 + r ) mt m ii) Bt; m) Bt; m) = A 1 + r ) mt m { = A 1 + r ) m } rt r m n = m r m n Bt; m) Aert e lim 1 + 1 n 1.1) n!1 n) e a 1, a 2, a 3,... {a n
More information20 6 4 1 4 1.1 1.................................... 4 1.1.1.................................... 4 1.1.2 1................................ 5 1.2................................... 7 1.2.1....................................
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 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 informationII Time-stamp: <05/09/30 17:14:06 waki> ii
II waki@cc.hirosaki-u.ac.jp 18 1 30 II Time-stamp: ii 1 1 1.1.................................................. 1 1.2................................................... 3 1.3..................................................
More information1 c Koichi Suga, ISBN
c Koichi Suga, 4 4 6 5 ISBN 978-4-64-6445- 4 ( ) x(t) t u(t) t {u(t)} {x(t)} () T, (), (3), (4) max J = {u(t)} V (x, u)dt ẋ = f(x, u) x() = x x(t ) = x T (), x, u, t ẋ x t u u ẋ = f(x, u) x(t ) = x T x(t
More information,,,,., = (),, (1) (4) :,,,, (1),. (2),, =. (3),,. (4),,,,.. (1) (3), (4).,,., () : = , ( ) : = F 1 + F 2 + F 3 + ( ) : = i Fj j=1 2
6 2 6.1 2 2, 2 5.2 R 2, 2 (R 2, B, µ)., R 2,,., 1, 2, 3,., 1, 2, 3,,. () : = 1 + 2 + 3 + (6.1.1).,,, 1 ,,,,., = (),, (1) (4) :,,,, (1),. (2),, =. (3),,. (4),,,,.. (1) (3), (4).,,., () : = 1 + 2 + 3 +,
More information,, / Ver.2060624 / MSJ Memoirs vol.25 (20) i ( ) 940 (von Neumann) (Ulam) ( ) ([56] p.3) 2 ; 3 960 (Kolmogorov) ([5, 22, 23, 24, 3]) 930 20 980 (Blum) ([2, 3, 58]) 2 3 [2] ii ( ) ( ) {0, }- ( ) 2 ( [6,
More information1 X X T T X (topology) T X (open set) (X, T ) (topological space) ( ) T1 T, X T T2 T T T3 T T ( ) ( ) T1 X T2 T3 1 X T = {, X} X (X, T ) indiscrete sp
1 X X T T X (topology) T X (open set) (X, T ) (topological space) ( ) T1 T, X T T2 T T T3 T T ( ) ( ) T1 X T2 T3 1 X T = {, X} X (X, T ) indiscrete space T1 T2 =, X = X, X X = X T3 =, X =, X X = X 2 X
More informationD 24 D D D
5 Paper I.R. 2001 5 Paper HP Paper 5 3 5.1................................................... 3 5.2.................................................... 4 5.3.......................................... 6
More informationall.dvi
72 9 Hooke,,,. Hooke. 9.1 Hooke 1 Hooke. 1, 1 Hooke. σ, ε, Young. σ ε (9.1), Young. τ γ G τ Gγ (9.2) X 1, X 2. Poisson, Poisson ν. ν ε 22 (9.) ε 11 F F X 2 X 1 9.1: Poisson 9.1. Hooke 7 Young Poisson G
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 information211 kotaro@math.titech.ac.jp 1 R *1 n n R n *2 R n = {(x 1,..., x n ) x 1,..., x n R}. R R 2 R 3 R n R n R n D D R n *3 ) (x 1,..., x n ) f(x 1,..., x n ) f D *4 n 2 n = 1 ( ) 1 f D R n f : D R 1.1. (x,
More information2 1 κ c(t) = (x(t), y(t)) ( ) det(c (t), c x (t)) = det (t) x (t) y (t) y = x (t)y (t) x (t)y (t), (t) c (t) = (x (t)) 2 + (y (t)) 2. c (t) =
1 1 1.1 I R 1.1.1 c : I R 2 (i) c C (ii) t I c (t) (0, 0) c (t) c(i) c c(t) 1.1.2 (1) (2) (3) (1) r > 0 c : R R 2 : t (r cos t, r sin t) (2) C f : I R c : I R 2 : t (t, f(t)) (3) y = x c : R R 2 : t (t,
More information−g”U›ß™ö‡Æ…X…y…N…g…‰
1 / 74 ( ) 2019 3 8 URL: http://www.math.kyoto-u.ac.jp/ ichiro/ 2 / 74 Contents 1 Pearson 2 3 Doob h- 4 (I) 5 (II) 6 (III-1) - 7 (III-2-a) 8 (III-2-b) - 9 (III-3) Pearson 3 / 74 Pearson Definition 1 ρ
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A, B Z Z m, n Z m n m, n A m, n B m=n (1) A, B (2) A B = A B = Z/ π : Z Z/ (3) A B Z/ (4) Z/ A, B (5) f : Z Z f(n) = n f = g π g : Z/ Z A, B (6)
More information1 1 2 3 2.1.................. 3 2.2.......... 6 3 7 3.1......................... 7 3.1.1 ALAGIN................ 7 3.1.2 (SVM).........................
[5] Yahoo! Yahoo! (SVM) 3 F 7 7 (SVM) 3 F 6 0 1 1 2 3 2.1.................. 3 2.2.......... 6 3 7 3.1......................... 7 3.1.1 ALAGIN................ 7 3.1.2 (SVM)........................... 8
More informationExercise in Mathematics IIB IIB (Seiji HIRABA) 0.1, =,,,. n R n, B(a; δ) = B δ (a) or U δ (a) = U(a;, δ) δ-. R n,,,, ;,,, ;,,. (S, O),,,,,,,, 1 C I 2
Exercise in Mathematics IIB IIB (Seiji HIRABA) 0.1, =,,,. n R n, B(a; δ) = B δ (a) or U δ (a) = U(a;, δ) δ-. R n,,,, ;,,, ;,,. (S, O),,,,,,,, 1 C I 2 C II,,,,,,,,,,, 0.2. 1 (Connectivity) 3 2 (Compactness)
More informationnewmain.dvi
数論 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/008142 このサンプルページの内容は, 第 2 版 1 刷発行当時のものです. Daniel DUVERNEY: THÉORIE DES NOMBRES c Dunod, Paris, 1998, This book is published
More informationuntitled
2 : n =1, 2,, 10000 0.5125 0.51 0.5075 0.505 0.5025 0.5 0.4975 0.495 0 2000 4000 6000 8000 10000 2 weak law of large numbers 1. X 1,X 2,,X n 2. µ = E(X i ),i=1, 2,,n 3. σi 2 = V (X i ) σ 2,i=1, 2,,n ɛ>0
More informationi
i 3 4 4 7 5 6 3 ( ).. () 3 () (3) (4) /. 3. 4/3 7. /e 8. a > a, a = /, > a >. () a >, a =, > a > () a > b, a = b, a < b. c c n a n + b n + c n 3c n..... () /3 () + (3) / (4) /4 (5) m > n, a b >, m > n,
More information卓球の試合への興味度に関する確率論的分析
17 i 1 1 1.1..................................... 1 1.2....................................... 1 1.3..................................... 2 2 5 2.1................................ 5 2.2 (1).........................
More informationii 3.,. 4. F. ( ), ,,. 8.,. 1. (75% ) (25% ) =7 24, =7 25, =7 26 (. ). 1.,, ( ). 3.,...,.,.,.,.,. ( ) (1 2 )., ( ), 0., 1., 0,.
(1 C205) 4 10 (2 C206) 4 11 (2 B202) 4 12 25(2013) http://www.math.is.tohoku.ac.jp/~obata,.,,,..,,. 1. 2. 3. 4. 5. 6. 7. 8. 1., 2007 ( ).,. 2. P. G., 1995. 3. J. C., 1988. 1... 2.,,. ii 3.,. 4. F. ( ),..
More information1/1 lim f(x, y) (x,y) (a,b) ( ) ( ) lim limf(x, y) lim lim f(x, y) x a y b y b x a ( ) ( ) xy x lim lim lim lim x y x y x + y y x x + y x x lim x x 1
1/5 ( ) Taylor ( 7.1) (x, y) f(x, y) f(x, y) x + y, xy, e x y,... 1 R {(x, y) x, y R} f(x, y) x y,xy e y log x,... R {(x, y, z) (x, y),z f(x, y)} R 3 z 1 (x + y ) z ax + by + c x 1 z ax + by + c y x +
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 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(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 information3 1 5 1.1........................... 5 1.1.1...................... 5 1.1.2........................ 6 1.1.3........................ 6 1.1.4....................... 6 1.1.5.......................... 7 1.1.6..........................
More information.1 1,... ( )
1 δ( ε )δ 2 f(b) f(a) slope f (c) = f(b) f(a) b a a c b 1 213 3 21. 2 [e-mail] nobuo@math.kyoto-u.ac.jp, [URL] http://www.math.kyoto-u.ac.jp/ nobuo 1 .1 1,... ( ) 2.1....................................
More informationZ: Q: R: C: sin 6 5 ζ a, b
Z: Q: R: C: 3 3 7 4 sin 6 5 ζ 9 6 6............................... 6............................... 6.3......................... 4 7 6 8 8 9 3 33 a, b a bc c b a a b 5 3 5 3 5 5 3 a a a a p > p p p, 3,
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 informationA 21 A.1 L p A A.3 H k,p () A
Analysis III Functional Analysis III 25 10 3 2 (10:40-12:10) 1 1 1.1 n R n or C n.......................... 1 1.2 ( ) (Linear sp. (Vector sp.))................. 1 2 (Normed Spaces) 2 2.1 (Norm).....................................
More informationp = mv p x > h/4π λ = h p m v Ψ 2 Ψ
II p = mv p x > h/4π λ = h p m v Ψ 2 Ψ Ψ Ψ 2 0 x P'(x) m d 2 x = mω 2 x = kx = F(x) dt 2 x = cos(ωt + φ) mω 2 = k ω = m k v = dx = -ωsin(ωt + φ) dt = d 2 x dt 2 0 y v θ P(x,y) θ = ωt + φ ν = ω [Hz] 2π
More informationI L01( Wed) : Time-stamp: Wed 07:38 JST hig e, ( ) L01 I(2017) 1 / 19
I L01(2017-09-20 Wed) : Time-stamp: 2017-09-20 Wed 07:38 JST hig e, http://hig3.net ( ) L01 I(2017) 1 / 19 ? 1? 2? ( ) L01 I(2017) 2 / 19 ?,,.,., 1..,. 1,2,.,.,. ( ) L01 I(2017) 3 / 19 ? I. M (3 ) II,
More information43433 8 3 . Stochastic exponentials...................................... 3. Girsanov s theorem......................................... 4 On the martingale property of stochastic exponentials 5. Gronwall
More informationA B P (A B) = P (A)P (B) (3) A B A B P (B A) A B A B P (A B) = P (B A)P (A) (4) P (B A) = P (A B) P (A) (5) P (A B) P (B A) P (A B) A B P
1 1.1 (population) (sample) (event) (trial) Ω () 1 1 Ω 1.2 P 1. A A P (A) 0 1 0 P (A) 1 (1) 2. P 1 P 0 1 6 1 1 6 0 3. A B P (A B) = P (A) + P (B) (2) A B A B A 1 B 2 A B 1 2 1 2 1 1 2 2 3 1.3 A B P (A
More informationNo δs δs = r + δr r = δr (3) δs δs = r r = δr + u(r + δr, t) u(r, t) (4) δr = (δx, δy, δz) u i (r + δr, t) u i (r, t) = u i x j δx j (5) δs 2
No.2 1 2 2 δs δs = r + δr r = δr (3) δs δs = r r = δr + u(r + δr, t) u(r, t) (4) δr = (δx, δy, δz) u i (r + δr, t) u i (r, t) = u i δx j (5) δs 2 = δx i δx i + 2 u i δx i δx j = δs 2 + 2s ij δx i δx j
More informationa n a n ( ) (1) a m a n = a m+n (2) (a m ) n = a mn (3) (ab) n = a n b n (4) a m a n = a m n ( m > n ) m n 4 ( ) 552
3 3.0 a n a n ( ) () a m a n = a m+n () (a m ) n = a mn (3) (ab) n = a n b n (4) a m a n = a m n ( m > n ) m n 4 ( ) 55 3. (n ) a n n a n a n 3 4 = 8 8 3 ( 3) 4 = 8 3 8 ( ) ( ) 3 = 8 8 ( ) 3 n n 4 n n
More informationII (10 4 ) 1. p (x, y) (a, b) ε(x, y; a, b) 0 f (x, y) f (a, b) A, B (6.5) y = b f (x, b) f (a, b) x a = A + ε(x, b; a, b) x a 2 x a 0 A = f x (
II (1 4 ) 1. p.13 1 (x, y) (a, b) ε(x, y; a, b) f (x, y) f (a, b) A, B (6.5) y = b f (x, b) f (a, b) x a = A + ε(x, b; a, b) x a x a A = f x (a, b) y x 3 3y 3 (x, y) (, ) f (x, y) = x + y (x, y) = (, )
More information218.8.21 1 2, (Theorem 1) (Theorem 2) 1 2, (Theorem 1) (Theorem 2) . (c.f. De Donno and Praelli, 24) (Ω, F, (F ) [,T ], P):, usual condiions, T < P : predicable σ-field on Ω [, T ] H 2 = { } X : (index
More informationz f(z) f(z) x, y, u, v, r, θ r > 0 z = x + iy, f = u + iv C γ D f(z) f(z) D f(z) f(z) z, Rm z, z 1.1 z = x + iy = re iθ = r (cos θ + i sin θ) z = x iy
z fz fz x, y, u, v, r, θ r > z = x + iy, f = u + iv γ D fz fz D fz fz z, Rm z, z. z = x + iy = re iθ = r cos θ + i sin θ z = x iy = re iθ = r cos θ i sin θ x = z + z = Re z, y = z z = Im z i r = z = z
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 information「産業上利用することができる発明」の審査の運用指針(案)
1 1.... 2 1.1... 2 2.... 4 2.1... 4 3.... 6 4.... 6 1 1 29 1 29 1 1 1. 2 1 1.1 (1) (2) (3) 1 (4) 2 4 1 2 2 3 4 31 12 5 7 2.2 (5) ( a ) ( b ) 1 3 2 ( c ) (6) 2. 2.1 2.1 (1) 4 ( i ) ( ii ) ( iii ) ( iv)
More information重力方向に基づくコントローラの向き決定方法
( ) 2/Sep 09 1 ( ) ( ) 3 2 X w, Y w, Z w +X w = +Y w = +Z w = 1 X c, Y c, Z c X c, Y c, Z c X w, Y w, Z w Y c Z c X c 1: X c, Y c, Z c Kentaro Yamaguchi@bandainamcogames.co.jp 1 M M v 0, v 1, v 2 v 0 v
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 informationft. ft τfτdτ = e t.5.. fx = x [ π, π] n sinnx n n=. π a π a, x [ π, π] x = a n cosnx cosna + 4 n=. 3, x [ π, π] x 3 π x = n sinnx. n=.6 f, t gt n 3 n
[ ]. A = IC X n 3 expx = E + expta t : n! n=. fx π x π. { π x < fx = x π fx F k F k = π 9 s9 fxe ikx dx, i =. F k. { x x fx = x >.3 ft = cosωt F s = s4 e st ftdt., e, s. s = c + iφ., i, c, φ., Gφ = lim
More informationtokei01.dvi
2. :,,,. :.... Apr. - Jul., 26FY Dept. of Mechanical Engineering, Saga Univ., JAPAN 4 3. (probability),, 1. : : n, α A, A a/n. :, p, p Apr. - Jul., 26FY Dept. of Mechanical Engineering, Saga Univ., JAPAN
More informationone way two way (talk back) (... ) C.E.Shannon 1948 A Mathematical theory of communication. 1 ( ) 0 ( ) 1
1 1.1 1.2 one way two way (talk back) (... ) 1.3 0 C.E.Shannon 1948 A Mathematical theory of communication. 1 ( ) 0 ( ) 1 ( (coding theory)) 2 2.1 (convolution code) (block code), 3 3.1 Q q Q n Q n 1 Q
More information