1) (AI) 5G AI AI Google IT Deep Learning RWC (RWCP) RWC Web RWCP [1] 2. RWC ETL-Mark I, II (1952, 1955) (ETL) (ETL-Mark

Similar documents
Convolutional Neural Network A Graduation Thesis of College of Engineering, Chubu University Investigation of feature extraction by Convolution

APR. JUL. AUG. MAY JUN. 2

三石貴志.indd

求人面接資料PPT

1 Foundations of Artificial Intelligence (Overview) artificial intelligence; AI Logic Theorist 1956 Dartmouth Conference Turing test image recognition

IPSJ SIG Technical Report iphone iphone,,., OpenGl ES 2.0 GLSL(OpenGL Shading Language), iphone GPGPU(General-Purpose Computing on Graphics Proc


請求記号:DVD 70- -1  栄光のフィレンツェ・ルネサンス  1 夜明け   55分 

(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 α,

極地研 no174.indd

初めに:

1 LAN SSID SSID SSID SSID SSID: SSID SSID IP SSID, VLAN IP SSID, eduroam SSID: SSID eduroam , ,,,, 3 LAN Mac (215 4 ) 17, (

医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.

IPSJ SIG Technical Report Vol.2016-ARC-221 No /8/9 GC 1 1 GC GC GC GC DalvikVM GC 12.4% 5.7% 1. Garbage Collection: GC GC Java GC GC GC GC Dalv

本文6(599) (Page 601)

(a) 1 (b) 3. Gilbert Pernicka[2] Treibitz Schechner[3] Narasimhan [4] Kim [5] Nayar [6] [7][8][9] 2. X X X [10] [11] L L t L s L = L t + L s

guideline_1_0.dvi

知的学習認識システム特論9.key

x T = (x 1,, x M ) x T x M K C 1,, C K 22 x w y 1: 2 2

ii

,000 1,000 1,000 1,000 1,000 1,000 1,000 1,000 1,

untitled

_2009MAR.ren

paper.dvi

ばらつき抑制のための確率最適制御

it-ken_open.key

IPSJ SIG Technical Report 1,a) 1,b) 1,c) 1,d) 2,e) 2,f) 2,g) 1. [1] [2] 2 [3] Osaka Prefecture University 1 1, Gakuencho, Naka, Sakai,

Optical Flow t t + δt 1 Motion Field 3 3 1) 2) 3) Lucas-Kanade 4) 1 t (x, y) I(x, y, t)

Web Web Web Web Web, i

(note-02) Rademacher 1/57

本文

4. 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

untitled

2 (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


_314I01BM浅谷2.indd

1 Fig. 1 Extraction of motion,.,,, 4,,, 3., 1, 2. 2.,. CHLAC,. 2.1,. (256 ).,., CHLAC. CHLAC, HLAC. 2.3 (HLAC ) r,.,. HLAC. N. 2 HLAC Fig. 2

D = [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

量子力学 問題



all.dvi

1 Abstract 2 3 n a ax 2 + bx + c = 0 (a 0) (1) ( x + b ) 2 = b2 4ac 2a 4a 2 D = b 2 4ac > 0 (1) 2 D = 0 D < 0 x + b 2a = ± b2 4ac 2a b ± b 2

H.Haken Synergetics 2nd (1978)

contents

Microsoft Word - toyoshima-deim2011.doc

9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0)


On the Limited Sample Effect of the Optimum Classifier by Bayesian Approach he Case of Independent Sample Size for Each Class Xuexian HA, etsushi WAKA

知能と情報, Vol.29, No.6, pp

有明海・八代海総合調査評価委員会 委員会報告書 別添資料

2 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) =

IBISML 20 (IBIS2017) 6 IBISML 4 CANDAR2017 (Graph Golf 2017) CW WSSM AI Author s Toolkit Writing Better Techn

IS1-09 第 回画像センシングシンポジウム, 横浜,14 年 6 月 2 Hough Forest Hough Forest[6] Random Forest( [5]) Random Forest Hough Forest Hough Forest 2.1 Hough Forest 1 2.2

Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.

