matrix util program bstat gram schmidt
|
|
|
- しまな ねぎたや
- 4 years ago
- Views:
Transcription
1 matrix util program bstat gram schmidt matadd matarith matcat matconvol matcorr matgen mati matinv matnormalize matprd matresize matsize matsq matsub matt mattrim metricmds pca plot2d reg
2 matinit() intmatinit() vectinit() matfill() matfill() vectinnerprd() vectouterprd() vectouterprd() vectnormal() mati() matdiag() matdiag() mattrace() mattrace() matadd() matadd() matadd() matsub() matsub() matsub() matprd() matprd() matprd() matcpy() matcpy() matarith() matarith() matarith() matt() matt() matsq() matsq() matsq()
3 4.34 matsqinv() matsqinv() matsqinv() matsqinvmatt() matsqinvmatt() matsqinvmatt() gram schmidt() Gram Schmidt() matnormalize() matnormalize() matnormalize() writemat() fwritemat() freadmat() matreadfile() matinfo read() mattrim() mattrim() plot2d() matinv() matinv() determinant() bstat min() bstat max() bstat range() bstat square() bstat sum() bstat mean() bstat variance() bstat sd() bstat skew() bstat kurtosis() matcorr() matcorr () matcorrinv() matcorrinv() matubcov() matubcov() matcov()
4 4.73 matcov() matubcovinv() matubcovinv() matcovinv() matcovinv() eigen pm()
5 1 # space tab aplication program double fileio util.h 2 program program -h help 2 % cat data matsq matinv % matsq data matinv []... [a b] a b 5
6 2.1 bstat bstat [options] [datafile] -mean: -sd: -max: -min: ( ) -range: -skew: -kurtosis: -corr: -invcorr: -cov: -invcov: -ubcov: -invubcov: -v : 2 -h : 2.2 gram schmidt gram schmidt [datafile] 2.3 matadd 2 matadd A [B] 6
7 2.4 matarith y = a {x} b b -plus -minus a -times -div value double matarith -plus -minus -times -div <value> [datafile] -plus value : value -minus : value -times : value -div : value 2.5 matcat matcat [-OFMT format] [datafile]... OFMT : printf "%8.5f " 2.6 matconvol f(x)g(x s)ds matconvol KERNEL [DATA] KERNEL : DATA : 2.7 matcorr matcorr [datafile] 7
8 2.8 matgen filler matgen N M filler N : (int) M : (int) filler : (double) 2.9 mati mati size 2.10 matinv matinv [datafile] 2.11 matnormalize 1 matnormalize [datafile] 2.12 matprd 2 matprd A [B] 2.13 matresize ( ) matresize N M [datafile] N : (int) M : (int) 8
9 2.14 matsize ( ) matsize [datafile] matsq 2 X X matsq [A] 2.16 matsub 2 matsub A [B] 2.17 matt matt [datafile] 2.18 mattrim (1,1) (1,m) (top,left) (bottom,right) (n,1) (n,m) n m top left bottom righit mattrim sn sm en em [datafile] sn : (int) 9
10 sm : en : em : (int) (int) (int) 2.19 metricmds n m m m metric MDS -d option m m ( 0) metricmds metricmds [options] [datafile] -p [int]: ( 2) -g : -d : 2.20 pca pca [options] [datafile] -p [int] : ( ) -v : -gw : -gs : -notext : 2.21 plot2d plot2d [datafile] 10
11 2.22 reg Y = AX A Y X reg [options] -A datafile -y datafile -A datafile: -y datafile: -1 : Y = AX + c1 -v : -h : 3 C 3.1 #include "matrix_util.h" #include "fileio_util.h" include matrix A; matinit() matinit() 3.2 n m A i j *(A+offs(n,m,i,j)) offs(n,m,i,j) 11
12 #define offs(n,m,i,j) ((m)*((i)-1)+((j)-1)) 3.3 double 2 1 matrix util.h #ifndef scalar #define scalar double #endif typedef scalar *vector, *matrix; 3.4 matxxxx() matadd() matadd() matrix Ret, A, B; int an, am; /* A */ int bn, bm; /* B */ Ret = matadd(a,an,am, B,bn,bm); Ret matadd() A + B Ret Ret matrix Ret, A, B; int an, am; /* A */ int bn, bm; /* B */ Ret = matinit(an,am); matadd(a,an,am, B,bn,bm, Ret); 12
13 matadd() A+ = B A B A matsub(), matprd() matinit() 2 \0 matrix matinit(int n, int m) n : m : 4.2 intmatinit() matinit() int intmatinit(int n, int m) n : m : 4.3 vectinit() matinit(n,1) vector vectinit(int n); n : 13
14 4.4 matfill() matrix filler int matfill(matrix A, int n, int m, double filler); A : n : m : filler : matrix 4.5 matfill() filler matrix matfill(int n, int m, double filler); n : m : filler : 4.6 vectinnerprd() 2 double vectinnerprd(vector a, vector b, int n); a : b : n : 4.7 vectouterprd() 2 int vectouterprd(vector a, vector b, int n, matrix Out); 14
15 a: b: out: 4.8 vectouterprd() 2 matrix vectouterprd(vector a, vector b, int n); a: b: 4.9 vectnormal() x = 1 vectnormal(vector x, int n); x: n: 4.10 mati() matrix mati(int n) ; n: 15
16 4.11 matdiag() ( ) int matdiag(matrix A, int n, matrix Ret); A: n: Ret: 4.12 matdiag() ( ) vector matdiag(matrix A, int n); A: n: 4.13 mattrace() ( ) int mattrace(matrix A, int n, double *trace); A: n: trace: 4.14 mattrace() 16
17 scalar mattrace(matrix A, int n); A: n: 4.15 matadd() Ret = A + B int matadd(matrix A, int an, int am, matrix B, int bn, int bm, matrix Ret) A: an: am: B: bn: bm: Ret: 4.16 matadd() A+ = B int matadd(matrix A, int an, int am, matrix B, int bn, int bm) A: an: am: B: bn: bm: 17
18 4.17 matadd() A + B matrix matadd(matrix A, int an, int am, matrix B, int bn, int bm) A: an: am: B: bn: bm: 4.18 matsub() Ret = A B int matsub(matrix A, int an, int am, matrix B, int bn, int bm, matrix Ret) A: an: am: B: bn: bm: Ret: 4.19 matsub() A = B 18
19 int matsub(matrix A, int an, int am, matrix B, int bn, int bm) A: an: am: B: bn: bm: 4.20 matsub() A B matrix matsub(matrix A, int an, int am, matrix B, int bn, int bm) A: an: am: B: bn: bm: 4.21 matprd() int matprd(matrix A, int an, int am, matrix B, int bn, int bm, matrix Ret) A: A 19
20 an: am: A A B: B bn: bm: Ret: B B 4.22 matprd() A = B int matprd(matrix A, int an, int am, matrix B, int bn, int bm) A: A an: am: A A B: B bn: bm: B B 4.23 matprd() matrix matprd(matrix A, int an, int am, matrix B, int bn, int bm) A: A an: am: A A B: B bn: bm: B B 20
21 4.24 matcpy() int matcpy(matrix From, int an, int am, matrix To); From: an: am: To: 4.25 matcpy() matrix matcpy(matrix A, int an, int am); From: an: am: 4.26 matarith() Ret = ax + b a b int matarith(matrix A, int n, int m, double a, double b, matrix Ret); A: an: am: a: a b: b Ret: 21
22 4.27 matarith() a b int matarith(matrix A, int n, int m, double a, double b); A: an: am: a: a b: b 4.28 matarith() a b matrix matmag(matrix A, int n, int m, double a, double b); A: an: am: a: a b: b 4.29 matt() int matt(matrix A, int an, int am, matrix Ret); A: an: am: Ret: 22
23 4.30 matt() matrix matt(matrix A, int an, int am); A: an: am: 4.31 matsq() A t A int matsq(matrix A, int n, int m, matrix Ret); A: n: m: Ret: 4.32 matsq() A t A A = A t A int matsq(matrix A, int n, int m); A: n: m: 23
24 4.33 matsq() A t A matrix matsq (matrix A, int n, int m); A: n: m: 4.34 matsqinv() int matsqinv(matrix A, int n, int m, matrix Ret); A: n: m: Ret: 4.35 matsqinv() int matsqinv(matrix A, int n, int m); A: n: m: 24
25 4.36 matsqinv() matrix matsqinv(matrix A, int n, int m); A: n: m: 4.37 matsqinvmatt() A A t A 1 A t int matsqinvmatt(matrix A, int n, int m, matrix Ret); A: n: m: Ret: A t A 1 A t 4.38 matsqinvmatt() A A t A 1 A t A = A t A 1 A t int matsqinvmatt(matrix A, int n, int m); A: n: m: 25
26 4.39 matsqinvmatt() A A t A 1 A t Ret = A t A 1 A t matrix matsqinvmatt(matrix A, int n, int m); A: n: m: 4.40 gram schmidt() Gram Schmidt int gram schmidt (matrix A, int n, int m, matrix Ret); A: n: m: Ret: 4.41 Gram Schmidt() Gram Schmidt matrix Gram Schmidt (matrix A, int n, int m); A: n: m: 26
27 4.42 matnormalize() 1 matrix matnormalize (matrix A, int n, int m); A: n: m: 4.43 matnormalize() 1 int matnormalize (matrix A, int n, int m); A: n: m: 4.44 matnormalize() 1 int matnormalize (matrix A, int n, int m, matrix Ret); A: n: m: Ret: 27
28 4.45 writemat() "8.3f" 8 3 writemat(file *fp, matrix w, int row, int col, unsigned char *mes, unsigned char *fmt) fp: w: row: col: mes: fmt: 4.46 fwritemat() fwritematf(file *fp, matrix w, int row, int col, unsigned char *mes, unsigned char *fmt) writmat 4.47 freadmat() int freadmat(file *fp, matrix A, int n, int m); fp: A: n: m: 28
29 4.48 matreadfile() matrix matreadfile(char *filename, int n, int m); filename: n: m: 4.49 matinfo read() matinfo typedef struct MAT_info { int n; int m; matrix mat; } *matinfo; matinfo matinfo matinfo read(char *filename); filename: 4.50 mattrim() (1,1) (1,m) (top,left) (bottom,right) (n,1) (n,m) 29
30 n m top left bottom righit int mattrim(matrix O, int n, int m, int top, int left, int bottom, int rigtht, matrix Ret); O: n: m: top: left: bottom: right: Ret: 4.51 mattrim() matrix mattrim(matrix O, int n, int m, int top, int left, int bottom, int right); O: n: m: top: left: bottom: right: 4.52 plot2d() int plot2d(file *fp, matrix x, int n, int m, char *header); 30
31 fp: x: n: m: header: 4.53 matinv() int matinv(matrix A, int n, scalar *det, matrix ret); A: n: det: ret: 4.54 matinv() matrix matinv(matrix A, int n, scalar *det); A: n: det: 4.55 determinant() scalar determinant(matrix A, int m); A: n: 31
32 4.56 bstat min() (1 m ) matrix bstat min (matrix A, int n, int m); A: n: m: 4.57 bstat max() (1 m ) matrix bstat max (matrix A, int n, int m); A: n: m: 4.58 bstat range() ( - ) (1 m ) matrix bstat range (matrix A, int n, int m); A: n: m: 32
33 4.59 bstat square() (1 m ) matrix bstat square(matrix A, int n, int m); A: n: m: 4.60 bstat sum() (1 m ) matrix bstat sum (matrix A, int n, int m); A: n: m: 4.61 bstat mean() (1 m ) matrix bstat mean (matrix A, int n, int m); A: n: m: 33
34 4.62 bstat variance() (1 m ) matrix bstat variance (matrix A, int n, int m); A: n: m: 4.63 bstat sd() (1 m ) matrix bstat sd (matrix A, int n, int m); A: n: m: 4.64 bstat skew() (1 m ) matrix bstat skew (matrix A, int n, int m, vector mean, vector sd); A: n: m: 34
35 4.65 bstat kurtosis() (1 m ) matrix bstat kurtosis (matrix A, int n, int m, vector mean, vector sd); A: n: m: 4.66 matcorr() int matcorr (matrix A, int n, int m, matrix Corr); A: n: m: 4.67 matcorr () matrix matcorr (matrix A, int n, int m); A: n: m: 35
36 4.68 matcorrinv() int matcorrinv(matrix X, int n, int m, scalar *det, matrix corrinv); A: n: m: det: corrinv: 4.69 matcorrinv() matrix matcorrinv(matrix X, int n, int m, scalar *det); A: n: m: det: 4.70 matubcov() int matubcov(matrix X, int n, int m, matrix Ret); X: n: m: 36
37 4.71 matubcov() matrix matubcov(matrix X, int n, int m); X: n: m: 4.72 matcov() int matcov (matrix X, int n, int m, matrix Cov); X: n: m: Cov: 4.73 matcov() matrix matcov (matrix X, int n, int m); X: n: m: 37
38 4.74 matubcovinv() int matubcovinv (matrix X, int n, int m, scalar *det, matrix Covinv); X: n: m: det: Covinv: 4.75 matubcovinv() matrix matubcovinv (matrix X, int n, int m, scalar *det); X: n: m: det: 4.76 matcovinv() int matcovinv(matrix X, int n, int m, scalar *det, matrix Covinv); X: 38
39 n: m: det: Covinv: 4.77 matcovinv() matrix matcovinv(matrix X, int n, int m, scalar *det); X: n: m: det: 4.78 eigen pm() int eigen pm(matrix a0, vector evv, matrix vv, int n, int p); a0: evv: vv: n: p: 39
1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() 2 double *a[ ]; double 1 malloc() dou
![1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() 2 double *a[ ]; double 1 malloc() dou](/thumbs/98/138757599.jpg "1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() 2 double *a[ ]; double 1 malloc() dou")
1 1.1 C 2 1 double a[ ][ ]; 1 3x3 0 1 3x3 ( ) 0.240 0.143 0.339 0.191 0.341 0.477 0.412 0.003 0.921 1.2 malloc() 2 double *a[ ]; double 1 malloc() double 1 malloc() free() 3 #include #include
1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() malloc 2 #include <stdio.h> #include
![1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() malloc 2 #include <stdio.h> #include](/thumbs/98/138365120.jpg "1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() malloc 2 #include <stdio.h> #include")
1 1.1 C 2 1 double a[ ][ ]; 1 3x3 0 1 3x3 ( ) 0.240 0.143 0.339 0.191 0.341 0.477 0.412 0.003 0.921 1.2 malloc() malloc 2 #include #include #include enum LENGTH = 10 ; int
‚æ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
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.......................
:010_ :3/24/2005 3:27 PM :05/03/28 14:39
:010_896300101703 :3/24/2005 3:27 PM :05/03/28 14:39 :010_896300101703 :3/24/2005 3:27 PM :05/03/28 14:39 :010_896300101703 :3/24/2005 3:27 PM :05/03/28 14:39 :010_896300101703 :3/24/2005 3:27 PM :05/03/28
31 gh gw
30 31 gh gw 32 33 1406 1421 640 0 (mm) (mm) MAX1513 MIN349 MIN280 MAX900 gh gw 34 gh gh gw gw gh gh gw gw gh gh gw gw 35 175 176 177 178 179 180 181 195 196 197 198 202 203 2 1 L L L2 L2 L2 L 2 2 1 L L
[ 1] 1 Hello World!! 1 #include <s t d i o. h> 2 3 int main ( ) { 4 5 p r i n t f ( H e l l o World!! \ n ) ; 6 7 return 0 ; 8 } 1:
![[ 1] 1 Hello World!! 1 #include <s t d i o. h> 2 3 int main ( ) { 4 5 p r i n t f ( H e l l o World!! \ n ) ; 6 7 return 0 ; 8 } 1:](/thumbs/97/132863283.jpg "[ 1] 1 Hello World!! 1 #include <s t d i o. h> 2 3 int main ( ) { 4 5 p r i n t f ( H e l l o World!! \ n ) ; 6 7 return 0 ; 8 } 1:")
005 9 7 1 1.1 1 Hello World!! 5 p r i n t f ( H e l l o World!! \ n ) ; 7 return 0 ; 8 } 1: 1 [ ] Hello World!! from Akita National College of Technology. 1 : 5 p r i n t f ( H e l l o World!! \ n ) ;
lexex.dvi
(2018, c ) http://istksckwanseiacjp/ ishiura/cpl/ 4 41 1 mini-c lexc,, 2 testlexc, lexc mini-c 1 ( ) mini-c ( ) (int, char, if, else, while, return 6 ) ( ) (+, -, *, /, %, &, =, ==,!=, >, >=,
QR
1 7 16 13 1 13.1 QR...................................... 2 13.1.1............................................ 2 13.1.2..................................... 3 13.1.3 QR........................................
program.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
新コンフィギュレータのフレームワークについて
: 2007 12 7 6: 2009 5 9 TOPPERS 1.... 4 1.1... 4 1.2 TOPPERS... 4 2.... 4 2.1... 4 3.... 8 4.... 9 4.1... 9 4.2... 10 4.3... 10 4.3.1... 11 4.3.2 INCLUDE... 11 4.3.3 C... 12 4.4 API... 14 4.2.1 API...
( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1
![( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1](/thumbs/96/128219471.jpg "( ) ( ) 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
Chapter 3 Mathematica Mathematica e a n = ( ) n b n = n 1! + 1 2! n! b n a n e 3/n b n e 2/n! b n a n b n M athematica Ma
Mathematica Workbook Workbook Mathematica Mathematica A4 12 A5 9 14 4 2 Chapter 3 Mathematica Mathematica e a n = ( 1 + 1 ) n b n = 1 + 1 n 1! + 1 2! + + 1 n! b n a n e 3/n b n e 2/n! b n a n b n M athematica
+ + + + n S (n) = + + + + n S (n) S (n) S 0 (n) S (n) 6 4 S (n) S (n) 7 S (n) S 4 (n) 8 6 S k (n) 0 7 (k + )S k (n) 8 S 6 (n), S 7 (n), S 8 (n), S 9 (
k k + k + k + + n k 006.7. + + + + n S (n) = + + + + n S (n) S (n) S 0 (n) S (n) 6 4 S (n) S (n) 7 S (n) S 4 (n) 8 6 S k (n) 0 7 (k + )S k (n) 8 S 6 (n), S 7 (n), S 8 (n), S 9 (n), S 0 (n) 9 S (n) S 4
橡点検記録(集約).PDF
942.8.8.8.7 671 86 11 1 9 9 9 1 1,792 7,23 2,483 1,324 2,198 7,23 82 7,23 6,327 9,22 9,713 8,525 8,554 9,22. 8,554. 1,79 9,713 95 947 8,525.. 944 671 81 7 17 1,29 1,225 1,241 1,25 1,375 9.3 23,264 25,
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] { /*
untitled
-1- -2- -3- AED -4- 2-5- -6- -7- -8-6-1-28 048-833-1231 2-1-1 048-261-3119 4389-1 048-556-3005 1-13-11 04-2924-1311 2097-1 048-738-3111 1172 04-2953-7111 990-1 048-565-1919 537 048-775-1311 2-2-2 048-924-2111
clover-375.pdf
8:4511:00 9:0012:30 9:0016:3003-5986-3188 AM PM AM PM AM PM AM PM AM PM AM PM - - - - - - 1 2 3 5 6 7 8:4515:00 9:0016:30 AM PM AM PM AM PM AM PM AM PM AM PM - - - - - - - - - () - - - - - - - 8 10 12
(search: ) [1] ( ) 2 (linear search) (sequential search) 1
![(search: ) [1] ( ) 2 (linear search) (sequential search) 1](/thumbs/97/131825822.jpg "(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
ARM gcc Kunihiko IMAI 2009 1 11 ARM gcc 1 2 2 2 3 3 4 3 4.1................................. 3 4.2............................................ 4 4.3........................................
thesis.dvi
H8 e041220 2009 2 Copyright c 2009 by Kentarou Nagashima c 2009 Kentarou Nagashima All rights reserved , H8.,,,..,.,., AKI-H8/3052LAN. OS. OS H8 Write Turbo. H8 C, Cygwin.,., windows. UDP., (TA7279P).,.
G1. tateyama~$ gcc -c xxxxx.c ( ) xxxxx.o tateyama~$ gcc -o xxxxx.o yyyyy.o..... zzzzz.o Makefile make Makefile : xxxxx.o yyyyy.o... zzzzz.o ; gcc -o
G1. tateyama~$ gcc -c xxxxx.c ( ) xxxxx.o tateyama~$ gcc -o xxxxx.o yyyyy.o..... zzzzz.o Makefile make Makefile : xxxxx.o yyyyy.o... zzzzz.o ; gcc -o xxxxx.o yyyyy.o... zzzzz.o [1] [5] 1 [1] (matrix multi
main.dvi
20 II 7. 1 409, 3255 e-mail: namba@faculty.chiba-u.jp 2 1 1 1 4 2 203 2 1 1 1 5 503 1 3 1 2 2 Web http://www.icsd2.tj.chiba-u.jp/~namba/lecture/ 1 2 1 5 501 1,, \,", 2000 7. : 1 1 CPU CPU 1 Intel Pentium
TI 89
T89 1 3 1.1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.3 : : : : : : : : : : : : : : : : : : : :
43-03‘o’ì’¹‘®”q37†`51†i„¤‰ƒ…m†[…g†j.pwd
n 808 3.0 % 86.8 % 8.3 % n 24 4.1 % 54.0 % 37.5 % 0% % 20 % 30 % 40 % 50 % 60 % 70 % 80 % 90 % 0% 37.4 % 7.2 % 27.2 % 8.4 % n 648 13.6 % 18.1% 45.4 % 4.1% n 18 0% % 20 % 30 % 40 % 50 % 60 % 70 % 80 % 90
新・明解Ｃ言語 実践編
第 1 章 見 21 1-1 見えないエラー 見 List 1-1 "max2x1.h" a, b max2 List 1-1 chap01/max2x1.h max2 "max2x1.h" #define max2(a, b) ((a) > (b)? (a) : (b)) max2 List 1-2 List 1-2 chap01/max2x1test.c max2 #include
memo
数理情報工学演習第一 C プログラミング演習 ( 第 5 回 ) 2015/05/11 DEPARTMENT OF MATHEMATICAL INFORMATICS 1 今日の内容 : プロトタイプ宣言 ヘッダーファイル, プログラムの分割 課題 : 疎行列 2 プロトタイプ宣言 3 C 言語では, 関数や変数は使用する前 ( ソースの上のほう ) に定義されている必要がある. double sub(int
void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=
![void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=](/thumbs/89/97513163.jpg "void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=")
II 14 2018 7 26 : : proen@mm.ics.saitama-u.ac.jp 14,, 8 2 12:00 1 O(1) n O(n) O(log n) O(1) 32 : 1G int 4 250 M 2.5 int 21 2 0 100 0 100 #include #define HASHSIZE 100 /* */ #define NOTFOUND 0
untitled
5.1.1 1...83 2...84 3...85 4...86 5...87 6...88 7...89 8...90 9...91 10...92 11...93 12...94 13...95 14...96 15...97 16...98 17...99 5.2.1 1...100 2 1...102 3 1...103 4 1...105 5 1...108 6 1...110 7 1...113
2004 2005 2 2 1G01P038-0 1 2 1.1.............................. 2 1.2......................... 2 1.3......................... 3 2 4 2.1............................ 4 2.2....................... 4 2.3.......................
I J
I 065763J 8 7 7 31 jikken/ +----- accumulation_demupa.c +----- accumulation_rain.c +----- frequency_demupa.c +----- frequency_rain.c +----- go.sh +----- graph_maker.sh +----- mesure-ryudai/ 2007/4/1 2007/6/30
新版明解Ｃ言語 実践編
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,
(1) 2000 ( ) ( ) 1000 2000 1000 0 http://www.spacepark.city.koriyama.fukushima.jp/ http://www.miraikan.jst.go.jp/ http://www.nasda.go.jp/ 3000 1 1 http://www.city.nara.nara.jp/citizen/jyugsidu/jgy/jsj/
PowerPoint Presentation
p.130 p.198 p.208 2 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight
損保ジャパンの現状2011
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 51 52 53 54 55 56 57 58 59 60 61 62 62 63 64 65 66 67 68 69
Minimum C Minimum C Minimum C BNF T okenseq W hite Any D
6 2019 5 14 6.1 Minimum C....................... 6 1 6.2....................................... 6 7 6.1 Minimum C Minimum C BNF T okenseq W hite Any Digit ::= 0 1 2... 9. Number ::= Digit Digit. Alphabet
Ｃ言語によるアルゴリズムとデータ構造
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",
cpp1.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
PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU
1. 1.1. 1.2. 1 PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 2. 2.1. 2 1 2 C a b N: PC BC c 3C ac b 3 4 a F7 b Y c 6 5 a ctrl+f5) 4 2.2. main 2.3. main 2.4. 3 4 5 6 7 printf printf
Isogai, T., Building a dynamic correlation network for fat-tailed financial asset returns, Applied Network Science (7):-24, 206,
H28. (TMU) 206 8 29 / 34 2 3 4 5 6 Isogai, T., Building a dynamic correlation network for fat-tailed financial asset returns, Applied Network Science (7):-24, 206, http://link.springer.com/article/0.007/s409-06-0008-x
Microsoft Word - no206.docx
3.2 双方向リスト 今までのリストは 前から順にたどることしかできませんでした 今度は逆にもたどることができる 双方向リストを扱います この場合は 構造体には次を表すポインタの他に前を表すポインタを持つ ことになります 今回は最初と最後をポインタを使うと取り扱いが面倒になるので 最初 (start) と最後 (end) を どちらとも構造体 ( 値は意味を持たない ) を使うことにします こうすることによって
Condition 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.............................
10
2: http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html kota@fbs.osaka-u.ac.jp 10 : 0 1 2 n 2 n 0 1 1 0 1 0 0 1 (2) = 105 1 = 8 1 2 8 = 256 0 9 105 i 106 j 256 2 1 #include int main(void)
28
y i = Z i δ i +ε i ε i δ X y i = X Z i δ i + X ε i [ ] 1 δ ˆ i = Z i X( X X) 1 X Z i [ ] 1 σ ˆ 2 Z i X( X X) 1 X Z i Z i X( X X) 1 X y i σ ˆ 2 ˆ σ 2 = [ ] y i Z ˆ [ i δ i ] 1 y N p i Z i δ ˆ i i RSTAT
P06.ppt
p.130 p.198 p.208 2 1 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i < NUM; i++ ) if ( weight[i] > max ) max = weight[i]: if ( weight[i] < min ) min = weight[i]: weight 3 maxof(a,
TEX American Mathematical Society PostScript Adobe Systems Incorporated
P A D manual ( pad2ps 3.1j ) (seiichi@muraoka.info.waseda.ac.jp) 1996 11 2 TEX American Mathematical Society PostScript Adobe Systems Incorporated pad2ps PAD PAD (Problem Analysis Diagram) C 1 2 PAD PAD
6 6.1 sound_wav_files flu00.wav.wav 44.1 khz 1/44100 spwave Text with Time spwave t T = N t N 44.1 khz t = 1 sec j t f j {f 0, f 1, f 2,, f N 1
6 6.1 sound_wav_files flu00.wav.wav 44.1 khz 1/44100 spwave Text with Time spwave t T = t 44.1 khz t = 1 sec 44100 j t f j {f 0, f 1, f 2,, f 1 6.2 T {f 0, f 1, f 2,, f 1 T ft) f j = fj t) j = 0, 1, 2,,
パッケージ情報
7. MII51007-2.0 MX II 7 1 7 2 7 3 7 4 7 1 7 9 I/O 0.1 µf VCC GN VCC GN MX II VCCINT/GNINT VCCIO/GNIO 0.1 µf BG VCC/GN 1 ltra Corporation 7 1 7 1 TQFPFinLin BG FBG Micro Finlin BG MBG MX II 7 1. TQFP FinLin
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
Optio S 使用説明書
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 2003 / 1 / 1 0 : 00 MENU DISP 12/24 OK 2003 / 1 / 1 0 : 00 MENU DISP 12/24 2003 / 10 / 1 0 : 00 MENU DISP 12/24 OK OK 16 Initial setting Language/ TYO n MENU OK b n
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
I httpd School of Information Science, Japan Advanced Institute of Science and Technology
I117 17 4 httpd School of Information Science, Japan Advanced Institute of Science and Technology httpd HTTP httpd log file access log access.log CERN httpd common format lighttpd common format 2 1000
p = 1, 2, cos 2n + p)πj = cos 2nπj 2n + p)πj, sin = sin 2nπj 7.1) f j = a ) 0 + a p + a n+p cos 2nπj p=1 p=0 1 + ) b n+p p=0 sin 2nπj 1 2 a 0 +
7 7.1 sound_wav_files flu00.wav.wav 44.1 khz 1/44100 spwave Text with Time spwave T > 0 t 44.1 khz t = 1 44100 j t f j {f 0, f 1, f 2,, f 1 = T t 7.2 T {f 0, f 1, f 2,, f 1 T ft) f j = fj t) j = 0, 1,
*p145-174_Œâ‡í‡ê‡é
*p145-174_ 問 われる 09.1.16 10:34 PM ページ145 2007 200708 146 147 a s 148 a s d f g 153 a s d 158 a s d f g h j 166 a s d f 171 2009 145 *p145-174_ 問 われる 09.1.16 10:34 PM ページ146 45 2007 2008 146 *p145-174_
2 of 46 07.2.10 4:30 PM
1 of 46 07.2.10 4:30 PM 2 of 46 07.2.10 4:30 PM 3 of 46 07.2.10 4:30 PM 4 of 46 07.2.10 4:30 PM 5 of 46 07.2.10 4:30 PM 6 of 46 07.2.10 4:30 PM 7 of 46 07.2.10 4:30 PM 8 of 46 07.2.10 4:30 PM 9 of 46 07.2.10
( ) 1 1: 1 #include <s t d i o. h> 2 #include <GL/ g l u t. h> 3 #include <math. h> 4 #include <s t d l i b. h> 5 #include <time. h>
2007 12 5 1 2 2.1 ( ) 1 1: 1 #include 2 #include 3 #include 4 #include 5 #include 6 7 #define H WIN 400 // 8 #define W WIN 300 // 9
17 1. strucr Potter ( ) Harry Potter and the Philosopher s Stone 1997 English Title : Harry Potter and the Philosopher s Stone : : 1997 #include<stdio
17 1. strucr Potter ( ) Harry Potter and the Philosopher s Stone 1997 English Title : Harry Potter and the Philosopher s Stone : : 1997 #include typedef struct Potter{ Potter; int main(void){
ランダムウォークの境界条件・偏微分方程式の数値計算
B L06(2018-05-22 Tue) : Time-stamp: 2018-05-22 Tue 21:53 JST hig,, 2, multiply transf http://hig3.net L06 B(2018) 1 / 38 L05-Q1 Quiz : 1 M λ 1 = 1 u 1 ( ). M u 1 = u 1, u 1 = ( 3 4 ) s (s 0)., u 1 = 1
BW BW
Induced Sorting BW 11T2042B 2015 3 23 1 1 1.1................................ 1 1.2................................... 1 2 BW 1 2.1..................................... 2 2.2 BW.................................
Microsoft Word - Sample_CQS-Report_English_backslant.doc
***** Corporation ANSI C compiler test system System test report 2005/11/16 Japan Novel Corporation *****V43/NQP-DS-501-1 Contents Contents......2 1. Evaluated compiler......3 1.1. smp-compiler compiler...3
二分木の実装
二分木の実装 この回の要点 二分木の C 言語による実装を理解する 再帰呼び出しによる木のなぞりの実装を理解する 関数ポインタを使った汎用処理の実装を理解する 実装コードの構成 汎用的構造 各ノードは void* を持つ 二分木のノード BinTreeNode.h BinTreeNode.cc 二分木 BinTree.h BinTree.cc テスト用 TestBinTree.cc BinTree
りそなホールディングス2005年3月期半期報告書
:000_3_0889500501612 :12/28/2004 10:23 AM:04/12/28 10:44 :000_4_0889500501612 :12/28/2004 10:24 AM:04/12/28 10:47 :000_header_0889500501612 :12/28/2004 10:24 AM:04/12/28 10:47 :010_0889500501612 :12/28/2004
joho07-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*
file"a" file"b" fp = fopen("a", "r"); while(fgets(line, BUFSIZ, fp)) {... fclose(fp); fp = fopen("b", "r"); while(fgets(line, BUFSIZ, fp)) {... fclose
I117 9 2 School of Information Science, Japan Advanced Institute of Science and Technology file"a" file"b" fp = fopen("a", "r"); while(fgets(line, BUFSIZ, fp)) {... fclose(fp); fp = fopen("b", "r"); while(fgets(line,
ex12.dvi
1 0. C, char., char, 0,. C, ("),., char str[]="abc" ; str abc.,, str 4. str 3. char str[10]="abc" ;, str 10, str 3., char s[]="abc", t[10] ;, t = s. ASCII, 0x00 0x7F, char., "abc" 3, 1. 1 8 256, 2., 2
第３回 配列とリスト
連結リスト Algorithms and Data Structures on C この回の要点 連結リストによるリスト 連結リストの構造 連結リストの利点と欠点 C 言語による連結リストの実現 ヘッダファイルによるソースファイルの分割 連結リスト (linked list) リストの実現の一種 リストに含まれる各要素をリンクによって連結した構造 リンクとは 他のデータへの参照のこと 各要素は 自分から次のデータへのリンクを持つ
01_OpenMP_osx.indd
OpenMP* / 1 1... 2 2... 3 3... 5 4... 7 5... 9 5.1... 9 5.2 OpenMP* API... 13 6... 17 7... 19 / 4 1 2 C/C++ OpenMP* 3 Fortran OpenMP* 4 PC 1 1 9.0 Linux* Windows* Xeon Itanium OS 1 2 2 WEB OS OS OS 1 OS
LIFO(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: ) ( ) 秋田高専 校長 準学士課程学生
untitled
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
Microsoft Word - Training10_プリプロセッサ.docx
Training 10 プリプロセッサ 株式会社イーシーエス出版事業推進委員会 1 Lesson1 マクロ置換 Point マクロ置換を理解しよう!! マクロ置換の機能により 文字列の置き換えをすることが出来ます プログラムの可読性と保守性 ( メンテナンス性 ) を高めることができるため よく用いられます マクロ置換で値を定義しておけば マクロの値を変更するだけで 同じマクロを使用したすべての箇所が変更ができるので便利です
+ 1 ( ) I IA i i i 1 n m a 11 a 1j a 1m A = a i1 a ij a im a n1 a nj a nm.....
+ http://krishnathphysaitama-uacjp/joe/matrix/matrixpdf 1 ( ) I IA i i i 1 n m a 11 a 1j a 1m A = a i1 a ij a im a n1 a nj a nm (1) n m () (n, m) ( ) n m B = ( ) 3 2 4 1 (2) 2 2 ( ) (2, 2) ( ) C = ( 46
Chapter 3 Mathematica Mathematica e ( a n = ) n b n = n 1! + 1 2! n! b n a n e 3/n b n e 2/n! b n a n b n Mathematica Mat
Chapter 3 Mathematica Mathematica e ( a n = 1 + 1 ) n b n = 1 + 1 n 1! + 1 2! + + 1 n! b n a n e 3/n b n e 2/n! b n a n b n Mathematica 10 3.7 3.1 Mathematica { } 26 3 {a, b, c} {{a, b}, {c, d}} {Sin[x],
(300, 150) 120 getchar() HgBox(x, y, w, h) (x, y), w, h #include <stdio.h> #include <handy.h> int main(void) { int i; double w, h; } HgO
Handy Graphic for Handy Graphic Version 0.5 2008-06-09 1 Handy Graphic Handy Graphic C Handy Graphic Handy Graphic Mac OS X Handy Graphic HgDisplayer Handy Graphic HgDisplayer 2 Handy Graphic 1 Handy Graphic
main main Makefile Makefile C.5 Makefile Makefile Makefile A Mech (TA ) 1. Web (http://www.jsk.t.u-tokyo.ac.jp/ iku
2008 (mizuuchi@i.u-tokyo.ac.jp) http://www.jsk.t.u-tokyo.ac.jp/ http://www.jsk.t.u-tokyo.ac.jp/ ikuo/enshu/keisanki/ 2008 5 19 6 24 1 2 2.1 my_sound.c, my_sounc.h, play.c, record.c 2 2. 2.2 2.2.1 main
第１章
...1... 1... 1...3... 3... 5... 6...9... 9... 9... 9... 10... 12... 14 Windows...16... 16... 16...21... 21... 25...30...31...32...33 3 1 2 3 4 5 6 7 8 n x, y i 0,1,, n 1 i i y P x ) i 0, 1,, n 1 n 1 i
橡ソート手順比較
PAGE:1 [Page] 20 1 20 20 QuickSort 21 QuickSort 21 21 22 QuickSort 22 QuickSort 22 23 0 23 QuickSort 23 QuickSort 24 Order 25 25 26 26 7 26 QuickSort 27 PAGE:2 PAGE:3 program sort; { { type item = record
ex14.dvi
1,, 0, b (b b 2 b ) n k n = n j b j, (0 n j b 1), n =(n k n k 1...n 1 n 0 ) b, n j j j +1, 0,...,b 1 (digit). b b, n b 1 ñ, ñ = k (b 1 n j )b j b N, n b n, n = b N n, n =ñ+1 b N, n m n + m (mod b N ),
¥Ñ¥Ã¥±¡¼¥¸ Rhpc ¤Î¾õ¶·
Rhpc COM-ONE 2015 R 27 12 5 1 / 29 1 2 Rhpc 3 forign MPI 4 Windows 5 2 / 29 1 2 Rhpc 3 forign MPI 4 Windows 5 3 / 29 Rhpc, R HPC Rhpc, ( ), snow..., Rhpc worker call Rhpc lapply 4 / 29 1 2 Rhpc 3 forign