AC-1 procedure AC-1 (G) begin Q = f(i; j) (i; j) 2 arc(g), i 6= jg repeat begin CHANGE = false for each (i; j) 2 Q do CHANGE = REVISE((i; j)) _ CHANGE
|
|
- さや しばもと
- 5 years ago
- Views:
Transcription
1 AC-5, May 7, 2003 Lecture 3-1, (Local Consistency) 4 1. (Node Consistency) 2. (Arc Consistency) 3. (Path Consistency) m (m-consistency) 4. AC-1 AC-2 (Waltz, ) AC-3 AC-4
2 AC-1 procedure AC-1 (G) begin Q = f(i; j) (i; j) 2 arc(g), i 6= jg repeat begin CHANGE = false for each (i; j) 2 Q do CHANGE = REVISE((i; j)) _ CHANGE until : CHANGE AC-1,, May 7, 2003 Lecture 3-2
3 for each v 2 D i REVISE ArcCons procedure REVISE ((i; j)) begin DELETE = false do if C ij (v,u) u 2 D j then begin Remove(x; D i ) DELETE = true return DELETE REVISE,, May 7, 2003 Lecture 3-3
4 REVISE C ij =) AC-1 O(ed 3 ) AC-1 O(d 2 ) repeat jqj = 2e repeat, 1 1., repeat d.,, May 7, 2003 Lecture 3-4
5 begin i = 1 to n do for = f(i; j) (i; j) 2 arc(g), i < jg Q = f(h; i) (h; i) 2 arc(g), h < ig Q' not EmptyStack(Q) do while not EmptyStack(Q) do while REVISE((k; m)) then if 0, f(p; k) (p; k)2arc(g),pi; p6=mg) push(q = Q 0 ; Q 0 = empty Q AC-2 procedure AC-2 (G) (k; m) = pop(q),, May 7, 2003 Lecture 3-5 AC-2
6 AC-2 AC-2 O(ed 3 ) Waltz ( ) (Constraint propagation) (symbolic relaxation method),, May 7, 2003 Lecture 3-6
7 Waltz, Convex edge Concave edge Boundary, with "stuff" on the right,, May 7, 2003 Lecture 3-7
8 [Winston],, May 7, 2003 Lecture 3-8
9 2 J1 L6 J6 L1 L5 J2 L7 L9 J5 L2 L8 J7 L4 J3 L3 J4 J8 L8 J7 J1 L1 J10 J11 L15 L13 L14 L12 J5 L7 L6 L5 J6 L2 L9 L11 J9 L10 L4 J4 J2 L3 J3,, May 7, 2003 Lecture 3-9
10 {1,3} {+,>},, May 7, 2003 Lecture 3-10
11 {1,3} {+,>} {2,3,4} {+,>} {+,-} {+,-} {+,>} {2,3,4} {+,>} {1,3} {1,3} {+,-} {1,2} {+,>} {2,3,4} {+,>} ,, May 7, 2003 Lecture 3-11
12 {2,3,4} {+,>},, May 7, 2003 Lecture 3-12
13 {2,3,4} {+,>} {+,>} {1,3} {1,3} {+,>} {2,3,4} {2,3} {1,2} {+,-} {+,-} {+,-} {+,-} {+,-} {+,>} {+,>} {+,>} {1,3} {1,3} {+,-} {+,>} {1,3} {2,3,4} {+,-} {+,>} ,, May 7, 2003 Lecture 3-13
14 AC-3 procedure AC-3 (G) begin Q = f(i; j) (i; j) 2 arc(g), i 6= jg while not EmptyQueue(Q) do begin (k; m) = pop(q) if REVISE((k; m)) then Q = Q [ f(i; k) (i; k)2arc(g),i6=k;i6=mg AC-3,, May 7, 2003 Lecture 3-14
15 nx d(e k 0 1) = d(2e 0 n) k=1 AC-3 AC-2, AC-3 REVISE k e k e 0 1 k Q. repeat 1 Q,, 2e + d(2e 0 n), d 2 C ij =) AC-3 O(ed 3 ) REVISE =) (ed 2 ),, May 7, 2003 Lecture 3-15
16 AC-5 AC-5 (generic) ArcCons LocalArcCons AC-3 AC-4 { (functional constraints) { (anti-functional constraints) { (monotonic constraints) { (piecewise functional constraints) { (piecewise anti-functional...) (piecewise monotonic constraints) {, May 7, 2003 Lecture 3-16,
17 i, May 7, 2003 Lecture 3-17, AC-5 Queue AC-5 ((i, j), w) queue. (i, j), w D j (i, j).. Enqueue(j, 1, Q) (i, j) w 2 1 queue Q ((i, j), w). k j C ij D j 1
18 ArcCons LocalArcCons function ArcCons(i,j ) Returns 1 = fv 2 D i j 8u 2 D j :C ij (v; u)g D i 1 (i,j ) consistent D j w function LocalArcCons(i,j,w) Returns 1 s.t where 1 1 = fv 2 D i j C ij ^ 8u 2 D j :C i;j (v; u)g 1 2 = fv 2 D i j 8u 2 D j :C i;j (v; u)g,, May 7, 2003 Lecture 3-18
19 AC-5 procedure AC-5 (G) InitQueue(Q) for each (i; j) 2 arc(g) do 1 = ArcCons(i, j ) Enqueue(i; 1; Q) Remove(1; D i ) while not EmptyQueue(Q) do ((i; j), w) = Dequeue(Q) 1 = LocalArcCons(i, j, w) Enqueue(i; 1; Q) Remove(1; D i ) AC-5, May 7, 2003 Lecture 3-19,
20 { InitQueue Status((k, i), v) = present if v 2 D i AC-5 Status((k, i), v) AC-5 queue \(edge, value)", Status rejected otherwize { EnQueue queue Status = susped { DeQueue queue Status = rejected = present i v 2 D i = susped i v =2 D i ((k, i), v) Q = rejected i v =2 D i ((k, i), v) Q AC-5 enqueue dequeue O(ed) =), May 7, 2003 Lecture 3-20,
21 ArcCons O(d 2 ) =) AC-3 enqueue dequeue O(ed 3 ) AC-3 AC-3 AC-5., LocalArcCons ArcCons,, May 7, 2003 Lecture 3-21
22 ArcCons:O(d 2 ), LocalArcCons:O(d) ) AC-5: O(ed 2 ) AC-4 j 2 u u fug i 2 v v fu; vg 1 w w fv; wg edge O(d 2 ) O(d 2 ) edge O(d) O(d 2 ) LocalArcCons(i; j; w) edge (i; j) w 1., 0 1. ArcCons:O(d 2 ), LocalArcCons:O(d) ) AC-4: O(ed 2 ) =), May 7, 2003 Lecture 3-22,
23 for each v 2 D i f ij (v) =2 D j then 1 = 1 [ fvg if 1 return return fg else LocalArcCons (functional constraints) C D i 8v 2 D fw 2 DjC(v; w)g w 1 ArcCons(i,j ) function = fg 1 bf do ArcCons O(d) ArcCons O(1) LocalArcCons LocalArcCons(i,j,w) AC-5 O(ed) function f ij (v) 2 D j then return ff ij (w)g if,, May 7, 2003 Lecture 3-23
24 3 AC Word List AFT HEEL HOSES 4 5 ALE HIKE SAILS 6 7 EEL KEEL LASER 8 LEE LINE SHEET TIE KNOT STEER,, May 7, 2003 Lecture 3-24
1. 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 f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
More informationMicrosoft PowerPoint - 計算機科学入門2014.pptx
計 算 機 科 学 入 門 (アプリケーション) 九 州 大 学 大 学 院 システム 情 報 科 学 研 究 院 情 報 学 部 門 横 尾 真 Email: yokoo@inf.kyushuu.ac.jp http://agent.inf.kyushuu.ac.jp/~yokoo/ 自 己 紹 介 98 年 東 京 大 学 大 学 院 工 学 系 研 究 科 電 気 工 学 専 門 課 程 修
More information応用数学特論.dvi
1 1 1.1.1 ( ). P,Q,R,.... 2+3=5 2 1.1.2 ( ). P T (true) F (false) T F P P T P. T 2 F 1.1.3 ( ). 2 P Q P Q P Q P Q P or Q P Q P Q P Q T T T T F T F T T F F F. P = 5 4 Q = 3 2 P Q = 5 4 3 2 P F Q T P Q T
More information( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1
() 2006 2 27 1 10 23 () 30 () 27 [1] p.97252 7 2 2.1 2.1.1 1 LIFO(last in first out, ) (push) (pup) 1 1: 2.1.2 1 List 4-1(p.100) stack[] stack top 1 2 (push) (pop) 1 2 void stack push(double val) val stack
More information2 1/2 1/4 x 1 x 2 x 1, x 2 9 3x 1 + 2x 2 9 (1.1) 1/3 RDA 1 15 x /4 RDA 1 6 x /6 1 x 1 3 x 2 15 x (1.2) (1.3) (1.4) 1 2 (1.5) x 1
1 1 [1] 1.1 1.1. TS 9 1/3 RDA 1/4 RDA 1 1/2 1/4 50 65 3 2 1/15 RDA 2/15 RDA 1/6 RDA 1 1/6 1 1960 2 1/2 1/4 x 1 x 2 x 1, x 2 9 3x 1 + 2x 2 9 (1.1) 1/3 RDA 1 15 x 1 + 2 1/4 RDA 1 6 x 1 1 4 1 1/6 1 x 1 3
More informationALG2012-A.ppt
21279 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/212/index.html (, )ε m = n C2 = n ( n 1) / 2 m = n ( n 1) 1 11 11 111 11 111 111 1111 1 1 11 1 11 11 111 4-dimentional
More information第10回 コーディングと統合(WWW用).PDF
10 January 8, 2004 algorithm algorithm algorithm (unit testing) (integrated testing) (acceptance testing) Big-Bang (incremental development) (goto goto DO 50 I=1,COUNT IF (ERROR1) GO TO 60 IF (ERROR2)
More information離散数学
離散数学 グラフ探索アルゴリズム 落合秀也 今日の内容 グラフの連結性 の判定 幅優先探索 幅優先探索の実現方法 深さ優先探索 深さ優先探索の実現方法 木の構造 探索木 パトリシア トライ 2 連結性の判定問題を考える グラフ G(V,E) が与えられたとき G が連結かどうか を判定したい 小さいグラフなら 紙に書いてみればよい 一般には簡単ではない 大きいグラフの場合 コンピュータに判断させる場合
More informationParametric Polymorphism
ML 2 2011/04/19 Parametric Polymorphism Type Polymorphism ? : val hd_int : int list - > int val hd_bool : bool list - > bool val hd_i_x_b : (int * bool) list - > int * bool etc. let hd_int = function (x
More informationD0050.PDF
Excel VBA 6 3 3 1 Excel BLOCKGAME.xls Excel 1 OK 2 StepA D B1 B4 C1 C2 StepA StepA Excel Workbook Open StepD BLOCKGAME.xls VBEditor ThisWorkbook 3 1 1 2 2 3 5 UserForm1 4 6 UsorForm2 StepB 3 StepC StepD
More informationxl 1 program Othello6; 2 {$APPTYPE CONSOLE} 3 uses SysUtils; 4 5 type 6 TMasuNo = 0..99; // 7 TYouso = (Soto,Kara,Kuro,Siro); // 8 TBan = array [TMasu
xl 1 program Othello6; 2 {$APPTYPE CONSOLE 3 uses SysUtils; 4 5 type 6 TMasuNo = 0..99; // 7 TYouso = (Soto,Kara,Kuro,Siro); // 8 TBan = array [TMasuNo] of TYouso; // 10 10 9 TPlayer = Kuro..Siro; // 10
More informationコンピュータ概論
4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For
More informationuntitled
WG 2013 P P P P WG WG P WG 12 12 P P20 200 200 200 200 2011 2012 2012 11 1 2 21 2 2 1 2 2 2 2 1 2 1 2 11 720,450(8.0) 37,845(0.4) 4) 37.7 7 5.4 0.1 8,299,154(91.6)
More informationuntitled
19 - 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 - -
More informationPowerPoint プレゼンテーション
ループ ループとは? ある条件を満たすまで 指定の命令を繰り返す Do... Loop For Next For Each Next While WEnd ループの種類 Do Loop Do While 条件 ステートメント Loop Do ステートメント Loop While 条件 Do Until 条件 ステートメント Loop Do ステートメント Until Loop 条件 Do Loop
More information情報科学概論 第1回資料
1. Excel (C) Hiroshi Pen Fujimori 1 2. (Excel) 2.1 Excel : 2.2Excel Excel (C) Hiroshi Pen Fujimori 2 256 (IV) :C (C 65536 B4 :2 (2 A3 Excel (C) Hiroshi Pen Fujimori 3 Tips: (1) B3 (2) (*1) (3) (4)Word
More informationuntitled
II 4 Yacc Lex 2005 : 0 1 Yacc 20 Lex 1 20 traverse 1 %% 2 [0-9]+ { yylval.val = atoi((char*)yytext); return NUM; 3 "+" { return + ; 4 "*" { return * ; 5 "-" { return - ; 6 "/" { return / ; 7 [ \t] { /*
More informationuntitled
21174 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/211/index.html tech.ac.jp/k1sakai/lecture/alg/211/index.html html (, )ε m = n C2 = n ( n 1) / 2 m = n ( ( n
More informationmr0805.indd
62 MAY 2008 MAY 2008 63 64 MAY 2008 MAY 2008 65 66 MAY 2008 MAY 2008 67 68 MAY 2008 MAY 2008 69 70 MAY 2008 MAY 2008 71 72 MAY 2008 MAY 2008 73 74 MAY 2008 MAY 2008 75 76 MAY 2008 MAY 2008 77 78 MAY 2008
More informationAC-2
AC-1 AC-2 AC-3 AC-4 AC-5 AC-6 AC-7 AC-8 AC-9 * * * AC-10 AC-11 AC-12 AC-13 AC-14 AC-15 AC-16 AC-17 AC-18 AC-19 AC-20 AC-21 AC-22 AC-23 AC-24 AC-25 AC-26 AC-27 AC-28 AC-29 AC-30 AC-31 AC-32 * * * * AC-33
More informationエンジョイ北スポーツ
28 3 20 85132 http://www.kita-city-taikyo.or.jp 85 63 27 27 85132 http://www.kita-city-taikyo.or.jp 2 2 3 4 4 3 6 78 27, http://www.kita-city-taikyo.or.jp 85132 3 35 11 8 52 11 8 2 3 4 1 2 4 4 5 4 6 8
More informationr07.dvi
19 7 ( ) 2019.4.20 1 1.1 (data structure ( (dynamic data structure 1 malloc C free C (garbage collection GC C GC(conservative GC 2 1.2 data next p 3 5 7 9 p 3 5 7 9 p 3 5 7 9 1 1: (single linked list 1
More informationohp07.dvi
19 7 ( ) 2019.4.20 1 (data structure) ( ) (dynamic data structure) 1 malloc C free 1 (static data structure) 2 (2) C (garbage collection GC) C GC(conservative GC) 2 2 conservative GC 3 data next p 3 5
More information¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~alse
I Exercise on Programming I http://bit.ly/oitprog1 1, 2 of 14 ( RD S ) I 1, 2 of 14 1 / 44 Ruby Ruby ( RD S ) I 1, 2 of 14 2 / 44 7 5 9 2 9 3 3 2 6 5 1 3 2 5 6 4 7 8 4 5 2 7 9 6 4 7 1 3 ( RD S ) I 1, 2
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
More informationB Simon (Trump ) SimonU.pas SimonP.dpr Name FormSimon Caption Position podesktopcenter uses Windows, Messages, SysUtils,
B 132 20 1 1 20.1 20.1.1 1 52 10 1 2 3... 7 8 8 8 20.1.2 1 5 6 7 3 20.1.3 1 3 8 20.1.4 13 20.1.5 4 1 (solitaire) B 133 20.2 20.2.1 Simon (Trump ) SimonU.pas SimonP.dpr 20.2.2 Name FormSimon Caption Position
More informationPRESENT STATUS OF SPring-8 PRESENT STATUS OF SPring-8 938 886 772 751 733 643 619 621 582 595 563 562 502 520 457 472 431 424 392 409 380 305 326 258 229 246 198 134 XAFS PRESENT STATUS OF SPring-8 PRESENT
More information1 G K C 1.1. G K V ρ : G GL(V ) (ρ, V ) G V 1.2. G 2 (ρ, V ), (τ, W ) 2 V, W T : V W τ g T = T ρ g ( g G) V ρ g T W τ g V T W 1.3. G (ρ, V ) V W ρ g W
Naoya Enomoto 2002.9. paper 1 2 2 3 3 6 1 1 G K C 1.1. G K V ρ : G GL(V ) (ρ, V ) G V 1.2. G 2 (ρ, V ), (τ, W ) 2 V, W T : V W τ g T = T ρ g ( g G) V ρ g T W τ g V T W 1.3. G (ρ, V ) V W ρ g W W G- G W
More informationExcel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009631 このサンプルページの内容は, 初版 1 刷発行時のものです. Excel URL http://www.morikita.co.jp/books/mid/009631 i Microsoft Windows
More information2 3
RR-XR330 C Matsushita Electric Industrial Co., Ltd.2001 2 3 4 + - 5 6 1 2 3 2 1-3 + + - 22 +- 7 22 8 9 1 2 1 2 1 2 3 12 4 1 2 5 12 1 1 2 3 1 2 1 2 10 11 1 2 $% 1 1 2 34 2 % 3 % 1 2 1 2 3 1 2 12 13 1 2
More informationparser.y 3. node.rb 4. CD-ROM
1. 1 51 2. parser.y 3. node.rb 4. CD-ROM 1 10 2 i 0 i 10 " i i+1 3 for(i = 0; i
More informationfp.gby
1 1 2 2 3 2 4 5 6 7 8 9 10 11 Haskell 12 13 Haskell 14 15 ( ) 16 ) 30 17 static 18 (IORef) 19 20 OK NG 21 Haskell (+) :: Num a => a -> a -> a sort :: Ord a => [a] -> [a] delete :: Eq a => a -> [a] -> [a]
More information0
第 4 書データベース操作 i 4.1 データベースへの接続 (1) データベースチェックポイントの追加 データベースチェックポイントを追加します (2)ODBC による接続 ODBC を使用してデータベースへ接続します SQL 文を手作業で指定する場合 最大フェッチ行数を指定する場合はここで最大行数を指定します ii 接続文字列を作成します 作成ボタンクリック > データソース選択 > データベース接続
More informationO157 6/23 7/4 6 25 1000 117,050 6 14:00~15:30 1 2 22 22 14:30~15:30 8 12 1 5 20 6 20 10 11 30 9 10 6 1 30 6 6 0 30 6 19 0 3 27 6 20 0 50 1 2 6 4 61 1 6 5 1 2 1 2 6 19 6 4 15 6 1 6 30 6 24 30 59
More information取扱説明書
ED-601 ED-501 ED-401 2 3 4 23 14 5 6 18 10 7 1 2 6 3 4 8 9 16 16 16 12 1 2 18 10 2 1 5 12 11 1 2 1 2 12 1 2 13 16 14 3 2 4 1 1 2 16 3 4 18 15 1 2 16 2 3 1 1 2 3 18 17 18 22 19 D A C 20 A B 22 B C D 22
More information2 2 ( M2) ( )
2 2 ( M2) ( ) 2007 3 3 1 2 P. Gaudry and R. Harley, 2000 Schoof 63bit 2 8 P. Gaudry and É. Schost, 2004 80bit 1 / 2 16 2 10 2 p: F p 2 C : Y 2 =F (X), F F p [X] : monic, deg F = 5, J C (F p ) F F p p Frobenius
More informationsyspro-0405.ppt
3 4, 5 1 UNIX csh 2.1 bash X Window 2 grep l POSIX * more POSIX 3 UNIX. 4 first.sh #!bin/sh #first.sh #This file looks through all the files in the current #directory for the string yamada, and then prints
More informationPowerPoint 2002
5.1.1 [ ] [ ] 5 1 5.1.2 [ ] 5 2 5.1.3 [ ] [ ] 5 3 5.1.4 [ ] [ ] [ ] 5 4 5.2.1 [ ] [ ] [ ] [ ] [ ] [] [OK] 5 5 5.2.2 [ ] [ ] [ ] [ ] [ ] [] [ ] [ ] [OK] [OK] 5 6 5.2.3 3-D 3-D [ ] [3-D] 3D 5 7 5.2.4 [Ctrl]
More information橡SPA2000.PDF
XSLT ( ) d-oka@is.s.u-tokyo.ac.jp ( ) hagiya@is.s.u-tokyo.ac.jp XSLT(eXtensible Stylesheet Language Transformations) XML XML XSLT XSLT XML XSLT XML XSLT XML XML XPath XML XSLT XPath XML XSLT,XPath 1 XSLT([6])
More informationRuby Ruby ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( ) 44=>
Ruby Ruby 200779 ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( 2+3+4+5+6+7+8+9 ) 44 irb(main):002:0> irb irb(main):001:0> 1+2+3+4 => 10 irb(main):002:0>
More informationPascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS Pascal
Pascal Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS 2010 10 1 Pascal 2 1.1.......................... 2 1.2.................. 2 1.3........................ 3 2 4 2.1................................
More informationC言語によるアルゴリズムとデータ構造
Algorithms and Data Structures in C 4 algorithm List - /* */ #include List - int main(void) { int a, b, c; int max; /* */ Ÿ 3Ÿ 2Ÿ 3 printf(""); printf(""); printf(""); scanf("%d", &a); scanf("%d",
More informationR による統計解析入門
R May 31, 2016 R R R R Studio GUI R Console R Studio PDF URL http://ruby.kyoto-wu.ac.jp/konami/text/r R R Console Windows, Mac GUI Unix R Studio GUI R version 3.2.3 (2015-12-10) -- "Wooden Christmas-Tree"
More information(Basic Theory of Information Processing) Fortran Fortan Fortan Fortan 1
(Basic Theory of Information Processing) Fortran Fortan Fortan Fortan 1 17 Fortran Formular Tranlator Lapack Fortran FORTRAN, FORTRAN66, FORTRAN77, FORTRAN90, FORTRAN95 17.1 A Z ( ) 0 9, _, =, +, -, *,
More informationhaskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
More informationCopyright c 2006 Zhenjiang Hu, All Right Reserved.
1 2006 Copyright c 2006 Zhenjiang Hu, All Right Reserved. 2 ( ) 3 (T 1, T 2 ) T 1 T 2 (17.3, 3) :: (Float, Int) (3, 6) :: (Int, Int) (True, (+)) :: (Bool, Int Int Int) 4 (, ) (, ) :: a b (a, b) (,) x y
More informationMicrosoft PowerPoint - 06graph3.ppt [互換モード]
I118 グラフとオートマトン理論 Graphs and Automata 担当 : 上原隆平 (Ryuhei UEHARA) uehara@jaist.ac.jp http://www.jaist.ac.jp/~uehara/ 1/20 6.14 グラフにおける探索木 (Search Tree in a Graph) グラフG=(V,E) における探索アルゴリズム : 1. Q:={v { 0 }
More informationuntitled
C -1 - -2 - concept lecture keywords FILE, fopen, fclose, fscanf, fprintf, EOF, r w a, typedef gifts.dat Yt JZK-3 Jizake tsumeawase 45 BSP-15 Body soap set 3 BT-2 Bath towel set 25 TEA-2 Koutya
More informationつくって学ぶプログラミング言語 RubyによるScheme処理系の実装
Ruby Scheme 2013-04-16 ( )! SICP *1 ;-) SchemeR SICP MIT * 1 Structure and Interpretaion of Computer Programs 2nd ed.: 2 i SchemeR Ruby Ruby Ruby Ruby & 3.0 Ruby ii https://github.com/ichusrlocalbin/scheme_in_ruby
More informationSouseki_Rondontou
1 2 3 4 5 6 7 Yow that the beasts do wel behold and se, May deme with ease wherefore here made they be Withe borders wherein 4 brothers' names who list to serche the grovnd. 8 9 The axe was sharp, and
More information.NETプログラマー早期育成ドリル ~VB編 付録 文法早見表~
.NET プログラマー早期育成ドリル VB 編 付録文法早見表 本資料は UUM01W:.NET プログラマー早期育成ドリル VB 編コードリーディング もしくは UUM02W:.NET プログラマー早期育成ドリル VB 編コードライティング を ご購入頂いた方にのみ提供される資料です 資料内容の転載はご遠慮下さい VB プログラミング文法早見表 < 基本文法 > 名前空間の定義 Namespace
More information取扱説明書 [F-02F]
F-02F 4. 2 3 4 5 6 7 8 9 0 2 3 4 5 6 7 8 a b c d a b c d a b cd 9 e a b c d e 20 2 22 ab a b 23 a b 24 c d e 25 26 o a b c p q r s t u v w d h i j k l e f g d m n a b c d e f g h i j k l m n x 27 o
More informationuntitled
1959 TOC 2007 TOC CCPM) TOC OPT 1970 s 1980 s 1990 s 2000 s The New Economics NTT Input Output TOC (Theory Of Constraint) Focus =Not to do The Focusing Steps IDENTIFY the system s constraint(s). Decide
More information( 9 1 ) 1 2 1.1................................... 2 1.2................................................. 3 1.3............................................... 4 1.4...........................................
More informationXpressMemoForDash.dvi
Xpress-MP 1 Ver 1.1 2006. 2. 16 (Ver1.0) 2006. 3. 1 (Ver1.1) 1 2006 3 Xpress-MP Xpress-MP 2006 Xpress-MP,. Dash [1]. mosel,, mosel.,,?, shokosv Xpress-MP,., 2. Example. 1 Xpress-MP 2 mosel 3 mosel 4, shakosv
More information3360 druby Web Who is translating it? http://dx.doi.org/10.1007/s10766-008-0086-1 $32.00 International Journal of PARALLEL PROGRAMING Must buy! http://dx.doi.org/10.1007/s10766-008-0086-1 toruby LT Linux
More information「計算と論理」 Software Foundations その4
Software Foundations 4 cal17@fos.kuis.kyoto-u.ac.jp http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/class/cal/ November 7, 2017 ( ) ( 4) November 7, 2017 1 / 51 Poly.v ( ) ( 4) November 7, 2017 2 / 51 : (
More informationlistings-ext
(6) Python (2) ( ) ohsaki@kwansei.ac.jp 5 Python (2) 1 5.1 (statement)........................... 1 5.2 (scope)......................... 11 5.3 (subroutine).................... 14 5 Python (2) Python 5.1
More information2
1 ア イ 2 3 X1 X2 X3 X4 4 X5 X6 X7 X8 X9 X10 X11 5 X12 X13 X14 X15 X16 X17 X18 X1 X19 X20 X21 X21 6 X22 X23 X24 X25 X26 X19 X15 X27 X28 7 X29 X30 X31 X31 X14 8 X32 X33 X34 X35 X36 9 10 11 12 13 14 15 16
More informationMicrosoft PowerPoint - csp.ppt
知能情報処理制約充足 (1) 制約をみたす意志決定をするエージェント 制約充足問題 (Constraint Satisfaction Problems) 制約充足問題 制約充足アルゴリズム バックトラック法 フォワードチェック 動的変数順序 今回の授業では, と呼ばれる広い範囲に適用可能な問題群の定義とその実例をいろいろ学ぶ. また, そのような問題の解を求める基本的なアルゴリズムとして を理解し,
More information‚å™J‚å−w“LŁñfi~P01†`08
156 2003 2 3 4 5 6 7 8 9 c f c a g 10 d c d 11 e a d 12 a g e 13 d fg f 14 g e 15 16 17 18 19 20 21 db de de fg fg g gf b eb g a a e e cf b db 22 d b e ag dc dc ed gf cb f f e b d ef 23 f fb ed e g gf
More informationw 1 h
9 No.467 SEP. 200214 w 1 h e NEWS NEWS Y r Y t y Y u 1 bf 1 i o !0 d f e Y 1 1 a c 1 !1 7 7 1 !2 e Y 1 de f 1 1 1 !3 1 1 b 71 Y Y Y Y !4 ga Y 7 7 1 E F E A Y u u u u u u u u u u u u u u u u u u u u u u
More information2
Haskell ( ) kazu@iij.ad.jp 1 2 Blub Paul Graham http://practical-scheme.net/trans/beating-the-averages-j.html Blub Blub Blub Blub 3 Haskell Sebastian Sylvan http://www.haskell.org/haskellwiki/why_haskell_matters...
More informationtest.gby
Beautiful Programming Language and Beautiful Testing 1 Haskeller Haskeller 2 Haskeller (Doctest QuickCheck ) github 3 Haskeller 4 Haskell Platform 2011.4.0.0 Glasgow Haskell Compiler + 23 19 8 5 10 5 Q)
More informationII 3 yacc (2) 2005 : Yacc 0 ~nakai/ipp2 1 C main main 1 NULL NULL for 2 (a) Yacc 2 (b) 2 3 y
II 3 yacc (2) 2005 : Yacc 0 ~nakai/ipp2 1 C 1 6 9 1 main main 1 NULL NULL 1 15 23 25 48 26 30 32 36 38 43 45 47 50 52 for 2 (a) 2 2 1 Yacc 2 (b) 2 3 yytext tmp2 ("") tmp2->next->word tmp2 yytext tmp2->next->word
More information2005 D Pascal CASL ( ) Pascal C 3. A A Pascal TA TA TA
2005 D 1 1.1 1.2 Pascal CASL ( ) Pascal 1. 2005 10 13 2006 1 19 12 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA TA TA sdate@ist.osaka-u.ac.jp nakamoto@image.med.osaka-u.ac.jp h-kido@ist.osaka-u.ac.jp m-nakata@ist.osaka-u.ac.jp
More information倫敦塔
JOHAN DECKER T. C. Acorns Ambrose Rose Robert Honeysuckle Henry Geranium G Yow that the beasts do wel behold and se, May deme with ease wherefore here made they be Withe borders wherein 4 brothers
More informationunix15-script2_09.key
UNIX講習会 シェルスクリプト2 31/July/2015 情報管理解析室 西出 浩世 SGE ~/unix15/sge $ cd ~/unix15/sge $ ls script* script2.sh script3.sh script4.sh ~/unix15/sge/results sam 12 $ ls results/*.sam $ rm -r results $ cp -r /usr/local/data/unix15/sge/results.
More information2011.12.3 1 2 Q) A) 3 Q) A) 4 5 6 Haskell 7 8 Parser data Parser a = Parser (String -> [(a,string)]) Parser pwrap :: a -> Parser a pwrap v = Parser $ \inp -> [(v,inp)] Parser pbind :: Parser a -> (a ->
More information1153006 JavaScript try-catch JavaScript JavaScript try-catch try-catch try-catch try-catch try-catch 1 2 2 try-catch try-catch try-catch try-catch 25 1153006 26 2 12 1 1 1 2 3 2.1... 3 2.1.1... 4 2.1.2
More informationh23w1.dvi
24 I 24 2 8 10:00 12:30 1),. Do not open this problem booklet until the start of the examination is announced. 2) 3.. Answer the following 3 problems. Use the designated answer sheet for each problem.
More informationFor_Beginners_CAPL.indd
CAPL Vector Japan Co., Ltd. 目次 1 CAPL 03 2 CAPL 03 3 CAPL 03 4 CAPL 04 4.1 CAPL 4.2 CAPL 4.3 07 5 CAPL 08 5.1 CANoe 5.2 CANalyzer 6 CAPL 10 7 CAPL 11 7.1 CAPL 7.2 CAPL 7.3 CAPL 7.4 CAPL 16 7.5 18 8 CAPL
More informationPSCHG000.PS
a b c a ac bc ab bc a b c a c a b bc a b c a ac bc ab bc a b c a ac bc ab bc a b c a ac bc ab bc de df d d d d df d d d d d d d a a b c a b b a b c a b c b a a a a b a b a
More informationAHPを用いた大相撲の新しい番付編成
5304050 2008/2/15 1 2008/2/15 2 42 2008/2/15 3 2008/2/15 4 195 2008/2/15 5 2008/2/15 6 i j ij >1 ij ij1/>1 i j i 1 ji 1/ j ij 2008/2/15 7 1 =2.01/=0.5 =1.51/=0.67 2008/2/15 8 1 2008/2/15 9 () u ) i i i
More information1/68 A. 電気所 ( 発電所, 変電所, 配電塔 ) における変圧器の空き容量一覧 平成 31 年 3 月 6 日現在 < 留意事項 > (1) 空容量は目安であり 系統接続の前には 接続検討のお申込みによる詳細検討が必要となります その結果 空容量が変更となる場合があります (2) 特に記載
1/68 A. 電気所 ( 発電所, 変電所, 配電塔 ) における変圧器の空き容量一覧 平成 31 年 3 月 6 日現在 < 留意事項 > (1) 空容量は目安であり 系統接続の前には 接続検討のお申込みによる詳細検討が必要となります その結果 空容量が変更となる場合があります (2) 特に記載のない限り 熱容量を考慮した空き容量を記載しております その他の要因 ( 電圧や系統安定度など ) で連系制約が発生する場合があります
More information2009 D Pascal CASL II ( ) Pascal C 3. A A Pascal TA TA
2009 D 1 1.1 1.2 Pascal CASL II ( ) Pascal 1. 2009 10 15 2010 1 29 16 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA enshud@image.med.osaka-u.ac.jp TA enshu-d@image.med.osaka-u.ac.jp nakamoto@image.med.osaka-u.ac.jp
More informationJava (9) 1 Lesson Java System.out.println() 1 Java API 1 Java Java 1
Java (9) 1 Lesson 7 2008-05-20 Java System.out.println() 1 Java API 1 Java Java 1 GUI 2 Java 3 1.1 5 3 1.0 10.0, 1.0, 0.5 5.0, 3.0, 0.3 4.0, 1.0, 0.6 1 2 4 3, ( 2 3 2 1.2 Java (stream) 4 1 a 5 (End of
More informationbdd.gby
Haskell Behavior Driven Development 2012.5.27 @kazu_yamamoto 1 Haskell 4 Mew Firemacs Mighty ghc-mod 2 Ruby/Java HackageDB 3 Haskeller 4 Haskeller 5 Q) Haskeller A) 6 7 Haskeller Haskell 8 9 10 Haskell
More informationスライド 1
isplever CLASIC 1.2 Startup Manual for MACH4000 Rev.1.0 isplever_ CLASIC Startup_for_MACH4000_Rev01.ppt Page: 1 1. Page 3 2. Lattice isplever Design Flow Page 4 3. Page 5 3-1 Page 6 3-2 Page 7 3-3 Page
More information2011 D Pascal CASL II ( ) Pascal C 3. A A Pascal TA TA enshu-
2011 D 1 1.1 1.2 Pascal CASL II ( ) Pascal 1. 2011 10 6 2011 2 9 15 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA enshud@fenrir.ics.es.osaka-u.ac.jp TA enshu-d@fenrir.ics.es.osaka-u.ac.jp higo@ist.osaka-u.ac.jp
More informationHARK Designer Documentation 0.5.0 HARK support team 2013 08 13 Contents 1 3 2 5 2.1.......................................... 5 2.2.............................................. 5 2.3 1: HARK Designer.................................
More informationT rank A max{rank Q[R Q, J] t-rank T [R T, C \ J] J C} 2 ([1, p.138, Theorem 4.2.5]) A = ( ) Q rank A = min{ρ(j) γ(j) J J C} C, (5) ρ(j) = rank Q[R Q,
(ver. 4:. 2005-07-27) 1 1.1 (mixed matrix) (layered mixed matrix, LM-matrix) m n A = Q T (2m) (m n) ( ) ( ) Q I m Q à = = (1) T diag [t 1,, t m ] T rank à = m rank A (2) 1.2 [ ] B rank [B C] rank B rank
More information