‚åŁÎ“·„´Šš‡ðŠp‡¢‡½‹âfi`fiI…A…‰…S…−…Y…•‡ÌMarkovŸA“½fiI›ð’Í

ETL Mark IV1957 ETL Mark IV A ETL Mark IV Automath NEAC2201 Newsweek ENIAC ETL Mark I1952 Mark II1955 ETL Marl III, Mark IV

基本 CMYK

数学の基礎訓練I

フリーソフトでつくる音声認識システム ( 第 2 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.

1 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


第5章 偏微分方程式の境界値問題

通信容量制約を考慮したフィードバック制御 - 電子情報通信学会 情報理論研究会(IT) 若手研究者のための講演会

& Vol.5 No (Oct. 2015) TV 1,2,a) , Augmented TV TV AR Augmented Reality 3DCG TV Estimation of TV Screen Position and Ro

kiyo5_1-masuzawa.indd

7 π L int = gψ(x)ψ(x)φ(x) + (7.4) [ ] p ψ N = n (7.5) π (π +,π 0,π ) ψ (σ, σ, σ )ψ ( A) σ τ ( L int = gψψφ g N τ ) N π * ) (7.6) π π = (π, π, π ) π ±

Part () () Γ Part ,

[1] SBS [2] SBS Random Forests[3] Random Forests ii

福光 寛 1‐37/1‐37

130 Oct Radial Basis Function RBF Efficient Market Hypothesis Fama ) 4) 1 Fig. 1 Utility function. 2 Fig. 2 Value function. (1) (2)

motomura.dvi


develop



Run-Based Trieから構成される 決定木の枝刈り法

B HNS 7)8) HNS ( ( ) 7)8) (SOA) HNS HNS 4) HNS ( ) ( ) 1 TV power, channel, volume power true( ON) false( OFF) boolean channel volume int


THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE {s-kasihr, wakamiya,


支持力計算法.PDF

入門ガイド

i Page ix xi xiii xv

? (EM),, EM? (, 2004/ 2002) von Mises-Fisher ( 2004) HMM (MacKay 1997) LDA (Blei et al. 2001) PCFG ( 2004)... Variational Bayesian methods for Natural

背景

IPSJ SIG Technical Report Vol.2013-CVIM-187 No /5/30 1,a) 1,b), 1,,,,,,, (DNN),,,, 2 (CNN),, 1.,,,,,,,,,,,,,,,,,, [1], [6], [7], [12], [13]., [

A 99% MS-Free Presentation

1 a b = max{a, b}, a b = mi{a, b} a 1 a 2 a a 1 a = max{a 1,... a }, a 1 a = mi{a 1,... a }. A sup A, if A A A A A sup A sup A = + A if A = ± y = arct

IPSJ SIG Technical Report Vol.2012-MUS-96 No /8/10 MIDI Modeling Performance Indeterminacies for Polyphonic Midi Score Following and

johnny-paper2nd.dvi

I, II 1, A = A 4 : 6 = max{ A, } A A 10 10%

インターネットを活用した公開天文台の可能性とその展望.PDF

日歯雑誌(H19・5月号)済/P6‐16 クリニカル  柿木 5

IPSJ SIG Technical Report Vol.2012-CG-149 No.13 Vol.2012-CVIM-184 No /12/4 3 1,a) ( ) DB 3D DB 2D,,,, PnP(Perspective n-point), Ransa

欧州に見るマイナス金利が銀行に及ぼす影響

I A A441 : April 15, 2013 Version : 1.1 I Kawahira, Tomoki TA (Shigehiro, Yoshida )

27 YouTube YouTube UGC User Generated Content CDN Content Delivery Networks LRU Least Recently Used UGC YouTube CGM Consumer Generated Media CGM CGM U

IPSJ SIG Technical Report Vol.2017-MUS-116 No /8/24 MachineDancing: 1,a) 1,b) 3 MachineDancing MachineDancing MachineDancing 1 MachineDan


Transcription:

RWC 10 RWC 1992 4 2001 13 RWC 21 RWC 1. RWC (Real World Computing ) (1982 1992 ) 3 1992 2001 10 21 RWCP 5 1992 1996 5 1997 2001 RWC (RWI) (PDC) 2 RWC (5G) 1

1) (AI) 5G AI AI Google IT Deep Learning RWC (RWCP) RWC Web RWCP [1] 2. RWC 2.. 1 1971 4 1970 7 ETL-Mark I, II (1952, 1955) (ETL) 1954 1965 (ETL-Mark III VI) ( ) ( [2][3]) (1966 1972) 1) RWC 2

OCR ASPET/70, 71 2) 60 (PIPS) : 1971 1980 TSS 1972 11 1973 3) 10 Lie [4] [5] (HLAC) 1981 [6] 10 Bayes 2 Boole 1 4) 70 (AI) (If-then rule) (KE) 2 AI KE 1969 ARPA-net 70 2) 3) 4) A 3

1: 80 TCP/IP 1980 5) AI KE AI (5G) (1982 1992) ICOT PIM OS (1981 1988) 1985 1992 1982 15 NRC [8] [11] From Boolean to Bayesian 6) [9][10] 80 2 AI KE 5G PIM 70 5) 6) Zadeh 1994 Soft Computing [23] 4

( 2 ) 2: 2.. 2 3 3: AI 5

[37] AI 1956 McCarthy Minsky Artificial Intelligence Newell AI Logic Theorist 60 1965 ELIZA 1966 1969 AI 7) McCarthy, Hayes 1972 NP AI AI 70 AI MYCIN DENDRAL Feigenbaum AI KE 80 80 1982 10 AI If A, then B AI McCulloch-Pitts, 1943 Hebb, 1949 Perceptron Rosenblatt, 1957 7) AI 6

Widrow-Hoff, 1960, 1967 1968 Minsky Papert Perceptrons 80 Hinton, 1984 Hopfield, 1985 Rumelhart, 1986 AI PDP (Parallel Distributed Processing) Pearl, 1988 90 Chow, 1957 1971 10 60 Widrow-Hoff Fisher Koford-Groner, 1966 Patterson-Womack, 1966 Fisher 1972, 1981 [6] A : 80 AI 7

AI 80 Toy world Real world Well-defined Ill-defined 3. RWC 1988 5G 10 5 8

RWC 3.. 1 1989 21 ( ) [12] 1991 [13] NIPT (New Information Processing Technology) RWC (Real World Computing) 1991 8) 3.. 2 [12, 13, 15, 17, 18, 21] 21 8) 5G 3D [16] 9

/ / subsymbolic 3.. 3 : : : 3 4 10

4: 1 [14, 15, 16, 17, 18, 19, 21, 22] 5G 5G 3.. 4 1992-1996 11

1997-2001 GA 9) RWC RWC 5 5: RWC [13] ( ) 9) Genetic Algorithm : 12

4. RWC 1992 7 RWC (RWCP: RWC Partnership) 10 (TRC) TRC RWC RWC TRC TRC RWC 4.. 1 1992 1996, H4 H8 RWCP 12 2 3 23 37 12 4 6 3 12 GMD ISS SNN SICS 4 7 (GMD 2001 10) 1993 5 (ISS KRDL ) (SNN) (SICS) 3 36 50 57 1 RWC NIPT 10) 67 24,000 10 13

1: [35] RWCP H4 H5 H6 H7 H8 TRC OS NTT MRI NEC NEC MRI NEC LD OBIS ISS SNN SICS GMD GMD SICS ISS 14

11) JOP RWC 2 34 RISC-LINZ IRST 1994 [35] ETL RWC RWCP TRC 2 RWC TRC 10 60 RWC 2 [20] 2: ETL-RWC H4 H5 H6 H7 H8 EM-X OS 1994 6 RWCP RWCP Joint Symposium 500 RWC 11) NIPT AI 15

[24] [25] [35] RWC RWCP 12) TRC 1994 3 RWC 1995 4 TRC RWC-1 OB RWC [3] RWC 4.. 2 1996, H8 1996 TRC RWC RWI PDC 12) 16

RWC 13) TRC [28] [31] RWIC 1997 RWC 4.. 3 1997 2001, H9 H13 TRC RWIC 6 RWI RWCP [31][32][33] 6: [35] 13) TRC 17

RWI 7 [29][31] 7: [35] RWIC RWC RWCP TRC 18

PDC 14) 8 [30][31] 8: PDC [35] TRC 3 RWIC 4 RWCP 3: RWI RWI RWC 14) 2000 H12 NEDO 19

4: RWCP RWCP RWI TRC Cross Madiator Cross Mediator NTT MRI NEC NEC ISS KRDL ISS KRDL SICS SNN SNN GMD SICS RWCP PDC TRC PAPIA NEC NEC LAN LD MRI GMD 20

RWI PDC TRC PC TRC RWI 19 PDC 11 [35] 5. [21] [18] [19] RWC 92 [16] RWC 94, 95, 97, 98, 00, 01 RWCP RWC NEWS [1] 1995 4 RWIC [38] [35] 5.. 1 RWC RWC 97 1997 1 600 15) (GA) EM-X RWC-1 PC RWC-1 RWC RWC NEWS [26] RWC [27] [28] RWI PDC TRC [29][30] 15) SF HAL 9000 21

5.. 2 [1] [35] RWI (Jijo2) BAYONET CrossMediator PDC RHiNET SCore Omni OpenMP PAPIA 2001 10 3 5 RWC2001 600 2,000 RWC NEWS Vol. 20 ( ) [34] 10 RWC [35] [36] B RWCP RWIC 2002 3 PWC 5.. 3 TRC RWI RWC RWC 6 22

RWC 21 COE [40] 2001 RWC 13 HLAC CHLAC 16) RWC 2002 2005 2006 TRC RWCP PC 1024 cpu RWC RWI RWC AI Deep Learnig Google IT AI RWI 15 2015 17) AI RWI [39] RWC-RWI 6. RWC ICT iphone 16) RWC 17) RWC 23

RWC AI RWC RWI ICT RWC NEDO 18) RWC AI RWC RWC Web RWCP [1] RWCP RWI 18) RWC 24

[1] RWCP, 10 [13, 31, 35, 36] RWC NEWS. (http://keima.la.coocan.jp/rwcp/memorial/index.html) [2],. (http://museum.ipsj.or.jp/computer/dawn/index.html) [3] :,, IPSJ Magazine, Vol. 44, No. 10 (Oct. 2003). (http://museum.ipsj.or.jp/guide/pdf/magazine/ipsj-mgn441015.pdf) [4] N. Otsu: An Invariant Theory of Linear Functionals as Linear Feature Extractors, Bull. ETL, Vol. 37, No. 10, pp. 893 913 (1973). [5] N. Otsu: Nonlinear Discriminant Analysis as a Natural Extension of the Linear Case, Behaviormetrika, Vol. 2, pp. 45 59 (1975). [6] :,, 818, 210 (1981). [7] N. Otsu: Optimal Linear and Nonlinear Solutions for Least-square Discriminant Feature Extraction, Proc. of 6th Int. Conf. on Pattern Recognition, pp. 557 560 (1982). [8],,,,, :,, 211, 136 (1985). [9] :,, Vol. 71, No. 11, pp. 1231 1240 (1988). [10] N. Otsu: Toward Soft Logic for the Foundation of Felxible Information Processing, Bull. ETL, Vol. 53, No. 10, pp. 75 95 (1989). [11],, :,, 5, pp. 113 127, (1990). [12], (Mar. 1991). [13], (May, 1992) in [35]. [14] N. Otsu: Toward Flexible Information Processing: Theory and Novel Functions, Japan Computer Quarterly, JIPDEC, No. 89, pp. 9 17 (1992). [15] :,, Computer Today 5 No.49 (1992). [16] : RWC 92,, Vol. 25, No. 6 (1992). [17],, 4 (1993). [18] N. Otsu: Toward Flexible Intelligence MITI s New Program of Real World Computing, invited paper, Proc. IJCAI-93, Vol. 1, pp. 786 791 (Chambery, 1993). [19] N. Otsu: Real World Computing Program Overview, Theory and Novel Functions, Proc. IJCNN-93, pp. 1065 1070 (Nagoya, 1993). [20] : RWC,, Vol. 12 (1993). [21] :,, RWC, Vol. 34, No. 12 (1993). [22] :,, Vol. 9, No. 5, pp. 358 364 (1994). [23] Zadeh: Fuzzy Logic, Neural Networks, and Soft Computing, Communication of the ACM, Vol. 37, No. 3, pp. 77 84 (March 1994). [24] : RWC, RWC NEWS, Vol. 1 (Apr. 1995). [25] : RWC, RWC NEWS, Vol. 2 (Jul. 1995). [26] RWC 1997 (Jun. 1997), in RWC NEWS, Vol. 8 (May. 1997). [27], RWC 1997, ibid (1997). 25

[28] :, RWC 1997, ibid (1997). [29] :, RWC 1997, ibid (1997). [30] :, RWC 1997, ibid (1997). [31] (RWC-RWI/PDC), (May, 1997) in [35]. [32] (RWC-RWI/PDC),, RWC NEWS, Vol. 9 (Aug. 1997). [33],, : RWC, RWC NEWS, Vol. 10 (Nov. 1997). [34] RWC 2001 (Oct. 2001), in RWC NEWS, Vol. 20 (Nov. 2001). [35], (Feb. 2002) at [1]. [36], WG (Feb. 2002) at [1]. [37] :,, Vol. 122, No. 4, pp. 240-243 (2002). [38] : RWC,, Vol. 17, No. 2 (2002). [39] :, (https://staff.aist.go.jp/y.motomura/bn2002/paper/otsu.pdf) (2002). [40],, 292, (2004). A: 1970 f(r) C j y i n n y Y p(y C j ) P (C j ) (y) P (C j y) =P (C j )p(y C j )/p(y) Chow, 1957 f 26

f x x = Φ[f] T (λ) Φ inv [T (λ)f] =Φ inv [f] Lie ξ = g(r)f(r) dr g ξ x i λ λ =Φ var [T (λ)f] Φ var [f] f T (λ) [4][6] T (λ)f X x x m X n <m Y y = Ψ(x) Ψ Y X Ψ m n A y = A x A A Y Y B Y, W Y Ψ J[Ψ] = tr (W 1 Y B Y ) X B X, W X A B X a i = λ i W X a i n K n min(k 1,m) Fisher Fisher, 1936 2 y =Ψ D(x) = K P (C j x)c j j=1 27

Y c j X K K S =[s ij ], s ij = P (C j x)p(x C i ) dx = P (C j C i ) n n K 1 [5][6] p(x C j ) Y K 1 ε 2 [Ψ] = K j=1 P (C j ) Ψ(x) e j 2 p(x C j ) dx Y e j (j 1 e i e j = δ ij ) C j δε 2 [Ψ] = 2 K j=1 P (C j ){Ψ(x) e j }p(x C j ) δψ(x) dx =0 δψ(x) [6][7] K y =Ψ P (C j )p(x C j ) K R(x) = e j = P (C j x) e j p(x) j=1 e j ε 2 [Ψ] 1986 Ψ R (x) ε 2 [Ψ R]=1 tr Γ Γ =[γ ij ] K K γ ij = P (C i x)p (C j x)p(x)dx = P (C i C j ) s ij j=1 P (C i )s ij = P (C i )P (C j C i )=P (C i C j )=γ ij S Γ P (C i C i ) 0 D M E[M] = D M 2 + kρ(m) min for M ρ(m) k 28

e E[M] = e D M 2 e kρ(m) max for M p(d M) p(m) e E[M] = p(d M)p(M) =p(m D)p(D) max for M D p(m D) M B: [36] RWI 19) RWCP RWCP RWI. 19) RWI 2001 29

GA RHiNET SCore MPEG7 [36] ( ) 1971 3 4 1985 4 1990 4 1991 4 RWC (1992 2001 ) 1997 9 2001 4 1992 4 2010 3 2001 4 2007 3 2012 3 30