25 Study on Effectiveness of Monte Calro Tree Search for Single-Player Games
|
|
- きみかず なつ
- 5 years ago
- Views:
Transcription
1 25 Study on Effectiveness of Monte Calro Tree Search for Single-Player Games
2 ,,, i
3 Abstract Study on Effectiveness of Monte Calro Tree Search for Single-Player Games Norimasa NASU Currently, Monte-carlo tree search has been actively studied for two-person games. Monte-carlo tree search took much attention after the first application to the igo player. However, there are few studies on monte-carlo tree search applied to one-person games. For some one-player games we cannot perform complete-search due to their very broad search space. An efficient search algorithm is needed to solve those problems with broach search space. In this study, we apply the monte-carlo tree search to one player games and verified the effectiveness. We use two problems for experiments: the knapsack problem and generation of Sudoku problems. The performance of monte-carlo tree search is compared with that of the genetic algorithm. The experiment results show the following facts. Firstly, the monte-carlo tree search gives a rather good solution immediately after the start. Secondly, the accuracy of the solution is hard to rise. Thirdly, the reason is that many playouts are done on a node that does not give an optimal solution. key words Monte-carlo tree search, Genetic algorithm, Sudoku, Knapsack problem ii
4 SAT iii
5 iv
6 SAT n = n = n = v
7 6.4 n = n = vi
8 MCT GA vii
9 1 1.1 [2] [14] [11] [14] 1
10 [11] ( ) [13] Samegame Schadd Takes [7] [8]
11 2 2.1 [10]
12 SAT Cell-Unique x x a 1 x a Line-Unique Block-Unique a x 1 x a k-naked k x 1, x 2,..., x k k a 1, a 2,..., a k x 1, x 2,..., x k a 1, a 2,..., a k k-hidden k a 1, a 2,..., a k x 1, x 2,..., x k k x 1, x 2,..., x k a 1, a 2,..., a k 4
13 2.2 solve(board) { cnf <- CNFOfBaseRule cnf <- append(cnf, tocnf(board)) if (satisfiable(cnf)) { answer = findanswer(cnf) cnf2 <- append(cnf, negate(answer)) if (satisfiable(cnf2)) { return multiple else { return unique else { return noanswer 2.3 SAT SAT SAT CNF CNF [5] 2.1 CNF SAT CNF CNF CNF [5] extended encoding 1 1 CNF SAT CNF no_answer CNF 1 CNF CNF SAT multiple unique 5
14 2.3 makeboard() { loop until board $n$ { board <- sethint(board) if(solve(board) ){ board <- board else if(solve(board) ){ return board; sethint 1 1 solve SAT solve 6
15 2.3 multiple no_answer unique 7
16 3 [3] [6] m n i C i j w j v j 1 1 m = 2 C 0 = 10, C 1 = 15 3 k i C i k 0 = {0, 1, 4 k 1 = {2, 3, 5, j w j v j
17 4 4.1 [2]
18 4.2 MCT(root) { loop until { leaf <- select_downwards(root) leaf.n <- leaf.n + 1 if (expand_cond(leaf)) { leaf <- expand(leaf).first_child board = playout(leaf.board) update_upwards(leaf, getvalue(board)) return select_best_child(root) select_downwards 2. expand_cond expand 3. playout 4. evaluate update_upwards 4.1 select_downwards expand_cond expand playout evaluate update_upwards 10
19 4.3 UCT [4] UCT UCB1 Upper Confidence Bound [1] Multi-armed bandit problem [12] X j j n j j n c ucb j = X j + c 2 log n n j (4.1) UCB1 4.1 UCB1 UCB1 UCB select_downwards expand_cond expand playout evaluate update_upwards UCB
20 4.3 playout(board) { loop until board.hint == $n$ { hint <- selecthint(board) board <- addhint(board, hint) if (solve(board ) == noanswer) { board <- deletecand(board, hint) else { board <- board return board 4.2 n selecthint solve deletecand addhint 1 n solve playout solve SAT n n n c v v = n 3 c (4.2) 12
21 4.4 playout(items, knapsack) { loop (infinity) { items <- getitemlist(items) if (items == empty) { break loop item <- selectitem(items ) knapsack_id <- selectknapsack(knapsack) knapsack <- additem(knapsack, knapsack_id, item) return bag.value UCB1 getitemlist) 1 (selectitem) (selectknapsack) (additem) 13
22 4.4 14
23 5 [9] evaluate 2. generate_next 3. 15
24 5.1 Genetic_Algorithm(first) { now <- first loop until { evaluate(now) next = generate_next(now) now <- next return max(now) 5.1 generate_next(population) { next <- null loop until next parent1, parent2 <- select_parent(popuration) if( ){ child1, child2 <- crossover(parent1, parent2) if( ){ child1, child2 <- mutation(child1, child2) next.add(child1, child2) else { next.add(parent1, parent2) return next select_parent 2 2 crossover mutation 2 16
25 evaluate 5.2 select_parent crossover mutation [9] i f i N i p i p i = f i N j=1 f j (5.1) N j=1 f j f i
26 [9] m 0 m 1 0 m n n n m 0 m 1 18
27 m , 2,
28 [ ]
29 , n n c 0 n 21
30 c 2 n c m 0 m [ ]
31 % 1 23
32 6 4 5 OS ubuntu CPU Intel Core 3.30GHz 8GB Java b03 MCT GA n = 17, 18, 19, 20 C
33 n MCT GA n = % 30% n =
34 n = 18 n = 19, 20 n = n = n m 3 C C 0 = 4n, C 1 = 5n, C 2 = 6n j j n 10 n n 5 2n 26
35 n MCT GA (-14) 2649(0) (-17) 6323(-10) (-131) 13029(-74) (-749) 17328(-169) (-905) 23511(-247) (-1585) 28575(-1159) C % 30% 1 n 50, 100, 150, 200, 250, (=10 ) n 6.2 n 200, 250,
36 n = n =
37 n = MCT GA n ( ) MCT GA (MCT ) (-27) (-251) (-501) (-172) (-1500) (-1824) 6.2 n 29
38 n UCB1 UCB1 30
39 7 2 UCB1 31
40
41 [1] P. Auer, N. Cesa-Bianchi, and P. Fischer: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning, Vol. 47, No. 2 3, pp , [2] C. Browne, E. Powley, D. Whitehouse, S. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, S. Colton: A Survey of Monte Carlo Tree Search Methods. IEEE Transactions on computional intelligence and AI in games, Vol. 4, No. 1, [3] H. Kellerer, U. Pferschy and D. Pisinger, Knapsack Problems, Springer, Berlin, [4] L. Kocsis, C. Szepesvári: Bandit Based Monte-Carlo Planning, 17th European Conference on Machine Learning (ECML 2006), Lecture Notes in Computer Science 4212, pp (2006). [5] I. Lynce, J. Ouaknine: Sudoku as a SAT problem. In Proceedings of 9th International Symposium on Artificial Intelligence and Mathematics, [6] S. Martello, P. Toth: Knapsack problems : algorithms and computer implementations, Wiley, Chichester, pp , [7] M. P. D. Schadd, M. H. M. Winands, M. J. W. Tak, J. W. H. M. Uiterwijk: Singleplayer Monte-Carlo tree search for SameGame. Journal Knowledge-Based Systems, Vol. 34, pp. 3 11, Elsevier, [8] F. W. Takes and W. A. Kosters: Solving SameGame and its Chessboard Variant. In Proceedings of the 21st Benelux Conference on Artificial Intelligence (BNAIC), pp , [9] : 1,, [10] :, pp ,, Vol.53, No.2, 33
42 563,, [11],,, :, pp ,, Vol.53, No.11, [12], : k-armed., AL,, Vol. 2008, No. 49, pp.65 70, [13], :., Vol MPS-86, No. 31, pp. 1 4, [14] :,, Vol. 49, No. 6, pp ,
23 Study on Generation of Sudoku Problems with Fewer Clues
23 Study on Generation of Sudoku Problems with Fewer Clues 1120254 2012 3 1 9 9 21 18 i Abstract Study on Generation of Sudoku Problems with Fewer Clues Norimasa NASU Sudoku is puzzle a kind of pencil
More information2 1 2 2 1 i
25 Improvement of Simulation Accuracy in Monte Carlo Daihinmin Players 1165064 2014 2 28 2 1 2 2 1 i 2 2 1 3 15,000 15,000 69% 2 3 3 ii Abstract Improvement of Simulation Accuracy in Monte Carlo Daihinmin
More informationThe 19th Game Programming Workshop 2014 SHOT 1,a) 2 UCT SHOT UCT SHOT UCT UCT SHOT UCT An Empirical Evaluation of the Effectiveness of the SHOT algori
SHOT 1,a) 2 UCT SHOT UCT SHOT UCT UCT SHOT UCT An Empirical Evaluation of the Effectiveness of the SHOT algorithm in Go and Gobang Masahiro Honjo 1,a) Yoshimasa Tsuruoka 2 Abstract: Today, UCT is the most
More informationn 2 n (Dynamic Programming : DP) (Genetic Algorithm : GA) 2 i
15 Comparison and Evaluation of Dynamic Programming and Genetic Algorithm for a Knapsack Problem 1040277 2004 2 25 n 2 n (Dynamic Programming : DP) (Genetic Algorithm : GA) 2 i Abstract Comparison and
More informationLogistello 1) playout playout 1 5) SIMD Bitboard playout playout Bitboard Bitboard 8 8 = black white 2 2 Bitboard 2 1 6) position rev i
SIMD 1 1 1 playout playout Cell B. E. SIMD SIMD playout playout Implementation of an Othello Program Based on Monte-Carlo Tree Search by Using a Multi-Core Processor and SIMD Instructions YUJI KUBOTA,
More informationThe 18th Game Programming Workshop ,a) 1,b) 1,c) 2,d) 1,e) 1,f) Adapting One-Player Mahjong Players to Four-Player Mahjong
1 4 1,a) 1,b) 1,c) 2,d) 1,e) 1,f) 4 1 1 4 1 4 4 1 4 Adapting One-Player Mahjong Players to Four-Player Mahjong by Recognizing Folding Situations Naoki Mizukami 1,a) Ryotaro Nakahari 1,b) Akira Ura 1,c)
More information2015 3
JAIST Reposi https://dspace.j Title ターン制ストラテジーゲームにおける候補手の抽象化 によるゲーム木探索の効率化 Author(s) 村山, 公志朗 Citation Issue Date 2015-03 Type Thesis or Dissertation Text version author URL http://hdl.handle.net/10119/12652
More information[1] AI [2] Pac-Man Ms. Pac-Man Ms. Pac-Man Pac-Man Ms. Pac-Man IEEE AI Ms. Pac-Man AI [3] AI 2011 UCT[4] [5] 58,990 Ms. Pac-Man AI Ms. Pac-Man 921,360
TD(λ) Ms. Pac-Man AI 1,a) 2 3 3 Ms. Pac-Man AI Ms. Pac-Man UCT (Upper Confidence Bounds applied to Trees) TD(λ) UCT UCT Progressive bias Progressive bias UCT UCT Ms. Pac-Man UCT Progressive bias TD(λ)
More informationsoturon.dvi
12 Exploration Method of Various Routes with Genetic Algorithm 1010369 2001 2 5 ( Genetic Algorithm: GA ) GA 2 3 Dijkstra Dijkstra i Abstract Exploration Method of Various Routes with Genetic Algorithm
More informationResearch on decision making in multi-player games with imperfect information
Research on decision making in multi-player games with imperfect information 37-086521 22 2 9 UCT UCT 46 % 60000 9 % 1 1 1.1........................................ 1 1.2.....................................
More information29 Short-time prediction of time series data for binary option trade
29 Short-time prediction of time series data for binary option trade 1180365 2018 2 28 RSI(Relative Strength Index) 3 USD/JPY 1 2001 1 2 4 10 2017 12 29 17 00 1 high low i Abstract Short-time prediction
More informationjob-shop.dvi
21 GA GA for job-shop scheduling problem by plural chromosome expression 1100303 2010 3 1 GA 1,,,,,,,, 4, 4,, i Abstract GA for job-shop scheduling problem by plural chromosome expression Tatsuki Shinohara
More information2 ( ) i
25 Study on Rating System in Multi-player Games with Imperfect Information 1165069 2014 2 28 2 ( ) i ii Abstract Study on Rating System in Multi-player Games with Imperfect Information Shigehiko MORITA
More information4.1 % 7.5 %
2018 (412837) 4.1 % 7.5 % Abstract Recently, various methods for improving computial performance have been proposed. One of these various methods is Multi-core. Multi-core can execute processes in parallel
More information( ) [1] [4] ( ) 2. [5] [6] Piano Tutor[7] [1], [2], [8], [9] Radiobaton[10] Two Finger Piano[11] Coloring-in Piano[12] ism[13] MIDI MIDI 1 Fig. 1 Syst
情報処理学会インタラクション 2015 IPSJ Interaction 2015 15INT014 2015/3/7 1,a) 1,b) 1,c) Design and Implementation of a Piano Learning Support System Considering Motivation Fukuya Yuto 1,a) Takegawa Yoshinari 1,b) Yanagi
More informationVol. 52 No (Dec. 2011) Ms. Pac-Man IEEE CIG Ms. Pac-Man Ms. Pac-Man AI AI Ms. Pac-Man Ms. Pac-Man Competition Ms. Pac-Man Monte
Vol. 52 No. 12 3817 3827 (Dec. 2011) Ms. Pac-Man 1 2 2007 IEEE CIG Ms. Pac-Man Ms. Pac-Man AI AI Ms. Pac-Man Ms. Pac-Man Competition Ms. Pac-Man Monte-Carlo Tree Search in Ms. Pac-Man Nozomu Ikehata 1
More informationAtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(
AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) 29 4 29 A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]: print( YES ) else: print( NO ) 1 B:
More information1 1 tf-idf tf-idf i
14 A Method of Article Retrieval Utilizing Characteristics in Newspaper Articles 1055104 2003 1 31 1 1 tf-idf tf-idf i Abstract A Method of Article Retrieval Utilizing Characteristics in Newspaper Articles
More information先端社会研究 ★5★号/4.山崎
71 72 5 1 2005 7 8 47 14 2,379 2,440 1 2 3 2 73 4 3 1 4 1 5 1 5 8 3 2002 79 232 2 1999 249 265 74 5 3 5. 1 1 3. 1 1 2004 4. 1 23 2 75 52 5,000 2 500 250 250 125 3 1995 1998 76 5 1 2 1 100 2004 4 100 200
More information(a) Picking up of six components (b) Picking up of three simultaneously. components simultaneously. Fig. 2 An example of the simultaneous pickup. 6 /
*1 *1 *1 *2 *2 Optimization of Printed Circuit Board Assembly Prioritizing Simultaneous Pickup in a Placement Machine Toru TSUCHIYA *3, Atsushi YAMASHITA, Toru KANEKO, Yasuhiro KANEKO and Hirokatsu MURAMATSU
More information21 Quantum calculator simulator based on reversible operation
21 Quantum calculator simulator based on reversible operation 1100366 2010 3 1 i Abstract Quantum calculator simulator based on reversible operation Ryota Yoshimura Quantum computation is the novel computational
More information,.,.,,.,. X Y..,,., [1].,,,.,,.. HCI,,,,,,, i
23 Experimental investigation of Natural Use Profiles of Pen Pressure, Tilt and Azimuth 1120230 2012 3 1 ,.,.,,.,. X Y..,,., [1].,,,.,,.. HCI,,,,,,, i Abstract Experimental investigation of Natural Use
More informationIT i
27 The automatic extract of know-how search tag using a thesaurus 1160374 2016 2 26 IT i Abstract The automatic extract of know-how search tag using a thesaurus In recent years, a number of organizational
More informationWeb Web Web Web Web, i
22 Web Research of a Web search support system based on individual sensitivity 1135117 2011 2 14 Web Web Web Web Web, i Abstract Research of a Web search support system based on individual sensitivity
More informationA Study on Throw Simulation for Baseball Pitching Machine with Rollers and Its Optimization Shinobu SAKAI*5, Yuichiro KITAGAWA, Ryo KANAI and Juhachi
A Study on Throw Simulation for Baseball Pitching Machine with Rollers and Its Optimization Shinobu SAKAI*5, Yuichiro KITAGAWA, Ryo KANAI and Juhachi ODA Department of Human and Mechanical Systems Engineering,
More information2 2 1 2 1 2 1 2 2 Web Web Web Web 1 1,,,,,, Web, Web - i -
2015 Future University Hakodate 2015 System Information Science Practice Group Report Project Name Improvement of Environment for Learning Mathematics at FUN C (PR ) Group Name GroupC (PR) /Project No.
More informationBulletin of JSSAC(2014) Vol. 20, No. 2, pp (Received 2013/11/27 Revised 2014/3/27 Accepted 2014/5/26) It is known that some of number puzzles ca
Bulletin of JSSAC(2014) Vol. 20, No. 2, pp. 3-22 (Received 2013/11/27 Revised 2014/3/27 Accepted 2014/5/26) It is known that some of number puzzles can be solved by using Gröbner bases. In this paper,
More information19 Systematization of Problem Solving Strategy in High School Mathematics for Improving Metacognitive Ability
19 Systematization of Problem Solving Strategy in High School Mathematics for Improving Metacognitive Ability 1105402 2008 2 4 2,, i Abstract Systematization of Problem Solving Strategy in High School
More information28 Horizontal angle correction using straight line detection in an equirectangular image
28 Horizontal angle correction using straight line detection in an equirectangular image 1170283 2017 3 1 2 i Abstract Horizontal angle correction using straight line detection in an equirectangular image
More information29 jjencode JavaScript
Kochi University of Technology Aca Title jjencode で難読化された JavaScript の検知 Author(s) 中村, 弘亮 Citation Date of 2018-03 issue URL http://hdl.handle.net/10173/1975 Rights Text version author Kochi, JAPAN http://kutarr.lib.kochi-tech.ac.jp/dspa
More informationjohnny-paper2nd.dvi
13 The Rational Trading by Using Economic Fundamentals AOSHIMA Kentaro 14 2 26 ( ) : : : The Rational Trading by Using Economic Fundamentals AOSHIMA Kentaro abstract: Recently Artificial Markets on which
More information23 A Comparison of Flick and Ring Document Scrolling in Touch-based Mobile Phones
23 A Comparison of Flick and Ring Document Scrolling in Touch-based Mobile Phones 1120220 2012 3 1 iphone..,. 2 (, ) 3 (,, ),,,.,..,. HCI i Abstract A Comparison of Flick and Ring Document Scrolling in
More informationSobel Canny i
21 Edge Feature for Monochrome Image Retrieval 1100311 2010 3 1 3 3 2 2 7 200 Sobel Canny i Abstract Edge Feature for Monochrome Image Retrieval Naoto Suzue Content based image retrieval (CBIR) has been
More information,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
More informationQ [4] 2. [3] [5] ϵ- Q Q CO CO [4] Q Q [1] i = X ln n i + C (1) n i i n n i i i n i = n X i i C exploration exploitation [4] Q Q Q ϵ 1 ϵ 3. [3] [5] [4]
1,a) 2,3,b) Q ϵ- 3 4 Q greedy 3 ϵ- 4 ϵ- Comparation of Methods for Choosing Actions in Werewolf Game Agents Tianhe Wang 1,a) Tomoyuki Kaneko 2,3,b) Abstract: Werewolf, also known as Mafia, is a kind of
More informationWeb Web Web Web i
28 Research of password manager using pattern lock and user certificate 1170369 2017 2 28 Web Web Web Web i Abstract Research of password manager using pattern lock and user certificate Takuya Mimoto In
More informationThe 15th Game Programming Workshop 2010 Magic Bitboard Magic Bitboard Bitboard Magic Bitboard Bitboard Magic Bitboard Magic Bitboard Magic Bitbo
Magic Bitboard Magic Bitboard Bitboard Magic Bitboard Bitboard Magic Bitboard 64 81 Magic Bitboard Magic Bitboard Bonanza Proposal and Implementation of Magic Bitboards in Shogi Issei Yamamoto, Shogo Takeuchi,
More information1 [1, 2, 3, 4, 5, 8, 9, 10, 12, 15] The Boston Public Schools system, BPS (Deferred Acceptance system, DA) (Top Trading Cycles system, TTC) cf. [13] [
Vol.2, No.x, April 2015, pp.xx-xx ISSN xxxx-xxxx 2015 4 30 2015 5 25 253-8550 1100 Tel 0467-53-2111( ) Fax 0467-54-3734 http://www.bunkyo.ac.jp/faculty/business/ 1 [1, 2, 3, 4, 5, 8, 9, 10, 12, 15] The
More informationP2P P2P peer peer P2P peer P2P peer P2P i
26 P2P Proposed a system for the purpose of idle resource utilization of the computer using the P2P 1150373 2015 2 27 P2P P2P peer peer P2P peer P2P peer P2P i Abstract Proposed a system for the purpose
More informationfx-9860G Manager PLUS_J
fx-9860g J fx-9860g Manager PLUS http://edu.casio.jp k 1 k III 2 3 1. 2. 4 3. 4. 5 1. 2. 3. 4. 5. 1. 6 7 k 8 k 9 k 10 k 11 k k k 12 k k k 1 2 3 4 5 6 1 2 3 4 5 6 13 k 1 2 3 1 2 3 1 2 3 1 2 3 14 k a j.+-(),m1
More informationi ii iii iv v vi vii ( ー ー ) ( ) ( ) ( ) ( ) ー ( ) ( ) ー ー ( ) ( ) ( ) ( ) ( ) 13 202 24122783 3622316 (1) (2) (3) (4) 2483 (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) 11 11 2483 13
More information27 1 NP NP-completeness of Picross 3D without segment-information and that with height of one
27 1 NP NP-completeness of Picross 3D without segment-information and that with height of one 115282 216 2 26 1 NP.,,., NP, 1 P.,, 1 NP, 3-SAT., NP, i Abstract NP-completeness of Picross 3D without segment-information
More information2017 (413812)
2017 (413812) Deep Learning ( NN) 2012 Google ASIC(Application Specific Integrated Circuit: IC) 10 ASIC Deep Learning TPU(Tensor Processing Unit) NN 12 20 30 Abstract Multi-layered neural network(nn) has
More informationInput image Initialize variables Loop for period of oscillation Update height map Make shade image Change property of image Output image Change time L
1,a) 1,b) 1/f β Generation Method of Animation from Pictures with Natural Flicker Abstract: Some methods to create animation automatically from one picture have been proposed. There is a method that gives
More information1,a) 1,b) TUBSTAP TUBSTAP Offering New Benchmark Maps for Turn Based Strategy Game Tomihiro Kimura 1,a) Kokolo Ikeda 1,b) Abstract: Tsume-shogi and Ts
JAIST Reposi https://dspace.j Title ターン制戦略ゲームにおけるベンチマークマップの提 案 Author(s) 木村, 富宏 ; 池田, 心 Citation ゲームプログラミングワークショップ 2016 論文集, 2016: 36-43 Issue Date 2016-10-28 Type Conference Paper Text version author
More informationGPGPU
GPGPU 2013 1008 2015 1 23 Abstract In recent years, with the advance of microscope technology, the alive cells have been able to observe. On the other hand, from the standpoint of image processing, the
More informationODA NGO NGO JICA JICA NGO JICA JBIC SCP
ODA NGO NGO JICA JICA NGO JICA JBIC SCP - - NGO NGO NGO NGO NGO NGO Roger A Hart - Potuvil UGM UGM APU NGO APU APU NGO APU NGO NGO APU APU Matara NGO ODA NGO ODA http://www.jica.go.jp/partner/college/index.html#partnership
More information220 28;29) 30 35) 26;27) % 8.0% 9 36) 8) 14) 37) O O 13 2 E S % % 2 6 1fl 2fl 3fl 3 4
Vol. 12 No. 2 2002 219 239 Λ1 Λ1 729 1 2 29 4 3 4 5 1) 2) 3) 4 6) 7 27) Λ1 701-0193 288 219 220 28;29) 30 35) 26;27) 0 6 7 12 13 18 59.9% 8.0% 9 36) 8) 14) 37) 1 1 1 13 6 7 O O 13 2 E S 1 1 17 0 6 1 585
More informationWeb Basic Web SAS-2 Web SAS-2 i
19 Development of moving image delivery system for elementary school 1080337 2008 3 10 Web Basic Web SAS-2 Web SAS-2 i Abstract Development of moving image delivery system for elementary school Ayuko INOUE
More information1 Table 1: Identification by color of voxel Voxel Mode of expression Nothing Other 1 Orange 2 Blue 3 Yellow 4 SSL Humanoid SSL-Vision 3 3 [, 21] 8 325
社団法人人工知能学会 Japanese Society for Artificial Intelligence 人工知能学会研究会資料 JSAI Technical Report SIG-Challenge-B3 (5/5) RoboCup SSL Humanoid A Proposal and its Application of Color Voxel Server for RoboCup SSL
More informationA Feasibility Study of Direct-Mapping-Type Parallel Processing Method to Solve Linear Equations in Load Flow Calculations Hiroaki Inayoshi, Non-member
A Feasibility Study of Direct-Mapping-Type Parallel Processing Method to Solve Linear Equations in Load Flow Calculations Hiroaki Inayoshi, Non-member (University of Tsukuba), Yasuharu Ohsawa, Member (Kobe
More information27 VR Effects of the position of viewpoint on self body in VR environment
27 VR Effects of the position of viewpoint on self body in VR environment 1160298 2015 2 25 VR (HMD), HMD (VR). VR,.. HMD,., VR,.,.,,,,., VR,. HMD VR i Abstract Effects of the position of viewpoint on
More information( )
NAIST-IS-MT0851100 2010 2 4 ( ) CR CR CR 1980 90 CR Kerberos SSH CR CR CR CR CR CR,,, ID, NAIST-IS- MT0851100, 2010 2 4. i On the Key Management Policy of Challenge Response Authentication Schemes Toshiya
More information28 Docker Design and Implementation of Program Evaluation System Using Docker Virtualized Environment
28 Docker Design and Implementation of Program Evaluation System Using Docker Virtualized Environment 1170288 2017 2 28 Docker,.,,.,,.,,.,. Docker.,..,., Web, Web.,.,.,, CPU,,. i ., OS..,, OS, VirtualBox,.,
More informationfiš„v5.dvi
(2001) 49 2 293 303 VRML 1 2 3 2001 4 12 2001 10 16 Web Java VRML (Virtual Reality Modeling Language) VRML Web VRML VRML VRML VRML Web VRML VRML, 3D 1. WWW (World Wide Web) WWW Mittag (2000) Web CGI Java
More information01ⅢⅣⅤⅥⅦⅧⅨⅩ一二三四五六七八九零壱弐02ⅢⅣⅤⅥⅦⅧⅨⅩ一二三四五六七八九零壱弐03ⅢⅣⅤⅥⅦⅧⅨⅩ一二三四五六七八九零壱弐04ⅢⅣⅤⅥⅦⅧⅨⅩ一二三四五六七八九零壱弐05ⅢⅣⅤⅥⅦⅧⅨⅩ一二三四五六七八九零壱弐06ⅢⅣⅤⅥⅦⅧⅨⅩ一二三四五六
*1 2 PR ( ) 1. 1 1.1. 2 1 2.2 3. 4. 5. 6. *1 Graduate School for Creative Cities, Osaka City University 1.2. Vol.6 (March, 2006) 3. 01) 02) ( ) 03) 04) 05) 06) 07) 08) 5.2.1. 09) 10),11) 2. 2.1. 2 1 2
More information25 D Effects of viewpoints of head mounted wearable 3D display on human task performance
25 D Effects of viewpoints of head mounted wearable 3D display on human task performance 1140322 2014 2 28 D HMD HMD HMD HMD 3D HMD HMD HMD HMD i Abstract Effects of viewpoints of head mounted wearable
More information(MIRU2008) HOG Histograms of Oriented Gradients (HOG)
(MIRU2008) 2008 7 HOG - - E-mail: katsu0920@me.cs.scitec.kobe-u.ac.jp, {takigu,ariki}@kobe-u.ac.jp Histograms of Oriented Gradients (HOG) HOG Shape Contexts HOG 5.5 Histograms of Oriented Gradients D Human
More information21 Key Exchange method for portable terminal with direct input by user
21 Key Exchange method for portable terminal with direct input by user 1110251 2011 3 17 Diffie-Hellman,..,,,,.,, 2.,.,..,,.,, Diffie-Hellman, i Abstract Key Exchange method for portable terminal with
More informationTF-IDF TDF-IDF TDF-IDF Extracting Impression of Sightseeing Spots from Blogs for Supporting Selection of Spots to Visit in Travel Sat
1 1 2 1. TF-IDF TDF-IDF TDF-IDF. 3 18 6 Extracting Impression of Sightseeing Spots from Blogs for Supporting Selection of Spots to Visit in Travel Satoshi Date, 1 Teruaki Kitasuka, 1 Tsuyoshi Itokawa 2
More informationIPSJ SIG Technical Report Vol.2016-GI-35 No /3/9 StarCraft AI Deep Q-Network StarCraft: BroodWar Blizzard Entertainment AI Competition AI Convo
StarCraft AI Deep Q-Network StarCraft: BroodWar Blizzard Entertainment AI Competition AI Convolutional Neural Network(CNN) Q Deep Q-Network(DQN) CNN DQN,,, 1. StarCraft: Brood War *1 Blizzard Entertainment
More information1 DHT Fig. 1 Example of DHT 2 Successor Fig. 2 Example of Successor 2.1 Distributed Hash Table key key value O(1) DHT DHT 1 DHT 1 ID key ID IP value D
P2P 1,a) 1 1 Peer-to-Peer P2P P2P P2P Chord P2P Chord Consideration for Efficient Construction of Distributed Hash Trees on P2P Systems Taihei Higuchi 1,a) Masakazu Soshi 1 Tomoyuki Asaeda 1 Abstract:
More information149 (Newell [5]) Newell [5], [1], [1], [11] Li,Ryu, and Song [2], [11] Li,Ryu, and Song [2], [1] 1) 2) ( ) ( ) 3) T : 2 a : 3 a 1 :
Transactions of the Operations Research Society of Japan Vol. 58, 215, pp. 148 165 c ( 215 1 2 ; 215 9 3 ) 1) 2) :,,,,, 1. [9] 3 12 Darroch,Newell, and Morris [1] Mcneil [3] Miller [4] Newell [5, 6], [1]
More informationNotePC 8 10cd=m 2 965cd=m 2 1.2 Note-PC Weber L,M,S { i {
12 The eect of a surrounding light to color discrimination 1010425 2001 2 5 NotePC 8 10cd=m 2 965cd=m 2 1.2 Note-PC Weber L,M,S { i { Abstract The eect of a surrounding light to color discrimination Ynka
More information1 Web [2] Web [3] [4] [5], [6] [7] [8] S.W. [9] 3. MeetingShelf Web MeetingShelf MeetingShelf (1) (2) (3) (4) (5) Web MeetingShelf
1,a) 2,b) 4,c) 3,d) 4,e) Web A Review Supporting System for Whiteboard Logging Movies Based on Notes Timeline Taniguchi Yoshihide 1,a) Horiguchi Satoshi 2,b) Inoue Akifumi 4,c) Igaki Hiroshi 3,d) Hoshi
More informationOctober p NHK No October GT meansd T T p p p t p p p PTA October October October Chavkin Chavkin, N.F. & GarzaLobeck, M. : Multicultural Approach to Parent Involvement. Social Work in Education, 13,
More information1 4 4 [3] SNS 5 SNS , ,000 [2] c 2013 Information Processing Society of Japan
SNS 1,a) 2 3 3 2012 3 30, 2012 10 10 SNS SNS Development of Firefighting Knowledge Succession Support SNS in Tokyo Fire Department Koutarou Ohno 1,a) Yuki Ogawa 2 Hirohiko Suwa 3 Toshizumi Ohta 3 Received:
More information卒業論文2.dvi
15 GUI A study on the system to transfer a GUI sub-picture to the enlarging viewer for operational support 1040270 2004 2 27 GUI PC PC GUI Graphical User Interface PC GUI GUI PC GUI PC PC GUI i Abstract
More informationVirtual Window System Virtual Window System Virtual Window System Virtual Window System Virtual Window System Virtual Window System Social Networking
23 An attribute expression of the virtual window system communicators 1120265 2012 3 1 Virtual Window System Virtual Window System Virtual Window System Virtual Window System Virtual Window System Virtual
More information..,,,, , ( ) 3.,., 3.,., 500, 233.,, 3,,.,, i
25 Feature Selection for Prediction of Stock Price Time Series 1140357 2014 2 28 ..,,,,. 2013 1 1 12 31, ( ) 3.,., 3.,., 500, 233.,, 3,,.,, i Abstract Feature Selection for Prediction of Stock Price Time
More information2012 20 2012 1 1-1 1-2 1-3 2 3 3-1 3-2 3-3 3-4 4 4-1 4-2 2016 2 25 2016 3 31 1 1-1 1990 2000 1315 2013 9 2015 2005 10 30 2013 20 11 2012 3 3 1 5 1 2013 1 2013 2015 1-2 2001 2004 2 2001 3 4 20036 30 1 1-3
More information(1) i NGO ii (2) 112
MEMOIRS OF SHONAN INSTITUTE OF TECHNOLOGY Vol. 41, No. 1, 2007 * * 2 * 3 * 4 * 5 * 6 * 7 * 8 Service Learning for Engineering Students Satsuki TASAKA*, Mitsutoshi ISHIMURA* 2, Hikaru MIZUTANI* 3, Naoyuki
More information人工知能学会研究会資料 SIG-KBS-B Analysis of Voting Behavior in One Night Werewolf 1 2 Ema Nishizaki 1 Tomonobu Ozaki Graduate School of Integrated B
人工知能学会研究会資料 SIG-KBS-B508-09 Analysis of Voting Behavior in One Night Werewolf 1 2 Ema Nishizaki 1 Tomonobu Ozaki 2 1 1 Graduate School of Integrated Basic Sciences, Nihon University 2 2 College of Humanities
More informationRun-Based Trieから構成される 決定木の枝刈り法
Run-Based Trie 2 2 25 6 Run-Based Trie Simple Search Run-Based Trie Network A Network B Packet Router Packet Filtering Policy Rule Network A, K Network B Network C, D Action Permit Deny Permit Network
More information58 10
57 Multi-channel MAC Protocol with Multi-busytone in Ad-hoc Networks Masatoshi Fukushima*, Ushio Yamamoto* and Yoshikuni Onozato* Abstract Multi-channel MAC protocols for wireless ad hoc networks have
More informationOS Windows Vista Windows XP PowerPoint2003 Word2003 (a Test No. OS 1 Windows Vista PPT2003 2 Windows Vista Word2003 3 Windows XP PPT2003 4 Windows XP
C ommunication In embedded softwares, designing a test process that considers how to perform tests in an efficient way, has been an important problem in a whole development process. By the software test,
More information) ,
Vol. 2, 1 17, 2013 1986 A study about the development of the basic policy in the field of reform of China s sports system 1986 HaoWen Wu Abstract: This study focuses on the development of the basic policy
More informationPage 1 of 6 B (The World of Mathematics) November 20, 2006 Final Exam 2006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (10pts) (a
Page 1 of 6 B (The World of Mathematics) November 0, 006 Final Exam 006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (a) (Decide whether the following holds by completing the truth
More information28 SAS-X Proposal of Multi Device Authenticable Password Management System using SAS-X 1195074 2017 2 3 SAS-X Web ID/ ID/ Web SAS-2 SAS-X i Abstract Proposal of Multi Device Authenticable Password Management
More informationTHE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE {s-kasihr, wakamiya,
THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE. 565-0871 1 5 E-mail: {s-kasihr, wakamiya, murata}@ist.osaka-u.ac.jp PC 70% Design, implementation, and evaluation
More information2 1 ( ) 2 ( ) i
21 Perceptual relation bettween shadow, reflectance and luminance under aambiguous illuminations. 1100302 2010 3 1 2 1 ( ) 2 ( ) i Abstract Perceptual relation bettween shadow, reflectance and luminance
More information修士論文
27 Mobile Ad Hoc Networks An Ant-based Routing Algorithm with Multi-phase Pheromone and Power-saving in Mobile Ad Hoc Networks 14T0013 Shohei Miyashita E-mail: shohei.miyashita.4j@stu.hosei.ac.jp : Abstract
More information26 Development of Learning Support System for Fixation of Basketball Shoot Form
26 Development of Learning Support System for Fixation of Basketball Shoot Form 1175094 ,.,,.,,.,,.,,,.,,,,.,,,.,,,,, Kinect i Abstract Development of Learning Support System for Fixation of Basketball
More informationIT,, i
22 Retrieval support system using bookmarks that are shared in an organization 1110250 2011 3 17 IT,, i Abstract Retrieval support system using bookmarks that are shared in an organization Yoshihiko Komaki
More information,,.,.,,.,.,.,.,,.,..,,,, i
22 A person recognition using color information 1110372 2011 2 13 ,,.,.,,.,.,.,.,,.,..,,,, i Abstract A person recognition using color information Tatsumo HOJI Recently, for the purpose of collection of
More informationi
21 Fault-Toleranted Authentication Data Distribution Protocol for Autonomous Distributed Networks 1125153 2010 3 2 i Abstract Fault-Toleranted Authentication Data Distribution Protocol for Autonomous Distributed
More informationSOM SOM(Self-Organizing Maps) SOM SOM SOM SOM SOM SOM i
20 SOM Development of Syllabus Vsualization System using Spherical Self-Organizing Maps 1090366 2009 3 5 SOM SOM(Self-Organizing Maps) SOM SOM SOM SOM SOM SOM i Abstract Development of Syllabus Vsualization
More informationDEIM Forum 2009 C8-4 QA NTT QA QA QA 2 QA Abstract Questions Recomme
DEIM Forum 2009 C8-4 QA NTT 239 0847 1 1 E-mail: {kabutoya.yutaka,kawashima.harumi,fujimura.ko}@lab.ntt.co.jp QA QA QA 2 QA Abstract Questions Recommendation Based on Evolution Patterns of a QA Community
More informationfiš„v8.dvi
(2001) 49 2 333 343 Java Jasp 1 2 3 4 2001 4 13 2001 9 17 Java Jasp (JAva based Statistical Processor) Jasp Jasp. Java. 1. Jasp CPU 1 106 8569 4 6 7; fuji@ism.ac.jp 2 106 8569 4 6 7; nakanoj@ism.ac.jp
More information2
1 2 3 4 5 6 7 8 9 10 I II III 11 IV 12 V 13 VI VII 14 VIII. 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 _ 33 _ 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 VII 51 52 53 54 55 56 57 58 59
More informationuntitled
i ii iii iv v 43 43 vi 43 vii T+1 T+2 1 viii 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 a) ( ) b) ( ) 51
More informationB_01田中.indd
A Study on the Image of the City in Contemporary Korea: Democracy and Busan Satoru Tanaka Abstract Busan has been the biggest harbor city in Korea, and ranked as one of the centers in democratization history
More informationWi-Fi Wi-Fi Wi-Fi Wi-Fi SAS SAS-2 Wi-Fi i
26 A Study on Secure Remote Control Methods 1175078 2015 2 27 Wi-Fi Wi-Fi Wi-Fi Wi-Fi SAS SAS-2 Wi-Fi i Abstract A Study on Secure Remote Control Methods SHINGAI, Tatsuro In recent years, communication
More information20 Method for Recognizing Expression Considering Fuzzy Based on Optical Flow
20 Method for Recognizing Expression Considering Fuzzy Based on Optical Flow 1115084 2009 3 5 3.,,,.., HCI(Human Computer Interaction),.,,.,,.,.,,..,. i Abstract Method for Recognizing Expression Considering
More information21 e-learning Development of Real-time Learner Detection System for e-learning
21 e-learning Development of Real-time Learner Detection System for e-learning 1100349 2010 3 1 e-learning WBT (Web Based training) e-learning LMS (Learning Management System) LMS WBT e-learning e-learning
More informationVol.1 No Autumn
OKAMOTO, Naohisa SATO, Takao 1 1-15m 5TEU 2251% 2 99.8%8 6 16 1,5 14 12 1 8 6 4 2 HongKong Singapore Kaohsiung Pusan Yokohama Kobe 1, 5 6,TEU 5,TEU 4,TEU 3,TEU 2,TEU 1,TEU 1,TEU 1973 1975 1985 1995 65
More information