listings-ext

Size: px
Start display at page:

Download "listings-ext"

Transcription

1 (10) (2) ( ) ohsaki@kwansei.ac.jp 8 (2) mobility.fixed mobility.randomwalk mobility.randomwaypoint monitor.cell (2) 8.1 ( ) mobility.randomwaypoint 1

2 agent.carryonly mobility.fixed path.none agent.random agent.epidemic agent.p_bcast mobility.fullmixed mobility.randomwalk mobility.graph.fixed path.line agent.prophet agent.sa_bcast agent.hp_bcast mobility.randomwaypoint mobility.graph.randomwalk path.grid path.voronoi mobility.limitedrandomwaypoint mobility.levywalk mobility.graph.crwp mobility.graph.sequential 1: pydtmsim monitor.cell mobility.randomwaypoint mobility.randomwalk ( mobility.randomwalk ) ( 1) mobility.randomwalk mobility.fixed mobility.fixed mobility.randomwalk mobility.randomwaypoint 8.2 mobility.fixed mobility.fixed mobility.fixed ( ) (x, y) 2 x X y Y pydtnsim (0, 0) X Y (X ) (Y ) mobility.fixed width height 1 #! / usr / b i n / env python3 2 # 3 # A m o b i l i t y c l a s s f o r s t a t i o n a r y a g e n t s. 2

3 4 # C o p y r i g h t ( c ) , H i r o y u k i Ohsaki. 5 # A l l r i g h t s r e s e r v e d. 6 # 7 # Id : F i x e d. pm, v / 1 2 / : 5 4 : 4 7 o h s a k i Exp $ 8 # 9 10 import math, random 11 from vector import Vector as V c l a s s Fixed : 14 def i n i t ( s e l f, width =1000, height =1000, current= None, kargs, 15 kwargs ) : 16 s e l f. width = width 17 s e l f. height = height 18 i f current i s None : 19 current = s e l f. random_coordinate ( ) 20 s e l f. current = current 21 s e l f. wait = True def repr ( s e l f ) : 24 name = s e l f. c l a s s. name 25 return f {name } ( width ={ s e l f. width! r }, height ={ s e l f. height! r }, current ={ s e l f. current! r }, wait ={ s e l f. wait! r } ) def random_coordinate ( s e l f ) : 28 """ P i c k a random c o o r d i n a t e on t h e f i e l d. """ 29 return V( random. uniform ( 0, s e l f. width ), random. uniform ( 0, s e l f. height ) ) def angle_between_vectors ( s e l f, v1, v2 ) : 32 """ Return t h e a n g l e between two v e c t o r s V1 and V2. """ 33 i f abs ( v1 ) == 0 or abs ( v2 ) == 0 : 34 return math. pi / 2 3

4 35 t r y : 36 return math. acos ( ( v1 v2 ) / ( abs ( v1 ) abs ( v2 ) ) ) 37 except ValueError : 38 return math. pi / 2 #??? def move( s e l f, d e l t a ) : 41 """Move t h e a g e n t f o r t h e d u r a t i o n o f DELTA. """ 42 pass Vector (11 ) 2 vector vector vector.vector V vector Vector 2 vector (overload) vector.vector Python ( ) ( 2) 1 >>> from vector import Vector as V 2 >>> v = V( 0. 5, 0. 7 ) 3 >>> v 4 Vector ( , ) 5 >>> type ( v ) 6 < c l a s s vector. Vector > 7 >>> u = V( 0.3, 0. 5 ) 8 >>> w = v + u 9 >>> w 10 Vector ( , ) 11 >>> abs ( v )

5 2: vector.vector V vector.vector 1 V(0.5, 0.7) (0.5, 0.7) vector.vector v u (0.5, 07) (-0.3, 0.5) u + v (0.5, 0.7) (-0.3, 0.5) ( ) (0.2, 1.2) vector.vector abs() Python ( ) abs(v) (0.5, 0.7) mobility.fixed (14 21 ) mobility.fixed 1 vector.vector V V(1, 2) vector.vector(1, 2) 5

6 mobility.fixed 1 mobility = mobility. Fixed ( 2 width =1000, 3 height =1000, 4 ) current random_coordinate current ( vector.vector ) (27 29 ) width height (31 38 ) 2 v1 v2 v1 v2 π/2 ( ) (40 42 ) delta mobility.fixed move move 6

7 8.3 mobility.randomwalk mobility.randomwalk mobility.fixed 1 #! / usr / b i n / env python3 2 # 3 # A m o b i l i t y c l a s s f o r random walk. 4 # C o p y r i g h t ( c ) , H i r o y u k i Ohsaki. 5 # A l l r i g h t s r e s e r v e d. 6 # 7 # Id : RandomWalk. pm, v / 1 2 / : 4 5 : 2 3 o h s a k i Exp $ 8 # 9 10 import math 11 import random from vector import Vector as V 14 from dtnsim. mobility. f i x e d import Fixed c l a s s RandomWalk( Fixed ) : 17 def i n i t ( s e l f, vel_func=none, kargs, kwargs ) : 18 super ( ). i n i t ( kargs, kwargs ) 19 i f vel_func i s None : 20 vel_func = lambda : 1. 0 # 1. 0 [m/ s ] by d e f a u l t 21 s e l f. vel_func = vel_func 22 s e l f. v e l o c i t y = None 23 s e l f. wait = None def update_velocity ( s e l f ) : 26 """ Update a g e n t s v e l o c i t y using t h e v e l o c i t y f u n c t i o n. """ 27 vel = s e l f. vel_func ( ) 28 t h e t a = random. uniform ( 0, 2 math. pi ) 29 s e l f. v e l o c i t y = vel V( math. cos ( t h e t a ), math. s i n ( t h e t a ) ) 30 s e l f. wait = F a l s e 7

