DiMP Users Manual Yuichi Tazaki
|
|
- みりあ みつだ
- 4 years ago
- Views:
Transcription
1 DiMP Users Manual Yuichi Tazaki
2
3 DiMP
4
5 5 1 DiMP C++ DiMP
6
7 DiMP doc lib Base DiMP1 DiMP2 GL Examples.lib Springhead Base DiMP DiMP OpenGL 2.2 DiMP Visual Studio 2010 VS2010 VS2010 DiMP10.sln DiMP
8
9 9 3 DiMP 3.1 DiMP DiMP DiMP DiMP
10 10 3 DiMP 3.1 DiMP h DiMP2 DiMP2 include #include <.h> DiMP DiMP2 using namespace DiMP2; DiMP2 DiMP2::Object typedef typedef DiMP2:: D;
11 DiMP public C++ real t vec3 t vec4 t quat t pose t 3 4 vec3 t quat t float double double float #define DIMP2_USE_SINGLE_PRECISION #include <.h> Springhead Base Springhead 3.3 DiMP2:: graph;
12 12 3 DiMP * graph = new ; delete class My : public { //... }; graph-> void SetGravity(const vec3 t&) [0.0, 9.8, 0.0] graph.setgravity(vec3_t()); 3.4 Object Object* obj = graph->createobject(); graph 3.4.1
13 Object void SetMass(real t m) void SetInertia(real t I) void SetDynamical(bool on) DiMP (inertia ) 1.0 object->setdynamical(false); false DiMP Object void SetInitialPose (vec3 t p, quat t q) void SetInitialVelocity(vec3 t v, vec3 t w) 3.4.3
14 14 3 DiMP Object void LockTrajectory() 3.5 Object Connector* CreateConnector(const pose t& p) void DeleteConnector(Connector* con) Connector void SetPose(const pose t& p) void GetPose(pose t& p) pose_t p; p.pos() = vec3_t(0,0,1); p.ori() = quat_t::rot(rad(30.0), x ); Connector* con = object->createconnector(p); [0, 0, 1] x
15 Box* CreateBox(string t, const vec3 t&) Sphere* CreateSphere(string t, real t) Cylinder* CreateCylinder(string t, real t, real t) void DeleteGeometry(Geometry* geo) DeleteGeometry Geometry 1.0 Box* box = graph->createbox("box1", vec3_t(1.0, 1.0, 1.0)); void void AttachGeometry(Geometry* geo, Connector* con) DetachGeometry(Geometry* geo, Connector* con) AttachGeometry geo con DetachGeometry con geo graph->addgeometry(box, con1); graph->addgeometry(box, con2); box Box* CreateBox(string t name, const vec3 t& sz)
16 16 3 DiMP sz x y z Sphere* CreateSphere(string t name, real t radius) radius Cylinder* CreateCylinder(string t name, real t radius, real t length) z radius length 3.7 Hinge* CreateHinge (string t, Connector*, Connector*) Slider* CreateSlider (string t, Connector*, Connector*) Balljoint* CreateBalljoint (string t, Connector*, Connector*) Planejoint* CreatePlanejoint(string t, Connector*, Connector*) void DeleteJoint (Joint* jnt)
17 DiMP DeleteJoint Joint Hinge* hinge = graph->createhinge("hinge1", socket, plug); socket plug z z 0 x x [rad] z z 0 z
18 18 3 DiMP 0 [rad] 1 [rad] 2 [rad] xy z xy 0 x 1 y 2 x x [rad] Joint void SetInitialPos(uint i, real t pos) void SetInitialVel(uint i, real t vel) SetInitialPos i pos SetInitialVel i vel 3.7.6
19 Joint void void void SetPosRange (uint i, real t rmin, real t rmax) SetVelRange (uint i, real t rmin, real t rmax) SetTorqueRange(uint i, real t rmin, real t rmax) i rmin rmax Object void ForwardKinematics() ForwardKinemaics
20 20 3 DiMP Tick* AddTick(real t) void AddTicks( real t ts, real t dt, real t te) void AddTicks( real t* tbegin, real t* tend) void RemoveTick(Tick*) void ClearTicks() size t NTicks() Tick* GetTick(uint i) real t GetHorizonLength() AddTick t AddTicks AddTicks ts te dt AddTicks [tbegin, tend) graph->addtick(0.0); graph->addtick(1.0); graph->addtick(2.0); graph->addtick(3.0); [0, 3] Tick void SetTime(real t) real t GetTime() graph->gettick(2)->settime(2.1);
21 DiMP 3.9 DiMP DiMP DiMP TimeSlot* CreateTimeSlot(string t name, real t ts = 0.0, real t te = 0.0) TimeSlot* timeslot = graph->createtimeslot("timeslot1", 1.0, 2.0); CreateTimeSlot [1.0, 2.0]
22 22 3 DiMP TimeSlot void Set(real t ts, real t te) void Lock(bool on = true) void SetStartRange( real t ts min, real t ts max) void SetEndRange( real t te min, real t te max) void SetDurationRange( real t T min, real t T max) CreateTimeSlot Set timeslot->lock(); Lock(false) Set[Start End Duration]Range DiMP MatchingTask* CreateMatchingTask( string t name, Object* obj0, Object* obj1, TimeSlot* time = 0) AvoidTask* CreateAvoidTask( string t name, Object* obj0, Object* obj1, TimeSlot* time = 0) name obj0 obj1 time
23 time 0 (null) MatchingTask* task; task = graph->creatematchingtask("task1", hand, box, timeslot); hand box Object* void Init() Init
24 24 3 DiMP 3.1 ObjectTP vec3 t ObjectRP quat t ObjectTV vec3 t ObjectRV vec3 t JointP real t JointV real t ForceT vec3 t ForceR vec3 t TimeStart real t TimeEnd real t Init DiMP 3 ID ID VarTag ConTag ID ID ID ID(int tag, Node* node = 0, Tick* tick = 0) tag node tick node
25 ObjectC1T vec3 t C 1 ( ) ObjectC1R quat t C 1 ( ) JointC1 real t C 1 JointRangeP real t JointRangeV real t JointRangeF real t JointTP vec3 t ( ) JointRP quat t ( ) JointTV vec3 t ( ) JointRV vec3 t ( ) ForceT real t ( ) ForceR real t ( ) TimeStartRange real t TimeEndRange real t TimeDurationRange real t MatchingTP vec3 t MatchingRP quat t MatchingTV vec3 t MatchingRV vec3 t AvoidP vec3 t AvoidV vec3 t tick 0 ID id(vartag::objecttp); ID
26 26 3 DiMP void Lock(ID id, bool lock = true) id ID lock void Enable(ID id, bool enable = true) id ID enable true id enable false void SetPriority(ID id, int level) id ID level 0 0, 1, 2 0, 3, 10 void SetNumIteration(int n) ::Step DiMP Gauss-Seidel SetNumIteration Gauss-Seidel Step
27 Step DiMP ::Step void Step() DiMP Step Step Step real t CalcError(ID mask, bool sum or max) real t CalcVariable(ID mask, bool ave or max) CalcError ID ID sum or max true false 0 CalcVariable ID ID ave or max true false
28 28 3 DiMP 3.3 Constant 0 LinearDiff LinearInt Quadratic Cubic SlerpDiff (quat t ) SlerpInt (quat t ) Object vec3 t Pos(real t t, int type) vec3 t Vel(real t t, int type) vec3 t Acc(real t t, int type) quat t Ori(real t t, int type) vec3 t Angvel(real t t, int type) vec3 t Angacc(real t t, int type) t type DiMP type Interpolate 3.3 quat t type quat t SlerpDiff Quadratic Joint real t Pos(uint i, real t t, int type) real t Vel(uint i, real t t, int type) real t Acc(uint i, real t t, int type)
29 i DiMP Springhead ics Springhead T.B.D.
30 30 Balljoint, 15 Box, 13 CreateBalljoint, 15 CreateBox, 13 CreateCylinder, 14 CreateHinge, 15 CreatePlanejoint, 16 CreateSlider, 15 CreateSphere, 14 Cylinder, 14, 17, 10, 8, 22, 15, 10, 16, 22 DiMP2, 8 Enable, 24, 9 Hinge, 15 ID, 22 Lock, 23 Object, 10 Planejoint, 16 real t, 9 SetNumIteration, 24 SetPriority, 24 Slider, 15 Sphere, 14, 10, 14, 9, 12, 12, 10, 10, 21, 17, 15, 19, 19
31 31 [1],, :,, Vol.31, No.5.
3.1 stdio.h iostream List.2 using namespace std C printf ( ) %d %f %s %d C++ cout cout List.2 Hello World! cout << float a = 1.2f; int b = 3; cout <<
C++ C C++ 1 C++ C++ C C++ C C++? C C++ C *.c *.cpp C cpp VC C++ 2 C++ C++ C++ [1], C++,,1999 [2],,,2001 [3], ( )( ),,2001 [4] B.W. /D.M.,, C,,1989 C Web [5], http://kumei.ne.jp/c_lang/ 3 Hello World Hello
More informationcpp1.dvi
2017 c 1 C++ (1) C C++, C++, C 11, 12 13 (1) 14 (2) 11 1 n C++ //, [List 11] 1: #include // C 2: 3: int main(void) { 4: std::cout
More informationelem attr value = "..." Scenebuilder XML <elem attr="value"... /> XML XML Scenebuilder body hinge XML Scenebuilder 4 3 Scenebuilder XML C/C++ bool int
Scenebuilder XML tazz 2013/9/4 1 Scenebuilder XML XML 2 XML XML XML ... 1 elem attr value = "..." Scenebuilder XML
More informationC# ++ 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 informationdouble float
2015 3 13 1 2 2 3 2.1.......................... 3 2.2............................. 3 3 4 3.1............................... 4 3.2 double float......................... 5 3.3 main.......................
More information解きながら学ぶC++入門編
!... 38!=... 35 "... 112 " "... 311 " "... 4, 264 #... 371 #define... 126, 371 #endif... 369 #if... 369 #ifndef... 369 #include... 3, 311 #undef... 371 %... 17, 18 %=... 85 &... 222 &... 203 &&... 40 &=...
More informationGLS user s reference 19 8 21 1 3 1.1....................................................... 3 1.2....................................................... 3 1.3.......................................................
More information(STL) STL 1 (deta structure) (algorithm) (deta structure) 2 STL STL (Standard Template Library) 2.1 STL STL ( ) vector<int> x; for(int i = 0; i < 10;
(STL) STL 1 (deta structure) (algorithm) (deta structure) 2 STL STL (Standard Template Library) 2.1 STL STL ( ) vector x; for(int i = 0; i < 10; ++i) x.push_back(i); vector STL x.push_back(i) STL
More informationCudaWaveField
CudaWaveField 2012 3 22 2 CudaWaveField Rel 1.0.0 Rel 1.0 CudaWaveField ( cwfl) / cwfl cwfl http://www.laser.ee.kansai-u.ac.jp/wavefieldtools Note Acrobat Reader 3 I CudaWaveField 9 1 11 1.1 CudaWaveField......................
More informationVB.NETコーディング標準
(C) Copyright 2002 Java ( ) VB.NET C# AS-IS extremeprogramming-jp@objectclub.esm.co.jp bata@gold.ocn.ne.jp Copyright (c) 2000,2001 Eiwa System Management, Inc. Object Club Kenji Hiranabe02/09/26 Copyright
More informationJava演習(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 informationBW 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 informationCondition DAQ condition condition 2 3 XML key value
Condition DAQ condition 2009 6 10 2009 7 2 2009 7 3 2010 8 3 1 2 2 condition 2 3 XML key value 3 4 4 4.1............................. 5 4.2...................... 5 5 6 6 Makefile 7 7 9 7.1 Condition.h.............................
More informationprogrammingII2019-v01
II 2019 2Q A 6/11 6/18 6/25 7/2 7/9 7/16 7/23 B 6/12 6/19 6/24 7/3 7/10 7/17 7/24 x = 0 dv(t) dt = g Z t2 t 1 dv(t) dt dt = Z t2 t 1 gdt g v(t 2 ) = v(t 1 ) + g(t 2 t 1 ) v v(t) x g(t 2 t 1 ) t 1 t 2
More informationJava (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 information19 3!! (+) (>) (++) (+=) for while 3.1!! (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics;
19 3!!...... (+) (>) (++) (+=) for while 3.1!! 3.1.1 50 20 20 5 (20, 20) 3.1.1 (1)(Blocks1.java) public class Blocks1 extends JApplet { public void paint(graphics g){ 5 g.drawrect( 20, 20, 50, 20); g.drawrect(
More information1.3 ( ) ( ) C
1 1.1 (Data Base) (Container) C++ Java 1.2 1 1.3 ( ) ( ) 1. 2. 3. C++ 2 2.1 2.2 2.3 2 C Fortran C++ Java 3 3.1 (Vector) 1. 2. ( ) 3.2 3 3.3 C++ C++ STL C++ (Template) vector vector< > ; int arrayint vector
More informationTOEIC
TOEIC 1 1 3 1.1.............................................. 3 1.2 C#........................................... 3 2 Visual Studio.NET Windows 5 2.1....................................... 5 2.2..........................................
More informationCopyright c 2006 Zhenjiang Hu, All Right Reserved.
1 2006 Copyright c 2006 Zhenjiang Hu, All Right Reserved. 2 ( ) 3 (T 1, T 2 ) T 1 T 2 (17.3, 3) :: (Float, Int) (3, 6) :: (Int, Int) (True, (+)) :: (Bool, Int Int Int) 4 (, ) (, ) :: a b (a, b) (,) x y
More information新版明解C言語 実践編
2 List - "max.h" a, b max List - max "max.h" #define max(a, b) ((a) > (b)? (a) : (b)) max List -2 List -2 max #include "max.h" int x, y; printf("x"); printf("y"); scanf("%d", &x); scanf("%d", &y); printf("max(x,
More informationcaimmetal03.key
import UIKit import simd // ID let ID_VERTEX:Int = 0 let ID_PROJECTION:Int = 1 // 1 struct Vertex { var pos:float2 = Float2() var uv:float2 = Float2() var rgba:float4 = Float4() // struct Particle { var
More informationnetcdf
1. Anetcdf.rb netcdf C ruby open new create NetCDF C filename String NetCDF NetCDF_open mode r r, w share false true or false open open netcdf filename String NetCDF NetCDF_create noclobber false true
More informationK227 Java 2
1 K227 Java 2 3 4 5 6 Java 7 class Sample1 { public static void main (String args[]) { System.out.println( Java! ); } } 8 > javac Sample1.java 9 10 > java Sample1 Java 11 12 13 http://java.sun.com/j2se/1.5.0/ja/download.html
More informationJava (5) 1 Lesson 3: x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java , 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) "flow
Java (5) 1 Lesson 3: 2008-05-20 2 x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java 1.1 10 10 0 1.0 2.0, 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) "flowrate.dat" 10 8 6 4 2 0 0 5 10 15 20 25 time (s) 1 1
More information解きながら学ぶJava入門編
44 // class Negative { System.out.print(""); int n = stdin.nextint(); if (n < 0) System.out.println(""); -10 Ÿ 35 Ÿ 0 n if statement if ( ) if i f ( ) if n < 0 < true false true false boolean literalboolean
More informationcpp4.dvi
2017 c 4 C++ (4) C++, 41, 42, 1, 43,, 44 45, 41 (inheritance),, C++,, 100, 50, PCMCIA,,,,,,,,, 42 1 421 ( ), car 1 [List 41] 1: class car { 2: private: 3: std::string m model; // 4: std::string m maker;
More informationランダムウォークの境界条件・偏微分方程式の数値計算
B L06(2018-05-22 Tue) : Time-stamp: 2018-05-22 Tue 21:53 JST hig,, 2, multiply transf http://hig3.net L06 B(2018) 1 / 38 L05-Q1 Quiz : 1 M λ 1 = 1 u 1 ( ). M u 1 = u 1, u 1 = ( 3 4 ) s (s 0)., u 1 = 1
More informationALG2012-C.ppt
2012717 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2012/index.html 1 1. 2. 2 .. 3 public class WeightedNode { private E value; // private Map
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:
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 information2008chom.pdf
CHomP Pawe l Pilarczyk 1 CHomP Computational Homology Project [3] OS Windows Mac Unix Linux [3] CHomP [3] 2 3 CHomP CHomP 4 5 C++ [1] 2 CHomP 1 2 K 1 = { A 1 A 2 A 3, A 1 A 2, A 2 A 3, A 1 A 3, A 3 A 4,
More informationHABOC manual
HABOC manual Version 2.0 takada@cr.scphys.kyoto-u.ac.jp HABOC とは Event by event 解析用の Framework C++ による coding ANL や FULL の C++ 版を目標 ANL/FULL は Object Oriented な設計概念なので C++ と相性が良い Histogram や視覚化には ROOT(http://root.cern.ch)
More information新・明解C言語 実践編
第 1 章 見 21 1-1 見えないエラー 見 List 1-1 "max2x1.h" a, b max2 List 1-1 chap01/max2x1.h max2 "max2x1.h" #define max2(a, b) ((a) > (b)? (a) : (b)) max2 List 1-2 List 1-2 chap01/max2x1test.c max2 #include
More informationdesign_pattern.key
#include void init(int* ary, int size) for (int i = 0; i < size; ++i) ary[i] = i; void mul10(int* ary, int size) for (int i = 0; i < size; ++i) ary[i] *= 10; void dispary(int* ary, int size)
More informationJava updated
Java 2003.07.14 updated 3 1 Java 5 1.1 Java................................. 5 1.2 Java..................................... 5 1.3 Java................................ 6 1.3.1 Java.......................
More informationMPI MPI MPI.NET C# MPI Version2
MPI.NET C# 2 2009 2 27 MPI MPI MPI.NET C# MPI Version2 MPI (Message Passing Interface) MPI MPI Version 1 1994 1 1 1 1 ID MPI MPI_Send MPI_Recv if(rank == 0){ // 0 MPI_Send(); } else if(rank == 1){ // 1
More informationhaskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
More informationfp.gby
1 1 2 2 3 2 4 5 6 7 8 9 10 11 Haskell 12 13 Haskell 14 15 ( ) 16 ) 30 17 static 18 (IORef) 19 20 OK NG 21 Haskell (+) :: Num a => a -> a -> a sort :: Ord a => [a] -> [a] delete :: Eq a => a -> [a] -> [a]
More informationLogisticaTRUCKServer-Ⅱ距離計算サーバ/Active-Xコントロール/クライアント 概略
- LogisticaTRUCKServer-Ⅱ(SQLServer 版 ) 距離計算サーハ API.NET DLL WindowsForm サンフ ルフ ロク ラム - 1 - LogisticaTRUCKServer-Ⅱ 距離計算サーハ.NET DLL WindowsForm VisualBasic での利用方法 LogisticaTRUCKServer-Ⅱ 距離計算.NET DLLのサンプルプログラムの参照サンフ
More informationuntitled
WIL (Visual C++ 2005 MFC ) WIL (Visual C++ 2005) Visual C++ 2005 Visual C++ WIL MFC 0 Visual C++ 2005 WIL Visual C++ WIL 1. Microsoft Visual Studio 2005 2. 3. VC 4. WIL EVC C: Program Files FAST WIL Include
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
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 informationA, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3,
40 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. 1 VC++ VC++ Visual C++ Professional 2010 Visual C++ 2010 express Windows whist 2 OK] 3 Form1 size 800, 500
More information‚æ4›ñ
( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9
More informationlistings-ext
(10) (2) ( ) ohsaki@kwansei.ac.jp 8 (2) 1 8.1.............................. 1 8.2 mobility.fixed.......................... 2 8.3 mobility.randomwalk...................... 7 8.4 mobility.randomwaypoint...................
More informationr07.dvi
19 7 ( ) 2019.4.20 1 1.1 (data structure ( (dynamic data structure 1 malloc C free C (garbage collection GC C GC(conservative GC 2 1.2 data next p 3 5 7 9 p 3 5 7 9 p 3 5 7 9 1 1: (single linked list 1
More informationC のコード例 (Z80 と同機能 ) int main(void) { int i,sum=0; for (i=1; i<=10; i++) sum=sum + i; printf ("sum=%d n",sum); 2
アセンブラ (Z80) の例 ORG 100H LD B,10 SUB A LOOP: ADD A,B DEC B JR NZ,LOOP LD (SUM),A HALT ORG 200H SUM: DEFS 1 END 1 C のコード例 (Z80 と同機能 ) int main(void) { int i,sum=0; for (i=1; i
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 informationohp07.dvi
19 7 ( ) 2019.4.20 1 (data structure) ( ) (dynamic data structure) 1 malloc C free 1 (static data structure) 2 (2) C (garbage collection GC) C GC(conservative GC) 2 2 conservative GC 3 data next p 3 5
More informationウィンドウ操作 応用
Win32API 関数 ウィンドウ操作 ウィンドウ名でトップレベルウィンドウ ( 親を持たないウィンドウ ) のハンドルを取得 メモ帳や電卓等のウィンドウ名でトップレベルウィンドウ ( 親を持たないウィンドウ ) のハンドルを取得する方法を 下記に示す Visual Basic Imports System.Runtime.InteropServices Public Class WindowFromWindowName
More informationJava Java Java Java Java 4 p * *** ***** *** * Unix p a,b,c,d 100,200,250,500 a*b = a*b+c = a*b+c*d = (a+b)*(c+d) = 225
Java Java Java Java Java 4 p35 4-2 * *** ***** *** * Unix p36 4-3 a,b,c,d 100,200,250,500 a*b = 20000 a*b+c = 20250 a*b+c*d = 145000 (a+b)*(c+d) = 225000 a+b*c+d = 50600 b/a+d/c = 4 p38 4-4 (1) mul = 1
More informationI117 7 School of Information Science, Japan Advanced Institute of Science and Technology
I117 7 School of Information Science, Japan Advanced Institute of Science and Technology time time t long typedef long time_t; 1970/01/01 0:00:00 time t = time(null); Japan Advanced Institute of Science
More informationALG ppt
2012 6 21 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2012/index.html 1 l l O(1) l l l 2 (123 ) l l l l () l H(k) = k mod n (k:, n: ) l l 3 4 public class MyHashtable
More information(300, 150) 120 getchar() HgBox(x, y, w, h) (x, y), w, h #include <stdio.h> #include <handy.h> int main(void) { int i; double w, h; } HgO
Handy Graphic for Handy Graphic Version 0.5 2008-06-09 1 Handy Graphic Handy Graphic C Handy Graphic Handy Graphic Mac OS X Handy Graphic HgDisplayer Handy Graphic HgDisplayer 2 Handy Graphic 1 Handy Graphic
More information10-C.._241_266_.Z
Windows 10 1 2 3 4 5 Visual Studio 2008LINQ MySchedule 242 Microsoft Visual C# 2008 10 Windows 243 1 LINQIEnumerableXML LINQ to Object q Form1.cs w RefreshListBox private void RefreshListBox() schedulelistbox.items.clear();
More information2 : 2008/12/ /01/ G :
2 : 2008/12/08 2008/01/16 075730G : 1 project draw main.cpp 1 draw main.cpp /* * main.cpp * draw * * Created by C-T on 08/12/08. * Copyright 2008 MyCompanyName. All rights reserved. * */ #include
More informationCX-Checker CX-Checker (1)XPath (2)DOM (3) 3 XPath CX-Checker. MISRA-C 62%(79/127) SQMlint 76%(13/17) XPath CX-Checker 3. CX-Checker 4., MISRA-C CX- Ch
CX-Checker: C 1 1 2 3 4 5 1 CX-Checker CX-Checker XPath DOM 3 CX-Checker MISRA-C CX-Checker: A Customizable Coding Checker for C TOSHINORI OSUKA, 1 TAKASHI KOBAYASHI, 1 JUNICHI MASE, 2 NORITOSHI ATSUMI,
More informationALG ppt
2012614 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2012/index.html 1 2 2 3 29 20 32 14 24 30 48 7 19 21 31 4 N O(log N) 29 O(N) 20 32 14 24 30 48 7 19 21 31 5
More informationuntitled
2011 6 20 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2011/index.html tech.ac.jp/k1sakai/lecture/alg/2011/index.html html 1 O(1) O(1) 2 (123) () H(k) = k mod n
More informationpresen.gby
kazu@iij.ad.jp 1 2 Paul Graham 3 Andrew Hunt and David Thomas 4 5 Java 6 Java Java Java 3 7 Haskell Scala Scala 8 9 Java Java Dean Wampler AWT ActionListener public interface ActionListener extends EventListener
More informationXMPによる並列化実装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 informationr03.dvi
19 ( ) 019.4.0 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void... argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0 a a \0 b b b \0 c c c \0 1: // argdemo1.c ---
More informationOOCOBOL紹介
ISO ANSI COBOL85 COBOL 1959 COBOL OOCOBOL 1 ... 1... 3.... 3. OOCOBOL... 4.1.... 4.2.... 5.3. IDENTIFICATION DIVISION... 7.4. ENVIRONMENT DIVISION.... 7.5. DATA DIVISION... 7.6. PROCEDURE DIVISION....
More information1.5 1...1 1.1... 1 1.2... 1 2... 2 2.1... 2 2.2 DB... 2 3... 3 3.1... 3 3.2... 3 4 DB... 4 4.1... 4 4.2... 6 4.3... 7 4.3.1.... 7 4.3.2.... 7 4.3.3.... 9 4.3.4.... 10 4.3.5.... 12 4.3.6.... 13 4.3.7....
More informationVisual Studio2008 C# で JAN13 バーコードイメージを作成 xbase 言語をご利用の現場でバーコードの出力が必要なことが多々あります xbase 言語製品によっては 標準でバーコード描画機能が付加されているものもあるようで す C# では バーコードフォントを利用したりバー
Visual Studio2008 C# で JAN13 バーコードイメージを作成 xbase 言語をご利用の現場でバーコードの出力が必要なことが多々あります xbase 言語製品によっては 標準でバーコード描画機能が付加されているものもあるようで す C# では バーコードフォントを利用したりバーコード OCX や バーコード対応レ ポートツールが豊富にありますので それほど困ることは無いと思われます
More informationRHEA key
2 $ cd RHEA $ git pull zsh $ for i in {009..049}; do curl -O https://raw.githubusercontent.com/akiraokumura/rhea-slides/master/photons/lat_photon_weekly_w${i} _p302_v001_extracted.root; done bash $ for
More informationuntitled
C -1 - -2 - concept lecture keywords FILE, fopen, fclose, fscanf, fprintf, EOF, r w a, typedef gifts.dat Yt JZK-3 Jizake tsumeawase 45 BSP-15 Body soap set 3 BT-2 Bath towel set 25 TEA-2 Koutya
More informationExcel基礎講座演習-表紙とはじめにv1.3.doc
Future Lifestyle Inc. IT Microsoft Excel 2000 Microsoft Microsoft Corporation B4 11 14 1999 1 C4 E7 C4 E7 2 =C4+D4+E4 SUM MAX MIN B3 F7 Sheet2 1999 2000 3 B3 F7 C4 F7 Delete C4 F7 SUM SUM() C4 SUM 4 B3
More informationPowerPoint Presentation
UML 2004 7 9 10 ... OOP UML 10 Copyright 2004 Akira HIRASAWA all rights reserved. 2 1. 2. 3. 4. UML 5. Copyright 2004 Akira HIRASAWA all rights reserved. 3 1..... Copyright 2004 Akira HIRASAWA all rights
More informationRHEA 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 informationohp03.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 informationJava (9) 1 Lesson Java System.out.println() 1 Java API 1 Java Java 1
Java (9) 1 Lesson 7 2008-05-20 Java System.out.println() 1 Java API 1 Java Java 1 GUI 2 Java 3 1.1 5 3 1.0 10.0, 1.0, 0.5 5.0, 3.0, 0.3 4.0, 1.0, 0.6 1 2 4 3, ( 2 3 2 1.2 Java (stream) 4 1 a 5 (End of
More informationtkk0408nari
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アルゴリズムとデータ構造1
1 200972 (sakai.keiichi@kochi sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi ://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2009/index.html 29 20 32 14 24 30 48 7 19 21 31 Object public class
More informationVB 資料 電脳梁山泊烏賊塾 音声認識 System.Speech の利用 System.Speech に依るディクテーション ( 音声を文字列化 ).NetFramework3.0 以上 (Visual Studio 2010 以降 ) では 標準で System.Speech が用意されて居るの
音声認識 System.Speech の利用 System.Speech に依るディクテーション ( 音声を文字列化 ).NetFramework3.0 以上 (Visual Studio 2010 以降 ) では 標準で System.Speech が用意されて居るので 此れを利用して音声認識を行うサンプルを紹介する 下記の様な Windows フォームアプリケーションを作成する エディタを起動すると
More informationParametric Polymorphism
ML 2 2011/04/19 Parametric Polymorphism Type Polymorphism ? : val hd_int : int list - > int val hd_bool : bool list - > bool val hd_i_x_b : (int * bool) list - > int * bool etc. let hd_int = function (x
More information明解Javaによるアルゴリズムとデータ構造
21 algorithm List 1-1 a, b, c max Scanner Column 1-1 List 1-1 // import java.util.scanner; class Max3 { public static void main(string[] args) { Scanner stdin = new Scanner(System.in); Chap01/Max3.java
More information10K
1 2 3 4 Object Oriented Object Oriented Programming(OOP) 5 6 OOP#1 OOP#2 Java 7 Java 8 手続き型 v.s. OOP #1 OOPのメリット#3 追加 変更がラク 出典 立山秀利 Javaのオブジェクト指向がゼッタイにわかる本 秀和システム 出典 立山秀利 Javaのオブジェクト指向がゼッタイにわかる本 秀和システム
More informationジョインポイント写像に基づく ドメイン特化AO機構の開発手法
X Aspect Aspect Aspect Aspect Aspect Aspect Aspect Aspect Aspect Aspect Aspect in out in out in out in out in out in in out out in out in out in out in in out out in out in out in out in in out
More informationI java A
I java 065762A 19.6.22 19.6.22 19.6.22 1 1 Level 1 3 1.1 Kouza....................................... 3 1.2 Kouza....................................... 4 1.3..........................................
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
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 informationuntitled
JCSP CSP HPC H.Nakahara 1 2 CSP A B HPC H.Nakahara 3 CSP HPC H.Nakahara 4 CSP Process A chan Process B ( DFD) HPC H.Nakahara 5 DFD HPC H.Nakahara 6 DFD FAX OK? HPC H.Nakahara 7 HPC H.Nakahara 8 HPC H.Nakahara
More information@(h) Select.vb ver 1.1 ( 07.09.15 ) @(h) Select.vb ver 1.0 ( 07.09.13 ) @(s) Option Explicit Private Structure SYMBOLINFO Dim SyDataType As String Dim
A HotDocument A HotDocument A HotDocument A HotDocument A HotDocument A HotDocument A HotDocument A HotDocument @(h) Select.vb ver 1.1 ( 07.09.15 ) @(h) Select.vb ver 1.0 ( 07.09.13 ) @(s) Option Explicit
More informationWinDriver PCI Quick Start Guide
WinDriver PCI/PCI Express/PCMCIA 5! WinDriver (1) DriverWizard (2) DriverWizard WinDriver (1) Windows 98/Me/2000/XP/Server 2003/Vista Windows CE.NET Windows Embedded CE v6.00 Windows Mobile 5.0/6.0 Linux
More informationJava学習教材
Java 2016/4/17 Java 1 Java1 : 280 : (2010/1/29) ISBN-10: 4798120987 ISBN-13: 978-4798120980 2010/1/29 1 Java 1 Java Java Java class FirstExample { public static void main(string[] args) { System.out.println("
More informationスライド 1
R 流 Visual Studio 2008 C# の 驚異的な生産性を知る 2008 年 03 月 29 日 R 田中一郎 http://blogs.wankuma.com/rti/ Microsoft MVP for Development Tools - Visual C# アジェンダ はじめに コード比較 新機能の紹介 新機能の応用 まとめ はじめに つい先日発売した Visual Studio
More informationdouble 2 std::cin, std::cout 1.2 C fopen() fclose() C++ std::fstream 1-3 #include <fstream> std::fstream fout; int a = 123; fout.open( "data.t
C++ 1 C C++ C++ C C C++ 1.1 C printf() scanf() C++ C 1-1 #include int a; scanf( "%d", &a ); printf( "a = %d\n", a ); C++ 1-2 int a; std::cin >> a; std::cout
More informationSystemC言語概論
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 informationcaimmetal03.key
import UIKit // ID let ID_VERTEX:Int = 0 let ID_PROJECTION:Int = 1 // 1 struct VertexInfo : Initializable { var pos:vec4 = Vec4() var uv:vec2 = Vec2() var rgba:caimcolor = CAIMColor() // struct Particle
More information_FH28_J.qxd
23.9 + + ø ø ø ø ø ø ø ø ø ++ + ++ + + + ± FH 28 D - 5 (25) S B -.5 SH (5) 2 3 4 5 6 7 8 9 2 6 7 3 8 4 9 5 ** ** ** ** ** ** ** ** ** ** ** ** ** CL586-86-4-** CL586-868-3-** CL586-823-5-** CL586-835-4-**
More information1 発病のとき
A A 1944 19 60 A 1 A 20 40 2 A 4 A A 23 6 A A 13 10 100 2 2 360 A 19 2 5 A A A A A TS TS A A A 194823 6 A A 23 A 361 A 3 2 4 2 16 9 A 7 18 A A 16 4 16 3 362 A A 6 A 6 4 A A 363 A 1 A A 1 A A 364 A 1 A
More informationuntitled
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 informationuntitled
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新版 明解C++入門編
第 1 章画面 出力 入力 C++ C++ C++ C++ C++ C++ C++ C++ #include using C++ C++ C++ main C++ C++ C++ int double char C++ C++ C++ string C++ C++ C++ 21 1-1 C++ 歴史 C++ C++ 歴史 CC with classes Fig.1-1 C C++ Simula 67
More informationcourse pptx
ParaView () 20105141CAE OPENFOAM (R) is a registered trade mark of OpenCFD Limited, the producer of the OpenFOAM software and owner of the OPENFOAM (R) and OpenCFD (R) trade marks. This offering is not
More information