SQUFOF NTT Shanks SQUFOF SQUFOF Pentium III Pentium 4 SQUFOF 2.03 (Pentium 4 2.0GHz Willamette) N UBASIC 50 / 200 [
|
|
- れいな たかぎ
- 5 years ago
- Views:
Transcription
1 SQUFOF
2 SQUFOF NTT Shanks SQUFOF SQUFOF Pentium III Pentium 4 SQUFOF 2.03 (Pentium 4 2.0GHz Willamette) N UBASIC 50 / 200 [ 01] 4 large prime
3 (%) (%) CPU1 Pentium III 700MHz (Coppermine) CPU2 Pentium 4 2GHz (Willamette) OS FreeBSD-4.5R 1 gcc version (release) [FreeBSD] 2 gcc version pgcc (release) CPU CPU CPU x86 CPU Pentium 4 (Northwood) Pentium 4 CPU Northwood Pentium 4 Willamette 2
4 Pentium III Pentium III Pentium 4 Pentium III Pentium 4 CPU Pentium III Pentium 4 Pentium 4 Pentium 4 CPU Athlon OS Linux 1 3% FreeBSD 4.x pgcc -Wall -fomit-frame-pointer -O6 -lm icc 2 1 gcc 3 C (ANSI-C ISO-C ) MMX, SSE, SSE2 2 SQUFOF SQUFOF [Rie93, pp ] Pascal SQUFOF [Rie93] SQUFOF ( ) ( ) 32 1 Linux version (root@neo), gcc version (Debian GNU/Linux) 2 Intel(R) C++ Compiler for 32-bit applications, Version
5 3 SQUFOF [Coh93, p.430] N 2 N 1 (mod 4) N 5N N 62 SQUFOF 2 N 2 62 first phase (%)
6 2 3 3 (3) SQUFOF SQUFOF ( (1 2 3 ) ( )) + (1 2 3 ) 1 = osqufof SQUFOF 2 first phase 0 1 Input: N (to be factored) Output: factor of N Cf max N if Cf max > 11 then Cf max 11 for Cf 3 to Cf max step by +2 do p osqufof(cf N, 2 17 Cf max 1 ) if p > Cf then return non-trivial factor of p return osqufof(n, 2 19 ) 1: SQUFOF SQUFOF 1 4 SQUFOF [Rie93, pp ] SQUFOF Pentium III [clock cycle] first phase 100 second phase 53 3 ( ) 5
7 [Fog00] div fsqrt instruction latency fsqrt first 1 phase 2 2 fsqrt (%) div (%) first phase second phase q i N + Pi 1 < = q i = < 2 N Q i 1 q i (%) (%) q i numerator = N + Pi if numerator Q i < Q i then q i = 1 else numerator q i = Q i 1 1 clock cycle penalty 26 clock cycles 1 1 clock cycle % (26 + 1) + (1 42%) 39 = 37 < 39 q i idiv (31 ) 5 float 6
8 penalty 26 clock cycle 10 [clock cycle] first phase 79 second phase = 20 clock cycles 39 clock cycles 4.2 first phase first phase [Rie93, pp ] SQUFOF first phase [Rie93, pp ] R[R 2 2, 3 (mod 4)] if Q i+1 3 > 1 then go to the next continued fraction else R Qi+1 if R 2 = Q i+1 then go to second phase go to the next continued fraction [Coh93, pp.39 41] 4 mod2 k mod2 k ± 1 mod 2 k (±1) 7
9 if not issquaremod256[q i+1 0xff] then go to the next continued fraction /* 83% discarded */ else /* compute mod2 8 1 */ tmp (Q i+1 0xff00ff) + (( Q i ) 0xff00ff) tmp tmp + tmp 2 16 tmp tmp + tmp 2 8 tmp tmp 0xff 6 if not issquaremod255[tmp] then go to the next continued fraction /* rest of 79% discarded */ R Qi+1 if R 2 = Q i+1 then go to second phase go to the next continued fraction issquaremod256[] 55 clock cycles issquaremod255[] 43 clock cycles mod index KB 7 39 clock cycles issquaremod255[] first phase second phase 2 2 (39 33) = 12 [clock cycle] +1 2 first phase 1 5 loop unroll 6 0x101 issquaremod255[0] = issquaremod255[1] KB 8
10 CPU ( ) [Mcycles/ ] [ ] Pentium III 2.45 (2.84) 1.87 (1.3GHz ) Pentium (4.69) 1.60 (2.53GHz ) Pentium III 1.2 Pentium gcc -mcpu=i386 -mcpu= 35 (3.7%) Time [cycle] : [Pentium III] 6 large prime p 1 ρ Pentium 4 9
11 e+16 1e+17 1e+18 1e+19 Time [cycle] N 3: N [Pentium III] e+06 1e+07 1e+08 1e+09 1e+10 Time [cycle] p 4: p [Pentium III] 10
12 [Coh93] Henri Cohen. A Course in Computational Algebraic Number Theory, Vol. 138 of Graduate Texts in Mathematics. Springer-Verlag, Boston, Basel, Berlin, Second Corrected Printing [Fog00] Agner Fog. How to optimize for the Pentium microprocessors, ( [Rie93] Hans Riesel. Prime Numbers and Computer Methods for Factorization, Vol. 126 of Progress in Mathematics. Birkhäuser, Boston, Basel, Berlin, second edition, [ 01]. 200, (JANT) 5. 11
2 2 ( M2) ( )
2 2 ( M2) ( ) 2007 3 3 1 2 P. Gaudry and R. Harley, 2000 Schoof 63bit 2 8 P. Gaudry and É. Schost, 2004 80bit 1 / 2 16 2 10 2 p: F p 2 C : Y 2 =F (X), F F p [X] : monic, deg F = 5, J C (F p ) F F p p Frobenius
More information( 9 1 ) 1 2 1.1................................... 2 1.2................................................. 3 1.3............................................... 4 1.4...........................................
More informationCPU Levels in the memory hierarchy Level 1 Level 2... Increasing distance from the CPU in access time Level n Size of the memory at each level 1: 2.2
FFT 1 Fourier fast Fourier transform FFT FFT FFT 1 FFT FFT 2 Fourier 2.1 Fourier FFT Fourier discrete Fourier transform DFT DFT n 1 y k = j=0 x j ω jk n, 0 k n 1 (1) x j y k ω n = e 2πi/n i = 1 (1) n DFT
More informationRaVioli SIMD
RaVioli SIMD 17 17115074 i RaVioli SIMD PC PC PC PC CPU RaVioli RaVioli CPU RaVioli CPU SIMD RaVioli RaVioli SIMD RaVioli SIMD RaVioli SIMD 1 1 2 RaVioli 2 2.1 RaVioli.......................................
More informationT rank A max{rank Q[R Q, J] t-rank T [R T, C \ J] J C} 2 ([1, p.138, Theorem 4.2.5]) A = ( ) Q rank A = min{ρ(j) γ(j) J J C} C, (5) ρ(j) = rank Q[R Q,
(ver. 4:. 2005-07-27) 1 1.1 (mixed matrix) (layered mixed matrix, LM-matrix) m n A = Q T (2m) (m n) ( ) ( ) Q I m Q à = = (1) T diag [t 1,, t m ] T rank à = m rank A (2) 1.2 [ ] B rank [B C] rank B rank
More information., White-Box, White-Box. White-Box.,, White-Box., Maple [11], 2. 1, QE, QE, 1 Redlog [7], QEPCAD [9], SyNRAC [8] 3 QE., 2 Brown White-Box. 3 White-Box
White-Box Takayuki Kunihiro Graduate School of Pure and Applied Sciences, University of Tsukuba Hidenao Iwane ( ) / Fujitsu Laboratories Ltd. / National Institute of Informatics. Yumi Wada Graduate School
More information1 P2 P P3P4 P5P8 P9P10 P11 P12
1 P2 P14 2 3 4 5 1 P3P4 P5P8 P9P10 P11 P12 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 & 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 1! 3 2 3! 4 4 3 5 6 I 7 8 P7 P7I P5 9 P5! 10 4!! 11 5 03-5220-8520
More information2 1,384,000 2,000,000 1,296,211 1,793,925 38,000 54,500 27,804 43,187 41,000 60,000 31,776 49,017 8,781 18,663 25,000 35,300 3 4 5 6 1,296,211 1,793,925 27,804 43,187 1,275,648 1,753,306 29,387 43,025
More information21 1 2 1 2
21 1 2 1 2 1 2 3 ( ) 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 210 0.0 0.0 22 23 25 27 28 29 30 31 32 33 34 35 36 74 pp.4362003.10 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 141224 14 48 10
More information2016 Course Description of Undergraduate Seminars (2015 12 16 ) 2016 12 16 ( ) 13:00 15:00 12 16 ( ) 1 21 ( ) 1 13 ( ) 17:00 1 14 ( ) 12:00 1 21 ( ) 15:00 1 27 ( ) 13:00 14:00 2 1 ( ) 17:00 2 3 ( ) 12
More informationsequentially Cohen Macaulay Herzog Cohen Macaulay 5 unmixed semi-unmixed 2 Semi-unmixed Semi-unmixed G V V (G) V G V G e (G) G F(G) (G) F(G) G dim G G
Semi-unmixed 1 K S K n K[X 1,..., X n ] G G G 2 G V (G) E(G) S G V (G) = {1,..., n} I(G) G S square-free I(G) = (X i X j {i, j} E(G)) I(G) G (edge ideal) 1990 Villarreal [11] S/I(G) Cohen Macaulay G 2005
More information2.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 informationWeb Web Web Web Web, i
22 Web Research of a Web search support system based on individual sensitivity 1135117 2011 2 14 Web Web Web Web Web, i Abstract Research of a Web search support system based on individual sensitivity
More informationi Version 1.1, (2012/02/22 24),.,..,.,,. R-space,, ( R- space),, Kahler (Kähler C-space)., R-space,., R-space, Hermite,.
R-space ( ) Version 1.1 (2012/02/29) i Version 1.1, (2012/02/22 24),.,..,.,,. R-space,, ( R- space),, Kahler (Kähler C-space)., R-space,., R-space, Hermite,. ii 1 Lie 1 1.1 Killing................................
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 informationSkew-Frobenius IISEC, JANT18 1
Skew-Frobenius IISEC, 2008 7 5 JANT18 1 Frobenius C/F p Jacobian J C (F p n) Frobenius ϕ p ϕ p Z[ϕ p ] End(J C ) ϕ p J C (F p ) J C (F p n) (J C (F p n)/j C (F p )) p g(n 1) g 2, p n J C (F p ) JANT18
More informationimai@eng.kagawa-u.ac.jp No1 No2 OS Wintel Intel x86 CPU No3 No4 8bit=2 8 =256(Byte) 16bit=2 16 =65,536(Byte)=64KB= 6 5 32bit=2 32 =4,294,967,296(Byte)=4GB= 43 64bit=2 64 =18,446,744,073,709,551,615(Byte)=16EB
More information[1] [2] [3] (RTT) 2. Android OS Android OS Google OS 69.7% [4] 1 Android Linux [5] Linux OS Android Runtime Dalvik Dalvik UI Application(Home,T
LAN Android Transmission-Control Middleware on multiple Android Terminals in a WLAN Environment with consideration of Round Trip Time Ai HAYAKAWA, Saneyasu YAMAGUCHI, and Masato OGUCHI Ochanomizu University
More information#2 (IISEC)
#2 (IISEC) 2007 10 6 E Y 2 = F (X) E(F p ) E : Y 2 = F (X) = X 3 + AX + B, A, B F p E(F p ) = {(x, y) F 2 p y2 = F (x)} {P } P : E(F p ) E F p - Given: E/F p : EC, P E(F p ), Q P Find: x Z/NZ s.t. Q =
More informationmain.dvi
20 II 7. 1 409, 3255 e-mail: namba@faculty.chiba-u.jp 2 1 1 1 4 2 203 2 1 1 1 5 503 1 3 1 2 2 Web http://www.icsd2.tj.chiba-u.jp/~namba/lecture/ 1 2 1 5 501 1,, \,", 2000 7. : 1 1 CPU CPU 1 Intel Pentium
More informationA Responsive Processor for Parallel/Distributed Real-time Processing
E-mail: yamasaki@{ics.keio.ac.jp, etl.go.jp} http://www.ny.ics.keio.ac.jp etc. CPU) I/O I/O or Home Automation, Factory Automation, (SPARC) (SDRAM I/F, DMAC, PCI, USB, Timers/Counters, SIO, PIO, )
More informationERATO100913
ERATO September 13, 2010, DC2 1/25 1. 2 2. 2/25 3/25 3/25 2 3/25 2 3/25 1 1 0.5 0.5 0 0 0.5 1 0 0 0.5 1 4/25 1 1 0.5 0.5 0 0 0.5 1 (0, 0) 0 0 0.5 1 4/25 1 1 0.5 0.5 0 0 0.5 1 (0, 0) ( 1, 0) 0 0 0.5 1 4/25
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.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For
More informationBulletin of JSSAC(2014) Vol. 20, No. 2, pp (Received 2013/11/27 Revised 2014/3/27 Accepted 2014/5/26) It is known that some of number puzzles ca
Bulletin of JSSAC(2014) Vol. 20, No. 2, pp. 3-22 (Received 2013/11/27 Revised 2014/3/27 Accepted 2014/5/26) It is known that some of number puzzles can be solved by using Gröbner bases. In this paper,
More information23 Study on Generation of Sudoku Problems with Fewer Clues
23 Study on Generation of Sudoku Problems with Fewer Clues 1120254 2012 3 1 9 9 21 18 i Abstract Study on Generation of Sudoku Problems with Fewer Clues Norimasa NASU Sudoku is puzzle a kind of pencil
More information,4) 1 P% P%P=2.5 5%!%! (1) = (2) l l Figure 1 A compilation flow of the proposing sampling based architecture simulation
1 1 1 1 SPEC CPU 2000 EQUAKE 1.6 50 500 A Parallelizing Compiler Cooperative Multicore Architecture Simulator with Changeover Mechanism of Simulation Modes GAKUHO TAGUCHI 1 YOUICHI ABE 1 KEIJI KIMURA 1
More information自動残差修正機能付き GBiCGSTAB$(s,L)$法 (科学技術計算アルゴリズムの数理的基盤と展開)
1733 2011 149-159 149 GBiCGSTAB $(s,l)$ GBiCGSTAB(s,L) with Auto-Correction of Residuals (Takeshi TSUKADA) NS Solutions Corporation (Kouki FUKAHORI) Graduate School of Information Science and Technology
More information.......p...{..P01-48(TF)
1 2 3 5 6 7 8 9 10 Act Plan Check Act Do Plan Check Do 11 12 13 14 INPUT OUTPUT 16 17 18 19 20 21 22 23 24 25 26 27 30 33 32 33 34 35 36 37 36 37 38 33 40 41 42 43 44 45 46 47 48 49 50 51 1. 2. 3.
More informationRun-Based Trieから構成される 決定木の枝刈り法
Run-Based Trie 2 2 25 6 Run-Based Trie Simple Search Run-Based Trie Network A Network B Packet Router Packet Filtering Policy Rule Network A, K Network B Network C, D Action Permit Deny Permit Network
More informationSCORE−‹Šp‡Ì”è‹ø‡«Ver3
2 Step 0 Step 1 Step 1 Step 2 Step 3 Step 4 Step 5 Step1 3 Step 2 Step 2-1 Step 2-2 Step3 Step4 Step2 4 5 Step 3 Step 3-1 Step 3-2 Step 3-3 Step5 6 Step 3-4 Step3 Step5 7 8 Step 4 Step 4-1 9 Step4 Step
More information(I) GotoBALS, http://www-is.amp.i.kyoto-u.ac.jp/ kkimur/charpoly.html 2
sdmp Maple - (Ver.2) ( ) September 27, 2011 1 (I) GotoBALS, http://www-is.amp.i.kyoto-u.ac.jp/ kkimur/charpoly.html 2 (II) Nehalem CPU GotoBLAS Intel CPU Nehalem CPU, GotoBLAS, Hyper-Thread technology
More informationItanium2ベンチマーク
HPC CPU mhori@ile.osaka-u.ac.jp Special thanks Timur Esirkepov HPC 2004 2 25 1 1. CPU 2. 3. Itanium 2 HPC 2 1 Itanium2 CPU CPU 3 ( ) Intel Itanium2 NEC SX-6 HP Alpha Server ES40 PRIMEPOWER SR8000 Intel
More information1 (bit ) ( ) PC WS CPU IEEE754 standard ( 24bit) ( 53bit)
GNU MP BNCpack tkouya@cs.sist.ac.jp 2002 9 20 ( ) Linux Conference 2002 1 1 (bit ) ( ) PC WS CPU IEEE754 standard ( 24bit) ( 53bit) 10 2 2 3 4 5768:9:; = %? @BADCEGFH-I:JLKNMNOQP R )TSVU!" # %$ & " #
More information橡点検記録(集約).PDF
942.8.8.8.7 671 86 11 1 9 9 9 1 1,792 7,23 2,483 1,324 2,198 7,23 82 7,23 6,327 9,22 9,713 8,525 8,554 9,22. 8,554. 1,79 9,713 95 947 8,525.. 944 671 81 7 17 1,29 1,225 1,241 1,25 1,375 9.3 23,264 25,
More informationLinuxDeviceDriver2003-PDF.PDF
Linux Kernel Conference 2003 Linux info@devdrv.com 2003/10/9 Device Drivers Limited 1 Linux 2.6 Device Drivers Limited 2 SpinLock Atomic (SMP) HyperThreading(HT) tasklet task_queue /proc Device Drivers
More informationLogistello 1) playout playout 1 5) SIMD Bitboard playout playout Bitboard Bitboard 8 8 = black white 2 2 Bitboard 2 1 6) position rev i
SIMD 1 1 1 playout playout Cell B. E. SIMD SIMD playout playout Implementation of an Othello Program Based on Monte-Carlo Tree Search by Using a Multi-Core Processor and SIMD Instructions YUJI KUBOTA,
More informationスパコンに通じる並列プログラミングの基礎
2018.09.10 furihata@cmc.osaka-u.ac.jp ( ) 2018.09.10 1 / 59 furihata@cmc.osaka-u.ac.jp ( ) 2018.09.10 2 / 59 Windows, Mac Unix 0444-J furihata@cmc.osaka-u.ac.jp ( ) 2018.09.10 3 / 59 Part I Unix GUI CUI:
More information(Version: 2017/4/18) Intel CPU 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU do
(Version: 2017/4/18) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
More information64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/5/16) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
More informationスパコンに通じる並列プログラミングの基礎
2018.06.04 2018.06.04 1 / 62 2018.06.04 2 / 62 Windows, Mac Unix 0444-J 2018.06.04 3 / 62 Part I Unix GUI CUI: Unix, Windows, Mac OS Part II 2018.06.04 4 / 62 0444-J ( : ) 6 4 ( ) 6 5 * 6 19 SX-ACE * 6
More information,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
More information01_OpenMP_osx.indd
OpenMP* / 1 1... 2 2... 3 3... 5 4... 7 5... 9 5.1... 9 5.2 OpenMP* API... 13 6... 17 7... 19 / 4 1 2 C/C++ OpenMP* 3 Fortran OpenMP* 4 PC 1 1 9.0 Linux* Windows* Xeon Itanium OS 1 2 2 WEB OS OS OS 1 OS
More informationIPSJ SIG Technical Report Vol.2016-ARC-221 No /8/9 GC 1 1 GC GC GC GC DalvikVM GC 12.4% 5.7% 1. Garbage Collection: GC GC Java GC GC GC GC Dalv
GC 1 1 GC GC GC GC DalvikVM GC 12.4% 5.7% 1. Garbage Collection: GC GC Java GC GC GC GC DalvikVM[1] GC 1 Nagoya Institute of Technology GC GC 2. GC GC 2.1 GC 1 c 2016 Information Processing Society of
More information64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/7/10) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
More informationAn Interactive Visualization System of Human Network for Multi-User Hiroki Akehata 11N F
An Interactive Visualization System of Human Network for Multi-User Hiroki Akehata 11N8100002F 2013 3 ,.,.,.,,., (, )..,,,.,,.,, SPYSEE. SPYSEE,,., 2,,.,,.,,,,.,,,.,, Microsoft Microsoft PixelSense Samsung
More information橡ボーダーライン.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 informationtutorial_lc.dvi
00 Linux v.s. RT Linux v.s. ART-Linux Linux RT-Linux ART-Linux Linux kumagai@emura.mech.tohoku.ac.jp 1 1.1 Linux Yes, No.,. OS., Yes. Linux,.,, Linux., Linux.,, Linux. Linux.,,. Linux,.,, 0..,. RT-Linux
More information(1)2004年度 日本地理
1 2 3 4 1 2 3 4 5 6 7 8 9 10 11 12-5.0-5.1-1.4 4.2 8.6 12.4 16.9 19.5 16.6 10.8 3.3-2.0 6.6 16.6 16.6 18.6 21.3 23.8 26.6 28.5 28.2 27.2 24.9 21.7 18.4 22.7 5 1 2 3 4 5 6 7 8 9 10 11 12 2.2 3.5 7.7 11.1
More informationVM-53PA1取扱説明書
VM-53PA1 VM-53PA1 VM-53 VM-53A VM-52 VM-52A VM-53PA1 VM-53PA1 VM-53A CF i ii VM-53 VM-53A VM-52 VM-52A CD-ROM iii VM-53PA1 Microsoft Windows 98SE operating system Microsoft Windows 2000 operating system
More informationUnconventional HDL Programming ( version) 1
Unconventional HDL Programming (20090425 version) 1 1 Introduction HDL HDL Hadware Description Language printf printf (C ) HDL 1 HDL HDL HDL HDL HDL HDL 1 2 2 2.1 VHDL 1 library ieee; 2 use ieee.std_logic_1164.all;
More information1 [1, 2, 3, 4, 5, 8, 9, 10, 12, 15] The Boston Public Schools system, BPS (Deferred Acceptance system, DA) (Top Trading Cycles system, TTC) cf. [13] [
Vol.2, No.x, April 2015, pp.xx-xx ISSN xxxx-xxxx 2015 4 30 2015 5 25 253-8550 1100 Tel 0467-53-2111( ) Fax 0467-54-3734 http://www.bunkyo.ac.jp/faculty/business/ 1 [1, 2, 3, 4, 5, 8, 9, 10, 12, 15] The
More information単位、情報量、デジタルデータ、CPUと高速化 ~ICT用語集~
CPU ICT mizutani@ic.daito.ac.jp 2014 SI: Systèm International d Unités SI SI 10 1 da 10 1 d 10 2 h 10 2 c 10 3 k 10 3 m 10 6 M 10 6 µ 10 9 G 10 9 n 10 12 T 10 12 p 10 15 P 10 15 f 10 18 E 10 18 a 10 21
More informationB 5 (2) VBA R / B 5 ( ) / 34
B 5 (2) VBAR / B 5 (2014 11 17 ) / 34 VBA VBA (Visual Basic for Applications) Visual Basic VBAVisual Basic Visual BasicC B 5 (2014 11 17 ) 1 / 34 VBA 2 Excel.xlsm 01 Sub test() 02 Dim tmp As Double 03
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
More informationGNU/Linux on SuperH g,,,,, GNU/Linux on SuperH [1] SuperH (SH-3 SH-4) GNU/Linux g linux-kernel 1998 Linux (SH-3) g GD
GNU/Linux on SuperH g,,,,, 2001 9 28 1 GNU/Linux on SuperH [1] SuperH (SH-3 SH-4) GNU/Linux 1999 8 g 1 1998 linux-kernel 1998 Linux (SH-3) 1999 7 g GDB CqREEK SH-3 1999 8 g Linux (SH-3) 1999 8 Linux (SH-4)
More informationB 20 Web
B 20 Web 0753018 21 1 29 1 1 6 2 8 3 UI 10 3.1........................ 10 3.2 Web............ 11 3.3......... 12 4 UI 14 4.1 Web....................... 15 4.2 Web........... 16 4.3 Web....................
More informationCH1 ...g O...pmd
MCT-1A 2 17 27 44 59 SPACE DiVA SPACE DiVA JCSAT-2A SPACE DiVA CS BS 2 OK USB ver 1.1 USB 2005 4 256 32 3 SPACE DiVA 950 MHz 2150 MHz CS SPACE DiVA SPACE DiVA 4... 2... 32... 2... 32... 3... 33... 4...34...
More informationストリーミング SIMD 拡張命令2 (SSE2) を使用した、倍精度浮動小数点ベクトルの最大/最小要素とそのインデックスの検出
SIMD 2(SSE2) / 2.0 2000 7 : 248602J-001 01/10/30 1 305-8603 115 Fax: 0120-47-8832 * Copyright Intel Corporation 1999-2001 01/10/30 2 1...5 2...5 2.1...5 2.1.1...5 2.1.2...8 3...9 3.1...9 3.2...9 4...9
More informationtemplate.dvi
XVI W I D E P R O J E C T 16 1 igeoid Internet GEOgraphical Information Platform Development ULP 2 2.1 PDA GPS Global Positioning System IC RFID ID LAN 2.1.1 GPS LAN IC 2.1 2.2 2.2.1 163 16 16 16 W I
More informationPowerPoint プレゼンテーション
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 informationjoho09.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 informationuntitled
70.0 60.0 50.0 40.0 30.0 20.0 10.0 0.0 18.5 18 60.4 6.3 45.5 18.9 41.8 5.0 29.3 17.1 1.2 3.7 0.0 0.0 1.5 19 20 21 22 2.50 2.00 1.50 1.00 0.50 0.00 19 2.38 1.48 1.02 2.05 0.11 0.00 0.00 20 21 1.22 0.44
More informationNEXT 1 2 3 1 2 3 4 5 6 1 2 1 2 1 1 1 1 2 3 1 2 3 4 5 6 1 2 3 4 1 2 3 4 5 6 1 2 3 4 5 1 2 3 1 1 2 1 2 3 4 5 6 7 1 2 3 1 2 1 2 3 4 5 6 7 8 9 1 1 1 2 1 2 1 2 3 4 5 6 1 2
More information離散数理工学 第 2回 数え上げの基礎:漸化式の立て方
2 okamotoy@uec.ac.jp 2015 10 20 2015 10 18 15:29 ( ) (2) 2015 10 20 1 / 45 ( ) 1 (10/6) ( ) (10/13) 2 (10/20) 3 ( ) (10/27) (11/3) 4 ( ) (11/10) 5 (11/17) 6 (11/24) 7 (12/1) 8 (12/8) ( ) (2) 2015 10 20
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 informationA B 1: Ex. MPICH-G2 C.f. NXProxy [Tanaka] 2:
Java Jojo ( ) ( ) A B 1: Ex. MPICH-G2 C.f. NXProxy [Tanaka] 2: Java Jojo Jojo (1) :Globus GRAM ssh rsh GRAM ssh GRAM A rsh B Jojo (2) ( ) Jojo Java VM JavaRMI (Sun) Horb(ETL) ( ) JPVM,mpiJava etc. Send,
More informationJavaScript の使い方
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 informationuntitled
1959 CEOTOC TOCTheory Of Constraint: 074 084 [ ] 10 10 10 B: Requirement 1 D: Prerequisite 1 A: Goal C: Requirement 2 D : Prerequisite 2 Project 1 1 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 Project
More informationIntel® Compilers Professional Editions
2007 6 10.0 * 10.0 6 5 Software &Solutions group 10.0 (SV) C++ Fortran OpenMP* OpenMP API / : 200 C/C++ Fortran : OpenMP : : : $ cat -n main.cpp 1 #include 2 int foo(const char *); 3 int main()
More information2005 1
25 SPARCstation 2 CPU central processor unit 25 2 25 3 25 4 DRAM 25 5 25 6 : DRAM 25 7 2 25 8 2 25 9 2 bit: binary digit V 2V 25 2 2 2 2 4 5 2 6 3 7 25 A B C A B C A B C A B C A C A B 3 25 2 25 3 Co Cin
More informationKumagai09-hi-2.indd
CSR2009 CONTENTS 1 2 3 4 5 6 7 8 9 10 350 11 12 13 14 15 16 17 18 Do Check Action Plan 19 20 INPUT r r r r k k OUTPUT 21 22 Plan Action Check Do 23 24 25 26 27 28 16:50 7:30 8:00 8:30 9:30 10:00 18:00
More information2 3 4 5 6 7 8 9 10 12 14 17 20 23 26 28 29 30 32 33 34 35 2
2 3 4 5 6 7 8 9 10 12 14 17 20 23 26 28 29 30 32 33 34 35 2 21 3 CO-GROWING HUMAN CONVINNOVATION 4 5 6 ISO14001 PDCA Plan Do Check Action Plan Do Check Action 7 a a a 8 9 10 input \ output \ DATA input
More informationCompiled MODELSでのDFT位相検出装置のモデル化と評価
listsize TPBIG.EXE /Mingw32 ATP (Alternative Transients Program)- EMTP ATP ATP ATP ATP(TPBIG.EXE) EMTP (ATP)FORTAN77 DIMENSION C malloc listsize TACS DIMENSIONEMTP ATP(TPBIG.EXE) listsize (CPU ) RL 4040
More information橡ソート手順比較
PAGE:1 [Page] 20 1 20 20 QuickSort 21 QuickSort 21 21 22 QuickSort 22 QuickSort 22 23 0 23 QuickSort 23 QuickSort 24 Order 25 25 26 26 7 26 QuickSort 27 PAGE:2 PAGE:3 program sort; { { type item = record
More information1 2
1 2 4 3 5 6 8 7 9 10 12 11 0120-889-376 r 14 13 16 15 0120-0889-24 17 18 19 0120-8740-16 20 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58
More information3 5 6 7 7 8 9 5 7 9 4 5 6 6 7 8 8 8 9 9 3 3 3 3 8 46 4 49 57 43 65 6 7 7 948 97 974 98 99 993 996 998 999 999 4 749 7 77 44 77 55 3 36 5 5 4 48 7 a s d f g h a s d f g h a s d f g h a s d f g h j 83 83
More information:00-16:10
3 3 2007 8 10 13:00-16:10 2 Diffie-Hellman (1976) K K p:, b [1, p 1] Given: p: prime, b [1, p 1], s.t. {b i i [0, p 2]} = {1,..., p 1} a {b i i [0, p 2]} Find: x [0, p 2] s.t. a b x mod p Ind b a := x
More informationDOPRI5.dvi
ODE DOPRI5 ( ) 16 3 31 Runge Kutta Dormand Prince 5(4) [1, pp. 178 179] DOPRI5 http://www.unige.ch/math/folks/hairer/software.html Fortran C C++ [3, pp.51 56] DOPRI5 C cprog.tar % tar xvf cprog.tar cprog/
More information(個別のテーマ) 薬剤に関連した医療事故
- 67 - III - 68 - - 69 - III - 70 - - 71 - III - 72 - - 73 - III - 74 - - 75 - III - 76 - - 77 - III - 78 - - 79 - III - 80 - - 81 - III - 82 - - 83 - III - 84 - - 85 - - 86 - III - 87 - III - 88 - - 89
More information