8 31 32 def move( s e l f, d e l t a ) : 33 """Move t h e a g e n t f o r t h e d u r a t i o n o f DELTA. """ 34 s e l f. update_velocity ( ) 35 s e l f. current += s e l f. v e l o c i t y d e l t a (14 16 ) mobility.randomwalk mobility.fixed mobility.randomwalk (17 23 ) mobility.randomwalk 18 super(). init ( mobility.fixed init mobility.fixed mobility.randomwalk 23 wait 0 ( 0 ) (25 30 ) ( ) velocity 2 27 vel ( ) vel vel_func ( 3) pydtnsim velocity v velocity 8

9 3: mobility.randomwalk 1 def vel_func ( ) : 2 """A c a l l b a c k f u n c t i o n f o r r e t u r n i n g t h e v e l o c i t y o f an a g e n t. """ 3 r e t u r n random. uniform ( MIN_VELOCITY, MAX_VELOCITY) MIN_VELOCITY MAX_VELOCITY (uniform distribution) ( ) theta 0 2 π ( ) (radian) 2 π velocity vel theta 9

10 (32 35 ) delta p v ( ) p p = p + v p current ( ) 8.4 mobility.randomwaypoint 1 #! / usr / b i n / env python3 2 # 3 # A m o b i l i t y c l a s s f o r RWP ( Random WayPoint ) m o b i l i t y model. 4 # C o p y r i g h t ( c ) , H i r o y u k i Ohsaki. 5 # A l l r i g h t s r e s e r v e d. 6 # 7 # Id : RandomWaypoint. pm, v / 1 2 / : 5 4 : 5 7 o h s a k i Exp $ 8 # 9 10 from dtnsim. mobility. randomwalk import RandomWalk c l a s s RandomWaypoint (RandomWalk) : 10

11 13 def i n i t ( s e l f, pause_func=none, kargs, kwargs ) : 14 super ( ). i n i t ( kargs, kwargs ) 15 i f pause_ func i s None : 16 pause_func = lambda : 0. 0 # no pause time by d e f a u l t 17 s e l f. pause_func = pause_func 18 s e l f. wait = 0 19 s e l f. goal = s e l f. goal_coordinate ( ) def goal_coordinate ( s e l f ) : 22 """ Randomly c h o o s e t h e g o a l on t h e f i e l d. """ 23 return s e l f. random_coordinate ( ) def update_velocity ( s e l f ) : 26 """ Update a g e n t s v e l o c i t y using t h e v e l o c i t y f u n c t i o n. """ 27 s e l f. v e l o c i t y = s e l f. vel_func ( ) ( 28 s e l f. goal s e l f. current ) / abs ( s e l f. goal s e l f. current ) def move( s e l f, d e l t a ) : 31 """Move t h e a g e n t f o r t h e d u r a t i o n o f DELTA. """ 32 # s l e e p u n t i l w ait time e x p i r e s 33 s e l f. wait = max( s e l f. wait delta, 0) 34 i f s e l f. wait > 0 : 35 return s e l f. update_velocity ( ) 38 s e l f. current += s e l f. v e l o c i t y d e l t a # i f c l o s e enough t o t h e goal, randomly c h o o s e a n o t h e r g o a l 41 epsilon = abs ( s e l f. v e l o c i t y ) d e l t a 42 i f abs ( s e l f. goal s e l f. current ) <= epsilon : 43 s e l f. goal = s e l f. goal_coordinate ( ) 44 s e l f. update_velocity ( ) 11

12 45 s e l f. wait = s e l f. pause_func ( ) mobility.randomwaypoint (14 19 ) mobility.randomwaypoint 14 super(). init ( mobility.randomwalk ) 19 goal (25 28 ) ( 4) 1. (goal) (pause) ( vector.vector ) goal velocity ( 5) (current) (goal) (self.goal - self.current) vel_func RandomWaypoint (30 45 ) delta 12

13 4: wait delta wait delta pause_func pydtnsim

14 1 def pause_func ( ) : 5: 2 """A c a l l b a c k f u n c t i o n f o r r e t u r n i n g t h e pause time o f an a g e n t. """ 3 r e t u r n random. uniform ( MIN_PAUSE, MAX_PAUSE) MIN_PAUSE MAX_PAUSE (uniform distribution) ( ) 14

15 8.5 monitor.cell pydtnsim pycell pycell (CELL ) 3 pycell CELL pydtnsim CELL pycell monitor.cell 1 #! / usr / b i n / env python3 2 # 3 # A monitor c l a s s f o r v i s u a l i z i n g s i m u l a t i o n with c e l l. 4 # C o p y r i g h t ( c ) , H i r o y u k i Ohsaki. 5 # A l l r i g h t s r e s e r v e d. 6 # 7 # Id : C e l l. pm, v / 1 1 / : 2 2 : 3 0 o h s a k i Exp o h s a k i $ 8 # 9 10 import math 11 import random from dtnsim. monitor. n u l l import Null def f l o a t 2 s t r ( v, fmt= 9. 3 f ) : 16 """ Return s t r i n g r e p r e s e n t a t i o n o f a number V using t h e f o r m a t FMT. A l l 3 Perl CELL cell ( software/cell/) python 15

16 17 w h i t e s p a c e s a r e r e p l a c e d with double u n d e r s c o r e s. """ 18 a s t r = ( % + fmt ) % v 19 a s t r = a s t r. r e p l a c e (, ) 20 return a s t r def to_geometry ( v ) : 23 """ Convert t h e r e l a t i v e l e n g t h V t o t h e a b s o l u t e l e n g t h. This c o d e 24 assumes b o t h t h e width and t h e h e i g h t o f t h e f i e l d i s 1, """ 25 return v / c l a s s C e l l ( Null ) : 28 def open ( s e l f ) : 29 """ I n i t i a l i z e t h e c o l o r p a l e t t e. """ 30 print ( p a l e t t e c_vertex ) 31 print ( p a l e t t e c_edge ) 32 print ( p a l e t t e c_sus_range ) 33 print ( p a l e t t e c_sus ) 34 print ( p a l e t t e c_inf_range ) 35 print ( p a l e t t e c _ i n f ) 36 print ( p a l e t t e c _ d e l i v e r y ) 37 print ( p a l e t t e c_dst_range ) 38 print ( p a l e t t e c_dst ) def c l o s e ( s e l f ) : 41 pass def display_path ( s e l f, path ) : 44 """Draw a l l u n d e r l y i n g p a t h s on t h e f i e l d. """ 45 graph = path. graph 46 i f not graph : 47 return 48 for v in sorted ( graph. v e r t i c e s ( ) ) : 49 p = graph. g e t _ v e r t e x _ a t t r i b u t e ( v, xy ) 50 x, y = to_geometry ( p [ 0 ] ), to_geometry ( p [ 1 ] ) 16

17 51 print ( f define v { v } e l l i p s e 2 2 c_vertex { x } { y } ) 52 # p r i n t ( f d e f i n e v { v } t t e x t { v } 14 w h i t e { x } { y } ) 53 for u, v in graph. edges ( ) : 54 print ( f define l i n k v { u } v { v } 1 c_edge ) 55 # NOTE: t h i s c o d e assumes p a t h s w i l l not move i n d e f i n i t e l y 56 print ( f i x /./ ) def change_agent_status ( s e l f, agent ) : 59 """ Update t h e c o l o r o f a g e n t i f i t has a l r e a d y r e c e i v e d a message. """ 60 id = agent. id_ 61 c o l o r = c_sus 62 i f agent. received or agent. receive_queue : 63 c o l o r = c _ i n f 64 print ( f c o l o r agent { id } { c o l o r } ) 65 print ( f c o l o r agentr { id } { c o l o r } _range ) def display_agents ( s e l f ) : 68 """Draw a l l a g e n t s on t h e f i e l d. """ 69 for agent in s e l f. scheduler. agents : 70 id = agent. id_ 71 p = agent. mobility. current 72 x, y = to_geometry ( p [ 0 ] ), to_geometry ( p [ 1 ] ) 73 r = to_ geometry ( agent. range_ ) 74 print ( f define agent { id } e l l i p s e 4 4 white { x } { y } ) 75 print ( f define agentr { id } e l l i p s e { r } { r } white { x } { y } ) 76 s e l f. change_agent_status ( agent ) def move_agent ( s e l f, agent ) : 79 """ R e p o s i t i o n t h e l o c a t i o n o f t h e a g e n t AGENT. """ 80 id = agent. id_ 17

18 81 p = agent. mobility. current 82 x, y = to_geometry ( p [ 0 ] ), to_geometry ( p [ 1 ] ) 83 print ( f move agent { id } { x } { y } ) 84 print ( f move agentr { id } { x } { y } ) def d i s p l a y _ s t a t u s ( s e l f ) : 87 """ D i s p l a y t h e c u r r e n t s t a t i s t i c s a t t h e t o p o f t h e s c r e e n. """ 88 time = f l o a t 2 s t r ( s e l f. scheduler. time, f ) 89 tx = f l o a t 2 s t r ( s e l f. t x _ t o t a l, 10g ) 90 rx = f l o a t 2 s t r ( s e l f. r x _ t o t a l, 10g ) 91 dup = f l o a t 2 s t r ( s e l f. dup_total, 10g ) 92 u n i q _ t o t a l = f l o a t 2 s t r ( s e l f. uniq_total, 10g ) 93 d e l i v e r e d _ t o t a l = f l o a t 2 s t r ( s e l f. d e l i v e r e d _ t o t a l, 10g ) 94 u n i q _ d e l i v e r e d _ t o t a l = f l o a t 2 s t r ( s e l f. u n i q _ d e l i v e r e d _ t o t a l, 10g ) 95 print ( 96 f define s t a t u s _ l t e x t Time : { time }, TX : { tx }, RX : { rx }, DUP : { dup }, Delivered : { u n i q _ d e l i v e r e d _ t o t a l } / { u n i q _ t o t a l }, Arrived : { d e l i v e r e d _ t o t a l } 14 white ) def display_forward ( s e l f, src_agent, dst_agent, msg) : 100 """ D i s p l a y t h e c o m p l e t i o n o f message d e l i v e r y f o r a g e n t s o f F i x e d 101 c l a s s. """ 102 super ( ). display_forward ( src_agent, dst_agent, msg) 103 i f not s e l f. i s _ d e l i v e r e d ( dst_agent, msg) : 104 return 105 i f Fixed not in dst_agent. mobility. c l a s s. name : 106 return

19 108 src, dst = dst_agent. msg_src (msg), dst_agent. msg_dst (msg) 109 src_p = s e l f. scheduler. agent_by_id ( s r c ). mobility. current 110 dst_p = s e l f. scheduler. agent_by_id ( dst ). mobility. current 111 x1, y1, x2, y2 = to_geometry ( src_p [ 0 ] ), to_geometry ( 112 src_p [ 1 ] ), to_geometry ( dst_p [ 0 ] ), to_geometry ( dst_p [ 1 ] ) 113 print ( f define l i n e { x1 } { y1 } { x2 } { y2 } 1 c _ d e l i v e r y ) def update ( s e l f ) : 116 print ( display ) (22 25 ) CELL pydtnsim CELL ( / ) 1000 [m] 27 monitor.cell monitor.cell monitor.null monitor.cell (28 38 ) pycell ( ) 4 R G B A ( ( )) c_vertex (A = 0.2) ((R, G, B) = (0.4, 0.8, 1.0)) 19

20 (43 56 ) pydtnsim graph X, Y (50 ) X, Y 2 ( CELL ) 2 ( ) pydtnsim pycell (56 ) CELL fix (58 65 ) c_sus c_inf c_sus_range c_inf_range (78 84 ) p (81 ) x y ( 1 ) pydtnsim ( ) (0, 0) (86 97 ) ( time tx rx dup ) status_l (text) 20

21 (14 ) ( 50% 5%) ( ) mobile.agent.* (monitor.null ) display_forward (102 ) monitor.null display_forward ( time tx rx dup ) mobility.fixed ( ) ( ) 21

RL_tutorial

RL_tutorial )! " = $ % & ' "(& &*+ = ' " + %' "(- + %. ' "(. + γ γ=0! " = $ " γ=0.9! " = $ " + 0.9$ " + 0.81$ "+, + ! " #, % #! " #, % # + (( + #,- +. max 2 3! " #,-, % 4! " #, % # ) α ! " #, % ' ( )(#, %)!

More information

Python Speed Learning

Python   Speed Learning Python Speed Learning 1 / 76 Python 2 1 $ python 1 >>> 1 + 2 2 3 2 / 76 print : 1 print : ( ) 3 / 76 print : 1 print 1 2 print hello 3 print 1+2 4 print 7/3 5 print abs(-5*4) 4 / 76 print : 1 print 1 2

More information

5.2 White

5.2 White 1 EViews 1 : 2007/5/15 2007/5/25 1 EViews 4 2 ( 6 2.1............................................ 6 2.2 Workfile............................................ 7 2.3 Workfile............................................

More information

4.9 Hausman Test Time Fixed Effects Model vs Time Random Effects Model Two-way Fixed Effects Model

4.9 Hausman Test Time Fixed Effects Model vs Time Random Effects Model Two-way Fixed Effects Model 1 EViews 5 2007 7 11 2010 5 17 1 ( ) 3 1.1........................................... 4 1.2................................... 9 2 11 3 14 3.1 Pooled OLS.............................................. 14

More information

Python Speed Learning

Python   Speed Learning Python Speed Learning 1 / 89 1 2 3 4 (import) 5 6 7 (for) (if) 8 9 10 ( ) 11 12 for 13 2 / 89 Contents 1 2 3 4 (import) 5 6 7 (for) (if) 8 9 10 ( ) 11 12 for 13 3 / 89 (def) (for) (if) etc. 1 4 / 89 Jupyter

More information

Page 1 of 6 B (The World of Mathematics) November 20, 2006 Final Exam 2006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (10pts) (a

Page 1 of 6 B (The World of Mathematics) November 20, 2006 Final Exam 2006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (10pts) (a Page 1 of 6 B (The World of Mathematics) November 0, 006 Final Exam 006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (a) (Decide whether the following holds by completing the truth

More information

JavaScript の使い方

JavaScript の使い方 JavaScript Release10.5 JavaScript NXJ JavaScript JavaScript JavaScript 2 JavaScript JavaScript JavaScript NXJ JavaScript 1: JavaScript 2: JavaScript 3: JavaScript 4: 1 1: JavaScript JavaScript NXJ Static

More information

2 A I / 58

2 A I / 58 2 A 2018.07.12 I 2 2018.07.12 1 / 58 I 2 2018.07.12 2 / 58 π-computer gnuplot 5/31 1 π-computer -X ssh π-computer gnuplot I 2 2018.07.12 3 / 58 gnuplot> gnuplot> plot sin(x) I 2 2018.07.12 4 / 58 cp -r

More information

( ) kadai4, kadai4.zip.,. 3 cos x [ π, π] Python. ( 100 ), x cos x ( ). (, ). def print cos(): print cos()

( ) kadai4, kadai4.zip.,. 3 cos x [ π, π] Python. ( 100 ), x cos x ( ). (, ). def print cos(): print cos() 4 2010.6 1 :, HP.. HP 4 (, PGM/PPM )., python,,, 2, kadai4,.,,, ( )., ( ) N, exn.py ( 3 ex3.py ). N 3.., ( )., ( ) N, (exn.txt).. 1 ( ) kadai4, kadai4.zip.,. 3 cos x [ π, π] Python. ( 100 ), x cos x (

More information

2 I I / 61

2 I I / 61 2 I 2017.07.13 I 2 2017.07.13 1 / 61 I 2 2017.07.13 2 / 61 I 2 2017.07.13 3 / 61 7/13 2 7/20 I 7/27 II I 2 2017.07.13 4 / 61 π-computer gnuplot MobaXterm Wiki PC X11 DISPLAY I 2 2017.07.13 5 / 61 Mac 1.

More information

r z m ε r ε θ z rθ

r z m ε r ε θ z rθ Rolling Characteristics in Three-roll-type Ring Rolling Toshifusa Nakamizo, Morihiko Nakasaki Synopsis: Hot ring rolling is a useful process for producing large seamless rings such as bearing races for

More information

13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software Nspire Nspire Nspir

13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software Nspire Nspire Nspir 13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software 37.1 37.1 Nspire Nspire Nspire 37.1: Student Software 13 2 13 Student Software esc

More information

untitled

untitled SPring-8 RFgun JASRI/SPring-8 6..7 Contents.. 3.. 5. 6. 7. 8. . 3 cavity γ E A = er 3 πε γ vb r B = v E c r c A B A ( ) F = e E + v B A A A A B dp e( v B+ E) = = m d dt dt ( γ v) dv e ( ) dt v B E v E

More information

cards.gif from Tkinter import * root = Tk() c0 = Canvas(root, width = 400, height = 300) c0.pack() image_data = PhotoImage(file = c1.gif ) c0.create_i

cards.gif from Tkinter import * root = Tk() c0 = Canvas(root, width = 400, height = 300) c0.pack() image_data = PhotoImage(file = c1.gif ) c0.create_i (Python ) Python Python 2 1. 2 2. 52 3. A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3, 2 4. 13 5. 6. 7. 8. 9. 13 10. 11. 12. Python http://www.jftz.com/cards/ 1 cards.gif from Tkinter import * root = Tk() c0 = Canvas(root,

More information

PowerPoint Presentation

PowerPoint Presentation 知能システム論 1 (9) 2015.6.17 情報システム学研究科情報メディアシステム学専攻知能システム学講座末廣尚士 13. アームモデルの Python による表現 理想ロボット :ArmWithHand 構造は関係なし move: 手先や持った物を動かす ハンド :Hand open, close, width アームのリンクの計算 :Link set_jparam シリアルリンクアーム :LinkedArm

More information

joho09.ppt

joho09.ppt s M B e E s: (+ or -) M: B: (=2) e: E: ax 2 + bx + c = 0 y = ax 2 + bx + c x a, b y +/- [a, b] a, b y (a+b) / 2 1-2 1-3 x 1 A a, b y 1. 2. a, b 3. for Loop (b-a)/ 4. y=a*x*x + b*x + c 5. y==0.0 y (y2)

More information

1 VisBAR edu H 2 O.....

1 VisBAR edu H 2 O..... VisBAR edu v1.03 ( ) 25 4 22 1 VisBAR edu 1 1.1....................................................... 1 1.2.................................................. 2 2 3 2.1 H 2 O.........................................

More information

double float

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

More information

1 6/13 2 6/20 3 6/27 4 7/4 5 7/11 6 7/18 N 7 7/25 Warshall-Floyd, Bellman-Ford, Dijkstra TSP DP, 8/1 2 / 36

1 6/13 2 6/20 3 6/27 4 7/4 5 7/11 6 7/18 N 7 7/25 Warshall-Floyd, Bellman-Ford, Dijkstra TSP DP, 8/1 2 / 36 3 2016 6 27 1 / 36 1 6/13 2 6/20 3 6/27 4 7/4 5 7/11 6 7/18 N 7 7/25 Warshall-Floyd, Bellman-Ford, Dijkstra TSP DP, 8/1 2 / 36 1 2 3 3 / 36 4 / 36 os.urandom(n) n >>> import os >>> r = os.urandom(4) #

More information

~~~~~~~~~~~~~~~~~~ wait Call CPU time 1, latch: library cache 7, latch: library cache lock 4, job scheduler co

~~~~~~~~~~~~~~~~~~ wait Call CPU time 1, latch: library cache 7, latch: library cache lock 4, job scheduler co 072 DB Magazine 2007 September ~~~~~~~~~~~~~~~~~~ wait Call CPU time 1,055 34.7 latch: library cache 7,278 750 103 24.7 latch: library cache lock 4,194 465 111 15.3 job scheduler coordinator slave wait

More information

Python C/C++ IPMU IRAF

Python C/C++ IPMU IRAF Python C/C++ IPMU 2010 11 24IRAF Python Swig Numpy array Image Python 2.6.6 swig 1.3.40 numpy 1.5.0 pyfits 2.3 pyds9 1.1 svn co hjp://svn.scipy.org/svn/numpy/tags/1.5.0/doc/swig swig/numpy.i /usr/local/share/swig/1.3.40/python

More information

Visual Python, Numpy, Matplotlib

Visual Python, Numpy, Matplotlib Visual Python, Numpy, Matplotlib 1 / 57 Contents 1 2 Visual Python 3 Numpy Scipy 4 Scipy 5 Matplotlib 2 / 57 Contents 1 2 Visual Python 3 Numpy Scipy 4 Scipy 5 Matplotlib 3 / 57 3 Visual Python: 3D Numpy,

More information

D-Link DWL-3500AP/DWL-8500AP 設定ガイド

D-Link DWL-3500AP/DWL-8500AP 設定ガイド 2 2001-2009 D-Link Corporation. All Rights Reserved. 3 4 2001-2009 D-Link Corporation. All Rights Reserved. 5 NOTE: 6 2001-2009 D-Link Corporation. All Rights Reserved. 7 8 2001-2009 D-Link Corporation.

More information

listings-ext

listings-ext (6) Python (2) ( ) ohsaki@kwansei.ac.jp 5 Python (2) 1 5.1 (statement)........................... 1 5.2 (scope)......................... 11 5.3 (subroutine).................... 14 5 Python (2) Python 5.1

More information

:56 1 (Forward kinematics) (Global frame) G r = (X, Y, Z) (Local frame) L r = (x, y, z) 1 X Y, Z X Y, Z 1 ( ) ( ) 1.2 (Joint rotati

:56 1 (Forward kinematics) (Global frame) G r = (X, Y, Z) (Local frame) L r = (x, y, z) 1 X Y, Z X Y, Z 1 ( ) ( ) 1.2 (Joint rotati 2013.09.21 17:56 1 (Forward kinematics) 1.1 2 (Global frame) G r (X, Y, Z) (Local frame) L r (x, y, z) 1 X Y, Z X Y, Z 1 ( ) ( ) 1.2 (Joint rotation) 3 P G r, L r G r L r Z α : G r Q L Z,α r (1) 1 G r

More information

Python2 Python3 Python 2.7 Python 3.6 Python2 Python3 Python 2.7 Python3.6 Python Python Anaconda Python Anaconda Python

Python2 Python3 Python 2.7 Python 3.6 Python2 Python3 Python 2.7 Python3.6 Python Python Anaconda Python Anaconda Python (Python ) C++ Python Python 1 Python2 Python3 Python 2.7 Python 3.6 Python2 Python3 Python 2.7 Python3.6 Python Python Anaconda Python Anaconda Python https://www.continuum.io/downloads 2 Python 3.6 version

More information

9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0)

9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0) E-mail: takio-kurita@aist.go.jp 1 ( ) CPU ( ) 2 1. a f(a) =(a 1.0) 2 (1) a ( ) 1(a) f(a) a (1) a f(a) a =2(a 1.0) (2) 2 0 a f(a) a =2(a 1.0) = 0 (3) 1 9 8 7 (x-1.0)*(x-1.0) 6 4 2.0*(x-1.0) 6 2 5 4 0 3-2

More information

Ruby Ruby ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( ) 44=>

Ruby Ruby ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( ) 44=> Ruby Ruby 200779 ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( 2+3+4+5+6+7+8+9 ) 44 irb(main):002:0> irb irb(main):001:0> 1+2+3+4 => 10 irb(main):002:0>

More information

DiMP Users Manual Yuichi Tazaki

DiMP Users Manual Yuichi Tazaki DiMP Users Manual Yuichi Tazaki 3 1 5 2 7 2.1............................. 7 2.2........................... 7 3 DiMP 9 3.1............................... 9 3.2........................... 10 3.3...................................

More information

from Tkinter import * root = Tk() c0 = Canvas(root, width = 400, height = 300) c0.pack() image_data = PhotoImage(file = c1.gif ) c0.create_image(200,

from Tkinter import * root = Tk() c0 = Canvas(root, width = 400, height = 300) c0.pack() image_data = PhotoImage(file = c1.gif ) c0.create_image(200, (Python ) Python Python 2 1. 2 2. 52 3. A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3, 2 4. 13 5. 6. 7. 8. 9. 13 10. 11. 12. Python.gif 1 from Tkinter import * root = Tk() c0 = Canvas(root, width = 400, height =

More information

Read the following text messages. Study the names carefully. 次のメッセージを読みましょう 名前をしっかり覚えましょう Dear Jenny, Iʼm Kim Garcia. Iʼm your new classmate. These ar

Read the following text messages. Study the names carefully. 次のメッセージを読みましょう 名前をしっかり覚えましょう Dear Jenny, Iʼm Kim Garcia. Iʼm your new classmate. These ar LESSON GOAL: Can read a message. メッセージを読めるようになろう Complete the conversation using your own information. あなた自身のことを考えて 会話を完成させましょう 1. A: Whatʼs your name? B:. 2. A: Whatʼs your phone number, (tutor says studentʼs

More information

01Ł\”ƒDV700D

01Ł\”ƒDV700D PWR RET RETURN TITLE SUBTITLE AUDIO ANGLE OSD STOP MENU PAUSE REPEAT TRACK GRP TITLE / CHAPTER PLAY T E X T DVD-VIDEO/VIDEO CD/CD PLAYBACK DIGITAL OUTPUT 96 khz 24 bit D/A CONVERTER 1 2 3 4 5 6 7 8 9 CX-DV700

More information

Microsoft Word - D JP.docx

Microsoft Word - D JP.docx Application Service Gateway Thunder/AX Series vthunder ライセンスキー インストール 手順 1 1.... 3 2. vthunder... 3 3. ACOS... 3 4. ID... 5 5.... 8 6.... 8 61... 8 62 GUI... 10 2 1. 概要 2. vthunder へのアクセス 方法 SSHHTTPSvThunder

More information

( ) 1.1 Polychoric Correlation Polyserial Correlation Graded Response Model Partial Credit Model Tetrachoric Correlation ( ) 2 x y x y s r 1 x 2

( ) 1.1 Polychoric Correlation Polyserial Correlation Graded Response Model Partial Credit Model Tetrachoric Correlation ( ) 2 x y x y s r 1 x 2 1 (,2007) SPSSver8 1997 (2002) 1. 2. polychoric correlation coefficient (polyserial correlation coefficient) 3. (1999) M-plus R 1 ( ) 1.1 Polychoric Correlation Polyserial Correlation Graded Response Model

More information

from tkinter import * root = Tk() # variable teban = IntVar() teban.set(1) # def start(): canvas.create_rectangle(0, 0, 560, 560, fill= white ) for k

from tkinter import * root = Tk() # variable teban = IntVar() teban.set(1) # def start(): canvas.create_rectangle(0, 0, 560, 560, fill= white ) for k Zen Deep Zen Go from tkinter import * root = Tk() canvas = Canvas(root, width = 360, height=360) canvas.pack() root.mainloop() 1 from tkinter import * root = Tk() # variable teban = IntVar() teban.set(1)

More information

2.2 Sage I 11 factor Sage Sage exit quit 1 sage : exit 2 Exiting Sage ( CPU time 0m0.06s, Wall time 2m8.71 s). 2.2 Sage Python Sage 1. Sage.sage 2. sa

2.2 Sage I 11 factor Sage Sage exit quit 1 sage : exit 2 Exiting Sage ( CPU time 0m0.06s, Wall time 2m8.71 s). 2.2 Sage Python Sage 1. Sage.sage 2. sa I 2017 11 1 SageMath SageMath( Sage ) Sage Python Sage Python Sage Maxima Maxima Sage Sage Sage Linux, Mac, Windows *1 2 Sage Sage 4 1. ( sage CUI) 2. Sage ( sage.sage ) 3. Sage ( notebook() ) 4. Sage

More information

Specview Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page htt

Specview Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page   htt Specview Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software_hardware/specview http://specview.stsci.edu/javahelp/main.html Specview

More information

Windows (L): D:\jyugyou\ D:\jyugyou\ D:\jyugyou\ (N): en2 OK 2

Windows (L): D:\jyugyou\ D:\jyugyou\ D:\jyugyou\ (N): en2 OK 2 Windows C++ Microsoft Visual Studio 2010 C++ Microsoft C++ Microsoft Visual Studio 2010 Microsoft Visual Studio 2010 C++ C C++ Microsoft Visual Studio 2010 Professional Professional 1 Professional Professional

More information

Microsoft Word - MetaFluor70取扱説明.doc

Microsoft Word - MetaFluor70取扱説明.doc MetaFluor (Version 7.7) MetaFluor 1. MetaFluor MetaFluor Meta Imaging Series 7.x Meta Imaging Series Administrator CCD Meta Imaging Series Administrator CCD Molecular Devices Japan KK/ Imaging Team (1/14)

More information

tkk0408nari

tkk0408nari SQLStatement Class Sql Database SQL Structured Query Language( ) ISO JIS http://www.techscore.com/tech/sql/02_02.html Database sql Perl Java SQL ( ) create table tu_data ( id integer not null, -- id aid

More information

0.2 Button TextBox: menu tab 2

0.2 Button TextBox: menu tab 2 Specview VO 2012 2012/9/27 Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software hardware/specview http://specview.stsci.edu/javahelp/main.html

More information

206“ƒŁ\”ƒ-fl_“H„¤‰ZŁñ

206“ƒŁ\”ƒ-fl_“H„¤‰ZŁñ 51 206 51 63 2007 GIS 51 1 60 52 2 60 1 52 3 61 2 52 61 3 58 61 4 58 Summary 63 60 20022005 2004 40km 7,10025 2002 2005 19 3 19 GIS 2005GIS 2006 2002 2004 GIS 52 2062007 1 2004 GIS Fig.1 GIS ESRIArcView

More information

PYTHON 資料 電脳梁山泊烏賊塾 PYTHON 入門 ゲームプログラミング スプライトの衝突判定 スプライトの衝突判定 スプライトの衝突判定の例として インベーダーゲームのコードを 下記に示す PYTHON3 #coding: utf-8 import pygame from pygame.lo

PYTHON 資料 電脳梁山泊烏賊塾 PYTHON 入門 ゲームプログラミング スプライトの衝突判定 スプライトの衝突判定 スプライトの衝突判定の例として インベーダーゲームのコードを 下記に示す PYTHON3 #coding: utf-8 import pygame from pygame.lo PYTHON 入門 ゲームプログラミング スプライトの衝突判定 スプライトの衝突判定 スプライトの衝突判定の例として インベーダーゲームのコードを 下記に示す #coding: utf-8 import pygame from pygame.locals import * import os import sys SCR_RECT = Rect(0, 0, 640, 480) def main():

More information

[ 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: 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 ) ;

More information

橡ボーダーライン.PDF

橡ボーダーライン.PDF 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 To be or not to be 32 33 34 35 36 37 38 ( ) 39 40 41 42 43 44 45 46 47 48 ( ) 49 50 51 52

More information

lifedesign_contest_No3

lifedesign_contest_No3 1 3 5 Apple Developer Program 5 AWS 8 Raspberry Pi 14 18 19 { "Version": "2012-10-17", "Statement": [ { "Effect": "Allow", "Action": [ "sns:createplatformendpoint" ], "Resource": [ ] ] #

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

# let st1 = {name = "Taro Yamada"; id = };; val st1 : student = {name="taro Yamada"; id=123456} { 1 = 1 ;...; n = n } # let string_of_student {n

# let st1 = {name = Taro Yamada; id = };; val st1 : student = {name=taro Yamada; id=123456} { 1 = 1 ;...; n = n } # let string_of_student {n II 6 / : 2001 11 21 (OCaml ) 1 (field) name id type # type student = {name : string; id : int};; type student = { name : string; id : int; } student {} type = { 1 : 1 ;...; n : n } { 1 = 1 ;...; n = n

More information

RHEA key

RHEA key 2 P (k, )= k e k! 3 4 Probability 0.4 0.35 0.3 0.25 Poisson ( λ = 1) Poisson (λ = 3) Poisson ( λ = 10) Poisson (λ = 20) Poisson ( λ = 30) Gaussian (µ = 1, s = 1) Gaussian ( µ = 3, s = 3) Gaussian (µ =

More information

or a 3-1a (0 b ) : max: a b a > b result a result b ( ) result Python : def max(a, b): if a > b: result = a else: result = b ret

or a 3-1a (0 b ) : max: a b a > b result a result b ( ) result Python : def max(a, b): if a > b: result = a else: result = b ret 4 2018.10.18 or 1 1.1 3-1a 3-1a (0 b ) : max: a b a > b result a result b result Python : def max(a, b): if a > b: result = a result = b return(result) : max2: a b result a b > result result b result 1

More information

( ) p.1 x y y = ( x ) 1 γ γ = filtergamma.java import java.applet.*; public class filtergamma extends Applet{ Image img; Image new_img; publi

( ) p.1 x y y = ( x ) 1 γ γ = filtergamma.java import java.applet.*; public class filtergamma extends Applet{ Image img; Image new_img; publi e001d 00 1 1 ( ) Figure 1: 1 shikaku.java import java.applet.*; public class shikaku extends Applet{ public void paint( Graphics g) { g.drawrect(,,0,0 ); // x(,) width = 0,height=0 g.drawrect(,,0,0 );

More information

num2.dvi

num2.dvi kanenko@mbk.nifty.com http://kanenko.a.la9.jp/ 16 32...... h 0 h = ε () 0 ( ) 0 1 IEEE754 (ieee754.c Kerosoft Ltd.!) 1 2 : OS! : WindowsXP ( ) : X Window xcalc.. (,.) C double 10,??? 3 :, ( ) : BASIC,

More information

Java演習(9) -- クラスとメソッド --

Java演習(9)   -- クラスとメソッド -- Java (9) Java (9) Java (9) 3 (x, y) x 1 30 10 (0, 50) 1 2 10 10 (width - 10, 80) -2 3 50 10 (width / 2, 110) 2 width 3 (RectMove4-1.java) import javax.swing.japplet; import javax.swing.timer; import java.awt.graphics;

More information

TopLink å SampleClient.java... 5 Ò readallsample() querysample() cachesample() Ç..

TopLink å SampleClient.java... 5 Ò readallsample() querysample() cachesample() Ç.. lê~åäé= qçéiáåâ= NMÖENMKNKPF Volume2 Creation Date: Mar 04, 2005 Last Update: Aug 22, 2005 Version 1.0 ...3... 3 TopLink å...4 1... 4... 4 SampleClient.java... 5 Ò... 8... 9... 10 readallsample()... 11

More information

ACS電子ジャーナル利用マニュアル

ACS電子ジャーナル利用マニュアル American Chemical Society ACS Web Edition & Journal Archives American Chemical Society ACS 4 Web Edition 2002 7 1879 Journal Archives ACS 1...2 2 2-1...3 2-2...4 2-3...5 3 3-1 Abstract...6 3-2 Full Text

More information

Mott散乱によるParity対称性の破れを検証

Mott散乱によるParity対称性の破れを検証 Mott Parity P2 Mott target Mott Parity Parity Γ = 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 t P P ),,, ( 3 2 1 0 1 γ γ γ γ γ γ ν ν µ µ = = Γ 1 : : : Γ P P P P x x P ν ν µ µ vector axial vector ν ν µ µ γ γ Γ ν γ

More information

A/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B

A/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B A/B (2010/10/08) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/soft.html 2010 10 8 A/B 1 2010 10 8 2 1 1 1.1 OHP.................................... 1 1.2.......................................

More information

JJ-90

JJ-90 Table 1 Message types added to ITU-T Recommendation Q.763 Message type Abbreviation Reference Code Comments Charge information CHG 4-30/JT-Q763 11111110 The description of a Charge information message

More information

C# ++ MASA C# ( ) XNA 1.1 C# ( ) VisualStuio XNA 4.0 VisualStuio XNA 3.1 * * *3 2.1 VisualStuio Windows ( TextGam

C# ++ MASA C# ( ) XNA 1.1 C# ( ) VisualStuio XNA 4.0 VisualStuio XNA 3.1 * * *3 2.1 VisualStuio Windows ( TextGam C# ++ MASA 2011 8 1 C# ( ) XNA 1.1 C# ( ) VisualStuio 2010 + XNA 4.0 VisualStuio 2008 + XNA 3.1 *1 1.2 1 *2 1.3 2 *3 2.1 VisualStuio Windows ( TextGame2 ) OK *1 XNA 3.1 4.0 *2 *3 1 TextGame2 ( Ship ) 32*32

More information

2 p.2 2 Java Hello0.class JVM Hello0 java > java Hello0.class Hello World! javac Java JVM java JVM : Java > javac 2> Q Foo.java Java : Q B

2 p.2 2 Java Hello0.class JVM Hello0 java > java Hello0.class Hello World! javac Java JVM java JVM : Java > javac 2> Q Foo.java Java : Q B 2 p.1 2 Java Java JDK Sun Microsystems JDK javac Java java JVM appletviewer IDESun Microsystems NetBeans, IBM 1 Eclipse 2 IDE GUI JDK Java 2.1 Hello World! 2.1.1 Java 2.1.1 Hello World Emacs Hello0.java

More information

2 of 46 07.2.10 4:30 PM

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

More information

*p145-174_Œâ‡í‡ê‡é

*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_

More information

80 X 1, X 2,, X n ( λ ) λ P(X = x) = f (x; λ) = λx e λ, x = 0, 1, 2, x! l(λ) = n f (x i ; λ) = i=1 i=1 n λ x i e λ i=1 x i! = λ n i=1 x i e nλ n i=1 x

80 X 1, X 2,, X n ( λ ) λ P(X = x) = f (x; λ) = λx e λ, x = 0, 1, 2, x! l(λ) = n f (x i ; λ) = i=1 i=1 n λ x i e λ i=1 x i! = λ n i=1 x i e nλ n i=1 x 80 X 1, X 2,, X n ( λ ) λ P(X = x) = f (x; λ) = λx e λ, x = 0, 1, 2, x! l(λ) = n f (x i ; λ) = n λ x i e λ x i! = λ n x i e nλ n x i! n n log l(λ) = log(λ) x i nλ log( x i!) log l(λ) λ = 1 λ n x i n =

More information

修士論文

修士論文 27 Mobile Ad Hoc Networks An Ant-based Routing Algorithm with Multi-phase Pheromone and Power-saving in Mobile Ad Hoc Networks 14T0013 Shohei Miyashita E-mail: shohei.miyashita.4j@stu.hosei.ac.jp : Abstract

More information

ApresiaNPシリーズ ユーザーズガイド

ApresiaNPシリーズ ユーザーズガイド 3 1. 2. SFP/SFP+/QSFP+ 3. 3 1. 1. REF: 1.1 2 ApresiaNP7000-48X6L ApresiaNP7000-48X6L SFP/SFP+ 1000BASE-X/10GBASE-R QSFP+ 40GBASE-R 1-1 ApresiaNP7000-48X6L ApresiaNP7000-48X6L 1-1 ApresiaNP7000-48X6L SFP/SFP+

More information

Python @HACHINONE 10 1 V Python 2014 2 : L[i] # -*- coding: utf-8 -*- def search(l, e): """L をリスト e をオブジェクトとする L に e が含まれていれば True そうでなければ False を返す """ for i in range(len(l)): if L[i] == e: return True

More information

Clustering in Time and Periodicity of Strong Earthquakes in Tokyo Masami OKADA Kobe Marine Observatory (Received on March 30, 1977) The clustering in time and periodicity of earthquake occurrence are investigated

More information

,, create table drop table alter table

,, create table drop table alter table PostgreSQL 1 1 2 1 3,, 2 3.1 - create table........................... 2 3.2 - drop table............................ 3 3.3 - alter table............................ 4 4 - copy 5 4.1..................................

More information

00_1512_SLIMLINE_BOOK.indb

00_1512_SLIMLINE_BOOK.indb PIECE type SLIM type Imbalance value Less interference type, ideal for deep machining Ideal for drilling 2 PIECE REGULAR type Rigidity value Nozzle type When compared to the slim type, it has more rigidity

More information

第62巻 第1号 平成24年4月/石こうを用いた木材ペレット

第62巻 第1号 平成24年4月/石こうを用いた木材ペレット Bulletin of Japan Association for Fire Science and Engineering Vol. 62. No. 1 (2012) Development of Two-Dimensional Simple Simulation Model and Evaluation of Discharge Ability for Water Discharge of Firefighting

More information

untitled

untitled 20 7 1 22 7 1 1 2 3 7 8 9 10 11 13 14 15 17 18 19 21 22 - 1 - - 2 - - 3 - - 4 - 50 200 50 200-5 - 50 200 50 200 50 200 - 6 - - 7 - () - 8 - (XY) - 9 - 112-10 - - 11 - - 12 - - 13 - - 14 - - 15 - - 16 -

More information

untitled

untitled 19 1 19 19 3 8 1 19 1 61 2 479 1965 64 1237 148 1272 58 183 X 1 X 2 12 2 15 A B 5 18 B 29 X 1 12 10 31 A 1 58 Y B 14 1 25 3 31 1 5 5 15 Y B 1 232 Y B 1 4235 14 11 8 5350 2409 X 1 15 10 10 B Y Y 2 X 1 X

More information

浜松医科大学紀要

浜松医科大学紀要 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

More information

Jupiter User Guide 1.0.2 30 3 16 Jupiter Genius[2] Genius Jupiter Jupiter Stacked Alternating Offers Protocol(SAOP)[1] Jupiter 1 Genius Jupiter 1 Jupiter 2 Jupiter 3 1 1 2 4 1 Jupiter 5 1.1..............................

More information

RR-US470 (RQCA1588).indd

RR-US470 (RQCA1588).indd RR-US470 Panasonic Corporation 2006 2 3 4 http://www.sense.panasonic.co.jp/ 1 2 3 ( ) ZOOM 5 6 7 8 9 10 4 2 1 3 4 2 3 1 3 11 12 1 4 2 5 3 1 2 13 14 q φ φ 1 2 3 4 3 1 2 3 4 2 3 15 16 1 2 3 [/]p/o 17 1 2

More information

自動シャットタ<3099>ウンクイックインストールカ<3099>イト<3099>.indb

自動シャットタ<3099>ウンクイックインストールカ<3099>イト<3099>.indb OMRON Corporation. 2011 All Rights Reserved. 2 3 4 5 6 7 8 9 10 11 12 13 14 15 title Red Hat Enterprise Linux Server (2.6.18-8.el5xen serial) root (hd0,1) kernel /xen.gz-2.6.18-8.el5 console=vga xencons=ttys16

More information

test.gby

test.gby Beautiful Programming Language and Beautiful Testing 1 Haskeller Haskeller 2 Haskeller (Doctest QuickCheck ) github 3 Haskeller 4 Haskell Platform 2011.4.0.0 Glasgow Haskell Compiler + 23 19 8 5 10 5 Q)

More information

…J…„…fi…g…j…–†[…Xno20

…J…„…fi…g…j…–†[…Xno20 SUPER VISOR SUPER VISOR SUPER VISOR 8 current news no.20 9 current news no.20 067223242 900630 68900800 06723455 :0020:00 9:30 0672356 900700 3600 0 current news no.20 4 06648398 :002:00 current news no.20

More information

2

2 L C -24K 9 L C -22K 9 2 3 4 5 6 7 8 9 10 11 12 11 03 AM 04 05 0 PM 1 06 1 PM 07 00 00 08 2 PM 00 4 PM 011 011 021 041 061 081 051 071 1 2 4 6 8 5 7 00 00 00 00 00 00 00 00 30 00 09 00 15 10 3 PM 45 00

More information

StarLogoテキスト(4匹).PDF

StarLogoテキスト(4匹).PDF StarLogo 0010 1100 20-10 3-100 10 1 Filename[ren4-1.slog] filename [kannkyou1.slog] x y 1/11 D: data StarLogo StarLogo2 StarLogo 2/11 D: data StarLogo StarLogo2 StarLogo 1 1 ask-patches [ ] 2 random 0

More information

Repatriation and International Development Assistance: Is the Relief-Development Continuum Becoming in the Chronic Political Emergencies? KOIZUMI Koichi In the 1990's the main focus of the global refugee

More information

# let rec sigma (f, n) = # if n = 0 then 0 else f n + sigma (f, n-1);; val sigma : (int -> int) * int -> int = <fun> sigma f n ( : * -> * ) sqsum cbsu

# let rec sigma (f, n) = # if n = 0 then 0 else f n + sigma (f, n-1);; val sigma : (int -> int) * int -> int = <fun> sigma f n ( : * -> * ) sqsum cbsu II 4 : 2001 11 7 keywords: 1 OCaml OCaml (first-class value) (higher-order function) 1.1 1 2 + 2 2 + + n 2 sqsum 1 3 + 2 3 + + n 3 cbsum # let rec sqsum n = # if n = 0 then 0 else n * n + sqsum (n - 1)

More information

( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1

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

More information

untitled

untitled - - GRIPS 1 traceroute IP Autonomous System Level http://opte.org/ GRIPS 2 Network Science http://opte.org http://research.lumeta.com/ches/map http://www.caida.org/home http://www.imdb.com http://citeseer.ist.psu.edu

More information

How to read the marks and remarks used in this parts book. Section 1 : Explanation of Code Use In MRK Column OO : Interchangeable between the new part

How to read the marks and remarks used in this parts book. Section 1 : Explanation of Code Use In MRK Column OO : Interchangeable between the new part Reservdelskatalog MIKASA MT65H vibratorstamp EPOX Maskin AB Postadress Besöksadress Telefon Fax e-post Hemsida Version Box 6060 Landsvägen 1 08-754 71 60 08-754 81 00 info@epox.se www.epox.se 1,0 192 06

More information