2008chom.pdf
|
|
- ぜんま あきくぼ
- 4 years ago
- Views:
Transcription
1 CHomP Pawe l Pilarczyk 1 CHomP Computational Homology Project [3] OS Windows Mac Unix Linux [3] CHomP [3] 2 3 CHomP CHomP 4 5 C++ [1] 2 CHomP 1 2 K 1 = { A 1 A 2 A 3, A 1 A 2, A 2 A 3, A 1 A 3, A 3 A 4, A 1, A 2, A 3, A 4, A 5 }, K 2 = { A 1 A 2, A 2 A 3, A 1 A 3, A 3 A 4, A 1, A 2, A 3, A 4, A 5 } K = {s i i = 1,,N} K = N i=1 s i CHomP homsimpl 1(a) (b) A i i 1
2 (a) K 1 (b) K 2 1: ; (a) sc1.txt {1,2,3} {3,4} {5} ; (b) sc2.txt {1,2} {2,3} {1,3} {3,4} {5} homsimpl 1(a) A 1 A 2, A 2 A 3, A 1 A 3, A 1, A 2, A 3, A 4 CHomP ; filename homsimpl filename 2 (a) homsimpl sc1.txt (b) homsimpl sc2.txt 2: (a) H 0 (K 1 ) = Z 2, (b) H 0 (K 2 ) = Z 2, H 1 (K 2 ) = Z (a) (b) 2 (b) 1 A 1,A 2,A 3 2
3 homsimpl CHomP homsimpl filename1 filename2 homsimpl -g homsimpl filename1 -g filename2 homsimpl homsimpl K 1 K 2 K 1 H (K 1,K 2 ) homsimpl K 1 filename1 K 2 filename2 homsimpl filename1 filename2 3 Computational Homology Project X R n Q = I 1 I 2 I n I i = [l i,l i + 1] [l i,l i ], l i Z m X = Q k, Q k : k=1 n 2 3
4 ; (I) n [l 1,l 1 + 1] [l n,l n + 1] (l 1,,l n ) 3 fullcubes.txt fullcubes.txt (1,2) (2,1) (2,3) (3,2) (5,2) 3: (1,2) (2,1) 3 (II) k [l 1,l 1 + 1] [l k 1,l k 1 + 1] [l k,l k ] [l k+1,l k+1 + 1] [l n,l n + 1] [l 1,l 1 +1] x x [l k 1,l k 1 +1] x [l k,l k ] x [l k+1,l k+1 +1] x x [l n,l n +1] [(l 1,,l k 1,l k,l k+1,,l n ) (l 1 +1,,l k 1 +1,l k,l k+1 +1,,l n +1)] 2 x 2 4 reducubes.txt CHomP chomp 3 4 filename 4
5 ; reducubes.txt [1,2] x [2,3] [(1,2) (2,3)] [2] x [3,4] [(2,3) (2,4)] [2,3] x [2] [(2,2) (3,2)] [2,3] x [4] [(2,4) (3,4)] [3] x [2,3] [(3,2) (3,3)] [3] x [3,4] [(3,3) (3,4)] [5] x [2] [(5,2) (5,2)] 4: chomp filename 2, 1, 0 MM CR PP --engine chomp filename --engine MM CR CHomP homcubes homcubes filename homsimpl homcubes filename1 -g filename2 filename2 homsimpl homcubes A.txt B.txt H (A B,B) CHomP bitmap 2 (I) bmp2pset bitmap picture.bmp bmp2pset picture.bmp picture.txt 5
6 picture.bmp picture.txt homcubes bitmap (0 255) bmp2pset -t -t 4 (X,A) (Y,B), (A X,B Y ) f : (X,A) (Y,B), f(a) B CHomP [1][2] X,Y,A,B X, Y, A, B X Y F : X Y X Q i Y f : X Y Q X f(q) F(Q) F f f f : H (X,A) H (Y,B) F : X Y F(Q) F(A) B F [1][2] 1 Q i R Q i R X F(R) F : X Y F(Q) CHomP 2 1 X Q {Q 1,...,Q n } Y (1,2) -> {(4,1) (4,2) (5,1) (5,2) (6,1) (6,2)} 5 F ( [1, 2] [2, 3] ) = { [4,5] [1, 2], [4,5] [2, 3], [5, 6] [1, 2], [5, 6] [2, 3], [6, 7] [1,2], [6, 7] [2, 3] } 2 Q F(Q) X 5 6
7 5: Q f F [(1,2)(2,3)] [(4,1)(7,3)] 1 2 X F homcubes f F : (X, A) (Y, B) F, X, A, Y, B 5 A = B = 3 H (X,A),H (Y,B) homcubes F.map X.cub A.cub Y.cub B.cub -g XA.gen -g YB.gen XA.gen,YB.gen H (X,A),H (Y,B) CHomP chkmvmap homcubes F.map X.cub,A.cub,Y.cub,B.cub chkmvmap F.map X.cub A.cub Y.cub B.cub 5 C++ CHomP C++ chomp homcubes CHomP 7
8 5.1 chomp C++ bitmap chomp engine 6: bitmap bitmap n bitmap R d [0,n 1 ] [0,n d ] n 1,,n d n bitmap (0,,0) n n d void ComputeBettiNumbers (const void *buffer, int *sizes, int dim, int *result, const char *engine = 0, const int *wrapping = 0, bool quiet = false); CubicalSet ComputeBettiNumbers bitmap CHomP CubicalSet CubicalSet [n 1,n+ 1 ] [n d,n+ d ] d n 1,...,n d n+ 1,...,n+ d Add Delete (k 1,...,k d ) 8
9 n i k i < n + i void ComputeBettiNumbers (const CubicalSet &s, int *result, const char *engine = 0, bool quiet = false); 1 1 CubicalSet 01 #include <iostream> 02 #include "capd/homengin/cubiset.h" int main () 05 { 06 int left coords [] = {-6, -5, 0}; 07 int right coords [] = {6, 1, 4}; 08 CubicalSet Q (left coords, right coords, 3); int cube1 [] = {1, -5, 0}; 11 Q. Add (cube1); 12 int cube2 [] = {5, -2, 2}; 13 Q. Add (cube2); int betti [4]; 16 ComputeBettiNumbers (Q, betti, "MM CR", true); 17 for (int i = 0; i < 4; ++ i) 18 std::cout << (i? " " : "") << betti [i]; 19 std::cout << \n ; 20 return 0; 21 } 5.2 chomp::homology coordinate 16 short int [ 32768, 32767] Cube SetOfCubes Cube R d Cube coord dim SetOfCubes add remove SetOfCubes 9
10 check SetOfCubes X (X,A) Homology 2 2 Cube SetOfCubes 01 #include <iostream> 02 #include "chomp/homology/homology.h" using namespace chomp::homology; int main () 07 { 08 coordinate coords1 [] = {1, -5, 0}; 09 Cube Q (coords1, 3); 10 SetOfCubes S; 11 S. add (Q); 12 coordinate coords2 [] = {5, -2, 2}; 13 S. add (Cube (coords2, 3)); Chain hom = 0; 16 int maxlevel = Homology (S, "S", hom); 17 for (int q = 0; q <= maxlevel; ++ q) 18 std::cout << (q? " " : "") << BettiNumber (hom [q]); 19 std::cout << \n ; 20 delete [] hom; 21 return 0; 22 } CubicalCell CubicalComplex R d CubicalCell Cube CubicalComplex add C dim k [] C[k] CubicalComplex Homology CubicalMap CubicalMap Q Cube F CubicalMap SetOfCubes F[Q] add = CubicalMap Homology 10
11 [1] T. Kaczynski, K. Mischaikow, and M. Mrozek, Computational Homology, Applied Mathematical Science Vol. 157, Springer, [2] K. Mischaikow, M. Mrozek, P. Pilarczyk, Graph approach to the computation of the homology of continuous maps, Foundations of Computational Mathematics 5 (2005) [3] 11
kokyuroku.dvi
On Applications of Rigorous Computing to Dynamical Systems (Zin ARAI) Department of Mathematics, Kyoto University email: arai@math.kyoto-u.ac.jp 1 [12, 13] Lorenz 2 Lorenz 3 4 2 Lorenz 2.1 Lorenz E. Lorenz
More informationprogrammingII2019-v01
II 2019 2Q A 6/11 6/18 6/25 7/2 7/9 7/16 7/23 B 6/12 6/19 6/24 7/3 7/10 7/17 7/24 x = 0 dv(t) dt = g Z t2 t 1 dv(t) dt dt = Z t2 t 1 gdt g v(t 2 ) = v(t 1 ) + g(t 2 t 1 ) v v(t) x g(t 2 t 1 ) t 1 t 2
More informationcpp1.dvi
2017 c 1 C++ (1) C C++, C++, C 11, 12 13 (1) 14 (2) 11 1 n C++ //, [List 11] 1: #include // C 2: 3: int main(void) { 4: std::cout
More information2008 DS T050049
DS T050049. PSP DS DS DS RPG DS OS Windows XP DevkiPro OS DS CPU ARM devkitarm MSYS MinGW MSYS MinGW Unix OS C++ C++ make nds nds DS DS micro SD Card nds DS DS DS nds C Java C++ nds nds DS 2008 DS T050049
More information1 C STL(1) C C C libc C C C++ STL(Standard Template Library ) libc libc C++ C STL libc STL iostream Algorithm libc STL string vector l
C/C++ 2007 6 18 1 C STL(1) 2 1.1............................................... 2 1.2 stdio................................................ 3 1.3.......................................... 10 2 11 2.1 sizeof......................................
More information: CR (0x0d) LF (0x0a) line separator CR Mac LF UNIX CR+LF MS-DOS WINDOWS Japan Advanced Institute of Science and Technology
I117 8 1 School of Information Science, Japan Advanced Institute of Science and Technology : CR (0x0d) LF (0x0a) line separator CR Mac LF UNIX CR+LF MS-DOS WINDOWS Japan Advanced Institute of Science and
More information北米アジャイル界デビュー fkinoからは 何も聞いてませんでした これまでに書いたもの Web 2.0 ビギナーズバイブル エンジニアマインド vol.5 開発の現場 vol.011 Dave 達人 Thomasも云ってたよ http://jp.rubyist.net/rubykaigi2007/?c=plugin;plugin=attach_download;p=program0610;file_name=the_island_of_ruby_j.pdf
More informationdesign_pattern.key
#include void init(int* ary, int size) for (int i = 0; i < size; ++i) ary[i] = i; void mul10(int* ary, int size) for (int i = 0; i < size; ++i) ary[i] *= 10; void dispary(int* ary, int size)
More information基礎プログラミング2015
応用プログラミング 第 4 回 ファイル操作 2017 年 10 月 11 日 ( 水 ) 第 6 章 ファイル操作 標準入出力とファイル (P.50) これまでのプログラム 入力 : キーボード 出力 : ディスプレイ Input an integer 1024 1024 標準入出力とファイル (P.50) 今回のプログラム 入力 : ファイル ( の内容 ) 出力 : ファイル Input a
More information89 91 93 95 97 99 101 103 105 107 109 111 113 115 H 117 119 l l 121 l l 123 125 127 129 l l l l 131 kl kl kl kl 133 135 137 139 141 143 145 147 149 151 153 155 157 159
More information株式会社日清製粉グループ本社 第158期中間事業報告書
C O N T E N T S...1...3...5...7...9...11...12...13...14 1 2 3 4 3.7% 5.8% 8.5% 70,100kL 81.2% 0.8% 25 20 15 10 5 0 9.18 9.54 9.74 9.62 9.65 9.71 21.04 21.97 22.44 22.23 8.54 22.31 22.45 20.41 15 12 9 6
More informationuntitled
C++2 1. publicprivate 2. 3. 4. 5. Intelligent Electronic Systems Group protected Carmainmy_car.car_number ca_number //Car class Car int car_number; // void showgas( ); // double gas; // void shownumber(
More information解きながら学ぶC++入門編
!... 38!=... 35 "... 112 " "... 311 " "... 4, 264 #... 371 #define... 126, 371 #endif... 369 #if... 369 #ifndef... 369 #include... 3, 311 #undef... 371 %... 17, 18 %=... 85 &... 222 &... 203 &&... 40 &=...
More informationsakigake2.dvi
(Zin ARAI) arai@cris.hokudai.ac.jp http://www.cris.hokudai.ac.jp/arai/ 1 2.1 Lorenz 3 4 5 6 1 2 2.1 Lorenz E. Lorenz R 3 ẋ = σx + σy ẏ = ρx y xz ż = βz + xy Lorenz σ, ρ, β Lorenz (σ, ρ, β) =(10, 28, 8/3)
More informationCudaWaveField
CudaWaveField 2012 3 22 2 CudaWaveField Rel 1.0.0 Rel 1.0 CudaWaveField ( cwfl) / cwfl cwfl http://www.laser.ee.kansai-u.ac.jp/wavefieldtools Note Acrobat Reader 3 I CudaWaveField 9 1 11 1.1 CudaWaveField......................
More information- - http://168iroha.net 018 10 14 i 1 1 1.1.................................................... 1 1.................................................... 7.1................................................
More informationdouble 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.......................
More informationソフトゼミC 第二回 C++の基礎
2013/08/06 エレクトロニクス研究部 C++ とは何か? ストリームライブラリを使った入出力 cin/coutについて CとC++ の構造体の違い classの基礎とメンバ関数 カプセル化 コンストラクタとは C++ とは何か? C++ はその名の通り C 言語の 拡張として 1983 年に作られた 開発当時は C with Classes と呼ばれ C 言語にクラスの概念を持たせた言語である
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 informationCondition DAQ condition condition 2 3 XML key value
Condition DAQ condition 2009 6 10 2009 7 2 2009 7 3 2010 8 3 1 2 2 condition 2 3 XML key value 3 4 4 4.1............................. 5 4.2...................... 5 5 6 6 Makefile 7 7 9 7.1 Condition.h.............................
More information=
2. 2.1 2.2 kuri@ice.uec.ac.jp ( 2007/10/30/16:46) 1 . 1. 1 + 2 = 5. 2. 180. 3. 3 3. 4.. 5.. 2 2.1 1.,,,,. 2., ( ) ( ).,,,, 3.,. 4.,,,. 3 1.,. 1. 1 + 2 = 5. (, ) 2. 180. (, ) 3. 3, 3. (, ) 4.. (, ) 5..
More information2004
2008 3 20 400 1 1,222 7 1 2 3 55.8 54.8 3 35.8 6 64.0 50.5 93.5 1 1,222 1 1,428 1 1,077 6 64.0 52.5 80.5 56.6 81.5 30.2 1 2 3 7 70.5 1 65.6 2 61.3 3 51.1 1 54.0 2 49.8 3 32.0 68.8 37.0 34.3 2008 3 2 93.5
More information: 1: 3:
1 2013 10 11 google maps engine : : : : : : : : : : 1 4.6.1 2: 1: 3: 4: 6: 5: 7: 2 2.1 2.1.1 2.1.2 2.2 2.2.1 2.2.2 2.2.3 2.2.4 2.2.5 2.3 2.3.1 18 2.3.2 2.3.3 2.3.4 2.3.5 2000 SA 2.3.6 2.4 2.4.1 2.4.2 2.4.3
More informationdouble 2 std::cin, std::cout 1.2 C fopen() fclose() C++ std::fstream 1-3 #include <fstream> std::fstream fout; int a = 123; fout.open( "data.t
C++ 1 C C++ C++ C C C++ 1.1 C printf() scanf() C++ C 1-1 #include int a; scanf( "%d", &a ); printf( "a = %d\n", a ); C++ 1-2 int a; std::cin >> a; std::cout
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 information4 5 6 CHAPTER 1 1 1-1 n % i n = 3 m = 10 k = {1, 3, 5 Yes 1, 1, 3, 5 10 n = 3 m = 9 k = {1, 3, 5 No 9 8 1-1 #include const int MAX_N = 50; int main() { int n, m, k[max_n]; // scanf("%d %d", &n,
More informationfiš„v3.dvi
(2001) 49 2 261 275 Web 1 1 2001 2 21 2001 4 26 Windows OS Web Windows OS, DELPHI, 1. Windows OS. DELPHI Web DELPHI ALGOL PASCAL VISUAL BASIC C++ JAVA DELPHI Windows OS Linux OS KyLix Mac OS (ver 10) JAVA
More information3.1 stdio.h iostream List.2 using namespace std C printf ( ) %d %f %s %d C++ cout cout List.2 Hello World! cout << float a = 1.2f; int b = 3; cout <<
C++ C C++ 1 C++ C++ C C++ C C++? C C++ C *.c *.cpp C cpp VC C++ 2 C++ C++ C++ [1], C++,,1999 [2],,,2001 [3], ( )( ),,2001 [4] B.W. /D.M.,, C,,1989 C Web [5], http://kumei.ne.jp/c_lang/ 3 Hello World Hello
More information1-4 int a; std::cin >> a; std::cout << "a = " << a << std::endl; C++( 1-4 ) stdio.h iostream iostream.h C++ include.h 1-4 scanf() std::cin >>
1 C++ 1.1 C C++ C++ C C C++ 1.1.1 C printf() scanf() C++ C hello world printf() 1-1 #include printf( "hello world\n" ); C++ 1-2 std::cout
More information1.3 ( ) ( ) C
1 1.1 (Data Base) (Container) C++ Java 1.2 1 1.3 ( ) ( ) 1. 2. 3. C++ 2 2.1 2.2 2.3 2 C Fortran C++ Java 3 3.1 (Vector) 1. 2. ( ) 3.2 3 3.3 C++ C++ STL C++ (Template) vector vector< > ; int arrayint vector
More informationFR 34 316 13 303 54
FR 34 316 13 303 54 23 ( 1 14 ) ( 3 10 ) 8/4 8/ 100% 8 22 7 12 1 9 8 45 25 28 17 19 14 3/1 6/27 5000 8/4 12/2930 1 66 45 43 35 49 25 22 20 23 21 17 13 20 6 1 8 52 1 50 4 11 49 3/4/5 75 6/7/8 46 9/10/11
More informationuntitled
II yacc 005 : 1, 1 1 1 %{ int lineno=0; 3 int wordno=0; 4 int charno=0; 5 6 %} 7 8 %% 9 [ \t]+ { charno+=strlen(yytext); } 10 "\n" { lineno++; charno++; } 11 [^ \t\n]+ { wordno++; charno+=strlen(yytext);}
More information広報さっぽろ 2016年8月号 厚別区
8/119/10 P 2016 8 11 12 P4 P6 P6 P7 13 P4 14 15 P8 16 P6 17 18 19 20 P4 21 P4 22 P7 23 P6 P7 24 25 26 P4 P4 P6 27 P4 P7 28 P6 29 30 P4 P5 31 P5 P6 2016 9 1 2 3 P4 4 P4 5 P5 6 7 8 P4 9 10 P4 1 b 2 b 3 b
More information1 2 3 4 1 2 1 2 3 4 5 6 7 8 9 10 11 27 29 32 33 1 2 3 7 9 11 13 15 17 19 21 23 26 CHECK! 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
More information..0.._0807...e.qxp
4 6 0 4 6 0 4 6 8 30 34 36 38 40 4 44 46 8 8 3 3 5 4 6 7 3 4 6 7 5 9 8 3 4 0 3 3 4 3 5 3 4 4 3 4 7 6 3 9 8 Check 3 4 6 5 3 4 0 3 5 3 3 4 4 7 3 3 4 6 9 3 3 4 8 3 3 3 4 30 33 3 Check Check Check Check 35
More informationh01
P03 P05 P10 P13 P18 P21 1 2 Q A Q A Q A Q A Q A 3 1 check 2 1 2-1 2-2 2-3 2-4 2-5 2-5-1 2-6 2-6-1 2-6-2 2-6-3 3 3-1 3-2 3-3 3-4 3 check 4 5 3-5 3-6 3-7 3-8 3-9 4-1 4-1-1 4-2 4-3 4-4 4-5 4-6 5-1 5-2 4
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 information/* sansu1.c */ #include <stdio.h> main() { int a, b, c; /* a, b, c */ a = 200; b = 1300; /* a 200 */ /* b 200 */ c = a + b; /* a b c */ }
C 2: A Pedestrian Approach to the C Programming Language 2 2-1 2.1........................... 2-1 2.1.1.............................. 2-1 2.1.2......... 2-4 2.1.3..................................... 2-6
More informationtuat1.dvi
( 1 ) http://ist.ksc.kwansei.ac.jp/ tutimura/ 2012 6 23 ( 1 ) 1 / 58 C ( 1 ) 2 / 58 2008 9 2002 2005 T E X ptetex3, ptexlive pt E X UTF-8 xdvi-jp 3 ( 1 ) 3 / 58 ( 1 ) 4 / 58 C,... ( 1 ) 5 / 58 6/23( )
More information/ SCHEDULE /06/07(Tue) / Basic of Programming /06/09(Thu) / Fundamental structures /06/14(Tue) / Memory Management /06/1
I117 II I117 PROGRAMMING PRACTICE II 2 MEMORY MANAGEMENT 2 Research Center for Advanced Computing Infrastructure (RCACI) / Yasuhiro Ohara yasu@jaist.ac.jp / SCHEDULE 1. 2011/06/07(Tue) / Basic of Programming
More informationuntitled
H8/300,H8S,H8SX [H8S,H8/300 Tool Chain Ver6.2.0.0] #define Inline static inline //************************************************** Inline char sil_and_mem(char *mem,char and) return (*((volatile
More informationQW-3414
MA1312-C P 1 2 3 A E L D E D A A E D A D D D D D E A C A C E D A A A C A C A C E E E D D D A C A C A A A A C A C A C E E C C E D D C C C E C E C C E C C C E D A C A C A C E L B B
More informationスライド 1
19 9 9 26 39 38 100 300 30 37 1 2 3 4 5 6 7 2004 Vol.132(12) Web http://www.nsknet.or.jp/katoh/honbun.html http://www.hyo-med.ac.jp/department/ped/qa/rota.html http://kodomo-qq.jp/ http://www.guide.metro.tokyo.jp/
More information(search: ) [1] ( ) 2 (linear search) (sequential search) 1
2005 11 14 1 1.1 2 1.2 (search:) [1] () 2 (linear search) (sequential search) 1 2.1 2.1.1 List 2-1(p.37) 1 1 13 n
More information新版明解C言語 実践編
2 List - "max.h" a, b max List - max "max.h" #define max(a, b) ((a) > (b)? (a) : (b)) max List -2 List -2 max #include "max.h" int x, y; printf("x"); printf("y"); scanf("%d", &x); scanf("%d", &y); printf("max(x,
More informationOpenCV IS Report No Report Medical Information System Labratry
OpenCV 2014 8 25 IS Report No. 2014090201 Report Medical Information System Labratry Abstract OpenCV OpenCV 1............................ 2 1.1 OpenCV.......................... 2 1.2......................
More informationIntel® Compilers Professional Editions
2007 6 10.0 * 10.0 6 5 Software &Solutions group 10.0 (SV) C++ Fortran OpenMP* OpenMP API / : 200 C/C++ Fortran : OpenMP : : : $ cat -n main.cpp 1 #include 2 int foo(const char *); 3 int main()
More informationjoho07-1.ppt
0xbffffc5c 0xbffffc60 xxxxxxxx xxxxxxxx 00001010 00000000 00000000 00000000 01100011 00000000 00000000 00000000 xxxxxxxx x y 2 func1 func2 double func1(double y) { y = y + 5.0; return y; } double func2(double*
More information#include #include #include int gcd( int a, int b) { if ( b == 0 ) return a; else { int c = a % b; return gcd( b, c); } /* if */ } int main() { int a = 60; int b = 45; int
More information(Kiyoshi Kitahara) Department of Engineering, Kogakuin University (Takayuki Abe) (Masataka Kaneko) (Satoshi Yamashita) Departmen
1674 2010 132-145 132 (Kiyoshi Kitahara) Department of Engineering, Kogakuin University (Takayuki Abe) (Masataka Kaneko) (Satoshi Yamashita) Department of Fundamental Research, Kisarazu National College
More informationII ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 D
II 8 2003 11 12 1 6 ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 Daisuke 8 =>. 73 Daisuke 35 Hiroshi 64 Ichiro 87 Junko
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 informationprogram.dvi
2001.06.19 1 programming semi ver.1.0 2001.06.19 1 GA SA 2 A 2.1 valuename = value value name = valuename # ; Fig. 1 #-----GA parameter popsize = 200 mutation rate = 0.01 crossover rate = 1.0 generation
More information, : GUI Web Java 2.1 GUI GUI GUI 2 y = x y = x y = x
J.JSSAC (2005) Vol. 11, No. 3,4, pp. 77-88 Noda2005 MathBlackBoard MathBlackBoard is a Java program based on the blackboard applet. We can use the blackboard applet with GUI operations. The blackboard
More information‚æ4›ñ
( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9
More informationJ.JSSAC Vol. 7, No. 2, Mathematica Maple,., Open asir Open xxx asir. Open xxx Open asir, asir., Open xxx, Linux Open asir Open sm1 (kan/sm1). C
J.JSSAC (1999) Vol. 7, No. 2, pp. 2-17 Open asir HPC (Received 1997/12/1) 1 Open asir Open xxx,., ( ),,,,,.,., (1) (2) (3) (4),. Open xxx,.,., 1.,.,., 0 10, dx,.,., ohara@math.kobe-u.ac.jp taka@math.kobe-u.ac.jp
More information(2 Linux Mozilla [ ] [ ] [ ] [ ] URL 2 qkc, nkc ~/.cshrc (emacs 2 set path=($path /usr/meiji/pub/linux/bin tcsh b
II 5 (1 2005 5 26 http://www.math.meiji.ac.jp/~mk/syori2-2005/ UNIX (Linux Linux 1 : 2005 http://www.math.meiji.ac.jp/~mk/syori2-2005/jouhousyori2-2005-00/node2. html ( (Linux 1 2 ( ( http://www.meiji.ac.jp/mind/tool/internet-license/
More informationLIFO(last in first out, ) 1 FIFO(first in first out, ) 2 2 PUSH POP : 1
2007 7 17 2 1 1.1 LIFO(last in first out, ) 1 FIFO(first in first out, ) 2 2 PUSH POP 2 2 5 5 5 1: 1 2 データの追加 データの取り出し 5 2 5 2 5 2: 1.2 [1] pp.199 217 2 (binary tree) 2 2.1 (three: ) ( ) 秋田高専 校長 準学士課程学生
More information1 2 3 4 5 1 2 3 2 3
Vol.58 CONTENTS 1 2 2 3 4 5 6 8 9 9 9 10 10 11 11 12 http://www.matsue-cityhospital.jp/ 1 2 3 4 5 1 2 3 2 3 4 5 Check! 6 7 Q A TOPICS 8 9 I N F O R M A T I O N 10 11 http://www.matsue-cityhospital.jp/
More information1 2 http://www.japan-shop.jp/ 3 4 http://www.japan-shop.jp/ 5 6 http://www.japan-shop.jp/ 7 2,930mm 2,700 mm 2,950mm 2,930mm 2,950mm 2,700mm 2,930mm 2,950mm 2,700mm 8 http://www.japan-shop.jp/ 9 10 http://www.japan-shop.jp/
More information1 911 34/ 22 1012 2/ 20 69 3/ 22 69 1/ 22 69 3/ 22 69 1/ 22 68 3/ 22 68 1/ 3 8 D 0.0900.129mm 0.1300.179mm 0.1800.199mm 0.1000.139mm 0.1400.409mm 0.4101.199mm 0.0900.139mm 0.1400.269mm 0.2700.289mm
More information1 1 36 223 42 14 92 4 3 2 1 4 3 4 3429 13536 5 6 7 8 9 2.4m/ (M) (M) (M) (M) (M) 6.67.3 6.57.2 6.97.6 7.27.8 8.4 5 6 5 6 5 5 74 1,239 0 30 21 ( ) 1,639 3,898 0 1,084 887 2 5 0 2 2 4 22 1 3 1 ( :) 426 1500
More information1 C 2 C 3 C 4 C 1 C 2 C 3 C
1 e N >. C 40 41 2 >. C 3 >.. C 26 >.. C .mm 4 C 106 e A 107 1 C 2 C 3 C 4 C 1 C 2 C 3 C 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124
More information平成24年財政投融資計画PDF出後8/016‐030
24 23 28,707,866 2,317,737 26,390,129 29,289,794 2,899,665 24 23 19,084,525 21,036,598 1952,073 24 23 8,603,613 8,393,427 967,631 925,404 202,440 179,834 217,469 219,963 66,716 64,877 3,160,423 2,951,165
More information第18回海岸シンポジウム報告書
2011.6.25 2011.6.26 L1 2011.6.27 L2 2011.7.6 2011.12.7 2011.10-12 2011.9-10 2012.3.9 23 2012.4, 2013.8.30 2012.6.13 2013.9 2011.7-2011.12-2012.4 2011.12.27 2013.9 1m30 1 2 3 4 5 6 m 5.0m 2.0m -5.0m 1.0m
More information液晶ディスプレイ取説TD-E432/TD-E502/TD-E552/TD-E652/TD-E432D/TD-E502D
1 2 3 4 5 6 7 1 2 3 4 5 6 7 2 2 2 1 1 2 9 10 11 12 13 14 15 16 17 1 8 2 3 4 5 6 7 1 2 3 4 5 6 7 8 9 10 9 11 12 13 13 14 15 16 17 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 1 2 3 4 5 6 7 8 9 11 12
More information000-.\..
1 1 1 2 3 4 5 6 7 8 9 e e 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 10mm 150mm 60mm 25mm 40mm 30mm 25 26 27 1 28 29 30 31 32 e e e e e e 33 e 34 35 35 e e e e 36 37 38 38 e e 39 e 1 40 e 41 e 42 43
More information(1519) () 1 ( ) () 1 ( ) - 1 - - 2 - (1531) (25) 5 25,000 (25) 5 30,000 25,000 174 3 323 174 3 323 (1532) () 2 () 2-3 - - 4 - (1533) () 1 (2267)204 () (1)(2) () 1 (2267)204 () (1)(2) (3) (3) 840,000 680,000
More information[mm] [mm] [mm] 70 60 50 40 30 20 10 1H 0 18 19 20 21 22 23 24 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 1 2 3 4 5 6 7 8 9 10 11 12 60 50 40 30 20 10 0 18 19 20 21 22 23 24 1 2 3 4
More informationC による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 新装版 1 刷発行時のものです.
C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009383 このサンプルページの内容は, 新装版 1 刷発行時のものです. i 2 22 2 13 ( ) 2 (1) ANSI (2) 2 (3) Web http://www.morikita.co.jp/books/mid/009383
More information81 /******************************************************************************/ 82 /* スレーブアドレスの設定 */ 83 /*****************************************
1 /******************************************************************************/ 2 /* IIC(Inter IC Bus) の制御 */ 3 /******************************************************************************/ 4 /*
More information