untitled
|
|
- わんど うづき
- 6 years ago
- Views:
Transcription
1 2 VTK 1 G401 gnuplot 2 3 x, y, ), ) Version
2 G401 vtk 3 CMakeLists.txt PROJECT (ProjectName) INCLUDE (${CMAKE_ROOT}/Modules/FindVTK.cmake) IF (USE_VTK_FILE) INCLUDE(${USE_VTK_FILE}) ENDIF (USE_VTK_FILE) ADD_EXECUTABLE(ObjectName ProgramFile) TARGET_LINK_LIBRARIES(ObjectName Libraries) VTK 4 2
3 URL Alphabetical List CVS logs(cvsweb):.cxx(/graphics/vtk???.cxx).h(/graphics/vtk???.h) vtkgraphics 5 Vtk vtkdataset vtkimagedata vtkpointset vtkrectilinear vtkstructuredpoints vtkpolydata 6 3
4 vtkstructuredpoints 3 x,y,z vtkrectilinear 3 x,y,z 7 vtkstructuredgrid vtkpolydata 8 4
5 (PointData) or (CellData) PointData CellData SvalarData VectorData TensorData FieldData 9 3 x1 y1 z1 x2 y2 z2 xn yn zn class vtkpolydata; class vtkpoints; class vtkidlist; void AddLineToPolyData(vtkPolyData *pdata,char *fname){ double x,y,z; int newflg=0; char buffer[1000]; vtkidlist *pntids=vtkidlist::new(); vtkpoints *pnts=pdata- >GetPoints(); if(pnts==null){ pnts=vtkpoints::new(); pdata->allocate(); newflg=1; } } FILE *fp=fopen(fname,"r"); while( fgets(buffer, BUFFER_SIZE, fp) ){ sscanf(buffer," %f %f %f", &x,&y,&z); pntids->insertnextid(pnts- >InsertNextPoint(x,y,z)); } fclose(fp); pdata->setpoints(pnts); pdata->insertnextcell (VTK_POLY_LINE,pntids); pntids->delete(); if(newflg==1) pnts->delete(); 10 5
6 VTK DataFile Version 1.0 (1) Volume example (2) ASCII (3) DATASET STRUCTURED_POINTS (4) DIMENSIONS (5) ORIGIN (6) SPACING (7) POINT_DATA 72 (8) SCALARS volume_scalars unsigned_char 1 (9) LOOKUP_TABLE default (10) (11) (1) (2) (3) ASCII or BINARY (4) (5) (X, Y, Z) (6) (X, Y, Z) (7) (X, Y, Z) (8) (9) (10) LookUpTable (11) ASCII 11 vtkrenderer *ren = vtkrenderer::new(); vtkrenderwindow *renwin = vtkrenderwindow::new(); renwin->addrenderer(ren); vtkrenderwindowinteractor *iren = vtkrenderwindowinteractor::new(); Iren->SetRenderwindow(renWin); ren->addactor(???); // ren->addvolume(???); renwin->setsize(600, 600); renwin->render(); iren->initialize(); renwin->render(); iren->start(); VTK 12 6
7 Actor vtkmapper*->scalarvisibilityoff(); vtkactor*->getproperty() ->SetColor(red, green, blue); vtkrenderer* ->SetBackground(red, green, blue) 13 VTK vtkwindowtoimagefilter *w2i=vtkwindowtoimagefilter::new(); vtkjpegwriter *writer=vtkjpegwriter::new(); JPEG *JPEG* w2i->setinput(vtkrenderwindow*); writer->setinput(w2i->getoutput()); writer->setfilename(char *); vtkrenderwindow*->render(); w2i->update(); writer->write(); 14 7
8 (Color mapping) (2D Contour) (3D Contour) (Cutting) 15 Lookup Table (Max, Min) Si Si Min colori = lut Max Min 16 8
9 Pipeline: vtkdatasetreader vtkimagedatageometryfilter Actor vtkwarpscalar ReleaseDataFlagOn(); vtklookuptable SetNormal(0,0,1); SetNumberOfColors(int); UseNormalOn(); SetHueRange(double, double); ReleaseDataFlagOn(); SetSaturationRange(double, double); SetValueRange(double, double); Build(); SetVisibilityOn(); SetLookupTable(vtkLookupTable*) vtkwarpscalar* ->Update(); SetScalarRange(vtkWarpScalar*->GetOutput()->GetScalarRange(); 17 LookupTable SetNumberOfColors(int); Int SetHueRange(double, double); : SetSaturationRange(double, double); 1 SetValueRange(double, double);
10 Pipeline: (2D Contour) vtkdatasetreader vtkimagedatageometryfilter vtkwarpscalar ReleaseDataFlagOn(); SetNormal(0,0,1); UseNormalOn(); ReleaseDataFlagOn(); vtkcontourfilter SetValue(int, double); Actor1 Actor2 19 Pipeline: (3D Contour) vtkstructuredgridreader vtkstructuredgridoutlinefilter ScalarVisibilityOn(); vtkcontourfilter SetValue(int, double); ScalarVisibilityOn(); Actor1 Actor
11 vtkcontourfilter vtkdataset vtkpolydata GenerateValues(int, double[2]) int: double[2]: (vtkwarpscale*->getoutput()->getscalarrange()); SetValue(int, double) int: double: GetNumberOfContours() 21 Pipeline: vtkstructuredgridreader vtkstructuredgridoutlinefilter vtkplane SetOrigin(x, y, z) SetNormal(vector x, vector y, vector z ) vtkcutter SetCutFunction(vtkPlane*) Actor1 Actor
12 Pipeline: vtkstructuredgridreader vtkstructuredgridoutlinefilter vtkstructuredgridgeometryfilter SetExtent(double, double, double, double, double, double) Actor1 Actor2 23 Pipeline: Glyphing vtkstructured GridReader vtkstructured GridOutlineFilter Actor1 vtkmaskpoints vtkglyph3d SetOnRatio(50); RandomModeOn(); Update(); Vtk???Source Setsource(vtk???Source*->GetOutput()); scalingon(); SetScaleModeToScaleByScalar(); SetColorModeToColorByScalar(); SetScaleFactor(2); SetRange(vtkMaskPoints*->GetOutput() ->GetScalarRange()) ScalarVisibilityOn(); SetScalarRange(vtkMaskPoints* ->GetOutput()->GetScalarRange()); 24 Actor2 12
13 vtkmaskpoints int SetOffset(int) int 1 SetOnRatio(int) RandomModeOn(), RandomModeOff() SetMaximumNumberOfPoints(int) 25 vtkglyph3d SetSource(vtkPolyData*) ScalingOn() ScalingOff() SetScaleModeToScaleByScalar SetScaleModeToScaleByVector SetColorModeToColorByScalar SetColorModeToColorByVector float SetScaleFactor(float) SetRange(float[2]) 26 13
14 vtkarrowsource vtkconesource vtkspheresource 27 Pipeline: vtkstructured GridReader vtkstructured GridOutlineFilter vtkextractgrid SetVOI(int, int, int, int, int, int); SetSamplerate (int, int, int); IncludeBoundaryOn(); vtkrungekutta4 vtkstreamline SetSource (vtkextractgrid*); SetIntegrator (vtkrungekutta4*); SetStepLength(float); Actor1 Actor3 Actor2 GetProperty() ->SetRepresentationToWireframe() 28 14
15 Pipeline: vtkstructured PointsReader vtkoutlinefilter Actor1 vtkvolumeraycastmapper vtkpiecewisefunction SetColor(vtkTransforFunction*) SetScalarOpacity(vtkPiecewiseFunction*) ShadeOn() SetInterpolationTypeToLinear() SetProperty(vtkVolumeProperty*) Actor2 29 AddVolume(vtkVolume*) vtkvolume vtkvolumeraycastcompositefunction SetVolumeRayCastFunction (vtkvolumeraycastcompositefunction*) AddPoint(int, double) vtkvolumeproperty vtktransferfunction AddRGBPoint (double, double, double, double) vtkpiecewisefunction AddPoint(double vlaue, trans) double value: double trans: vtkcolortransferfunction AddRGBPoint(double value, red, green, blue) HSV AddHSVPoint(double, H, S, V) 30 15
16 vtkimageshiftscale vtkstructuredpointsreader* vtkraycastmapper* SetShift( or 0) SetScale(Scale/ SetOutputScalarTypeToUnsignedChar() D The Visualization ToolKit An Object-oriented approach to 3D Graphics VTK User s Guide 32 16
TITLE
VisBAR Wave Batch v0.9 25 9 11 1 VisBAR wave batch 1 1.1.......................................... 1 1.2................................. 2 1.3.............................. 3 2 4 2.1.....................................
More informationTITLE
VisBAR Wave Batch v1.0.0 26 02 12 1 VisBAR wave batch 1 1.1.......................................... 1 1.2................................. 2 1.3.............................. 3 2 4 2.1.....................................
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 information6-1
6-1 (data type) 6-2 6-3 ML, Haskell, Scala Lisp, Prolog (setq x 123) (+ x 456) (setq x "abc") (+ x 456) ; 6-4 ( ) subtype INDEX is INTEGER range -10..10; type DAY is (MON, TUE, WED, THU, FRI, SAT, SUN);
More informationContents 1 2 3 1.1...................................... 3 1.2 VTK........................................... 3 1.3..................................
VTK (2006 ) Contents 1 2 3 1.1...................................... 3 1.2 VTK........................................... 3 1.3.................................. 4 1.4....................................
More information超初心者用
3 1999 10 13 1. 2. hello.c printf( Hello, world! n ); cc hello.c a.out./a.out Hello, world printf( Hello, world! n ); 2 Hello, world printf n printf 3. ( ) int num; num = 100; num 100 100 num int num num
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 informationprogram.dvi
2001.06.19 1 programming semi ver.1.0 2001.06.19 1 GA SA 2 A 2.1 valuename = value value name = valuename # ; Fig. 1 #-----GA parameter popsize = 200 mutation rate = 0.01 crossover rate = 1.0 generation
More information(3D) で高解像度なため情報量は膨大である この膨大なデータを3Dで表示し 画像のズーム 平行移動 回転 長さを測定するメジャー等の機能を提供することが求められる 前述した治療計画ソフトウェアを始めとし 粒子線治療装置のような医療の現場で使用されるアプリケーションソフトウェアには 概ねそのユーザイ
医用画像可視化技術 ~VTK による医用画像アプリケーション開発 Medical Image Visualization Technique-Software Development by VTK(Visualization Tool Kit) 田中真幸 * 馬場明子 * 山本啓二 * Masayuki Tanaka, Akiko Baba, Keiji Yamamoto 数ある放射線治療の中でも
More informationC による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 新装版 1 刷発行時のものです.
C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009383 このサンプルページの内容は, 新装版 1 刷発行時のものです. i 2 22 2 13 ( ) 2 (1) ANSI (2) 2 (3) Web http://www.morikita.co.jp/books/mid/009383
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 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 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 informationPC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU
1. 1.1. 1.2. 1 PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 2. 2.1. 2 1 2 C a b N: PC BC c 3C ac b 3 4 a F7 b Y c 6 5 a ctrl+f5) 4 2.2. main 2.3. main 2.4. 3 4 5 6 7 printf printf
More information第7章 レンダリング
7 April 11, 2017 1 / 59 7.1 ( ) CG 3 ( ) 2 / 59 7.2 7.2.1 ( ) 3 (rendering) 1 / (hidden line/surface calculation) a (outer normal algorithm) b Z (Z-buffer algorithm) c (scan-line algorithm) 2 (shading)
More information第7章 レンダリング
7 May 18, 2012 1 / 60 71 ( ) CG 3 ( ) 2 / 60 72 71 ( ) 3 (rendering) 1 / (hidden line/surface calculation) a (outer normal algorithm) b Z (Z-buffer algorithm) c (scan-line algorithm) 2 (shading) a (flat
More information新コンフィギュレータのフレームワークについて
: 2007 12 7 6: 2009 5 9 TOPPERS 1.... 4 1.1... 4 1.2 TOPPERS... 4 2.... 4 2.1... 4 3.... 8 4.... 9 4.1... 9 4.2... 10 4.3... 10 4.3.1... 11 4.3.2 INCLUDE... 11 4.3.3 C... 12 4.4 API... 14 4.2.1 API...
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 informationvoid hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=
II 14 2018 7 26 : : proen@mm.ics.saitama-u.ac.jp 14,, 8 2 12:00 1 O(1) n O(n) O(log n) O(1) 32 : 1G int 4 250 M 2.5 int 21 2 0 100 0 100 #include #define HASHSIZE 100 /* */ #define NOTFOUND 0
More informationex01.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‚æ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 informationLocal variable x y i paint public class Sample extends Applet { public void paint( Graphics gc ) { int x, y;... int i=10 ; while ( i < 100 ) {... i +=
Safari AppletViewer Web HTML Netscape Web Web 13-1 Applet Web Applet init Web paint Web start Web HTML stop destroy update init Web paint start Web update Event Driven paint Signature Overwriting Overriding
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 information1 C STL(1) C C C libc C C C++ STL(Standard Template Library ) libc libc C++ C STL libc STL iostream Algorithm libc STL string vector l
C/C++ 2007 6 18 1 C STL(1) 2 1.1............................................... 2 1.2 stdio................................................ 3 1.3.......................................... 10 2 11 2.1 sizeof......................................
More informationGLS user s reference 19 8 21 1 3 1.1....................................................... 3 1.2....................................................... 3 1.3.......................................................
More information掲示用ヒート表 第34回 藤沢市長杯 2017
34 8 4 2 Round 1 Round 2 SEMI FINAL 30 16 8 H1 H5 H1 H1 Red 12401821 2 Red 12601360 2 1-1 Red 12501915 1 1-1 Red 12501915 4 White 12900051 4 White 12600138 3 3-1 White 12802412 2 3-1 White 12801091 1 Yellow
More information3.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 information2008 ( 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 information6 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第1章
...1... 1... 1...3... 3... 5... 6...9... 9... 9... 9... 10... 12... 14 Windows...16... 16... 16...21... 21... 25...30...31...32...33 3 1 2 3 4 5 6 7 8 n x, y i 0,1,, n 1 i i y P x ) i 0, 1,, n 1 n 1 i
More informationp = 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第3章 OpenGL の基礎
3 OpenGL April 11, 2017 1 / 28 3.1 ( ) OpenGL OpenGL 2 / 28 3.2 OpenGL OpenGL OpenGL (Open Graphics Library) Silicon Graphics, Inc. 2 3 API (Application Program Interface) [4] UNIX OS Windows Macintosh
More information第3章 OpenGL の基礎
3 OpenGL April 20, 2012 1 / 23 31 ( ) OpenGL OpenGL 2 / 23 32 OpenGL OpenGL OpenGL (Open Graphics Library) Silicon Graphics, Inc 2 3 API (Application Program Interface) [4] UNIX OS Windows Macintosh CAD
More informationuntitled
II 4 Yacc Lex 2005 : 0 1 Yacc 20 Lex 1 20 traverse 1 %% 2 [0-9]+ { yylval.val = atoi((char*)yytext); return NUM; 3 "+" { return + ; 4 "*" { return * ; 5 "-" { return - ; 6 "/" { return / ; 7 [ \t] { /*
More information橡Taro9-生徒の活動.PDF
3 1 4 1 20 30 2 2 3-1- 1 2-2- -3- 18 1200 1 4-4- -5- 15 5 25 5-6- 1 4 2 1 10 20 2 3-7- 1 2 3 150 431 338-8- 2 3 100 4 5 6 7 1-9- 1291-10 - -11 - 10 1 35 2 3 1866 68 4 1871 1873 5 6-12 - 1 2 3 4 1 4-13
More informationj x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E
8 9 7 6 4 2 3 5 1 j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E a n 1 H = ae l j, j=1 l j = x j+1 x j, x n x 1 = n 1 j=1 l j, l j = ±l l > 0) n 1 H = ϵ l j, j=1 ϵ e x x
More informationValueHolder... 9 Customer.java Oracle TopLink 10g(10.1.3) È Volume3 2
lê~åäé= qçéiáåâ= NMÖENMKNKPF Volume3 Creation Date: Mar 04, 2005 Last Update: Aug 23, 2005 Version 1.0 ...3... 3...4... 4... 6 ValueHolder... 9 Customer.java... 10...14 Oracle TopLink 10g(10.1.3) È Volume3
More informationVersion C 1 2 3 4 5 1 2 3 4 5 6 7 8 9 0 A 1 2 1 3 4 5 1 1 2 1 1 1 2 4 5 6 7 8 3 1 2 C a b c d e f g A A B C B a b c d e f g 3 4 4 5 6 7 8 1 2 a b 1 2 a b 1 2 1 2 5 4 1 23 5 6 6 a b 1 2 e c d 3
More information★結果★ 藤沢市長杯 掲示用ヒート表
AA 35 Round 1 8 4 Round 2 28 16 SEMI FINAL H1 H5 H1 H1 Red 12802015 1 Red 12802109 1 1-1 Red 12802015 2 1-1 Red 12702346 White 12800232 2 White 12702406 3 3-1 White 12702346 1 3-1 White 12802109 Yellow
More informationuntitled
Fortran90 ( ) 17 12 29 1 Fortran90 Fortran90 FORTRAN77 Fortran90 1 Fortran90 module 1.1 Windows Windows UNIX Cygwin (http://www.cygwin.com) C\: Install Cygwin f77 emacs latex ps2eps dvips Fortran90 Intel
More information2 n ImageJ (intensity) ImageJ Bit
: western blot Photoshop () () NIH (National Institute of Health) Image JWindowsMac ( ) () Image J 2017.5.13 1 2 n ImageJ (intensity) ImageJ 0 0 0 0 26 26 26 26 234 234 232 238 255 255 245 131 0255 256
More informationRubyKaigi2009 COBOL
RubyKaigi2009 COBOL seki@druby.org 3360 Pragmatic Bookshelf druby Web $32.00 International Journal of PARALLEL PROGRAMING !? MapReduce Rinda (map, reduce) map reduce key value [, ] [, ID] map()
More informationTopLink å 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 informationuntitled
II yacc 005 : 1, 1 1 1 %{ int lineno=0; 3 int wordno=0; 4 int charno=0; 5 6 %} 7 8 %% 9 [ \t]+ { charno+=strlen(yytext); } 10 "\n" { lineno++; charno++; } 11 [^ \t\n]+ { wordno++; charno+=strlen(yytext);}
More informationFor_Beginners_CAPL.indd
CAPL Vector Japan Co., Ltd. 目次 1 CAPL 03 2 CAPL 03 3 CAPL 03 4 CAPL 04 4.1 CAPL 4.2 CAPL 4.3 07 5 CAPL 08 5.1 CANoe 5.2 CANalyzer 6 CAPL 10 7 CAPL 11 7.1 CAPL 7.2 CAPL 7.3 CAPL 7.4 CAPL 16 7.5 18 8 CAPL
More informationmatrix util program bstat gram schmidt
matrix util 14 12 3 1 2 2 program 2 2.1 bstat............................... 3 2.2 gram schmidt........................... 3 2.3 matadd............................... 3 2.4 matarith.............................
More informationex01.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 information2 1 Web Java Android Java 1.2 6) Java Java 7) 6) Java Java (Swing, JavaFX) (JDBC) 7) OS 1.3 Java Java
1 Java Java 1.1 Java 1) 2) 3) Java OS Java 1.3 4) Java Web Start Web / 5) Java C C++ Java JSP(Java Server Pages) 1) OS 2) 3) 4) Java Write Once, Run Anywhere 5) Java Web Java 2 1 Web Java Android Java
More informationC言語によるアルゴリズムとデータ構造
Algorithms and Data Structures in C 4 algorithm List - /* */ #include List - int main(void) { int a, b, c; int max; /* */ Ÿ 3Ÿ 2Ÿ 3 printf(""); printf(""); printf(""); scanf("%d", &a); scanf("%d",
More informationQ&A集
MapViewer & ver.2 EWEB-3C-N055 PreSerV for Web MapViewer & i 1... 1 1.1... 1 1.2... 2 1.3... 3 1.4... 4 1.5... 5 1.6... 6 1.7... 7 1.8... 8 1.9... 9 1.10...11 1.11...12 1.12...13 1.13...14 1.14...15 1.15...16
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 information9 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 informationI. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * *
2015 2015 07 30 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) +
More informationyacc.dvi
2017 c 8 Yacc Mini-C C/C++, yacc, Mini-C, run,, Mini-C 81 Yacc Yacc, 1, 2 ( ), while ::= "while" "(" ")" while yacc 1: st while : lex KW WHILE lex LPAREN expression lex RPAREN statement 2: 3: $$ = new
More information:30 12:00 I. I VI II. III. IV. a d V. VI
2018 2018 08 02 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF N N y N x N xy yx : yxxyxy N N x, y N (parse tree) (1) yxyyx (2) xyxyxy (3) yxxyxyy (4) yxxxyxxy N y N x N yx
More informationmbed_library_study_meeting_v1.0.key
mbed _mbed 2014 11 7 https://atnd.org/events/57766 version 1.0, 07-Nov.-2014 Tedd OKANO mbed - - 4.0 (^^; 1 mbed TEDD OKANO https://twitter.com/tedd_okano 10 I 2 C http://developer.mbed.org/users/okano/
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 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 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新・明解Java入門
537,... 224,... 224,... 32, 35,... 188, 216, 312 -... 38 -... 38 --... 102 --... 103 -=... 111 -classpath... 379 '... 106, 474!... 57, 97!=... 56 "... 14, 476 %... 38 %=... 111 &... 240, 247 &&... 66,
More information/* sansu1.c */ #include <stdio.h> main() { int a, b, c; /* a, b, c */ a = 200; b = 1300; /* a 200 */ /* b 200 */ c = a + b; /* a b c */ }
C 2: A Pedestrian Approach to the C Programming Language 2 2-1 2.1........................... 2-1 2.1.1.............................. 2-1 2.1.2......... 2-4 2.1.3..................................... 2-6
More informationMQTT V3.1 プロトコル仕様
1999 d digit = X MOD 128 X = X DIV 128 // if there are mre digits t encde, set the tp bit f this digit if ( X > 0 ) digit = digit OR 0x80 endif 'utput' digit while ( X> 0 ) multiplier = 1 value = 0
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 informationプログラミング基礎
C プログラミング 演習 アルゴリズム基礎論 演習 第 10 回 今後の予定 12/22( 月 ) 期末試験 (60 分間 ) 場所 :A1611 時間 :16:20~17:20 課題の最終提出締切 :12/19( 金 ) これ以降の新規提出は評価されない 12/22までに最終状況を提示するので, 提出したのに や になってる人は自分の提出内容や提出先を再確認した上で12/26までに問い合わせること
More informationr3.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 informationr1.dvi
2006 1 2006.10.6 ( 2 ( ) 1 2 1.5 3 ( ) Ruby Java Java Java ( Web Web http://lecture.ecc.u-tokyo.ac.jp/~kuno/is06/ / ( / @@@ ( 3 ) @@@ : ( ) @@@ (Q&A) ( ) 1 http://www.sodan.ecc.u-tokyo.ac.jp/cgi-bin/qbbs/view.cgi
More informationuntitled
186 17 100160250 1 10.1 55 2 18.5 6.9 100 38 17 3.2 17 8.4 45 3.9 53 1.6 22 7.3 100 2.3 31 3.4 47 OR OR 3 1.20.76 63.4 2.16 4 38,937101,118 17 17 17 5 1,765 1,424 854 794 108 839 628 173 389 339 57 6 18613
More informationuntitled
1. 3 14 2. 1 12 9 7.1 3. 5 10 17 8 5500 4. 6 11 5. 1 12 101977 1 21 45.31982.9.4 79.71996 / 1997 89.21983 41.01902 6. 7 5 10 2004 30 16.8 37.5 3.3 2004 10.0 7.5 37.0 2004 8. 2 7 9. 6 11 46 37 25 55 10.
More information卒 業 研 究 報 告.PDF
C 13 2 9 1 1-1. 1-2. 2 2-1. 2-2. 2-3. 2-4. 3 3-1. 3-2. 3-3. 3-4. 3-5. 3-5-1. 3-5-2. 3-6. 3-6-1. 3-6-2. 4 5 6 7-1 - 1 1 1-1. 1-2. ++ Lisp Pascal Java Purl HTML Windows - 2-2 2 2-1. 1972 D.M. (Dennis M Ritchie)
More information1 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 informationC
C 1 2 1.1........................... 2 1.2........................ 2 1.3 make................................................ 3 1.4....................................... 5 1.4.1 strip................................................
More information明解Java入門編
1 Fig.1-1 4 Fig.1-1 1-1 1 Table 1-1 Ease of Development 1-1 Table 1-1 Java Development Kit 1 Java List 1-1 List 1-1 Chap01/Hello.java // class Hello { Java System.out.println("Java"); System.out.println("");
More informationコンピュータグラフィックス - 第4回 色彩の表現
.. 4 2013 10 9 ( ) 2013 10 9 1 / 22 3 3 3 ( ) 2013 10 9 2 / 22 380 nm 780 nm 1 nm = 10 9 m ( ) 2013 10 9 3 / 22 3 3 (S M L ) 3 3 3 ( ) 2013 10 9 4 / 22 加法混色 光の 3 原色を組み合わせることで 様々な色を表現できる 光を重ねて別の色を作ることを加法混色と呼ぶ
More informationMicrosoft Word - no15.docx
7. ファイルいままでは プログラムを実行したとき その結果を画面で確認していました 簡単なものならそれでもいいのですか 複雑な結果は画面で見るだけでなく ファイルに保存できればよいでしょう ここでは このファイルについて説明します 使う関数のプロトタイプは次のとおりです FILE *fopen(const char *filename, const char *mode); ファイルを読み書きできるようにする
More informationIntroduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for
Introduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for embedded systems that use microcontrollers (MCUs)
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( ) ( ) 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 informationC¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç
C (3) if else switch AND && OR (NOT)! 1 BMI BMI BMI = 10 4 [kg]) ( [cm]) 2 bmi1.c Input your height[cm]: 173.2 Enter Input your weight[kg]: 60.3 Enter Your BMI is 20.1. 10 4 = 10000.0 1 BMI BMI BMI = 10
More information表紙.PDF
2 3 4 2001 2010 33 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 H18 21 22 23 24 25 26 27 28 29 30 31 32 33 300 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 410-8601 055-934-4747 Fax 055-933-1412
More informationuntitled
0120-888-089 0120-919-498 160-83381-26-1TEL. 03-3349-3111 URL http://www.sjnk.co.jp/ 160-83381-26-1 TEL. 03-3349-3111 URL http://www.sompo-japan.co.jp/ 100-89653-7-3 TEL. 0120-919-498 URL http://www.nipponkoa.co.jp/
More information