I 11
|
|
|
- きみとし みしま
- 4 years ago
- Views:
Transcription
1 I 11
2 2 h
3 3 var strs = ["meijo", "university", "abc", "shiogama","yagoto", "ueda", "hara", "irinaka", "yagoto-nisseki", "kanayama"] function make_table(){ var a = [] for (var i = 0; i < strs.length; i++){ var v = h(strs[i]) a[v] = strs[i] shiogama return a irinaka meijo,,shiogama,,,,irinaka,meijo,,,,,university,,,,,,,,,,,,,,,,,,,,,,,,,,,,h ara,,,,yagoto,,,,,,,,,,,,,kanaya ma,,,,,,,,,,,,ueda,,,,,,,,,,,,,,yago to-nisseki,,,,,,,,,,,,,abc university puts(make_table()) a shiogama irinaka meijo university
4 4 var a = make_table() function search(s){ m = a[h(s)] if (m === undefined) puts(s + " is undefined") else puts(m) irinaka foo is undefined search("irinaka") search("foo") shiogama irinaka meijo university JavaScript == a === shiogama irinaka meijo university
5 5 function delete_element(s){ var val = a[h(s)] if (val === undefined) puts("cannot delete " + s + ".") else{ a[h(s)] = undefined puts("ok. " + s + " has been deleted.") delete_element("irinaka") delete_element("foobar") search("irinaka") ok. irinaka has been deleted. cannot delete foobar. irinaka is undefined
6 6 function h(s){ var n = 0 for (var i = 0; i < s.length; i++){ n = (n * s.charcodeat(i)) % 13 return n var strs = ["meijo", "university", "abc", "shiogama","yagoto", "ueda", "hara", "irinaka", "yagoto-nisseki", "kanayama"] for (var i = 0; i < strs.length; i++){ puts(strs[i] + " : " + h(strs[i])) meijo : 7 university : 4 abc : 8 shiogama : 6 yagoto : 7 ueda : 6 hara : 6 irinaka : 6 yagoto-nisseki : 1 kanayama : 6 shiogama, ueda, hara, irinaka, kanayama
7 7 var strs = ["meijo", "university", "abc", "shiogama","yagoto", "ueda", "hara", "irinaka", "yagoto-nisseki", "kanayama"] function make_table2(){ var a = [] for (var i = 0; i < strs.length; i++){ var v = h(strs[i]) if (a[v] === undefined) a[v] = [strs[i]] else a[v].push(strs[i]) return a puts(make_table2().join(" ")) 4 6 a yagoto-nisseki university shiogama,ueda,hara,irinaka,kan ayama meijo,yagoto abc 7 meijo : 7 university : 4 abc : 8 shiogama : 6 yagoto : 7 ueda : 6 hara : 6 irinaka : 6 yagoto-nisseki : 1 kanayama : 6 8 [yagoto-nisseki] [university] [shiogama, ueda, hara, irinaka, kanayama] [meijo, yagoto] [abc ]
8 8 mn n m i x i E xi E[x 1 + x x m ]=E[x 1 ]+E[x 2 ]+ + E[x m ]=E[n] =n E[x i ]=n/m = α = me[x i ]
9 9 α O(1 + α)
10 10 + 1n 1 n n i=1 1+ i 1 m =1+ 1 nm n (i 1) =1+ α 2 1 i=1 O(2 + α/2 1/2m) 2m
11 11
12 12 h(k) =k mod m m2 10
13 13 p a 0 a 1 a 2 a 3 k = a 0 2 3p + a 1 2 2p + a 2 2 p + a 3 h(k) =k mod (2 p 1) h(k) =a 0 2 p 2 p 2 p + a 1 2 p 2 p + a 2 2 p + a 3 = a a a 2 1+a 3 = a 0 + a 1 + a 2 + a 3
14 14 function h(s){ var sum = 0 var p = 255 for (var i = 0; i < s.length; i++){ var c = s.charcodeat(i) sum = (sum * c) % p return sum function work(s){ puts(s + ": " + h(s)) work("abc") work("bca") work("yamamoto") work("motoyama") abc: 39 bca: 39 yamamoto: 106 motoyama: 106
15 15 function h(s){ var n = 0 for (var i = 0; i < s.length; i++){ n = (n * s.charcodeat(i)) % 31 return n var strs = ["meijo", "university", "abc", "shiogama","yagoto", "ueda", "hara", "irinaka", "yagoto-nisseki", "kanayama"] for (var i = 0; i < strs.length; i++){ puts(strs[i] + " : " + h(strs[i])) meijo : 2 university : 11 abc : 7 shiogama : 16 yagoto : 7 ueda : 5 hara : 8 irinaka : 23 yagoto-nisseki : 6 kanayama : 11
16 16 function add_data(table, data){ var v = h(data) while (table[v]!== undefined){ v = (v + 1) % 31 table[v] = data table 0--> 1--> 2-->meijo 3--> 4--> 5-->ueda 6-->yagoto-nisseki 7-->abc 8-->yagoto 9-->hara 10--> 11-->university 12-->kanayama 13--> 14--> 15--> 16-->shiogama 17--> 18--> 19--> 20--> 21--> 22--> 23-->irinaka 3 meijo : 2 university : 11 abc : 7 shiogama : 16 yagoto : 7 ueda : 5 hara : 8 irinaka : 23 yagoto-nisseki : 6 kanayama : 11
17 17 function add_data(table, data){ var i = 0 while (true){ var v = (h(data) + i + i * i) % 31 c * i + d * i * i if (table[v] === undefined){ table[v] = data return i = i > 1--> 2-->meijo 3--> 4--> 5-->ueda 6-->yagoto-nisseki 7-->abc 8-->hara 9-->yagoto 10--> 11-->university 12--> 13-->kanayama 14--> 15--> 16-->shiogama 17--> 18--> 19--> 20--> 21--> 22--> 23-->irinaka 2 meijo : 2 university : 11 abc : 7 shiogama : 16 yagoto : 7 ueda : 5 hara : 8 irinaka : 23 yagoto-nisseki : 6 kanayama : 11
18 18 function add_data(table, data){ var i = 0 while (true){ var v = (h(data) + i * h2(data)) % 31 if (table[v] === undefined){ table[v] = data return i = i + 1 function h2(s){ var n = 0 for (var i = 0; i < s.length; i++){ n = (n * 22 + s.charcodeat(i)) % 7 return n
19 19 0--> 1--> 2-->meijo 3--> 4--> 5-->ueda 6-->yagoto-nisseki 7-->abc 8-->yagoto 9--> 10--> 11-->university 12--> 13-->kanayama 14-->hara 15--> 16-->shiogama 17--> 18--> 19--> 20--> 21--> 22--> 23-->irinaka 3 meijo : 2 university : 11 abc : 7 shiogama : 16 yagoto : 7 ueda : 5 hara : 8 irinaka : 23 yagoto-nisseki : 6 kanayama : 11
20 20
21 21 function add_data(table, data){ var i = 0 while (true){ var v = h(data, i) if (table[v] === undefined){ table[v] = data return i = i + 1 if (i >= m) break; puts("table is full") function search_data(table, data){ var i = 0 while (true){ var v = h(data, i) if (table[v] === data){ return v i = i + 1 if (i >= m table[v] === undefined) break; return null
22 22 DEL
23
24 24 var pat_table = [] /* * A hash function which outputs values * less than 20,011 */ function h(pat){ var s = 0 for (var i = 0; i < 9; i++){ s = (s * pat[i]) % return s function eq_pat(pat1, pat2){ for (var i = 0; i < 9; i++){ if (pat1[i]!= pat2[i]) return false return true function add_pat(pat, dist){ var v = h(pat) if (pat_table[v] === undefined){ pat_table[v] = [[pat, dist]] return 1 else{ lst = pat_table[v] for (var i = 0; i < lst.length; i++) if (eq_pat(lst[i][0], pat)) return 0 pat_table[v].push([pat, dist]) return 1 function find_pat(pat){ var v = h(pat) if (pat_table[v] === undefined) return -1 else { var lst = pat_table[v] for (var i = 0; i < lst.length; i++) if (eq_pat(lst[i][0], pat)) return lst[i][1] return -1
25 25 function find_zero(pat){ for (var i = 0; i < 9; i++){ if (pat[i] == 0) return i return -1 function work(){ var init_pat = [0, 1, 2, 3, 4, 5, 6, 7, 8] var queue = [[init_pat, 0]] var counter = 0 while (queue.length > 0){ var [pat, dist] = queue.shift() var ddist = find_pat(pat) if (ddist < 0){ add_pat(pat, dist) counter += 1 var p = find_zero(pat) var px = p % 3 var py = Math.floor(p / 3) puts(counter) if (px > 0){ ppat = pat.slice(0) ppat[p] = ppat[p - 1] ppat[p - 1] = 0 queue.push([ppat, dist + 1]) if (px < 2){ ppat = pat.slice(0) ppat[p] = ppat[p + 1] ppat[p + 1] = 0 queue.push([ppat, dist + 1]) if (py > 0){ ppat = pat.slice(0) ppat[p] = ppat[p - 3] ppat[p - 3] = 0 queue.push([ppat, dist + 1]) if (py < 2){ ppat = pat.slice(0) ppat[p] = ppat[p + 3] ppat[p + 3] = 0 queue.push([ppat, dist + 1])
26
Algorithm11
4 I 11 vr = mke_tble() fuctio serch(s){ m = [h(s)] if (m === udefied) puts(s + " is udefied") else puts(m) serch("") serch("foo") foo is udefied JvScript == === 1 h 345 fuctio delete_elemet(s){ vr vl =
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)
JavaScript 1.! DOM Ajax Shelley Powers,, JavaScript David Flanagan, JavaScript 2
JavaScript (2) 1 JavaScript 1.! 1. 2. 3. DOM 4. 2. 3. Ajax Shelley Powers,, JavaScript David Flanagan, JavaScript 2 (1) var a; a = 8; a = 3 + 4; a = 8 3; a = 8 * 2; a = 8 / 2; a = 8 % 3; 1 a++; ++a; (++
haskell.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]
Ⅰ．市場リスクの計測手法
1 2 3 4 { } n n 5 R R R R 1 6 7 8 9 , 10 11 12 13 14 15 T 16 T 17 18 19 20 21 22 23 99VaR 99 24 25 26 0.5 0.5 27 99 28 99 99 29 99 30 31 t-1 t-1 t-1 t-1 t-10 t-10 t-10 t-10 32 33 2 T 2 34 99 99 99 35 36
平塚信用金庫の現況 2015
2015 1 2 3 1 2 3 4 5 6 7 1 2 3 4 5 8 9 @ A B C D E F G H I J K HK L M N O P Q R T R T S T U V W 1 2 3 4 5 6 E F C J I O M N K L H 8 7 G D 0 A 6 9 5
Taro13-第６章（まとめ）.PDF
% % % % % % % % 31 NO 1 52,422 10,431 19.9 10,431 19.9 1,380 2.6 1,039 2.0 33,859 64.6 5,713 10.9 2 8,292 1,591 19.2 1,591 19.2 1,827 22.0 1,782 21.5 1,431 17.3 1,661 20.0 3 1,948 1,541 79.1 1,541 79.1
ML Edinburgh LCF ML Curry-Howard ML ( ) ( ) ( ) ( ) 1
More Logic More Types ML/OCaml GADT Jacques Garrigue ( ) Jacques Le Normand (Google) Didier Rémy (INRIA) @garriguejej ocamlgadt ML Edinburgh LCF ML Curry-Howard ML ( ) ( ) ( ) ( ) 1 ( ) ML type nebou and
1. 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
情報科学概論 第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
1 2 3 4 5 6 X Y ABC A ABC B 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 13 18 30 P331 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 51 52 53 54 55 56 57 58 59
26 2 3 4 5 8 9 6 7 2 3 4 5 2 6 7 3 8 9 3 0 4 2 4 3 4 4 5 6 5 7 6 2 2 A B C ABC 8 9 6 3 3 4 4 20 2 6 2 2 3 3 4 4 5 5 22 6 6 7 7 23 6 2 2 3 3 4 4 24 2 2 3 3 4 4 25 6 2 2 3 3 4 4 26 2 2 3 3 27 6 4 4 5 5
mogiJugyo_slide_full.dvi
a 2 + b 2 = c 2 (a, b, c) a 2 a 2 = a a a 1/ 78 2/ 78 3/ 78 4/ 78 180 5/ 78 http://www.kaijo.ed.jp/ 6/ 78 a, b, c ABC C a b B c A C 90 a 2 + b 2 = c 2 7/ 78 C a b a 2 +b 2 = c 2 B c A a 2 a a 2 = a a 8/
第 2 部 JavaScript 編 17 演習の答え 17.1( 演習 3-3)1 列目の width を 200px 2 列目を 300px にしなさい pr3-3.html <title> </title> <table border="1" style="border-collapse:co
付録 第 2 部 JavaScript 編 17 演習の答え 17.1( 演習 3-3)1 列目の width を 200px 2 列目を 300px にしなさい pr3-3.html
1 2 3 1 34060120 1,00040 2,000 1 5 10 50 2014B 305,000140 285 5 6 9 1,838 50 922 78 5025 50 10 1 2
0120-563-506 / 9001800 9001700 123113 0120-860-777 163-8626 6-13-1 Tel.03-6742-3111 http://www.himawari-life.co.jp 1 2 3 1 34060120 1,00040 2,000 1 5 10 50 2014B 305,000140 285 5 6 9 1,838 50 922 78 5025
syuryoku
248 24622 24 P.5 EX P.212 2 P271 5. P.534 P.690 P.690 P.690 P.690 P.691 P.691 P.691 P.702 P.702 P.702 P.702 1S 30% 3 1S 3% 1S 30% 3 1S 3% P.702 P.702 P.702 P.702 45 60 P.702 P.702 P.704 H17.12.22 H22.4.1
土壌環境行政の最新動向（環境省 水・大気環境局土壌環境課）
201022 1 18801970 19101970 19201960 1970-2 1975 1980 1986 1991 1994 3 1999 20022009 4 5 () () () () ( ( ) () 6 7 Ex Ex Ex 8 25 9 10 11 16619 123 12 13 14 5 18() 15 187 1811 16 17 3,000 2241 18 19 ( 50
untitled
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] { /*
8 if switch for while do while 2
(Basic Theory of Information Processing) ( ) if for while break continue 1 8 if switch for while do while 2 8.1 if (p.52) 8.1.1 if 1 if ( ) 2; 3 1 true 2 3 false 2 3 3 8.1.2 if-else (p.54) if ( ) 1; else
平成20年5月 協会創立50年の歩み 海の安全と環境保全を目指して 友國八郎 海上保安庁 長官 岩崎貞二 日本船主協会 会長 前川弘幸 JF全国漁業協同組合連合会 代表理事会長 服部郁弘 日本船長協会 会長 森本靖之 日本船舶機関士協会 会長 大内博文 航海訓練所 練習船船長 竹本孝弘 第二管区海上保安本部長 梅田宜弘
![Œ{Ł¶/1ŒÊ −ªfiª„¾ [ 1…y†[…W ]](/thumbs/50/26134150.jpg "Œ{Ł¶/1ŒÊ −ªfiª„¾ [ 1…y†[…W ]")
VDM-SL VDM VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web bool
VDM-SL VDM++ 23 6 28 VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web 2 1 3 1.1............................................... 3 1.1.1 bool......................................... 3 1.1.2 real rat int
/* do-while */ #include <stdio.h> #include <math.h> int main(void) double val1, val2, arith_mean, geo_mean; printf( \n ); do printf( ); scanf( %lf, &v
1 http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html kota@fbs.osaka-u.ac.jp /* do-while */ #include #include int main(void) double val1, val2, arith_mean, geo_mean; printf( \n );
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/97/134738565.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬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
学校では教えてくれないアセットバンドル
Unity Technologies Japan Developer Relationship Engineer Yusuke Ebata Unity 5.3 Unity ICON:designed by Freepik 1 AssetBundle.CreateFromMemory AssetBundle.CreateFromFile WWW.LoadFromCacheOrDownload LoadFromCacheOrDonwload
Java学習教材
Java 2016/4/17 Java 1 Java1 : 280 : (2010/1/29) ISBN-10: 4798120987 ISBN-13: 978-4798120980 2010/1/29 1 Java 1 Java Java Java class FirstExample { public static void main(string[] args) { System.out.println("
untitled
20 20 6 30 18 30 20 30 1 1 1 2 3 10 2 2 2 22 6 29 2 7 1 2 11 3 21 2 4 6 3 5 9 6 22 2 2 6 7 2 1 16 10 1 16 10 10 2 4 3 3 A4 3 1 2 3 1 55 8 4 63 11 4 8 8 4 8 12 2 17 11 4 4 4 8 12 3 5 4 8 4 12 5 5 6 19 2
Parametric 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
離散数理工学 第 2回 数え上げの基礎：漸化式の立て方
2 okamotoy@uec.ac.jp 2015 10 20 2015 10 18 15:29 ( ) (2) 2015 10 20 1 / 45 ( ) 1 (10/6) ( ) (10/13) 2 (10/20) 3 ( ) (10/27) (11/3) 4 ( ) (11/10) 5 (11/17) 6 (11/24) 7 (12/1) 8 (12/8) ( ) (2) 2015 10 20
untitled
JavaScript HP JavaScript JavaScript Web JavaScript Web JavaScript JavaScript JavaScript HTML HTML HTML JavaScript 1. JavaScript ON/OFF 2. JavaScript 3. 4. 5. 6. 7. 8. 9. 10. if 11. if 12. switch 13. 14.
Designer サンプル
Designer AEM 6.2 Forms https://helpx.adobe.com/jp/legal/legal-notices.html 4 ...................................1........................................ 1...............................................
(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, _, =, +, -, *,
明解Javaによるアルゴリズムとデータ構造
21 algorithm List 1-1 a, b, c max Scanner Column 1-1 List 1-1 // import java.util.scanner; class Max3 { public static void main(string[] args) { Scanner stdin = new Scanner(System.in); Chap01/Max3.java
ALG ppt
2012 6 21 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2012/index.html 1 l l O(1) l l l 2 (123 ) l l l l () l H(k) = k mod n (k:, n: ) l l 3 4 public class MyHashtable
r07.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
ohp07.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
GIMP
(JavaScript ) Javascript 1. 2 2. 3. A, K, Q, J, 10, 9, 8, 7, 4. 5. 6. 7. J Q K A 8. 9. 6 10. 11. 12. 13. A- K- Q- J- 10-9 8 7 JavaScript.png 1 GIMP 200 300 2 var ctx; function init()
untitled
2011 6 20 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2011/index.html tech.ac.jp/k1sakai/lecture/alg/2011/index.html html 1 O(1) O(1) 2 (123) () H(k) = k mod n
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 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)
CodeIgniter Con 2011, Tokyo Japan, February
CodeIgniter Con 2011, Tokyo Japan, February 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 http://www.iviking.org/fx.php/ 25 26 10 27 28 29 30 31
GIMP
(JavaScript ) Javascript 2 1. 2 2. 52 3. A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3, 2 4. 13 5. 6. 7. 8. 9. 13 10. 11. 12. JavaScript.png 1 GIMP 200 300 2 var ctx; function init() { var
1153006 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
コンピュータ概論
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
javascript key
Associate Professor Department of International Social Studies KYOAI GAKUEN UNIVERSITY Email: ogashiwa@c.kyoai.ac.jp, ogashiwa@wide.ad.jp sample
Hasegawa_pacsec.pptx
NetAgent Co., Ltd. 自己 長谷 自己 用 行 ff http://developer.android.com/about/dashboards/index.html 示 示 示 h"p://media.admob.com/sdk core v40.js 入 言 // MainActivity.java public class foo{... public void method(
fp.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]
double float
2015 3 13 1 2 2 3 2.1.......................... 3 2.2............................. 3 3 4 3.1............................... 4 3.2 double float......................... 5 3.3 main.......................
# let rec sigma (f, n) = # if n = 0 then 0 else f n + sigma (f, n-1);; val sigma : (int -> int) * int -> int = <fun> sigma f n ( : * -> * ) sqsum cbsu
II 4 : 2001 11 7 keywords: 1 OCaml OCaml (first-class value) (higher-order function) 1.1 1 2 + 2 2 + + n 2 sqsum 1 3 + 2 3 + + n 3 cbsum # let rec sqsum n = # if n = 0 then 0 else n * n + sqsum (n - 1)
R による統計解析入門
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"
JavaScript の使い方
JavaScript Release10.5 JavaScript NXJ JavaScript JavaScript JavaScript 2 JavaScript JavaScript JavaScript NXJ JavaScript 1: JavaScript 2: JavaScript 3: JavaScript 4: 1 1: JavaScript JavaScript NXJ Static
class IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value =
Part2-1-3 Java (*) (*).class Java public static final 1 class IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value
ML λ λ 1 λ 1.1 λ λ λ e (λ ) ::= x ( ) λx.e (λ ) e 1 e 2 ( ) ML λx.e Objective Caml fun x -> e x e let 1
2005 sumii@ecei.tohoku.ac.jp 2005 6 24 ML λ λ 1 λ 1.1 λ λ λ e (λ ) ::= x ( ) λx.e (λ ) e 1 e 2 ( ) ML λx.e Objective Caml fun x -> e x e let 1 let λ 1 let x = e1 in e2 (λx.e 2 )e 1 e 1 x e 2 λ 3 λx.(λy.e)
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/104/163649169.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 12 of 14 ( RD S ) I 12 of 14 1 / 35 https://bit.ly/oitprog1 ( RD S ) I 12 of 14 2 / 35 game.rb ( RD S ) I 12 of 14 3 / 35 game.rb 11 ( ) 1 require "io/console"
読めば必ずわかる 分散分析の基礎 第２版
2 2003 12 5 ( ) ( ) 2 I 3 1 3 2 2? 6 3 11 4? 12 II 14 5 15 6 16 7 17 8 19 9 21 10 22 11 F 25 12 : 1 26 3 I 1 17 11 x 1, x 2,, x n x( ) x = 1 n n i=1 x i 12 (SD ) x 1, x 2,, x n s 2 s 2 = 1 n n (x i x)
listings-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
memo
計数工学プログラミング演習 ( 第 5 回 ) 2017/05/09 DEPARTMENT OF MATHEMATICAL INFORMATICS 1 内容 文字列 双方向リスト ハッシュ 2 文字列 文字列は char の配列 char name[] = ABC ; name は ABC を格納するのに十分な長さの配列 長さは, 文字列の長さ + 1 ( 終端記号用 ) char name[4]
新・明解Ｃ言語で学ぶアルゴリズムとデータ構造
第 1 章 基本的 1 n 141 1-1 三値 最大値 algorithm List 1-1 a, b, c max /* */ #include int main(void) { int a, b, c; int max; /* */ List 1-1 printf("\n"); printf("a"); scanf("%d", &a); printf("b"); scanf("%d",
1_cover
BetweenAS3 Updater Spark Project #APMT 2009.9.11 TAKANAWA Tomoaki ( http://nutsu.com ) http://www.libspark.org/svn/as3/betweenas3/tags/alpha-r3022/ public static function tween(...):iobjecttween { var
f(x) x S (optimal solution) f(x ) (optimal value) f(x) (1) 3 GLPK glpsol -m -d -m glpsol -h -m -d -o -y --simplex ( ) --interior --min --max --check -
GLPK by GLPK http://mukun mmg.at.infoseek.co.jp/mmg/glpk/ 17 7 5 : update 1 GLPK GNU Linear Programming Kit GNU LP/MIP ILOG AMPL(A Mathematical Programming Language) 1. 2. 3. 2 (optimization problem) X
X 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
2 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
1 Ex Ex. 2 2
I 20 100 85 40 85 PDF Windows TA ruby TA6 2 8 1. 2. PDF 3. PDF 1 Ex. 1 2 2 Ex. 2 2 2 Ex. 3 seisu = Array.new(3, 0) seisu[0] = gets.chomp.to_i seisu[1] = gets.chomp.to_i seisu[2] = gets.chomp.to_i wa =
Copyright 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
18 5 10 1 1 1.1 1.1.1 P Q P Q, P, Q P Q P Q P Q, P, Q 2 1 1.1.2 P.Q T F Z R 0 1 x, y x + y x y x y = y x x (y z) = (x y) z x + y = y + x x + (y + z) = (x + y) + z P.Q V = {T, F } V P.Q P.Q T F T F 1.1.3
1. はじめにこのドキュメントは IBMi 上のデータを HTML のテーブルで表示するためのカスタマイズ方法について説明するものです この手法を用いることで スムーズなスクロールによる照会画面 (HTML のテーブル ) を 5250 画面に挿 することが出来ます ( 下図参照 ) なお このドキ
目次 1. はじめに... 2 2. カスタマイズ方法... 4 2.1. 静的テーブルを使ったカスタマイズ方法... 4 2.2. 動的テーブルを使ったカスタマイズ方法... 6 2.3. 動的テーブルを使ったカスタマイズ方法 ( あいまい検索の実装 )... 8 2.4. ヘッダーを固定したスクロール テーブルのカスタマイズ方法... 12 2.5. テーブル内のデータを axes カスタマイズ画面で使用する方法...
SystemC言語概論
SystemC CPU S/W 2004/01/29 4 SystemC 1 SystemC 2.0.1 CPU S/W 3 ISS SystemC Co-Simulation 2004/01/29 4 SystemC 2 ISS SystemC Co-Simulation GenericCPU_Base ( ) GenericCPU_ISS GenericCPU_Prog GenericCPU_CoSim
東京工業大学情報理工学院 AO 入試 活動実績報告書 氏名 ( よみ ): 大岡山花子 ( おおおかやまはなこ ) 高等学校 : 県立 高等学校 (2019 年 3 月 卒業 卒業予定 ) 活動実績概要 (150 字程度 ): JavaScript ではコールバックを多用することがある. これはプロ
東京工業大学情報理工学院 AO 入試 活動実績報告書 氏名 ( よみ ): 大岡山花子 ( おおおかやまはなこ ) 高等学校 : 県立 高等学校 (2019 年 3 月 卒業 卒業予定 ) 活動実績概要 (150 字程度 ): JavaScript ではコールバックを多用することがある. これはプログラム全体の見通しを悪くするため, コールバック地獄と呼ばれる. そこで JavaScript でコールバック地獄が起こる原因と既存の解決方法について調査した.
1958 1984 1985 1 1985 1987 1987 1992 2004 j - 1996 j 1996 12 j 1997 6 1997 j 1998 6 j 1998 6 j 1998 9 1998 2000 2-01 j 2000. 12 2000.7.24 2001 2001.12
1958 1984 1985 1 1985 1987 1987 1992 2004 j - 1996 j 1996 12 j 1997 6 1997 j 1998 6 j 1998 6 j 1998 9 1998 2000 2-01 j 2000. 12 2000.7.24 2001 2001.12 2002.4 2002 2003.9 2003 2004 2005. 2006 2007.11 2008
r3.dvi
00 3 2000.6.10 0 Java ( 7 1 7 1 GSSM 1? 1 1.1 4 4a 4b / / 0 255 HTML X 0 255 16 (0,32,255 #0020FF Java xclock -bg #0020FF xclock ^C (Control C xclock 4c 1 import java.applet.applet; import java.awt.*;
第7回 Javascript入門
Slide URL https://vu5.sfc.keio.ac.jp/slide/ Web 情報システム構成法第 8 回 JavaScript 入門 萩野達也 (hagino@sfc.keio.ac.jp) 1 Web ページの構成要素 直交技術を組み合わせる 内容 スタイル ( 表現方法 ) プログラミング スタイル プログラミング JavaScript CSS Web ページ Web 文書
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 /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
d_appendixB-asp10appdev.indd
付録 B jquery Visual Studio 00 ASP.NET jquery ASP.NET MVC Scripts jquery jquery-...js jquery jquery とは jquery JavaScript JavaScript jquery Ajax HTML 図 B- jqurey とブラウザの関係 Visual Studio 00 jquery JavaScript
コーディング基準.PDF
Java Java Java Java.java.class 1 private public package import / //////////////////////////////////////////////////////////////////////////////// // // // // ////////////////////////////////////////////////////////////////////////////////
Ｃ言語によるアルゴリズムとデータ構造
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",
r2.dvi
15 2 1 2015.6.2 ( ( ( Ruby ( ( https://www.ruby-lang.org/ja/documentation/ 2 Chris Pine,, 2,, 2010. Yugui, Ruby,, 2008. Ruby 1 ( Ruby ( 2 ( i i j ( ) /( (regular expression Ruby /.../ ( 1 if / / =~ =~
exec.dvi
2018 c 6, Mini-C C++ 6211 611, 61, print,,, (run ),,, (int ), 7, x, x "a" 3 "b" 4 "x" 10 (, ), x STL map 1 + 2, 1 2,, x = ;, 1, 2 x { 1 ; 2 ; ; m, if ( ) { 1 else { 2, 1,, 2 0, 1, 3 0, 2,,, main 6 1 ,,
第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)