3 3.1 n > 1 n = 1/2 x = 0 x = z 2 z 2n+1 F n (η) = 2 dz (5) e z2 η 3.2 G B G (G transform) B (B transform) (Gray and Atchison) [2] S(η) = S t (η
|
|
|
- がんま かやぬま
- 7 years ago
- Views:
Transcription
1 Cloutman [1] 11 FORTRAN C 2 3 n E 1/2 f(e ) n = 1 2π 2 = 1 2π 2 = 1 2π 2 x = E /k B T η = µ/k B T ( ) 3/2 2m h 2 E 1/2 f(e )de 0 ( ) 3/2 2m E 1/2 h 2 de (1) e (E µ)/kbt ( ) 3/2 2mkB T x 1/2 dx (2) 1 + ex η h 2 (1) E 1/2 E 3/2 F n (η) = 0 0 x n dx (3) 1 + ex η n(the Fermi-Dirac integral of order n) 1 η η Cloutman [1] 11 B G Aitken Cloutman η [3, 4] (3) η x 1 F n = F n(η) = nf n 1 (η) (4) Z 1 x n dx Γ(n + 1) ex η n 1
2 3 3.1 n > 1 n = 1/2 x = 0 x = z 2 z 2n+1 F n (η) = 2 dz (5) e z2 η 3.2 G B G (G transform) B (B transform) (Gray and Atchison) [2] S(η) = S t (η) = a t a f(η, x)dx (6) f(η, x)dx (7) S(η) = lim t S t (η) (8) G B G[S(η); t, k] = S t+k(η) R t (η, k)s t (η), R t 1 (9) 1 R t (η, k) f(η, t + k) R t (η, k) = k > 0 (10) f(η, t) B[S(η); t, k] = S tk(η) ρ t (η, k)s t (η), ρ t 1 (11) 1 ρ t (η, k) kf(η, kt) ρ t (η, k) = k > 1 (12) f(η, t) lim G[S(η); t, k] = lim B[S(η); t, k] = S(η) (13) t t Gray Atchison lim t R t (η, k) 0, 1G S t+k (η) B f = e x S t G[S(η); t, k] = Sf = x s B[S(η); t, k] = S 2
3 3.3 Aitken µ 2µ 4µ H H/2 H/4 I µ I 2µ I 4µ I I = I µ + ch p (14) I = I 2µ + c(h/2) p (15) I = I 4µ + c(h/4) p (16) I = I 4µ (I 4µ I 2µ ) 2 (17) I 4µ 2I 2µ + I µ [ ] 1 I p = log 10 (2) log Iµ 10 (18) I I 2µ c = I I µ H p (19) 3.4 η < 0 η 0 (Cox and Giuli, 1968) F n (η) = Γ(n + 1)e η r=0 n = 1/2 n = 3/2n = 5/2 F 1/2 (η) = π1/2 2 F 3/2 (η) = 3π1/2 4 F 5/2 (η) = 15π1/2 8 e rη ( 1) r, n > 1 (20) (r + 1) n+1 ( 1) j=1 ( 1) j=1 ( 1) j=1 j+1 ejη, (21) j3/2 j+1 ejη j 5/2 (22) j+1 ejη j 7/2 (23) 3.5 η > 25 I(η) = 0 φ (u)du e u η + 1 (24) I(η) φ(η) + 2 C 2j φ 2j (η) (25) j=1 3
4 C 2 = π2 12, C 4 = 7π4 720, C 6 = 31π , C 8 = 127π , C 10 = 511π (26) (3) [ F n (η) = ηn n + 1 r=1 n = 1/2 n = 3/2 n = 5/2 ( n+1 2C 2r k=n 2r+2 k ) η 2r ], n > 0, η 1 (27) F 1/2 (η) 2 3 η3/2 + π2 12 η 1/2 + 7π4 960 η 5/2 + 31π η 9/ π η 13/2 (28) F 3/2 (η) 2 5 η5/2 + π2 4 η1/2 7π4 960 η 3/2 31π η 7/2 381π η 11/2 (29) F 5/2 (η) 2 7 η7/2 + 5π2 12 η3/2 + 7π4 192 η 1/2 + 31π η 5/ π η 9/2 (30) [1] L. D. Cloutman, Numerical evaluation of the Fermi-Dirac integrals, Astrophys. J. Suppl. Ser. 71, (1989). [2] H. L. Gray and T. A. Atchison, Applications of the G and B transforms to the Laplace transform, Proceedings of the rd ACM national conference, pp.73-77, (1968). pdf [3] 5 (2016/6/30 ). [4] (2016/6/29 ). [5] (2016/7/4 ). [1] FORTRAN n = 1/2 n = 1/2, 1/2, 3/2, 5/2 5 η 25 n = 1/2 [5] 1. /* fermi_dirac_inetgral.c -o fermi_dirac_integral */ /* translated from FDTAB written in the FORTRAN language to C. */ /* by M. Suzuki */ /* This program is based on the programme by Lawrence D. Cloutman, */ /* described in his original paper, "Numerical Evaluation of the */ 4
5 /* Fermi-Dirac Integrals",The Astrophysical Journal of Supplement */ /* Series vol.71, pp (1989). The paper is available at */ /* */ /* PROGRAM FDTAB */ /* COMPUTE ACCURATE TABLES OF FERMI-DIRAC INTEGRALS */ /* USING SIMPSON S RULE WITH EXTRAPOLATION TECHNIQUES */ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> /* Evaluate the integrand at (x, eta) */ double fint(double x, double eta) double z; z=2*x*x/(exp(x*x-eta)+1); return z; int main(int argc, char *argv[]) FILE *fp; char filenameout[200], dummy[200]; int m2, m4, mpts, mptsav, n, ne, nfail, ngb, nm, itrap, N; int i, ii, j; double a, b, bad, bgt, binc, bk, bkt, bratio, bsave; double bxfrm, cextr, de, denom, digits, eta, eta0, extrap; double fmax, fsum, gk, gkt, gxfrm, h, pextr; double rgb, rob, rog, xmax; double relerr, seta, sgxfrm; double x[2000], f[2000], value[20]; /* INITIAL DATA */ /* (a, b) are the starting values fo the integration limits (0, t) */ a=0.0; b=1.0; /* binc is the increment in b used by the adaptive upper */ /* integration limit routine, bratio is the maximum value */ /* of f(b)/max(f),where the function f is the integrand. */ binc=0.5; bratio=1.0e-6; /* Incrementing factors for the B and G transforms */ gk=1.0; bk=1.1; /* mpts is the number of mesh points to which Simpson s rule */ /* is applied for the coarsest mesh, must be an odd integer */ mpts=201; /* eta0 is the first value of degeneracy parameter, de is the */ 5
6 /* increment in eta, and ne is the number of eta values */ eta0=-5.0; de=0.05; ne=601; /* nfail is a diagnostic that counts extrapolation failures */ nfail=0; /* itrap=1 for trapezoidal rule, */ /* otherwise Simpson s rule integration */ itrap=0; /* make sure mpts is even for Simpson s rule */ if((mpts % 2)!=1 && itrap==0) printf("%d should be even\n", mpts); exit(0); mptsav=mpts; bsave=b; /* Outer loop is over all values of eta */ for(n=0;n<ne;n++) eta=eta0+de*n; bad=bsave; printf("\neta=%lf\n", eta); /* This loop does the three integrations required for the */ /* B and G transforms, after which the transforms are computed. */ for(ngb=0;ngb<3;ngb++) /* Set appropriate upper integration limit */ b=bad; if(ngb==1) b=bad+gk; if(ngb==2) b=bad*bk; /* This loop increments the number of mesh points to do the */ /* three integrations required for each Aitken extrapolation. */ for(nm=0;nm<3;nm++) while(1) m2=(mpts-3)/2; m4=m2+1; h=(b-a)/(mpts-1); fmax=-1.0e100; for(j=0;j<mpts;j++) x[j]=a+h*j; f[j]=fint(x[j], eta); 6
7 if(f[j] >= fmax) xmax=x[j]; fmax=f[j]; if((ngb!= 0) (nm!= 0) (f[mpts-1] < bratio*fmax) (b > 100.0)) break; b+=binc; bad=b; if(nm==0) printf("fmax %le at %lf, end point x=%lf f=%le\n", fmax,xmax,x[mpts-1],f[mpts-1]); if(itrap==1) /* Use trapezoidal rule integrations */ fsum=0.0; for(i=0;i<mpts;i++) fsum+=f[i]; value[nm]=h*(fsum-0.5*(f[0]+f[mpts-1])); else /* Integrate the f array with Simpson s rule */ fsum=0.0; for(ii=0;ii<m2;ii++) i=ii; // j descending order i=m2-ii+1; // j ascending order j=m4-i; fsum+=2*f[2*j+1]+f[2*j+2]; value[nm]=h*(2*fsum+f[0]+f[mpts-1]+4*f[mpts-2])/3; printf("integral=%20.14le for mpts=%d\n", value[nm], mpts); printf("%d\t%le\t%le\t%le\n", nm, value[0], value[1], value[2]); if(nm < 2) mpts=2*(mpts-1)+1; /* Aitken extrapolation */ denom=value[2]+value[0]-2*value[1]; if(denom!= 0.0) extrap=value[2]-pow((value[2]-value[1]),2)/denom; else 7
8 extrap=value[2]; nfail++; printf("cannot perform Aitken extrapolation\n"); if(extrap-value[1]!= 0.0) denom=(extrap-value[0])/(extrap-value[1]); else denom=0.0; if(denom > 0.0) pextr=log10(denom)/log10(2.0); h=(b-a)/(mptsav-1); cextr=(extrap-value[0])/pow(h, pextr); else nfail++; pextr= ; cextr=pextr; printf("cannot compute Aitken parameters p and c\n "); printf("extrap=%le, value[1,2]=%le, %le\n", extrap, value[0], value[1]); relerr=fabs((extrap-value[2])/extrap); if(relerr > 0.0) digits=-log10(relerr); else digits=-30.0; printf("extrapolated integral = %le, ", extrap); printf("p=%le, c=%le, h=%le, digits=%lf\n", pextr, cextr, h, digits); if(ngb==0) bgt=extrap; rgb=f[mpts-1]; if(ngb==1) gkt=extrap; rog=f[mpts-1]; if(ngb==2) bkt=extrap; rob=f[mpts-1]; mpts=mptsav; /* Calculate the B and G transforms */ rog=rog/rgb; rob=bk*rob/rgb; 8
9 printf("%le\t%le\t%20.12le\n", rog, rob, f[mpts-1]); /* Limited error checking */ if(rob <= 0.0 rog <=0.0) printf("eta=%le, rob=%le, rog=%le, Cannot do B and G transforms", eta, rob, rog); exit(0); gxfrm=(gkt-rog*bgt)/(1.0-rog); bxfrm=(bkt-rob*bgt)/(1.0-rob); printf("g transform=%le, B transform=%le\n", gxfrm, bxfrm); relerr=fabs((gxfrm-gkt)/gxfrm); if(relerr > 0.0) digits=-log10(relerr); else digits=-30; seta=eta; sgxfrm=gxfrm; printf("%lf\t%18.11le\n", seta, sgxfrm); printf("%lf\t%le, %lf digits G xfrm\n", seta, sgxfrm, digits); 2. /* FDSET.c -o FDSET */ /* translated from FDSET written in the FORTRAN language to C. */ /* by M. Suzuki */ /* This program is based on the programm written by Lawrence D. Cloutman, */ /* described in his original paper, "Numerical Evaluation of the */ /* Fermi-Dirac Integrals",The Astrophysical Journal of Supplement */ /* Series vol.71, pp (1989). The paper is available at */ /* */ /* SUBROUTINE FDSET */ /* THIS SUBROUTINE INITIALIZES ARRAYS NEEDED BY FUNCTION FD. */ /* FDSET IS CALLED ONCE (AND ONLY ONCE) BEFORE CALLING FD. */ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> static double fdtab; static double F[601][4], ahi[5][3], alo[5][3]; /* SET UP F-D INTEGRAL ASSYMPTOTIC EXPANSION COEFFICIENTS */ int FDSET(void) FILE *fp; char filenamein[100]; int i; 9
10 double a, pi, e0, f0, f1, f2, f3; pi=m_pi; strcpy(filenamein, "FD_table.txt"); a=sqrt(pi)/2; alo[0][0]=a; alo[1][0]=-a/pow(sqrt(2),3); alo[2][0]=a/pow(sqrt(3),3); alo[3][0]=-a/8; alo[4][0]=a/pow(sqrt(5),3); a=3*sqrt(pi)/4; alo[0][1]=a; alo[1][1]=-a/pow(sqrt(2),5); alo[2][1]=a/pow(sqrt(3),5); alo[3][1]=-a/32; alo[4][1]=a/pow(sqrt(5),5); a=15*sqrt(pi)/8; alo[0][2]=a; alo[1][2]=-a/pow(sqrt(2),7); alo[2][2]=a/pow(sqrt(3),7); alo[3][2]=-a/128; alo[4][2]=a/pow(sqrt(5),7); ahi[0][0]=2/3; ahi[1][0]=pow(pi, 2)/12; ahi[2][0]=pow(pi, 4)*7/960; ahi[3][0]=pow(pi, 6)*31/4608; ahi[4][0]=pow(pi, 8)*1397/81920; ahi[0][1]=0.4; ahi[1][1]=pow(pi, 2)/4; ahi[2][1]=-ahi[2][0]; ahi[3][1]=-pow(pi, 6)*31/10752; ahi[4][1]=-pow(pi, 8)*381/81920; ahi[0][2]=2/7; ahi[1][2]=pow(pi, 2)*5/12; ahi[2][2]=pow(pi, 4)*7/192; ahi[3][2]=pow(pi, 6)*31/10752; ahi[4][2]=pow(pi, 8)*127/49152; /* READ IN FERMI-DIRAC INTEGRAL TABLES GIVEN IN TABLE 5 */ if((fp=fopen(filenamein, "r"))==0) exit(0); i=0; while(i<601) fscanf(fp, "%lf\t%le\t%le\t%le\t%le\n", &e0,&f0,&f1,&f2,&f3); F[i][0]=f0; F[i][1]=f1; F[i][2]=f2; F[i][3]=f3; i++; fclose(fp); return 0; 10
11 /* COMPUTES THE FERMI-DIRAC INTEGRAL FD FOR DEGENERACY */ /* PARAMETER ETA. n=1 FOR ORDER 1/2; n=2 FOR ORDER 3/2; n=3 FOR ORDER 3/2. */ double FD(double eta, int n) int j, k, kk, l; double u, z; double x0, x1, x2, y0, y1, y2, s0, s1, s2; double HERMITE5(); if(eta >= -5 && eta <= 25) /* FIFTH ORDER HERMITE INTERPOLATION FOR INTERMEDIATE VALUES OF ETA. */ j=(eta+5)*20; if(j < 1) j=1; if(j > 599) j=599; x0= *(j-1); x1=x0+0.05; x2=x0+0.1; y0=f[j-1][n]; y1=f[j][n]; y2=f[j+1][n]; s0=f[j-1][n-1]*(n-0.5); s1=f[j][n-1]*(n-0.5); s2=f[j+1][n-1]*(n-0.5); z=hermite5(eta, x0, y0, s0, x1, y1, s1, x2, y2, s2); return z; if(eta <-5) z=0; for(k=0;k<5;k++) kk=k+1; z+=alo[k][n]*exp(k*eta); return z; if(eta >25) u=sqrt(eta); l=1+2*n; z=0; for(k=0;k<5;k++) z+=ahi[k][n]*pow(u,l-4*k); return z; 11
12 /* FIFTH ORDER HERMITE INTERPOLATION */ /* x = value of the independent variable where the function value */ /* Hermite5 is desired. */ /* x0, x1, x2 = values of the independent variable at the three */ /* interpolation nodes. */ /* p0, p1, p2 = function values at the interpolation nodes. */ /* dp0, dp1, dp2 = first derivatives of the function */ /* at the interpolation nodes. */ double HERMITE5(double x, double x0, double p0, double dp0, double x1, double p1, double dp1, double x2, double p2, double dp2) double xp, h; double a0, a1, a2, a3, a4, a5; h=x1-x0; xp=x-x1; a0=p1; a1=dp1; a4=(h*(dp2-dp0)-2*(p0+p2-p1-p1)); a2=((p0+p2-p1-p1)*-a4)/(4*h*h); a4*=0.25/pow(h, 4); a5=0.25*(h*(dp2+4*dp1+dp0)-3*(p2-p0)); a3=(0.5*(p2-p0)-h*dp1-a5)/pow(h, 3); a5/=pow(h, 5); return ((((a5*xp+a4)*xp+a3)*xp+a2)*xp+a1)*xp+a0; int main(int argc, char *argv[]) FILE *fp; int i, n; double eta, z; if(argc<3) printf("usage; a.out eta n\n"); exit(0); i=fdset(); eta=atof(argv[1]); n=atoi(argv[2]); z=fd(eta, n); printf("%8.5lf\t%2d\t%19.11le\n", eta, n, z); 12
実際の株価データを用いたオプション料の計算
2002 2 20 1 1 3 2 3 2.1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.1.1 : : : : : : : : : : : : : : : : : : : : 5 2.1.2 : : : : : : : : : : : : : : : : : : : : 6 2.2 : : : : : : : : : :
£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裵²ó ¨¡ À©¸æ¹½Â¤¡§¾ò·ïʬ´ô ¨¡
(2018) 2018 5 17 0 0 if switch if if ( ) if ( 0) if ( ) if ( 0) if ( ) (0) if ( 0) if ( ) (0) ( ) ; if else if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 (0) 2 if else
超初心者用
3 1999 10 13 1. 2. hello.c printf( Hello, world! n ); cc hello.c a.out./a.out Hello, world printf( Hello, world! n ); 2 Hello, world printf n printf 3. ( ) int num; num = 100; num 100 100 num int num num
C
C 1 2 1.1........................... 2 1.2........................ 2 1.3 make................................................ 3 1.4....................................... 5 1.4.1 strip................................................
ex01.dvi
,. 0. 0.0. C () /******************************* * $Id: ex_0_0.c,v.2 2006-04-0 3:37:00+09 naito Exp $ * * 0. 0.0 *******************************/ #include int main(int argc, char **argv) double
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
untitled
Fortran90 ( ) 17 12 29 1 Fortran90 Fortran90 FORTRAN77 Fortran90 1 Fortran90 module 1.1 Windows Windows UNIX Cygwin (http://www.cygwin.com) C\: Install Cygwin f77 emacs latex ps2eps dvips Fortran90 Intel
DOPRI5.dvi
ODE DOPRI5 ( ) 16 3 31 Runge Kutta Dormand Prince 5(4) [1, pp. 178 179] DOPRI5 http://www.unige.ch/math/folks/hairer/software.html Fortran C C++ [3, pp.51 56] DOPRI5 C cprog.tar % tar xvf cprog.tar cprog/
Microsoft Word - 03-数値計算の基礎.docx
δx f x 0 + δ x n=0 a n = f ( n) ( x 0 ) n δx n f x x=0 sin x = x x3 3 + x5 5 x7 7 +... x ( ) = a n δ x n ( ) = sin x ak = (-mod(k,2))**(k/2) / fact_k 10 11 I = f x dx a ΔS = f ( x)h I = f a h I = h b (
,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
30
3 ............................................2 2...........................................2....................................2.2...................................2.3..............................
fx-9860G Manager PLUS_J
fx-9860g J fx-9860g Manager PLUS http://edu.casio.jp k 1 k III 2 3 1. 2. 4 3. 4. 5 1. 2. 3. 4. 5. 1. 6 7 k 8 k 9 k 10 k 11 k k k 12 k k k 1 2 3 4 5 6 1 2 3 4 5 6 13 k 1 2 3 1 2 3 1 2 3 1 2 3 14 k a j.+-(),m1
Microsoft Word - 資料 (テイラー級数と数値積分).docx
δx δx n x=0 sin x = x x3 3 + x5 5 x7 7 +... x ak = (-mod(k,2))**(k/2) / fact_k ( ) = a n δ x n f x 0 + δ x a n = f ( n) ( x 0 ) n f ( x) = sin x n=0 58 I = b a ( ) f x dx ΔS = f ( x)h I = f a h h I = h
1 Fourier Fourier Fourier Fourier Fourier Fourier Fourier Fourier Fourier analog digital Fourier Fourier Fourier Fourier Fourier Fourier Green Fourier
Fourier Fourier Fourier etc * 1 Fourier Fourier Fourier (DFT Fourier (FFT Heat Equation, Fourier Series, Fourier Transform, Discrete Fourier Transform, etc Yoshifumi TAKEDA 1 Abstract Suppose that u is
28 Horizontal angle correction using straight line detection in an equirectangular image
28 Horizontal angle correction using straight line detection in an equirectangular image 1170283 2017 3 1 2 i Abstract Horizontal angle correction using straight line detection in an equirectangular image
II ( ) 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
j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E
8 9 7 6 4 2 3 5 1 j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E a n 1 H = ae l j, j=1 l j = x j+1 x j, x n x 1 = n 1 j=1 l j, l j = ±l l > 0) n 1 H = ϵ l j, j=1 ϵ e x x
ex01.dvi
,. 0. 0.0. C () /******************************* * $Id: ex_0_0.c,v.2 2006-04-0 3:37:00+09 naito Exp $ * * 0. 0.0 *******************************/ #include int main(int argc, char **argv) { double
I, II 1, A = A 4 : 6 = max{ A, } A A 10 10%
1 2006.4.17. A 3-312 tel: 092-726-4774, e-mail: [email protected], http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office hours: B A I ɛ-δ ɛ-δ 1. 2. A 1. 1. 2. 3. 4. 5. 2. ɛ-δ 1. ɛ-n
スライド 1
Matsuura Laboratory SiC SiC 13 2004 10 21 22 H-SiC ( C-SiC HOY Matsuura Laboratory n E C E D ( E F E T Matsuura Laboratory Matsuura Laboratory DLTS Osaka Electro-Communication University Unoped n 3C-SiC
料理集
ABC Cooking Studio 1 2 3 ABC Cooking Studio ABC Cooking Studio Point Point ABC Cooking Studio Point ABC Cooking Studio ABC Cooking Studio Point
新版明解Ｃ言語 実践編
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 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf ("%s", str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i
![1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf (%s, str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i](/thumbs/89/99201513.jpg "1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf (%s, str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i")
ABC066 / ARC077 writer: nuip 2017 7 1 For International Readers: English editorial starts from page 8. A : ringring a + b b + c a + c a, b, c a + b + c 1 # include < stdio.h> 2 3 int main (){ 4 int a,
comment.dvi
( ) (sample1.c) (sample1.c) 2 2 Nearest Neighbor 1 (2D-class1.dat) 2 (2D-class2.dat) (2D-test.dat) 3 Nearest Neighbor Nearest Neighbor ( 1) 2 1: NN 1 (sample1.c) /* -----------------------------------------------------------------
[2] OCR [3], [4] [5] [6] [4], [7] [8], [9] 1 [10] Fig. 1 Current arrangement and size of ruby. 2 Fig. 2 Typography combined with printing
![[2] OCR [3], [4] [5] [6] [4], [7] [8], [9] 1 [10] Fig. 1 Current arrangement and size of ruby. 2 Fig. 2 Typography combined with printing](/thumbs/93/112070099.jpg "[2] OCR [3], [4] [5] [6] [4], [7] [8], [9] 1 [10] Fig. 1 Current arrangement and size of ruby. 2 Fig. 2 Typography combined with printing")
1,a) 1,b) 1,c) 2012 11 8 2012 12 18, 2013 1 27 WEB Ruby Removal Filters Using Genetic Programming for Early-modern Japanese Printed Books Taeka Awazu 1,a) Masami Takata 1,b) Kazuki Joe 1,c) Received: November
() n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (5) (6 ) n C + nc + 3 nc n nc n (7 ) n C + nc + 3 nc n nc n (
3 n nc k+ k + 3 () n C r n C n r nc r C r + C r ( r n ) () n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (4) n C n n C + n C + n C + + n C n (5) k k n C k n C k (6) n C + nc
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
4. ϵ(ν, T ) = c 4 u(ν, T ) ϵ(ν, T ) T ν π4 Planck dx = 0 e x 1 15 U(T ) x 3 U(T ) = σt 4 Stefan-Boltzmann σ 2π5 k 4 15c 2 h 3 = W m 2 K 4 5.
A 1. Boltzmann Planck u(ν, T )dν = 8πh ν 3 c 3 kt 1 dν h 6.63 10 34 J s Planck k 1.38 10 23 J K 1 Boltzmann u(ν, T ) T ν e hν c = 3 10 8 m s 1 2. Planck λ = c/ν Rayleigh-Jeans u(ν, T )dν = 8πν2 kt dν c
Trapezoidal Rule θ = 1/ x n x n 1 t = 1 [f(t n 1, x n 1 ) + f(t n, x n )] (6) 1. dx dt = f(t, x), x(t 0) = x 0 (7) t [t 0, t 1 ] f t [t 0, t 1 ], x x
![Trapezoidal Rule θ = 1/ x n x n 1 t = 1 [f(t n 1, x n 1 ) + f(t n, x n )] (6) 1. dx dt = f(t, x), x(t 0) = x 0 (7) t [t 0, t 1 ] f t [t 0, t 1 ], x x](/thumbs/92/107866474.jpg "Trapezoidal Rule θ = 1/ x n x n 1 t = 1 [f(t n 1, x n 1 ) + f(t n, x n )] (6) 1. dx dt = f(t, x), x(t 0) = x 0 (7) t [t 0, t 1 ] f t [t 0, t 1 ], x x")
University of Hyogo 8 8 1 d x(t) =f(t, x(t)), dt (1) x(t 0 ) =x 0 () t n = t 0 + n t x x n n x n x 0 x i i = 0,..., n 1 x n x(t) 1 1.1 1 1 1 0 θ 1 θ x n x n 1 t = θf(t n 1, x n 1 ) + (1 θ)f(t n, x n )
ohp03.dvi
19 3 ( ) 2019.4.20 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void int main(int argc, char *argv[]) {... 2 (2) argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0
2000年度『数学展望 I』講義録
2000 I I IV I II 2000 I I IV I-IV. i ii 3.10 (http://www.math.nagoya-u.ac.jp/ kanai/) 2000 A....1 B....4 C....10 D....13 E....17 Brouwer A....21 B....26 C....33 D....39 E. Sperner...45 F....48 A....53
DKA ( 1) 1 n i=1 α i c n 1 = 0 ( 1) 2 n i 1 <i 2 α i1 α i2 c n 2 = 0 ( 1) 3 n i 1 <i 2 <i 3 α i1 α i2 α i3 c n 3 = 0. ( 1) n 1 n i 1 <i 2 < <i
149 11 DKA IEEE754 11.1 DKA n p(x) = a n x n + a n 1 x n 1 + + a 0 (11.1) p(x) = 0 (11.2) p n (x) q n (x) = x n + c n 1 x n 1 + + c 1 x + c 0 q n (x) = 0 (11.3) c i = a i a n (i = 0, 1,..., n 1) (11.3)
RX600 & RX200シリーズ アプリケーションノート RX用仮想EEPROM
R01AN0724JU0170 Rev.1.70 MCU EEPROM RX MCU 1 RX MCU EEPROM VEE VEE API MCU MCU API RX621 RX62N RX62T RX62G RX630 RX631 RX63N RX63T RX210 R01AN0724JU0170 Rev.1.70 Page 1 of 33 1.... 3 1.1... 3 1.2... 3
25 II :30 16:00 (1),. Do not open this problem booklet until the start of the examination is announced. (2) 3.. Answer the following 3 proble
25 II 25 2 6 13:30 16:00 (1),. Do not open this problem boolet until the start of the examination is announced. (2) 3.. Answer the following 3 problems. Use the designated answer sheet for each problem.
XcalableMP入門
XcalableMP 1 HPC-Phys@, 2018 8 22 XcalableMP XMP XMP Lattice QCD!2 XMP MPI MPI!3 XMP 1/2 PCXMP MPI Fortran CCoarray C++ MPIMPI XMP OpenMP http://xcalablemp.org!4 XMP 2/2 SPMD (Single Program Multiple Data)
20 6 4 1 4 1.1 1.................................... 4 1.1.1.................................... 4 1.1.2 1................................ 5 1.2................................... 7 1.2.1....................................
JFE.dvi
,, Department of Civil Engineering, Chuo University Kasuga 1-13-27, Bunkyo-ku, Tokyo 112 8551, JAPAN E-mail : [email protected] E-mail : [email protected] SATO KOGYO CO., LTD. 12-20, Nihonbashi-Honcho
Part () () Γ Part ,
Contents a 6 6 6 6 6 6 6 7 7. 8.. 8.. 8.3. 8 Part. 9. 9.. 9.. 3. 3.. 3.. 3 4. 5 4.. 5 4.. 9 4.3. 3 Part. 6 5. () 6 5.. () 7 5.. 9 5.3. Γ 3 6. 3 6.. 3 6.. 3 6.3. 33 Part 3. 34 7. 34 7.. 34 7.. 34 8. 35
( ) sin 1 x, cos 1 x, tan 1 x sin x, cos x, tan x, arcsin x, arccos x, arctan x. π 2 sin 1 x π 2, 0 cos 1 x π, π 2 < tan 1 x < π 2 1 (1) (
6 20 ( ) sin, cos, tan sin, cos, tan, arcsin, arccos, arctan. π 2 sin π 2, 0 cos π, π 2 < tan < π 2 () ( 2 2 lim 2 ( 2 ) ) 2 = 3 sin (2) lim 5 0 = 2 2 0 0 2 2 3 3 4 5 5 2 5 6 3 5 7 4 5 8 4 9 3 4 a 3 b
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.................................
D = [a, b] [c, d] D ij P ij (ξ ij, η ij ) f S(f,, {P ij }) S(f,, {P ij }) = = k m i=1 j=1 m n f(ξ ij, η ij )(x i x i 1 )(y j y j 1 ) = i=1 j
![D = [a, b] [c, d] D ij P ij (ξ ij, η ij ) f S(f,, {P ij }) S(f,, {P ij }) = = k m i=1 j=1 m n f(ξ ij, η ij )(x i x i 1 )(y j y j 1 ) = i=1 j](/thumbs/103/158001152.jpg "D = [a, b] [c, d] D ij P ij (ξ ij, η ij ) f S(f,, {P ij }) S(f,, {P ij }) = = k m i=1 j=1 m n f(ξ ij, η ij )(x i x i 1 )(y j y j 1 ) = i=1 j")
6 6.. [, b] [, d] ij P ij ξ ij, η ij f Sf,, {P ij } Sf,, {P ij } k m i j m fξ ij, η ij i i j j i j i m i j k i i j j m i i j j k i i j j kb d {P ij } lim Sf,, {P ij} kb d f, k [, b] [, d] f, d kb d 6..
T 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,
![T 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,](/thumbs/93/114160334.jpg "T 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
取扱説明書
ER-LD530 STEP 1 STEP 2 STEP 3 STEP 4 STEP 5 1 5 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 1 2 3 22 23 1 2 24 25 26 27 1 2 3 28 29 30 31 32 33 34 1 2 3 35 1 2 3 36 37 1 2 3 4 38 39 1 2 3 4 40
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,,
x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y)
x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 1 1977 x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y) ( x 2 y + xy 2 x 2 2xy y 2) = 15 (x y) (x + y) (xy
5 11 3 1....1 2. 5...4 (1)...5...6...7...17...22 (2)...70...71...72...77...82 (3)...85...86...87...92...97 (4)...101...102...103...112...117 (5)...121...122...123...125...128 1. 10 Web Web WG 5 4 5 ²
. ev=,604k m 3 Debye ɛ 0 kt e λ D = n e n e Ze 4 ln Λ ν ei = 5.6π / ɛ 0 m/ e kt e /3 ν ei v e H + +e H ev Saha x x = 3/ πme kt g i g e n
003...............................3 Debye................. 3.4................ 3 3 3 3. Larmor Cyclotron... 3 3................ 4 3.3.......... 4 3.3............ 4 3.3...... 4 3.3.3............ 5 3.4.........
tuat1.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( )
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,
Study on Application of the cos a Method to Neutron Stress Measurement Toshihiko SASAKI*3 and Yukio HIROSE Department of Materials Science and Enginee
Study on Application of the cos a Method to Neutron Stress Measurement Toshihiko SASAKI*3 and Yukio HIROSE Department of Materials Science and Engineering, Kanazawa University, Kakuma-machi, Kanazawa-shi,
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,
11042 計算機言語7回目 サポートページ:
11042 7 :https://goo.gl/678wgm November 27, 2017 10/2 1(print, ) 10/16 2(2, ) 10/23 (3 ) 10/31( ),11/6 (4 ) 11/13,, 1 (5 6 ) 11/20,, 2 (5 6 ) 11/27 (7 12/4 (9 ) 12/11 1 (10 ) 12/18 2 (10 ) 12/25 3 (11
r08.dvi
19 8 ( ) 019.4.0 1 1.1 (linked list) ( ) next ( 1) (head) (tail) ( ) top head tail head data next 1: NULL nil ( ) NULL ( NULL ) ( 1 ) (double linked list ) ( ) 1 next 1 prev 1 head cur tail head cur prev
Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb Phrase VP while before [ MP MP [ IP IP [ VP VP ]]] [ MP [ IP [ VP ]]]
![Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb Phrase VP while before [ MP MP [ IP IP [ VP VP ]]] [ MP [ IP [ VP ]]]](/thumbs/89/98876548.jpg "Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb Phrase VP while before [ MP MP [ IP IP [ VP VP ]]] [ MP [ IP [ VP ]]]")
30 4 2016 3 pp.195-209. 2014 N=23 (S)AdvOV (S)OAdvV 2 N=17 (S)OAdvV 2014 3, 2008 Koizumi 1993 3 MP IP VP 1 MP 2006 2002 195 Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb
θ (t) ω cos θ(t) = ( : θ, θ. ( ) ( ) ( 5) l () θ (t) = ω sin θ(t). ω := g l.. () θ (t) θ (t)θ (t) + ω θ (t) sin θ(t) =. [ ] d dt θ (t) ω cos θ(t
![θ (t) ω cos θ(t) = ( : θ, θ. ( ) ( ) ( 5) l () θ (t) = ω sin θ(t). ω := g l.. () θ (t) θ (t)θ (t) + ω θ (t) sin θ(t) =. [ ] d dt θ (t) ω cos θ(t](/thumbs/92/108011133.jpg "θ (t) ω cos θ(t) = ( : θ, θ. ( ) ( ) ( 5) l () θ (t) = ω sin θ(t). ω := g l.. () θ (t) θ (t)θ (t) + ω θ (t) sin θ(t) =. [ ] d dt θ (t) ω cos θ(t")
7 8, /3/, 5// http://nalab.mind.meiji.ac.jp/~mk/labo/text/furiko/ l (, simple pendulum) m g mlθ (t) = mg sin θ(t) () θ (t) + ω sin θ(t) =, ω := ( m ) ( θ ) sin θ θ θ (t) + ω θ(t) = ( ) ( ) g l θ(t) = C
1 28 6 12 7 1 7.1...................................... 2 7.1.1............................... 2 7.1.2........................... 2 7.2...................................... 3 7.3...................................
161 J 1 J 1997 FC 1998 J J J J J2 J1 J2 J1 J2 J1 J J1 J1 J J 2011 FIFA 2012 J 40 56
J1 J1 リーグチーム組織に関する考察 松原悟 Abstract J League began in 1993 by 10 teams. J League increased them by 40 teams in 2012. The numerical increase of such a team is a result of the activity of Football Association
C el = 3 2 Nk B (2.14) c el = 3k B C el = 3 2 Nk B
I [email protected] 217 11 14 4 4.1 2 2.4 C el = 3 2 Nk B (2.14) c el = 3k B 2 3 3.15 C el = 3 2 Nk B 3.15 39 2 1925 (Wolfgang Pauli) (Pauli exclusion principle) T E = p2 2m p T N 4 Pauli Sommerfeld
浜松医科大学紀要
On the Statistical Bias Found in the Horse Racing Data (1) Akio NODA Mathematics Abstract: The purpose of the present paper is to report what type of statistical bias the author has found in the horse
C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in
![C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in](/thumbs/88/114913715.jpg "C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in")
C 1 / 21 C 2005 A * 1 2 1.1......................................... 2 1.2 *.......................................... 3 2 4 2.1.............................................. 4 2.2..............................................
AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(
![AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(](/thumbs/104/161880166.jpg "AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(")
AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) 29 4 29 A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]: print( YES ) else: print( NO ) 1 B:
Introduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for
Introduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for embedded systems that use microcontrollers (MCUs)
II (Percolation) ( 3-4 ) 1. [ ],,,,,,,. 2. [ ],.. 3. [ ],. 4. [ ] [ ] G. Grimmett Percolation Springer-Verlag New-York [ ] 3
![II (Percolation) ( 3-4 ) 1. [ ],,,,,,,. 2. [ ],.. 3. [ ],. 4. [ ] [ ] G. Grimmett Percolation Springer-Verlag New-York [ ] 3](/thumbs/94/121840826.jpg "II (Percolation) ( 3-4 ) 1. [ ],,,,,,,. 2. [ ],.. 3. [ ],. 4. [ ] [ ] G. Grimmett Percolation Springer-Verlag New-York [ ] 3")
II (Percolation) 12 9 27 ( 3-4 ) 1 [ ] 2 [ ] 3 [ ] 4 [ ] 1992 5 [ ] G Grimmett Percolation Springer-Verlag New-York 1989 6 [ ] 3 1 3 p H 2 3 2 FKG BK Russo 2 p H = p T (=: p c ) 3 2 Kesten p c =1/2 ( )
2 ( ) i
25 Study on Rating System in Multi-player Games with Imperfect Information 1165069 2014 2 28 2 ( ) i ii Abstract Study on Rating System in Multi-player Games with Imperfect Information Shigehiko MORITA
¥Ñ¥Ã¥±¡¼¥¸ 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
x () g(x) = f(t) dt f(x), F (x) 3x () g(x) g (x) f(x), F (x) (3) h(x) = x 3x tf(t) dt.9 = {(x, y) ; x, y, x + y } f(x, y) = xy( x y). h (x) f(x), F (x
[ ] IC. f(x) = e x () f(x) f (x) () lim f(x) lim f(x) x + x (3) lim f(x) lim f(x) x + x (4) y = f(x) ( ) ( s46). < a < () a () lim a log xdx a log xdx ( ) n (3) lim log k log n n n k=.3 z = log(x + y ),
LC304_manual.ai
Stick Type Electronic Calculator English INDEX Stick Type Electronic Calculator Instruction manual INDEX Disposal of Old Electrical & Electronic Equipment (Applicable in the European Union
Microsoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