1. ( ) SPH 1. 1: 2: 2.

Size: px
Start display at page:

Download "1. ( ) SPH 1. 1: 2: 2."

Transcription

1 SPH 2014/08/

2 1. ( ) SPH 1. 1: 2: 2.

3 1. ( )

4 MPI SIMD

5 :

6 1. MPI : 2. ( ) MPI :

7 ( ) : DRY (Don t Repeat Yourself)

8 ( ) : DRY (Don t Repeat Yourself) ( )

9 (SPH MPS MLS ) ( : Tree, FMM, PME ) ( ) ( ) ( )

10 API C++ ( ) (I/O )

11 SPH MPI

12 Recursive Multisection (JM 2004) Tofu ( )

13 1. #include<particle_simulator.h> // class ResultForce{ // public: void clear(){ // acc = 0.0; pot = 0.0; } // PS::F64vec acc; PS::F64 pot; };

14 (1) class RealPtcl{ // public: PS::F64vec getpos() const { // return this->pos; } PS::F64 getcharge() const { // return this->mass; } void copyfromforce(const ResultForce & force){ // this->acc = force.acc; this->pot = force.pot; }

15 (2) // PS::S64 id; PS::F64 mass; PS::F64vec pos; PS::F64vec vel; PS::F64vec acc; PS::F64 pot; PS::S32 loadoneparticle(file * fp) { PS::S32 ret = 0; ret = fscanf(fp, "%lf%lf%lf%lf%lf%lf%lf", &this->mass, &this->pos[0], &this->pos[1], &this->pos[2 &this->vel[0], &this->vel[1], &this->vel[2 std::cout<<"this->mass"<<this->mass<<std::endl; return ret; }

16 (3) void dumponeparticle(file * fp){ fprintf(fp, "%lf %lf %lf %lf %lf %lf %lf this->mass, this->pos[0], this->pos[1], this->pos[2], this->vel[0], this->vel[1], this->vel[2]); } }; class EssentialPtclI{ public: void copyfromrp(const RealPtcl & rp){ // pos = rp.pos; id = rp.id; } }; // PS::F64vec pos; PS::S64 id;

17 (4) class EssentialPtclJ{ public: void copyfromrp(const RealPtcl & rp){ // mass = rp.mass; pos = rp.pos; id = rp.id; } }; // PS::S64 id; PS::F64 mass; PS::F64vec pos;

18 void CalcForceEpEp(const EssentialPtclI * ep_i, const PS::S32 n_ip, const EssentialPtclJ * ep_j, const PS::S32 n_jp, ResultForce * force){ for(ps::s32 i=0; i<n_ip; i++){ PS::F64vec xi = ep_i[i].pos; PS::F64vec ai = 0.0; PS::F64 poti = 0.0; PS::S64 idi = ep_i[i].id; for(ps::s32 j=0; j<n_jp; j++){ if( idi == ep_j[j].id ) continue; PS::F64vec rij = xi - ep_j[j].pos; PS::F64 r3_inv = rij * rij; PS::F64 r_inv = 1.0/sqrt(r3_inv); r3_inv = r_inv * r_inv; r_inv *= ep_j[j].mass; r3_inv *= r_inv; ai -= r3_inv * rij; poti -= r_inv;

19 } } ( ) } force[i].acc = ai; force[i].pot = poti;

20 ( ) // (Leapfrog) void Kick(PS::ParticleSystem<RealPtcl> system, const PS::F64 dt){ RealPtcl * rp = system.getparticlepointer(); PS::S32 ni = system.getnumberofparticlelocal(); for(int i=0; i<ni; i++){ rp[i].vel = rp[i].acc * dt; } } void Drift(PS::ParticleSystem<RealPtcl> system, const PS::F64 dt){ RealPtcl * rp = system.getparticlepointer(); PS::S32 ni = system.getnumberofparticlelocal(); for(int i=0; i<ni; i++){ rp[i].pos = rp[i].vel * dt; } }

21 int main(int argc, char *argv[]){ PS::Initialize(argc, argv); // PS::ParticleSystem<RealPtcl> nbody_system; // nbody_system.loadparticlesingle(argv[1], "r", &RealPtcl::lo PS::DomainInfo dinfo; dinfo.initialize("domain_info.para"); dinfo.decomposedomainall(nbody_system); // PS::TreeType<ResultForce, EssentialPtclI, EssentialPtclJ>:: PS::F32 theta = 0.5; PS::S32 n_leaf_max = 8; PS::S32 n_grp_max = 64; // grav_tree.initialize(nbody_system.getnumberofparticletotal(

22 // LT LET GT nbody_system grav_tree.calcforceallandwriteback(calcforceepep, dinfo, nb PS::F64 dt = 0.125; PS::F64 tend = 100.0; PS::F64 tsys = 0.0; Kick(nbody_system, dt*0.5); while(tsys < tend){ tsys += dt; Drift(nbody_system, dt); if( fmod(tsys, 1.0) == 0){ // dinfo.decomposedomainall(nbody_system); } grav_tree.calcforceallandwriteback(calcforceepep, dinfo Kick(nbody_system, dt); }

23 } PS::Finalize(); return 0;

24 150 ( )

25 1: 2:

26 : : v v = 0 t + (v )v = p + 1 Re 2 v CFL

27 1 2 3 CG ( )

28 : : CFL 1 : ( )

29 ( ) Explicit-MPS ( 2011, MPS S semiimplicit ) (Fan et al. 2003, Hotta et al. 2012)

30 0 1 ξ ξ

31 : : ( ) ( )

32 : : 1

33 ρ dv dt = p ρge z + Π ρc p dt dt = λ dp dt = (k T ) + (others) ξρ dv dt = p ρge z + 1 c Π ρc p dt dt = λ dp dt = (ck T ) + (others)

34 ξ: c: Q: 1 2 A: 1 Q: A: R R 1/3

35 ( )

36 SPH SPH ( ) ( )3

37 1000

38 1000 1/1000 1

39 2

40 ( ) ( )

41 ( ) ( )

42

43 SPH

44 SPH f f ( x) = f( x )W ( x x )d x. (1) ρ( x) = j m j W ( x x j ), (2) SPH f = j m j f j ρ( x) W ( x x j). (3)

45 SPH (1) f : f = f 1 = j f ( x) j m j 1 ρ( x) W ( x x j). (4) m j f( x j ) ρ( x j ) W ( x x j). (5)

46 SPH (2) 1 P ρ 1 ρ P = P ρ 2 ρ + P ρ2. (6) v i = j m j ( Pi ρ 2 i + P j ρ 2 j ) W (x i x j ), (7) x i

47 SPH KH Agertz et al (MN 2007, 380,963) SPH Grid Brob test Kelvin-Helmholtz ( 3 ) SPH

48 (1) ( 1/10 10 ) 3 Grid 2 Gasoline ( 10M ) SPH

49 (2) SPH KH

50 (3) 2

51 SPH 2 ρ 2 1 = 1 m j ρ( x) W ( x x j). (8) j 1 ρ P = P ρ 2 ρ + P ρ2. (9) SPH

52 : ρ u ( ) u u u ( ) ( )

53 ( ) : f ( x) = j m j f( x j ) ρ( x j ) W ( x x j). (10) d x m j /ρ( x j )

54 (Saito and Makino 2013, Hosono et al. 2013) (SM13, Hosono et al. 2014) (Yamamoto et al. submitted) ( )

55 (1) : : =1 : =

56 (2) KHI : : =1 : =

57 ( ) SPH 0

£Ã¥×¥í¥°¥é¥ß¥ó¥°(2018) - Âè11²ó – ½ÉÂꣲ¤Î²òÀ⡤±é½¬£² –

£Ã¥×¥í¥°¥é¥ß¥ó¥°(2018) - Âè11²ó – ½ÉÂꣲ¤Î²òÀ⡤±é½¬£² – (2018) 11 2018 12 13 2 g v dv x dt = bv x, dv y dt = g bv y (1) b v 0 θ x(t) = v 0 cos θ ( 1 e bt) (2) b y(t) = 1 ( v 0 sin θ + g ) ( 1 e bt) g b b b t (3) 11 ( ) p14 2 1 y 4 t m y > 0 y < 0 t m1 h = 0001

More information

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裱£²²ó ¡Ý½ÉÂꣲ¤Î²òÀ⡤±é½¬£²¡Ý

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裱£²²ó  ¡Ý½ÉÂꣲ¤Î²òÀ⡤±é½¬£²¡Ý (2018) 2018 7 5 f(x) [ 1, 1] 3 3 1 3 f(x) dx c i f(x i ) 1 0 i=1 = 5 ) ( ) 3 ( 9 f + 8 5 9 f(0) + 5 3 9 f 5 1 1 + sin(x) θ ( 1 θ dx = tan 1 + sin x 2 π ) + 1 4 1 3 [a, b] f a, b double G3(double (*f)(),

More information

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裶²ó ¨¡ À©¸æ¹½Â¤¡§·«¤êÊÖ¤· ¨¡

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裶²ó  ¨¡ À©¸æ¹½Â¤¡§·«¤êÊÖ¤· ¨¡ (2018) 2018 5 24 ( ) while ( ) do while ( ); for ( ; ; ) while int i = 0; while (i < 100) { printf("i = %3d\n", i); i++; while int i = 0; i while (i < 100) { printf("i = %3d\n", i); i++; while int i =

More information

2.2 h h l L h L = l cot h (1) (1) L l L l l = L tan h (2) (2) L l 2 l 3 h 2.3 a h a h (a, h)

2.2 h h l L h L = l cot h (1) (1) L l L l l = L tan h (2) (2) L l 2 l 3 h 2.3 a h a h (a, h) 1 16 10 5 1 2 2.1 a a a 1 1 1 2.2 h h l L h L = l cot h (1) (1) L l L l l = L tan h (2) (2) L l 2 l 3 h 2.3 a h a h (a, h) 4 2 3 4 2 5 2.4 x y (x,y) l a x = l cot h cos a, (3) y = l cot h sin a (4) h a

More information

WinHPC ppt

WinHPC ppt MPI.NET C# 2 2009 1 20 MPI.NET MPI.NET C# MPI.NET C# MPI MPI.NET 1 1 MPI.NET C# Hello World MPI.NET.NET Framework.NET C# API C# Microsoft.NET java.net (Visual Basic.NET Visual C++) C# class Helloworld

More information

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裵²ó ¨¡ À©¸æ¹½Â¤¡§¾ò·ïʬ´ô ¨¡

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (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

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 information

新版明解C言語 実践編

新版明解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 information

SystemC言語概論

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

More information

programmingII2019-v01

programmingII2019-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 information

1.ppt

1.ppt /* * Program name: hello.c */ #include int main() { printf( hello, world\n ); return 0; /* * Program name: Hello.java */ import java.io.*; class Hello { public static void main(string[] arg)

More information

ex01.dvi

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

More information

1 (Berry,1975) 2-6 p (S πr 2 )p πr 2 p 2πRγ p p = 2γ R (2.5).1-1 : : : : ( ).2 α, β α, β () X S = X X α X β (.1) 1 2

1 (Berry,1975) 2-6 p (S πr 2 )p πr 2 p 2πRγ p p = 2γ R (2.5).1-1 : : : : ( ).2 α, β α, β () X S = X X α X β (.1) 1 2 2005 9/8-11 2 2.2 ( 2-5) γ ( ) γ cos θ 2πr πρhr 2 g h = 2γ cos θ ρgr (2.1) γ = ρgrh (2.2) 2 cos θ θ cos θ = 1 (2.2) γ = 1 ρgrh (2.) 2 2. p p ρgh p ( ) p p = p ρgh (2.) h p p = 2γ r 1 1 (Berry,1975) 2-6

More information

para02-2.dvi

para02-2.dvi 2002 2 2002 4 23 : MPI MPI 1 MPI MPI(Message Passing Interface) MPI UNIX Windows Machintosh OS, MPI 2 1 1 2 2.1 1 1 1 1 1 1 Fig. 1 A B C F Fig. 2 A B F Fig. 1 1 1 Fig. 2 2.2 Fig. 3 1 . Fig. 4 Fig. 3 Fig.

More information

1 CUI CUI CUI 1.1 cout cin 1.1.1 redirect.cpp #i n c l u d e <s t r i n g > 3 using namespace std ; 5 6 i n t main ( void ) 7 { 8 s t r i n g s ; 10 c

1 CUI CUI CUI 1.1 cout cin 1.1.1 redirect.cpp #i n c l u d e <s t r i n g > 3 using namespace std ; 5 6 i n t main ( void ) 7 { 8 s t r i n g s ; 10 c C/C++ 007 6 11 1 CUI 1.1....................................... 1................................ 3 1.3 argc argv................................. 5.1.............................................. 5...............................................

More information

comment.dvi

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) /* -----------------------------------------------------------------

More information

2 KH Coder KH Coder KH Coder KH Coder

2 KH Coder KH Coder KH Coder KH Coder Keywords : 1 2 KH Coder KH Coder KH Coder KH Coder 2.1 KH Coder 1 ........,,,..... .. 2 - - - - - - - - - - - - 2.2 3, ......... - - - - - - 4 3 3.1.. 1 - / - - - - - 2 - ....... a . ... 3.2 < >, Sunday

More information

5 5.1 E 1, E 2 N 1, N 2 E tot N tot E tot = E 1 + E 2, N tot = N 1 + N 2 S 1 (E 1, N 1 ), S 2 (E 2, N 2 ) E 1, E 2 S tot = S 1 + S 2 2 S 1 E 1 = S 2 E

5 5.1 E 1, E 2 N 1, N 2 E tot N tot E tot = E 1 + E 2, N tot = N 1 + N 2 S 1 (E 1, N 1 ), S 2 (E 2, N 2 ) E 1, E 2 S tot = S 1 + S 2 2 S 1 E 1 = S 2 E 5 5.1 E 1, E 2 N 1, N 2 E tot N tot E tot = E 1 + E 2, N tot = N 1 + N 2 S 1 (E 1, N 1 ), S 2 (E 2, N 2 ) E 1, E 2 S tot = S 1 + S 2 2 S 1 E 1 = S 2 E 2, S 1 N 1 = S 2 N 2 2 (chemical potential) µ S N

More information

A B A E

A B A E 10533-68-3955 10533-68-3955 10533-68-3804 RP A-6 10533-68-3804 10533-69-9615 10533-57-2161 B-2 10533-68-2274 10533-68-2221 10533-67-6282 A-6 10533-57-2161 E-3 10533-68-5161 10533-68-3553 D-2 D-2 10533-69-5258

More information

2.5 (Gauss) (flux) v(r)( ) S n S v n v n (1) v n S = v n S = v S, n S S. n n S v S v Minoru TANAKA (Osaka Univ.) I(2012), Sec p. 1/30

2.5 (Gauss) (flux) v(r)( ) S n S v n v n (1) v n S = v n S = v S, n S S. n n S v S v Minoru TANAKA (Osaka Univ.) I(2012), Sec p. 1/30 2.5 (Gauss) 2.5.1 (flux) v(r)( ) n v n v n (1) v n = v n = v, n. n n v v I(2012), ec. 2. 5 p. 1/30 i (2) lim v(r i ) i = v(r) d. i 0 i (flux) I(2012), ec. 2. 5 p. 2/30 2.5.2 ( ) ( ) q 1 r 2 E 2 q r 1 E

More information

( CUDA CUDA CUDA CUDA ( NVIDIA CUDA I

(    CUDA CUDA CUDA CUDA (  NVIDIA CUDA I GPGPU (II) GPGPU CUDA 1 GPGPU CUDA(CUDA Unified Device Architecture) CUDA NVIDIA GPU *1 C/C++ (nvcc) CUDA NVIDIA GPU GPU CUDA CUDA 1 CUDA CUDA 2 CUDA NVIDIA GPU PC Windows Linux MaxOSX CUDA GPU CUDA NVIDIA

More information

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 ( ) 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 information

chap03.dvi

chap03.dvi 99 3 (Coriolis) cm m (free surface wave) 3.1 Φ 2.5 (2.25) Φ 100 3 r =(x, y, z) x y z F (x, y, z, t) =0 ( DF ) Dt = t + Φ F =0 onf =0. (3.1) n = F/ F (3.1) F n Φ = Φ n = 1 F F t Vn on F = 0 (3.2) Φ (3.1)

More information

30

30 3 ............................................2 2...........................................2....................................2.2...................................2.3..............................

More information

C

C C 1 2 1.1........................... 2 1.2........................ 2 1.3 make................................................ 3 1.4....................................... 5 1.4.1 strip................................................

More information

BW BW

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.................................

More information

GIZMO ¤ÇÍ·¤ó¤Ç¤ß¤ë

GIZMO ¤ÇÍ·¤ó¤Ç¤ß¤ë GIZMO February 21, 2019 GIZMO February 21, 2019 1 / 17 GIZMO Users Guide URL http://www.tapir.caltech.edu/ phopkins/site/gizmo_files/gizmo_documentation.html /home/hydro00/gizmo_hydro2018.tar.gz GIZMO_hydro2018/practice

More information

PowerPoint プレゼンテーション

PowerPoint プレゼンテーション 斎藤貴之東京工業大学地球生命研究所 1 Contents 研究背景 ASURA: 並列 N 体 /SPHコード Density Independent SPH まとめ 2 3 内海洋輔(広島大学) NASA/JPL-Caltech/ESO/R. Hurt 4 Credit: S. Beckwith & the HUDF Working Group (STScI), HST, ESA, NASA 我々の宇宙

More information

Java (7) Lesson = (1) 1 m 3 /s m 2 5 m 2 4 m 2 1 m 3 m 1 m 0.5 m 3 /ms 0.3 m 3 /ms 0.6 m 3 /ms 1 1 3

Java (7) Lesson = (1) 1 m 3 /s m 2 5 m 2 4 m 2 1 m 3 m 1 m 0.5 m 3 /ms 0.3 m 3 /ms 0.6 m 3 /ms 1 1 3 Java (7) 2008-05-20 1 Lesson 5 1.1 5 3 = (1) 1 m 3 /s 1 2 3 10 m 2 5 m 2 4 m 2 1 m 3 m 1 m 0.5 m 3 /ms 0.3 m 3 /ms 0.6 m 3 /ms 1 1 3 1.2 java 2 1. 2. 3. 4. 3 2 1.3 i =1, 2, 3 V i (t) 1 t h i (t) i F, k

More information

,,..,. 1

,,..,. 1 016 9 3 6 0 016 1 0 1 10 1 1 17 1..,,..,. 1 1 c = h = G = ε 0 = 1. 1.1 L L T V 1.1. T, V. d dt L q i L q i = 0 1.. q i t L q i, q i, t L ϕ, ϕ, x µ x µ 1.3. ϕ x µ, L. S, L, L S = Ld 4 x 1.4 = Ld 3 xdt 1.5

More information

- - http://168iroha.net 018 10 14 i 1 1 1.1.................................................... 1 1.................................................... 7.1................................................

More information

ex01.dvi

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

More information

memo

memo 数理情報工学演習第一 C ( 第 12 回 ) 2017/07/11 DEPARTMENT OF MATHEMATICAL INFORMATICS 1 今日の内容 : ファイルの入出力 コマンドライン引数 2 分探索 最長単調増加列 2 ファイル操作の手続き : ファイル操作 ファイルからのデータ読み込み ファイルへのデータ書き出し 基本的な手順 読みこむ / 書き出すファイルを開く (fopen)

More information

p12.dvi

p12.dvi 301 12 (2) : 1 (1) dx dt = f(x,t) ( (t 0,t 1,...,t N ) ) h k = t k+1 t k. h k k h. x(t k ) x k. : 2 (2) :1. step. 1 : explicit( ) : ξ k+1 = ξ k +h k Ψ(t k,ξ k,h k ) implicit( ) : ξ k+1 = ξ k +h k Ψ(t k,t

More information

... 3... 3... 3... 3... 4... 7... 10... 10... 11... 12... 12... 13... 14... 15... 18... 19... 20... 22... 22... 23 2

... 3... 3... 3... 3... 4... 7... 10... 10... 11... 12... 12... 13... 14... 15... 18... 19... 20... 22... 22... 23 2 1 ... 3... 3... 3... 3... 4... 7... 10... 10... 11... 12... 12... 13... 14... 15... 18... 19... 20... 22... 22... 23 2 3 4 5 6 7 8 9 Excel2007 10 Excel2007 11 12 13 - 14 15 16 17 18 19 20 21 22 Excel2007

More information

lexex.dvi

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 ) ( ) (+, -, *, /, %, &, =, ==,!=, >, >=,

More information

1 2 3 4 5 6 0.4% 58.4% 41.2% 10 65 69 12.0% 9 60 64 13.4% 11 70 12.6% 8 55 59 8.6% 0.1% 1 20 24 3.1% 7 50 54 9.3% 2 25 29 6.0% 3 30 34 7.6% 6 45 49 9.7% 4 35 39 8.5% 5 40 44 9.1% 11 70 11.2% 10 65 69 11.0%

More information

2 T ax 2 + 2bxy + cy 2 + dx + ey + f = 0 a + b + c > 0 a, b, c A xy ( ) ( ) ( ) ( ) u = u 0 + a cos θ, v = v 0 + b sin θ 0 θ 2π u = u 0 ± a

2 T ax 2 + 2bxy + cy 2 + dx + ey + f = 0 a + b + c > 0 a, b, c A xy ( ) ( ) ( ) ( ) u = u 0 + a cos θ, v = v 0 + b sin θ 0 θ 2π u = u 0 ± a 2 T140073 1 2 ax 2 + 2bxy + cy 2 + dx + ey + f = 0 a + b + c > 0 a, b, c A xy u = u 0 + a cos θ, v = v 0 + b sin θ 0 θ 2π u = u 0 ± a cos θ, v = v 0 + b tan θ π 2 < θ < π 2 u = u 0 + 2pt, v = v 0 + pt

More information

2008 ( 13 ) C LAPACK 2008 ( 13 )C LAPACK p. 1

2008 ( 13 ) C LAPACK 2008 ( 13 )C LAPACK p. 1 2008 ( 13 ) C LAPACK LAPACK p. 1 Q & A Euler http://phase.hpcc.jp/phase/mppack/long.pdf KNOPPIX MT (Mersenne Twister) SFMT., ( ) ( ) ( ) ( ). LAPACK p. 2 C C, main Asir ( Asir ) ( ) (,,...), LAPACK p.

More information

±é½¬£²¡§£Í£Ð£É½éÊâ

±é½¬£²¡§£Í£Ð£É½éÊâ 2012 8 7 1 / 52 MPI Hello World I ( ) Hello World II ( ) I ( ) II ( ) ( sendrecv) π ( ) MPI fortran C wget http://www.na.scitec.kobe-u.ac.jp/ yaguchi/riken2012/enshu2.zip unzip enshu2.zip 2 / 52 FORTRAN

More information

215 11 13 1 2 1.1....................... 2 1.2.................... 2 1.3..................... 2 1.4...................... 3 1.5............... 3 1.6........................... 4 1.7.................. 4

More information

やさしいJavaプログラミング -Great Ideas for Java Programming サンプルPDF

やさしいJavaプログラミング -Great Ideas for Java Programming サンプルPDF pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) 3 5 14 18 21 23 23 24 28 29 29 31 32 34 35 35 36 38 40 44 44 45 46 49 49 50 pref : 2004/6/5 (11:8) 50 51 52 54 55 56 57 58 59 60 61

More information

XMPによる並列化実装2

XMPによる並列化実装2 2 3 C Fortran Exercise 1 Exercise 2 Serial init.c init.f90 XMP xmp_init.c xmp_init.f90 Serial laplace.c laplace.f90 XMP xmp_laplace.c xmp_laplace.f90 #include int a[10]; program init integer

More information

http://banso.cocolog-nifty.com/ 100 100 250 5 1 1 http://www.banso.com/ 2009 5 2 10 http://www.banso.com/ 2009 5 2 http://www.banso.com/ 2009 5 2 http://www.banso.com/ < /> < /> / http://www.banso.com/

More information

( : December 27, 2015) CONTENTS I. 1 II. 2 III. 2 IV. 3 V. 5 VI. 6 VII. 7 VIII. 9 I. 1 f(x) f (x) y = f(x) x ϕ(r) (gradient) ϕ(r) (gradϕ(r) ) ( ) ϕ(r)

( : December 27, 2015) CONTENTS I. 1 II. 2 III. 2 IV. 3 V. 5 VI. 6 VII. 7 VIII. 9 I. 1 f(x) f (x) y = f(x) x ϕ(r) (gradient) ϕ(r) (gradϕ(r) ) ( ) ϕ(r) ( : December 27, 215 CONTENTS I. 1 II. 2 III. 2 IV. 3 V. 5 VI. 6 VII. 7 VIII. 9 I. 1 f(x f (x y f(x x ϕ(r (gradient ϕ(r (gradϕ(r ( ϕ(r r ϕ r xi + yj + zk ϕ(r ϕ(r x i + ϕ(r y j + ϕ(r z k (1.1 ϕ(r ϕ(r i

More information

r02.dvi

r02.dvi 172 2017.7.16 1 1.1? X A B A X B ( )? IBMPL/I FACOM PL1 ( ) X ( ) 1.2 1 2-0 ( ) ( ) ( ) (12) ( ) (112) (131) 281 26 1 (syntax) (semantics) ( ) 2 2.1 BNF BNF(Backus Normal Form) Joun Backus (grammer) English

More information

ohp02.dvi

ohp02.dvi 172 2017.7.16 1 ? X A B A X B ( )? IBMPL/I FACOM PL1 ( ) X 2 ( ) 3 2-0 ( ) ( ) ( ) (12) ( ) (112) 31) 281 26 1 4 (syntax) (semantics) ( ) 5 BNF BNF(Backus Normal Form) Joun Backus (grammer) English grammer

More information

Kroneher Levi-Civita 1 i = j δ i j = i j 1 if i jk is an even permutation of 1,2,3. ε i jk = 1 if i jk is an odd permutation of 1,2,3. otherwise. 3 4

Kroneher Levi-Civita 1 i = j δ i j = i j 1 if i jk is an even permutation of 1,2,3. ε i jk = 1 if i jk is an odd permutation of 1,2,3. otherwise. 3 4 [2642 ] Yuji Chinone 1 1-1 ρ t + j = 1 1-1 V S ds ds Eq.1 ρ t + j dv = ρ t dv = t V V V ρdv = Q t Q V jdv = j ds V ds V I Q t + j ds = ; S S [ Q t ] + I = Eq.1 2 2 Kroneher Levi-Civita 1 i = j δ i j =

More information

No.004 [1] J. ( ) ( ) (1968) [2] Morse (1997) [3] (1988) 1

No.004 [1] J. ( ) ( ) (1968) [2] Morse (1997) [3] (1988) 1 No.004 [1] J. ( ) ( ) (1968) [2] Morse (1997) [3] (1988) 1 1 (1) 1.1 X Y f, g : X Y { F (x, 0) = f(x) F (x, 1) = g(x) F : X I Y f g f g F f g 1.2 X Y X Y gf id X, fg id Y f : X Y, g : Y X X Y X Y (2) 1.3

More information

Hanbury-Brown Twiss (ver. 2.0) van Cittert - Zernike mutual coherence

Hanbury-Brown Twiss (ver. 2.0) van Cittert - Zernike mutual coherence Hanbury-Brown Twiss (ver. 2.) 25 4 4 1 2 2 2 2.1 van Cittert - Zernike..................................... 2 2.2 mutual coherence................................. 4 3 Hanbury-Brown Twiss ( ) 5 3.1............................................

More information

PowerPoint プレゼンテーション

PowerPoint プレゼンテーション 0 1 2 3 4 5 6 1964 1978 7 0.0015+0.013 8 1 π 2 2 2 1 2 2 ( r 1 + r3 ) + π ( r2 + r3 ) 2 = +1,2100 9 10 11 1.9m 3 0.64m 3 12 13 14 15 16 17 () 0.095% 0.019% 1.29% (0.348%) 0.024% 0.0048% 0.32% (0.0864%)

More information

ex12.dvi

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

More information

SystemC 2.0を用いた簡易CPUバスモデルの設計

SystemC 2.0を用いた簡易CPUバスモデルの設計 SystemC 2.0 CPU CPU CTD&SW CT-PF 2002/1/23 1 CPU BCA UTF GenericCPU IO (sc_main) 2002/1/23 2 CPU CPU CQ 1997 11 Page 207 4 Perl Verilog-HDL CPU / Verilog-HDL SystemC 2.0 (asm) ROM (test.hex) 2002/1/23

More information

joho07-1.ppt

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*

More information

Condition DAQ condition condition 2 3 XML key value

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.............................

More information

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 = 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,,

More information

n=360 28.6% 34.4% 36.9% n=360 2.5% 17.8% 19.2% n=64 0.8% 0.3% n=69 1.7% 3.6% 0.6% 1.4% 1.9% < > n=218 1.4% 5.6% 3.1% 60.6% 0.6% 6.9% 10.8% 6.4% 10.3% 33.1% 1.4% 3.6% 1.1% 0.0% 3.1% n=360 0% 50%

More information

102

102 5 102 5 103 q w 104 e r t y 5 u 105 q w e r t y u i 106 o!0 io!1 io q w e r t y 5 u 107 i o 108 q w e q w e r 5 109 q w 110 e r t 5 y 111 q w e r t y u 112 i q w e r 5 113 q w e 114 r t 5 115 q w e 116

More information

: , 2.0, 3.0, 2.0, (%) ( 2.

: , 2.0, 3.0, 2.0, (%) ( 2. 2017 1 2 1.1...................................... 2 1.2......................................... 4 1.3........................................... 10 1.4................................. 14 1.5..........................................

More information

1 4 2 EP) (EP) (EP)

1 4 2 EP) (EP) (EP) 2003 2004 2 27 1 1 4 2 EP) 5 3 6 3.1.............................. 6 3.2.............................. 6 3.3 (EP)............... 7 4 8 4.1 (EP).................... 8 4.1.1.................... 18 5 (EP)

More information

r07.dvi

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

More information

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 +

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,

More information

ohp07.dvi

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

More information

Java演習(4) -- 変数と型 --

Java演習(4)   -- 変数と型 -- 50 20 20 5 (20, 20) O 50 100 150 200 250 300 350 x (reserved 50 100 y 50 20 20 5 (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics; (reserved public class Blocks1 extends

More information

ohp03.dvi

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

More information

#A A A F, F d F P + F P = d P F, F y P F F x A.1 ( α, 0), (α, 0) α > 0) (x, y) (x + α) 2 + y 2, (x α) 2 + y 2 d (x + α)2 + y 2 + (x α) 2 + y 2 =

#A A A F, F d F P + F P = d P F, F y P F F x A.1 ( α, 0), (α, 0) α > 0) (x, y) (x + α) 2 + y 2, (x α) 2 + y 2 d (x + α)2 + y 2 + (x α) 2 + y 2 = #A A A. F, F d F P + F P = d P F, F P F F A. α, 0, α, 0 α > 0, + α +, α + d + α + + α + = d d F, F 0 < α < d + α + = d α + + α + = d d α + + α + d α + = d 4 4d α + = d 4 8d + 6 http://mth.cs.kitmi-it.c.jp/

More information

重力方向に基づくコントローラの向き決定方法

重力方向に基づくコントローラの向き決定方法 ( ) 2/Sep 09 1 ( ) ( ) 3 2 X w, Y w, Z w +X w = +Y w = +Z w = 1 X c, Y c, Z c X c, Y c, Z c X w, Y w, Z w Y c Z c X c 1: X c, Y c, Z c Kentaro Yamaguchi@bandainamcogames.co.jp 1 M M v 0, v 1, v 2 v 0 v

More information

- 1 - - 0.5%5 10 10 5 10 1 5 1

- 1 - - 0.5%5 10 10 5 10 1 5 1 - - - 1 - - 0.5%5 10 10 5 10 1 5 1 - 2 - - - - A B A A A B A B B A - 3 - - 100 100 100 - A) ( ) B) A) A B A B 110 A B 13 - 4 - A) 36 - - - 5 - - 1 - 6-1 - 7 - - 8 - Q.15 0% 10% 20% 30% 40% 50% 60% 70%

More information

slide5.pptx

slide5.pptx ソフトウェア工学入門 第 5 回コマンド作成 1 head コマンド作成 1 早速ですが 次のプログラムを head.c という名前で作成してください #include #include static void do_head(file *f, long nlines); int main(int argc, char *argv[]) { if (argc!=

More information

r3.dvi

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.*;

More information

01

01 2 0 0 7 0 3 2 2 i n d e x 0 7. 0 2. 0 3. 0 4. 0 8. 0 9. 1 0. 1 1. 0 5. 1 2. 1 3. 1 4. 1 5. 1 6. 1 7. 1 8. 1 9. 2 0. 2 1. 2 3. 2 4. 2 5. 2 6. O k h o t s k H a m a n a s u B e e f 0 2 http://clione-beef.n43.jp

More information

sec13.dvi

sec13.dvi 13 13.1 O r F R = m d 2 r dt 2 m r m = F = m r M M d2 R dt 2 = m d 2 r dt 2 = F = F (13.1) F O L = r p = m r ṙ dl dt = m ṙ ṙ + m r r = r (m r ) = r F N. (13.2) N N = R F 13.2 O ˆn ω L O r u u = ω r 1 1:

More information

untitled

untitled Q 8 1 8.1 (C++) C++ cin cout 5 C++ 16 6 p.63 8.3 #include 7 showbase noshowbase showpoint noshowpoint 8.3 uppercase 16 nouppercase 16 setfill(int) setprecision(int) setw(int) setbase(int) dec

More information

ohp11.dvi

ohp11.dvi 19 11 ( ) 2019.4.20 1 / ( ) n O(n 2 ) O(n 2 ) ( ) 1 d n 1 n logn O(nlogn) n ( n logn C ) 2 ( ) ( merge) 2 1 1 3 1 4 5 4 2 3 7 9 7 1 2 3 4 5 7 9 1: 2 ivec merge 3 ( ) (2) int *ivec_new(int size) { int *a

More information

r11.dvi

r11.dvi 19 11 ( ) 2019.4.20 1 / 1.1 ( n n O(n 2 O(n 2 ) ( 1 d n 1 n logn O(nlogn n ( n logn C 1.2 ( ( merge 2 1 1 3 1 4 5 4 2 3 7 9 7 1 2 3 4 5 7 9 1: 2 ivec merge int *ivec_new(int size) { int *a = (int*)malloc((size+1)

More information

r08.dvi

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

More information