Figure 9.01
|
|
|
- 효빈 곡
- 7 years ago
- Views:
Transcription
1 Chapter 8: Main Memory, Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
2 Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium 8.2 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
3 Objectives To provide a detailed description of various ways of organizing memory hardware To discuss various memory-management techniques, including paging and segmentation To provide a detailed description of the Intel Pentium, which supports both pure segmentation and segmentation with paging 8.3 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
4 1.Background Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are only storage CPU can access directly Register access in one CPU clock (or less) Main memory can take many cycles Cache sits between main memory and CPU registers Protection of memory required to ensure correct operation 8.4 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
5 1.1 기본하드웨어 A pair of base and limit registers define the logical address space Monitor mode 에서 OS 는 monitor 와사용자메모리전체에무제한접근권한가짐 기준 (base) 과한계 (limit) 레지스터적재명령은특권명령임 8.5 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
6 1.2 주소의할당 (address Binding) Address binding of instructions and data to memory addresses can happen at three different stages Compile time: If memory location known a priori, absolute code can be generated; must recompile code if starting location changes. Cf. MS-DOS,.COM Load time: Must generate relocatable code if memory location is not known at compile time Execution time: Binding delayed until run time if the process can be moved during its execution from one memory segment to another. Need hardware support for address maps (e.g., base and limit registers) 8.6 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
7 Multistep Processing of a User Program 8.7 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
8 1.3 논리적주소공간과물리적주소공간 (Logical vs. Physical Address Space) 논리주소 ---MMU H/W- 물리주소 논리주소 (logical address) : program generated. Virtual address 물리주소 (physical address) : memory address register에적재되는주소 Memory mapping H/W = MMU(Memory Management Unit) Hardware device that maps virtual to physical address Relocation register 이용 생성된모든주소 + relocation register value 물리주소 R : base value in relocation register logical address : 0 ~ max physical address : R + 0 ~ R + max 8.8 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
9 동적재배치 (Dynamic relocation using a relocation register) 8.9 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
10 1.4 동적적재 (dynamic loading) 와동적연결 (dynamic linking) 동적적재 (Dynamic Loading) 프로세스의모든프로그램이물리적메모리에적재된후에실행되어야한다면프로세스의크기가물리적메모리의크기에제한된다. 모든루틴들은호출이요청될때적재됨 : runtime에 load ( 예 ) error routines : 필요할때만적재 OS 지원 : 라이브러리루틴의동적적재 동적연결 (Dynamic Linking) run time에 linking 시스템라이브러리는물리적메모리공간에서프로세스들이공유할필요가있다. ( 예 ) language subroutine library stub 이용 : run-time에메모리에있으면그곳으로, 없으면 load & link. memory resident library routine의위치를찾아가거나새로 load하는방법을제공하는 program code OS 도움필요 : 다른프로세스의 address space 접근지원 (paging) shared libraries 예 ) MS.dll (dynamic linking library) (cf.).lib (static linking library) Implicit linking.dll 파일링크,.h 파일 ; extern C _declspec(dllimport)void PaintImage(LPSTR filename); 빈함수정의 ; void PaintImage(LPSTR filename)=0; Explicit linking» Loadlibrary( ExRegularDll dll ); 8.10 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
11 2. Swapping CPU scheduler : 순환할당스케줄링 : swap-out/swap-in 우선순위스케줄링 : roll-out/roll-in ( 우선순위에따라 ) CPU scheduler dispatcher : 프로세스선택, 필요하면 swap out and swap in swap-back 위치» 같은위치 : compile time 또는 load time binding» 다른위치 : execution time binding ready queue 의 processes 위치» memory 에» backing store 에 : swap-in 하기위해다른프로세스 swap-out swap time ( 대부분이전송시간 )» swap context-switch time = (transfer time + latency time) x 2 =?» 회전지연시간 (latency time) = 8ms» 프로세스크기 (process size) = 10M» 전송율 (transfer rate) = 40MB» 전송시간 (transfer time) = (10/40*1000+8)*2=516ms» no head seek 가정 RR 1-time quantum > 516ms modified swapping» Unix : system load 가클때 OS 가 swapping( 멀티프로그래밍정도를낮춤 )» PC Windows 3.1: user 가 swap-in 선택, swap time 결정» PC Windows/NT : OS 가 full swapping 8.11 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
12 8.3 연속메모리할당 (Contiguous Allocation) Main memory usually into two partitions: Resident operating system, usually held in low memory with interrupt vector User processes then held in high memory Relocation registers used to protect user processes from each other, and from changing operating-system code and data Base register contains value of smallest physical address Limit register contains range of logical addresses each logical address must be less than the limit register MMU maps logical address dynamically 8.12 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
13 8.3 연속메모리할당 (Contiguous Allocation) 3.1 메모리사상과보호 (memory mapping and protection) Memory mapping MMU 가사상 : 동적으로코드의논리주소에재배치레지스터의값을더하여물리적주소의코드를만들어메모리에적재한다. Memory protection CPU scheduler 가프로세스를교체할때 dispatcher 가 context switch 안에 limit register 과 relocation address 를저장및적재하고 CPU 가생성하는모든주소가 limit register 과 relocation address 를점검하므로다른프로그램의접근을막는다. Hardware Support for Relocation and Limit Registers 8.13 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
14 8.3 연속메모리할당 (Contiguous Allocation) 3.2 메모리할당 (memory allocation) 단일분할할당 (Single-Partition Allocation) 배치주소고정 : relocation register + limit register 가변 OS size 가능 실행시간에필요한 device driver 만 load : transient OS code 다중분할할당 (Multiple-Partition Allocation) 고정크기분할 여러개의고정크기분할 다중프로그래밍정도 (degree of multiprogramming) 를제한 ( 예 ) IBM OS/360 MFT2(Multiprogramming with a Fixed number of Tasks) 가변크기분할 hole( 사용가능메모리블럭 ) 에서필요한만큼할당 MVT(Multiprogramming with a Variable number of Tasks) 주로일괄처리환경 OS지원 : Operating system maintains information about: a) allocated partitions b) free partitions (hole) H/W 지원 : 기준 / 한계레지스터 dynamic storage allocation 8.14 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
15 8.3 연속메모리할당 (Contiguous Allocation) How to satisfy a request of size n from a list of free holes First-fit: Allocate the first hole that is big enough Best-fit: Allocate the smallest hole that is big enough; must search entire list, unless ordered by size Produces the smallest leftover hole Worst-fit: Allocate the largest hole; must also search entire list Produces the largest leftover hole 기억장치할당예 (c) 에서 100k, 100k, 200k, 160k 할당 First-fit and best-fit better than worst-fit in terms of speed and storage utilization OS OS OS OS process 5 process 5 process 5 process 5 process 9 process 9 process 8 process 10 process 2 process 2 process 2 process / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
16 8.3 연속메모리할당 (Contiguous Allocation) An example of memory allocation 8.16 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
17 8.3 연속메모리할당 (Contiguous Allocation) 3.3 Fragmentation 외부단편 (External Fragmentation ) 프로세스의메모리적재가반복 작은메모리조각 ( 사용이불가능한 ) 50-pecent-rule : first-fit 할당방식의경우통계적으로 N 할당블록에대해 0.5N 블록의영역이단편화즉 1/3 이메모리는사용불가 Compaction : 사용가능메모리를한곳으로모음 내부단편 (Internal Fragmentation) partition 내부에생긴단편이사용되지않음 Compaction 사용가능메모리를한곳으로모음 dynamic relocation 인경우에만가능» 각 program 마다 base register 이용 Compaction + Swapping» roll-back 될때 dynamic relocation 으로 compaction( 적절한 위치로 roll-back 됨으로써 ) 8.17 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
18 8.3 연속메모리할당 (Contiguous Allocation) 압축 (compression) 8.18 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
19 8.4 Paging 1. 물리주소 -> frame( 고정크기블럭 ) 단위로나눔 2. 논리주소 -> page(frame 크기 ) 단위로나눔» H/W 지원 1 Page table H/W» 각 page 의물리주소공간에서의시작주소 : base address» 논리주소 = page number + page offset» 물리주소 = 그 page 의물리적시작주소 + page offset 2 address generation H/W(registers) : Figure 8.7» page table 참조하여물리주소계산» 논리주소 = 2 m, page size 는 2 n : ( 예 ) 512(n=9), 1024(n=10), 2048(n=11), 4096(n=12), 8192(n=13) page number page offset m n bit n bit» 외부단편없음, 내부단편생김 ( 마지막 page)» page size 작을수록 내부단편크기? page table 유지 overhead? disk I/O 시간? page size 커지는것이추세 (2048, 4096, 8192) 8.19 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
20 8.4 Paging(~) Paging Hardware 8.20 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
21 8.4 Paging(~) Paging Model of Logical and Physical Memory An Paging example of 32 byte memory and 4 byte pages physical memory size = 32 byte=2 5 Frame size=page size= 4-byte =2 2 P.A F # / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
22 8.4 Paging(~)» 논리주소 물리주소 (address-translation H/W) OS 가올바른물리주소생성지원 1 각프로세스마다 page table 유지 : 그페이지가담긴 frame 번호 context-switch time 증가 2 frame 할당상황담은 frame table 유지 : 사용가능 frame list 3 사용자프로세스가자신의주소공간에서동작하는지파악» 페이징은동적재배치 (dynamic relocation) 의한형태 Page Table 의기본구조 (Structure of the Page Table)» H/W 지원 1 register 로» 빠르다. page table 크기작을때가능» ( 예 ) DEC PDP-11 : 16bits address, page size 8K -> 8 page registers 2 memory 에» PTBR(Page-Table Base Register) 로접근» 느리다 (memory 에 2 회접근 ) fast-lookup hardware cache(associative register, translation look-aside buffers; key & value) 로보완 1 보다 10% 의느린속도로 8.22 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
23 8.4 Paging(~) 페이징주소변환하드웨어 (Address Translation Hardware) 8.23 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
24 가용프레임 (Free Frames) 8.4 Paging(~) Before allocation After allocation 8.24 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
25 8.4.2 하드웨어지원 (Implementation of Page Table Page table is kept in main memory Page-table base register (PTBR) points to the page table Page-table length register (PRLR) indicates size of the page table In this scheme every data/instruction access requires two memory accesses. One for the page table and one for the data/instruction. The two memory access problem can be solved by the use of a special fast-lookup hardware cache called associative memory or translation look-aside buffers (TLBs) Some TLBs store address-space identifiers (ASIDs) in each TLB entry uniquely identifies each process to provide address-space protection for that process 8.25 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
26 8.4.2 하드웨어지원 (~) Associative Memory Associative memory(tlb) parallel search Page # Frame # Address translation (p, d) If p is in associative register, get frame # out Otherwise get frame # from page table in memory 8.26 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
27 8.4.2 하드웨어지원 (~) Paging Hardware With TLB 8.27 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
28 8.4.2 하드웨어지원 (~)» 유효접근시간 (effective access time) (page 를 cache 에서찾을 ) hit-ratio 80% : 16 registers» i) cache 에있으면 20ns(cache access) + 100ns(memory access) -> 120 ns» ii) cache 에없으면 20ns + 2 x 100ns ->220ns» 유효접근시간 = 0.80 x x 220 = 140ns (40% slow down) hit radio 98%» 유효접근시간 = 0.98 x x 220 = 122ns (22% slow down) TLB 10~512 개이용하여 80~98% hit-ratio» Motorola processor : 22 entry TLB» Intel PU : 32 entry TBL 로 98% hit-ratio» 보호 (Protection) 보호비트 (Protection bit) on page table : read-write, read-only, execute-only 타당 / 비타당비트 (valid/invalid bit) : 논리주소공간에서의유효성여부 전체주소공간 : 2 14 = 16,383 = 2K x 8 페이지크기 : 2K 프로그램크기 : 10469( 주소 : 0 ~ 10, 468) valid : page 0 ~ page 5( 마지막페이지에내부단편 ) PTLR(Page Table Length Register) 사용 8.28 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
29 8.4.3 Memory Protection Memory Protection Memory protection implemented by associating protection bit with each frame Valid-invalid bit attached to each entry in the page table: valid indicates that the associated page is in the process logical address space, and is thus a legal page invalid indicates that the page is not in the process logical address space 8.29 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
30 8.4.3 Memory Protection Valid (v) or Invalid (i) Bit In A Page Table 8.30 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
31 4.4 Shared Pages Shared code One copy of read-only (reentrant) code shared among processes (i.e., text editors, compilers, window systems). Shared code must appear in same location in the logical address space of all processes Private code and data Each process keeps a separate copy of the code and data The pages for the private code and data can appear anywhere in the logical address space 8.31 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
32 Shared Pages Example 4.4 Shared Pages(~) 8.32 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
33 4.5 Structure of the Page Table Hierarchical Paging Hashed Page Tables Inverted Page Tables 8.33 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
34 5.1 Hierarchical Page Tables Break up the logical address space into multiple page tables A simple technique is a two-level page table 다중레벨페이징 (Multilevel Paging) 논리주소공간 : 2 32 에서 단일페이지테이블페이지크기 : 4K(2 12 ) 페이지테이블개수 :100 만 (2 32 /21 12 = 항목 ) 페이지테이블크기 2 20 x 4 bytes = 4M 2 레벨테이블페이지 10bit page number + 10 bit page number page table 을 4K paging(1k 항목, 각항목 4 bytes) : 8.34 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
35 5.1 Hierarchical Page Tables(~) Two-Level Page-Table Scheme 8.35 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
36 5.1 Hierarchical Page Tables(~) Two-Level Paging Example A logical address (on 32-bit machine with 1K page size) is divided into: a page number consisting of 22 bits a page offset consisting of 10 bits Since the page table is paged, the page number is further divided into: a 12-bit page number a 10-bit page offset Thus, a logical address is as follows: where p i is an index into the outer page table, and p 2 is the displacement within the page of the outer page table Address-Translation Scheme of 2 level paging structure 8.36 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
37 5.1 Hierarchical Page Tables(~) Two-level Paging Scheme Three-level Paging Scheme 8.37 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
38 5.2 Hashed Page Tables Common in address spaces > 32 bits The virtual page number is hashed into a page table This page table contains a chain of elements hashing to the same location Virtual page numbers are compared in this chain searching for a match If a match is found, the corresponding physical frame is extracted 8.38 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
39 5.2 Hashed Page Tables(~) Hashed Page Table 8.39 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
40 5.3 Inverted Page Table Only one entry for each real page of memory regardless of the number of processes Entry consists of the virtual address of the page stored in that real memory location, with information about the process that owns that page Decreases memory needed to store each page table, but increases time needed to search the table when a page reference occurs Use hash table to limit the search to one or at most a few page-table entries Used in the 64 bit UltraSparc, PowerPC 8.40 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
41 Inverted Page Table Architecture 8.41 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
42 6. Segmentation 기억장치의사용자관점을지원하는기법 기본방법 (Basic Method)» 메모리에대한사용자관점 /= 실제메모리» 사용자관점 : 임의길이의논리적 segment 들의집합 segment : 의미적으로 (semantically) 정의된프로그램의부분들, 예를들면, main, subroutines, functions, data elements,...» 논리주소 : <segment number, offset> s d» 세그먼테이션처리 segmentation : compiler 가 segment 번호 : loader 가 Hardware 1 segment table 한계 ( 길이 ), 기준의쌍 2 address generation H/W 8.42 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
43 6. Segmentation(~) User s View of a Program Logical address space user space Physical address (memory) space 8.43 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
44 Segmentation Architecture 6. Segmentation(~) Logical address consists of a two tuple: <segment-number, offset>, Segment table maps two-dimensional physical addresses; each table entry has: base contains the starting physical address where the segments reside in memory limit specifies the length of the segment Segment-table base register (STBR) points to the segment table s location in memory Segment-table length register (STLR) indicates number of segments used by a program; segment number s is legal if s < STLR 8.44 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
45 6. Segmentation(~) Segmentation Architecture (Cont.) Protection With each entry in segment table associate: validation bit = 0 illegal segment read/write/execute privileges Protection bits associated with segments; code sharing occurs at segment level Since segments vary in length, memory allocation is a dynamic storage-allocation problem A segmentation example is shown in the following diagram 8.45 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
46 Segmentation Hardware 6. Segmentation(~) 8.46 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
47 Example of Segmentation 6. Segmentation(~) 8.47 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
48 Example: The Intel Pentium 7. Pentium Segmentation Supports both segmentation and segmentation with paging CPU generates logical address Given to segmentation unit Which produces linear addresses Linear address given to paging unit Which generates physical address in main memory Paging units form equivalent of MMU Pentinum 에서논리주소가물리주소로변환되는과정 8.48 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
49 Segmentation unit 7. Pentium Segmentation(~) 논리주소 : (select, offset) select : 16 bit : <s(13),g(1),p(2)> s: segment number, g:gdtor LDT, p: protection information GDT(Global Descriptor Table), LDT(Local Descriptor Table) : 8byte로구성, segment의기준위치과길이등의정보 8.49 / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
50 Pentium Paging 32bit linear address : Pentium paging P.s.f=0 10 Page size flag= / 50 Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
51 End of Chapter 8, Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2010
Microsoft PowerPoint os9.ppt
기억장치관리 (Memory Management) 배경 (Background) Source Program ( 심볼주소 ) Compiler Object Module ( 재배치가능주소 ) Linkage Editor & Loader Binary Run-time Module ( 절대주소 ) X 14(bytes offset) 74014(R+14) 주소바인딩 (Address
Microsoft PowerPoint - o8.pptx
메모리보호 (Memory Protection) 메모리보호를위해 page table entry에 protection bit와 valid bit 추가 Protection bits read-write / read-only / executable-only 정의 page 단위의 memory protection 제공 Valid bit (or valid-invalid bit)
Microsoft PowerPoint os8.ppt [호환 모드]
![Microsoft PowerPoint os8.ppt [호환 모드]](/thumbs/66/55685563.jpg "Microsoft PowerPoint os8.ppt [호환 모드]")
8 장주메모리 (Main Memory) Questions of the day 1. 내부단편화 (internal segmentation) 와외부단편화 (external segmentation) 사이의차이점을설명하고아래메모리기법들에어느단편화가발생할수있는지밝히세요. 1MFT(Multiprogramming with a Fixed number of Tasks) 2 MVT(Multiprogramming
Microsoft PowerPoint - o8.pptx
목표 메모리하드웨어를구성하는다양한방법소개 프로세스에게메모리를할당하는다양한기법설명 현대컴퓨터시스템에서 paging 동작방법논의 8 장. 메모리관리 2 8. 배경지식 메모리보호 Base 와 Limit Registers 사용 프로그램은디스크에서메모리로적재된후실행됨 프로세스 disk program load memory PCB process CPU 가직접접근가능한기억장치
강의10
Computer Programming gdb and awk 12 th Lecture 김현철컴퓨터공학부서울대학교 순서 C Compiler and Linker 보충 Static vs Shared Libraries ( 계속 ) gdb awk Q&A Shared vs Static Libraries ( 계속 ) Advantage of Using Libraries Reduced
PowerPoint 프레젠테이션
Reasons for Poor Performance Programs 60% Design 20% System 2.5% Database 17.5% Source: ORACLE Performance Tuning 1 SMS TOOL DBA Monitoring TOOL Administration TOOL Performance Insight Backup SQL TUNING
6주차.key
6, Process concept A program in execution Program code PCB (process control block) Program counter, registers, etc. Stack Heap Data section => global variable Process in memory Process state New Running
휠세미나3 ver0.4
andromeda@sparcs:/$ ls -al dev/sda* brw-rw---- 1 root disk 8, 0 2014-06-09 18:43 dev/sda brw-rw---- 1 root disk 8, 1 2014-06-09 18:43 dev/sda1 brw-rw---- 1 root disk 8, 2 2014-06-09 18:43 dev/sda2 andromeda@sparcs:/$
step 1-1
Written by Dr. In Ku Kim-Marshall STEP BY STEP Korean 1 through 15 Action Verbs Table of Contents Unit 1 The Korean Alphabet, hangeul Unit 2 Korean Sentences with 15 Action Verbs Introduction Review Exercises
` Companies need to play various roles as the network of supply chain gradually expands. Companies are required to form a supply chain with outsourcing or partnerships since a company can not
6.24-9년 6월
리눅스 환경에서Solid-State Disk 성능 최적화를 위한 디스크 입출력요구 변환 계층 김태웅 류준길 박찬익 Taewoong Kim Junkil Ryu Chanik Park 포항공과대학교 컴퓨터공학과 {ehoto, lancer, cipark}@postech.ac.kr 요약 SSD(Solid-State Disk)는 여러 개의 낸드 플래시 메모리들로 구성된
PCServerMgmt7
Web Windows NT/2000 Server DP&NM Lab 1 Contents 2 Windows NT Service Provider Management Application Web UI 3 . PC,, Client/Server Network 4 (1),,, PC Mainframe PC Backbone Server TCP/IP DCS PLC Network
김기남_ATDC2016_160620_[키노트].key
![김기남_ATDC2016_160620_[키노트].key](/thumbs/85/91488855.jpg "김기남_ATDC2016_160620_[키노트].key")
metatron Enterprise Big Data SKT Metatron/Big Data Big Data Big Data... metatron Ready to Enterprise Big Data Big Data Big Data Big Data?? Data Raw. CRM SCM MES TCO Data & Store & Processing Computational
MS-SQL SERVER 대비 기능
Business! ORACLE MS - SQL ORACLE MS - SQL Clustering A-Z A-F G-L M-R S-Z T-Z Microsoft EE : Works for benchmarks only CREATE VIEW Customers AS SELECT * FROM Server1.TableOwner.Customers_33 UNION ALL SELECT
solution map_....
SOLUTION BROCHURE RELIABLE STORAGE SOLUTIONS ETERNUS FOR RELIABILITY AND AVAILABILITY PROTECT YOUR DATA AND SUPPORT BUSINESS FLEXIBILITY WITH FUJITSU STORAGE SOLUTIONS kr.fujitsu.com INDEX 1. Storage System
untitled
Logic and Computer Design Fundamentals Chapter 4 Combinational Functions and Circuits Functions of a single variable Can be used on inputs to functional blocks to implement other than block s intended
2009년 국제법평론회 동계학술대회 일정
한국경제연구원 대외세미나 인터넷전문은행 도입과제와 캐시리스사회 전환 전략 일시 2016년 3월 17일 (목) 14:00 ~17:30 장소 전경련회관 컨퍼런스센터 2층 토파즈룸 주최 한국경제연구원 한국금융ICT융합학회 PROGRAM 시 간 내 용 13:30~14:00 등 록 14:00~14:05 개회사 오정근 (한국금융ICT융합학회 회장) 14:05~14:10
Microsoft PowerPoint - 27.pptx
이산수학 () n-항관계 (n-ary Relations) 2011년봄학기 강원대학교컴퓨터과학전공문양세 n-ary Relations (n-항관계 ) An n-ary relation R on sets A 1,,A n, written R:A 1,,A n, is a subset R A 1 A n. (A 1,,A n 에대한 n- 항관계 R 은 A 1 A n 의부분집합이다.)
Microsoft PowerPoint - 알고리즘_1주차_2차시.pptx
Chapter 2 Secondary Storage and System Software References: 1. M. J. Folk and B. Zoellick, File Structures, Addison-Wesley. 목차 Disks Storage as a Hierarchy Buffer Management Flash Memory 영남대학교데이터베이스연구실
<3130C0E5>
Redundancy Adding extra bits for detecting or correcting errors at the destination Types of Errors Single-Bit Error Only one bit of a given data unit is changed Burst Error Two or more bits in the data
Microsoft PowerPoint - 06-IPAddress [호환 모드]
![Microsoft PowerPoint - 06-IPAddress [호환 모드]](/thumbs/84/90735609.jpg "Microsoft PowerPoint - 06-IPAddress [호환 모드]")
Chapter 06 IP Address IP Address Internet address IP 계층에서사용되는식별자 32 bit 2 진주소 The address space of IPv4 is 2 32 or 4,294,967,296 netid 와 hostid 로구분 인터넷에서호스트와라우터를유일하게구분 IP Address Structure 2-Layer Hierarchical
SRC PLUS 제어기 MANUAL
,,,, DE FIN E I N T R E A L L O C E N D SU B E N D S U B M O TIO
슬라이드 1
/ 유닉스시스템개요 / 파일 / 프로세스 01 File Descriptor file file descriptor file type unix 에서의파일은단지바이트들의나열임 operating system 은파일에어떤포맷도부과하지않음 파일의내용은바이트단위로주소를줄수있음 file descriptor 는 0 이나양수임 file 은 open 이나 creat 로 file
[ReadyToCameral]RUF¹öÆÛ(CSTA02-29).hwp
![[ReadyToCameral]RUF¹öÆÛ(CSTA02-29).hwp](/thumbs/80/82353018.jpg "[ReadyToCameral]RUF¹öÆÛ(CSTA02-29).hwp")
RUF * (A Simple and Efficient Antialiasing Method with the RUF buffer) (, Byung-Uck Kim) (Yonsei Univ. Depth of Computer Science) (, Woo-Chan Park) (Yonsei Univ. Depth of Computer Science) (, Sung-Bong
DE1-SoC Board
실습 1 개발환경 DE1-SoC Board Design Tools - Installation Download & Install Quartus Prime Lite Edition http://www.altera.com/ Quartus Prime (includes Nios II EDS) Nios II Embedded Design Suite (EDS) is automatically
°í¼®ÁÖ Ãâ·Â
Performance Optimization of SCTP in Wireless Internet Environments The existing works on Stream Control Transmission Protocol (SCTP) was focused on the fixed network environment. However, the number of
Microsoft PowerPoint - ch03ysk2012.ppt [호환 모드]
![Microsoft PowerPoint - ch03ysk2012.ppt [호환 모드]](/thumbs/101/150466693.jpg "Microsoft PowerPoint - ch03ysk2012.ppt [호환 모드]")
전자회로 Ch3 iode Models and Circuits 김영석 충북대학교전자정보대학 2012.3.1 Email: kimys@cbu.ac.kr k Ch3-1 Ch3 iode Models and Circuits 3.1 Ideal iode 3.2 PN Junction as a iode 3.4 Large Signal and Small-Signal Operation
untitled
Memory leak Resource 力 金 3-tier 見 Out of Memory( 不 ) Memory leak( 漏 ) 狀 Application Server Crash 理 Server 狀 Crash 類 JVM 說 例 行說 說 Memory leak Resource Out of Memory Memory leak Out of Memory 不論 Java heap
<31B1E8C0B1C8F128C6ED2E687770>
한국패션디자인학회지 제9권1호 The Korean Society of Fashion Design Vol. 9 No. 1 (2009) pp.1~17 모듈과 웨어넷을 이용한 유비쿼터스 패셔너블 컴퓨터 디자인 연구 - 탈ㆍ부착을 이용한 모듈러 시스템을 중심으로 - A Study on Ubiquitous Fashionable Computer Design Using
1217 WebTrafMon II
(1/28) (2/28) (10 Mbps ) Video, Audio. (3/28) 10 ~ 15 ( : telnet, ftp ),, (4/28) UDP/TCP (5/28) centralized environment packet header information analysis network traffic data, capture presentation network
APOGEE Insight_KR_Base_3P11
Technical Specification Sheet Document No. 149-332P25 September, 2010 Insight 3.11 Base Workstation 그림 1. Insight Base 메인메뉴 Insight Base Insight Insight Base, Insight Base Insight Base Insight Windows
untitled
Embedded System Lab. II Embedded System Lab. II 2 RTOS Hard Real-Time vs Soft Real-Time RTOS Real-Time, Real-Time RTOS General purpose system OS H/W RTOS H/W task Hard Real-Time Real-Time System, Hard
Microsoft PowerPoint - AC3.pptx
Chapter 3 Block Diagrams and Signal Flow Graphs Automatic Control Systems, 9th Edition Farid Golnaraghi, Simon Fraser University Benjamin C. Kuo, University of Illinois 1 Introduction In this chapter,
Chap06(Interprocess Communication).PDF
Interprocess Communication 2002 2 Hyun-Ju Park Introduction (interprocess communication; IPC) IPC data transfer sharing data event notification resource sharing process control Interprocess Communication
CD-RW_Advanced.PDF
HP CD-Writer Program User Guide - - Ver. 2.0 HP CD-RW Adaptec Easy CD Creator Copier, Direct CD. HP CD-RW,. Easy CD Creator 3.5C, Direct CD 3.0., HP. HP CD-RW TEAM ( 02-3270-0803 ) < > 1. CD...3 CD...5
Microsoft PowerPoint - 알고리즘_5주차_1차시.pptx
Basic Idea of External Sorting run 1 run 2 run 3 run 4 run 5 run 6 750 records 750 records 750 records 750 records 750 records 750 records run 1 run 2 run 3 1500 records 1500 records 1500 records run 1
<4D F736F F F696E74202D2037C0E52DC4B3BDC3BFCDB8DEB8F0B8AE>
7장 : 캐시와메모리 메모리계층 사용자들은값싸고빠른메모리를크면클수록갖고싶어한다! - 나에게하드디스크 (300GB) 만큼의, 속도는 RAM 정도이고비휘발성메모리가있다면.. 그런데돈이없다. 2006년현재 RAM은 52 MB/5 만원 ( GB/0 만원 ) HD는 300GB/0 만원 (GB/330원) 캐시가격을정확히산정하기는어려우나 52KB/2 만원 (GB/4000
Microsoft PowerPoint - 알고리즘_11주차_2차시.pptx
5 Collision Resolution by Progressive Overflow Progressive Overflow Linear Probing 51 How Progressive Overflow Works 기본개념 Collision 발생할때, 이후빈공간에삽입 ( 그림 104) End of file 일경우, 처음부터다시검색 ( 그림 105) Circular
04-다시_고속철도61~80p
Approach for Value Improvement to Increase High-speed Railway Speed An effective way to develop a highly competitive system is to create a new market place that can create new values. Creating tools and
인켈(국문)pdf.pdf
M F - 2 5 0 Portable Digital Music Player FM PRESET STEREOMONO FM FM FM FM EQ PC Install Disc MP3/FM Program U S B P C Firmware Upgrade General Repeat Mode FM Band Sleep Time Power Off Time Resume Load
Output file
240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 An Application for Calculation and Visualization of Narrative Relevance of Films Using Keyword Tags Choi Jin-Won (KAIST) Film making
<BFA9BAD02DB0A1BBF3B1A4B0ED28C0CCBCF6B9FC2920B3BBC1F62E706466>
001 002 003 004 005 006 008 009 010 011 2010 013 I II III 014 IV V 2010 015 016 017 018 I. 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 III. 041 042 III. 043
Microsoft Word - FunctionCall
Function all Mechanism /* Simple Program */ #define get_int() IN KEYOARD #define put_int(val) LD A val \ OUT MONITOR int add_two(int a, int b) { int tmp; tmp = a+b; return tmp; } local auto variable stack
슬라이드 제목 없음
2006-09-27 경북대학교컴퓨터공학과 1 제 5 장서브넷팅과슈퍼넷팅 서브넷팅 (subnetting) 슈퍼넷팅 (Supernetting) 2006-09-27 경북대학교컴퓨터공학과 2 서브넷팅과슈퍼넷팅 서브넷팅 (subnetting) 하나의네트워크를여러개의서브넷 (subnet) 으로분할 슈퍼넷팅 (supernetting) 여러개의서브넷주소를결합 The idea
<B3EDB9AEC1FD5F3235C1FD2E687770>
경상북도 자연태음악의 소박집합, 장단유형, 전단후장 경상북도 자연태음악의 소박집합, 장단유형, 전단후장 - 전통 동요 및 부녀요를 중심으로 - 이 보 형 1) * 한국의 자연태 음악 특성 가운데 보편적인 특성은 대충 밝혀졌지만 소박집합에 의한 장단주기 박자유형, 장단유형, 같은 층위 전후 구성성분의 시가( 時 價 )형태 등 은 밝혀지지 않았으므로
K7VT2_QIG_v3
1......... 2 3..\ 4 5 [R] : Enter Raid setup utility 6 Press[A]keytocreateRAID RAID Type: JBOD RAID 0 RAID 1: 2 7 " RAID 0 Auto Create Manual Create: 2 RAID 0 Block Size: 16K 32K
Å©·¹Àγ»Áö20p
Main www.bandohoist.com Products Wire Rope Hoist Ex-proof Hoist Chain Hoist i-lifter Crane Conveyor F/A System Ci-LIFTER Wire Rope Hoist & Explosion-proof Hoist Mono-Rail Type 1/2ton~20ton Double-Rail
GNU/Linux 1, GNU/Linux MS-DOS LOADLIN DOS-MBR LILO DOS-MBR LILO... 6
GNU/ 1, qkim@pecetrirekr GNU/ 1 1 2 2 3 4 31 MS-DOS 5 32 LOADLIN 5 33 DOS- LILO 6 34 DOS- 6 35 LILO 6 4 7 41 BIOS 7 42 8 43 8 44 8 45 9 46 9 47 2 9 5 X86 GNU/LINUX 10 1 GNU/, GNU/ 2, 3, 1 : V 11, 2001
0125_ 워크샵 발표자료_완성.key
WordPress is a free and open-source content management system (CMS) based on PHP and MySQL. WordPress is installed on a web server, which either is part of an Internet hosting service or is a network host
Microsoft PowerPoint APUE(Intro).ppt
컴퓨터특강 () [Ch. 1 & Ch. 2] 2006 년봄학기 문양세강원대학교컴퓨터과학과 APUE 강의목적 UNIX 시스템프로그래밍 file, process, signal, network programming UNIX 시스템의체계적이해 시스템프로그래밍능력향상 Page 2 1 APUE 강의동기 UNIX 는인기있는운영체제 서버시스템 ( 웹서버, 데이터베이스서버
public key private key Encryption Algorithm Decryption Algorithm 1
public key private key Encryption Algorithm Decryption Algorithm 1 One-Way Function ( ) A function which is easy to compute in one direction, but difficult to invert - given x, y = f(x) is easy - given
T100MD+
User s Manual 100% ) ( x b a a + 1 RX+ TX+ DTR GND TX+ RX+ DTR GND RX+ TX+ DTR GND DSR RX+ TX+ DTR GND DSR [ DCE TYPE ] [ DCE TYPE ] RS232 Format Baud 1 T100MD+
C# Programming Guide - Types
C# Programming Guide - Types 최도경 lifeisforu@wemade.com 이문서는 MSDN 의 Types 를요약하고보충한것입니다. http://msdn.microsoft.com/enus/library/ms173104(v=vs.100).aspx Types, Variables, and Values C# 은 type 에민감한언어이다. 모든
Oracle9i Real Application Clusters
Senior Sales Consultant Oracle Corporation Oracle9i Real Application Clusters Agenda? ? (interconnect) (clusterware) Oracle9i Real Application Clusters computing is a breakthrough technology. The ability
목차 1. 제품 소개... 4 1.1 특징... 4 1.2 개요... 4 1.3 Function table... 5 2. 기능 소개... 6 2.1 Copy... 6 2.2 Compare... 6 2.3 Copy & Compare... 6 2.4 Erase... 6 2
유영테크닉스( 주) 사용자 설명서 HDD014/034 IDE & SATA Hard Drive Duplicator 유 영 테 크 닉 스 ( 주) (032)670-7880 www.yooyoung-tech.com 목차 1. 제품 소개... 4 1.1 특징... 4 1.2 개요... 4 1.3 Function table... 5 2. 기능 소개... 6 2.1 Copy...
歯15-ROMPLD.PDF
MSI & PLD MSI (Medium Scale Integrate Circuit) gate adder, subtractor, comparator, decoder, encoder, multiplexer, demultiplexer, ROM, PLA PLD (programmable logic device) fuse( ) array IC AND OR array sum
1
04단원 컴퓨터 소프트웨어 1. 프로그래밍 언어 2. 시스템 소프트웨어 1/10 1. 프로그래밍 언어 1) 프로그래밍 언어 구분 각종 프로그래밍 언어에 대해 알아보는 시간을 갖도록 하겠습니다. 우리가 흔히 접하는 소프트웨어 들은 프로그래밍 언어로 만들어지는데, 프로그래밍 언어는 크게 2가지로 나눌 수 있습니다. 1 저급어 : 0과 1로 구성되어 있어, 컴퓨터가
FMX M JPG 15MB 320x240 30fps, 160Kbps 11MB View operation,, seek seek Random Access Average Read Sequential Read 12 FMX () 2
FMX FMX 20062 () wwwexellencom sales@exellencom () 1 FMX 1 11 5M JPG 15MB 320x240 30fps, 160Kbps 11MB View operation,, seek seek Random Access Average Read Sequential Read 12 FMX () 2 FMX FMX D E (one
bn2019_2
arp -a Packet Logging/Editing Decode Buffer Capture Driver Logging: permanent storage of packets for offline analysis Decode: packets must be decoded to human readable form. Buffer: packets must temporarily
Microsoft PowerPoint os2.ppt [호환 모드]
![Microsoft PowerPoint os2.ppt [호환 모드]](/thumbs/97/131404076.jpg "Microsoft PowerPoint os2.ppt [호환 모드]")
2 장컴퓨터시스템구조 (Computer-System Structures) 컴퓨터시스템연산 (Computer System Operation) 입출력구조 (I/O Structure) 저장장치구조 (Storage Structure) 저장장치계층 (Storage Hierarchy) 하드웨어보호 (Hardware Protection) 일반적인시스템구조 (General
À±½Â¿í Ãâ·Â
Representation, Encoding and Intermediate View Interpolation Methods for Multi-view Video Using Layered Depth Images The multi-view video is a collection of multiple videos, capturing the same scene at
Orcad Capture 9.x
OrCAD Capture Workbook (Ver 10.xx) 0 Capture 1 2 3 Capture for window 4.opj ( OrCAD Project file) Design file Programe link file..dsn (OrCAD Design file) Design file..olb (OrCAD Library file) file..upd
Sharing Memory Between Drivers and Applications
본컬럼에대한모든저작권은 DevGuru에있습니다. 컬럼을타사이트등에기재및링크또는컬럼내용을인용시반드시출처를밝히셔야합니다. 컬럼들을 CD나기타매체로배포하고자할경우 DevGuru에동의를얻으셔야합니다. c DevGuru Corporation. All rights reserved 기타자세한질문사항들은웹게시판이나 support@devguru.co.kr 으로 문의하기바랍니다.
http://www.kbc.go.kr/ Abstract Competition and Concentration in the Market for the Multichannel Video Programming G h e e - Young Noh ( P r o f e s s o, rschool of Communication,
Integ
HP Integrity HP Chipset Itanium 2(Processor 9100) HP Integrity HP, Itanium. HP Integrity Blade BL860c HP Integrity Blade BL870c HP Integrity rx2660 HP Integrity rx3600 HP Integrity rx6600 2 HP Integrity
Microsoft PowerPoint - 알고리즘_2주차_1차시.pptx
1.4 Blocking Block의정의 디스크와메모리사이에데이터전송의단위 물리적레코드라고도함 Sector, Block, Cluster의비교 Sector: Data transfer 의최소단위 Block = n개의 sector로구성 디스크와메모리사이에데이터전송의단위 Cluster: m 개의 sector 로구성되며, FAT 구성단위 Cluster Block 영남대학교데이터베이스연구실
<30362E20C6EDC1FD2DB0EDBFB5B4EBB4D420BCF6C1A42E687770>
327 Journal of The Korea Institute of Information Security & Cryptology ISSN 1598-3986(Print) VOL.24, NO.2, Apr. 2014 ISSN 2288-2715(Online) http://dx.doi.org/10.13089/jkiisc.2014.24.2.327 개인정보 DB 암호화
10주차.key
10, Process synchronization (concurrently) ( ) => critical section ( ) / =>, A, B / Race condition int counter; Process A { counter++; } Process B { counter ;.. } counter++ register1 = counter register1
Something that can be seen, touched or otherwise sensed
Something that can be seen, touched or otherwise sensed Things about an object Weight Height Material Things an object does Pen writes Book stores words Water have Fresh water Rivers Oceans have
example code are examined in this stage The low pressure pressurizer reactor trip module of the Plant Protection System was programmed as subject for
2003 Development of the Software Generation Method using Model Driven Software Engineering Tool,,,,, Hoon-Seon Chang, Jae-Cheon Jung, Jae-Hack Kim Hee-Hwan Han, Do-Yeon Kim, Young-Woo Chang Wang Sik, Moon
디지털포렌식학회 논문양식
ISSN : 1976-5304 http://www.kdfs.or.kr Virtual Online Game(VOG) 환경에서의 디지털 증거수집 방법 연구 이 흥 복, 정 관 모, 김 선 영 * 대전지방경찰청 Evidence Collection Process According to the Way VOG Configuration Heung-Bok Lee, Kwan-Mo
목차 제 1 장 inexio Touch Driver소개... 3 1.1 소개 및 주요 기능... 3 1.2 제품사양... 4 제 2 장 설치 및 실행... 5 2.1 설치 시 주의사항... 5 2.2 설치 권고 사양... 5 2.3 프로그램 설치... 6 2.4 하드웨
최종 수정일: 2010.01.15 inexio 적외선 터치스크린 사용 설명서 [Notes] 본 매뉴얼의 정보는 예고 없이 변경될 수 있으며 사용된 이미지가 실제와 다를 수 있습니다. 1 목차 제 1 장 inexio Touch Driver소개... 3 1.1 소개 및 주요 기능... 3 1.2 제품사양... 4 제 2 장 설치 및 실행... 5 2.1 설치 시
TEL:02)861-1175, FAX:02)861-1176 , REAL-TIME,, ( ) CUSTOMER. CUSTOMER REAL TIME CUSTOMER D/B RF HANDY TEMINAL RF, RF (AP-3020) : LAN-S (N-1000) : LAN (TCP/IP) RF (PPT-2740) : RF (,RF ) : (CL-201)
vm-웨어-앞부속
VMware vsphere 4 This document was created using the official VMware icon and diagram library. Copyright 2009 VMware, Inc. All rights reserved. This product is protected by U.S. and international copyright
○ 제2조 정의에서 기간통신역무의 정의와 EU의 전자커뮤니케이션서비스 정의의 차이점은
이동전화시장 경쟁활성화를 위한 MVNO 추진을 바라보며 김원식 1) 1. 들어가며 최근 이동전화의 무선재판매 시장 활성화 등을 위해 정보통신부가 준비한 전기통신사업 법 개정안 공청회에서 무선재판매의무제 관련규정을 둘러싸고 전문가들의 우려와 지적이 상당하였다. 우선 무선재판매 제도 도입의 배경을 살펴보자. 직접적 배경으로는 국내 이동전화 요금에 대한 이용자들의
(72) 발명자 이동희 서울 동작구 여의대방로44길 10, 101동 802호 (대 방동, 대림아파트) 노삼혁 서울 중구 정동길 21-31, B동 404호 (정동, 정동상 림원) 이 발명을 지원한 국가연구개발사업 과제고유번호 2010-0025282 부처명 교육과학기술부
(19) 대한민국특허청(KR) (12) 등록특허공보(B1) (45) 공고일자 2015년01월13일 (11) 등록번호 10-1480424 (24) 등록일자 2015년01월02일 (51) 국제특허분류(Int. Cl.) G06F 12/00 (2006.01) G11C 16/00 (2006.01) (21) 출원번호 10-2013-0023977 (22) 출원일자 2013년03월06일
금오공대 컴퓨터공학전공 강의자료
데이터베이스및설계 Chap 1. 데이터베이스환경 (#2/2) 2013.03.04. 오병우 컴퓨터공학과 Database 용어 " 데이타베이스 용어의기원 1963.6 제 1 차 SDC 심포지움 컴퓨터중심의데이타베이스개발과관리 Development and Management of a Computer-centered Data Base 자기테이프장치에저장된데이터파일을의미
PJTROHMPCJPS.hwp
제 출 문 농림수산식품부장관 귀하 본 보고서를 트위스트 휠 방식 폐비닐 수거기 개발 과제의 최종보고서로 제출 합니다. 2008년 4월 24일 주관연구기관명: 경 북 대 학 교 총괄연구책임자: 김 태 욱 연 구 원: 조 창 래 연 구 원: 배 석 경 연 구 원: 김 승 현 연 구 원: 신 동 호 연 구 원: 유 기 형 위탁연구기관명: 삼 생 공 업 위탁연구책임자:
Page 2 of 6 Here are the rules for conjugating Whether (or not) and If when using a Descriptive Verb. The only difference here from Action Verbs is wh
Page 1 of 6 Learn Korean Ep. 13: Whether (or not) and If Let s go over how to say Whether and If. An example in English would be I don t know whether he ll be there, or I don t know if he ll be there.
- i - - ii - - iii - - iv - - v - - vi - - 1 - - 2 - - 3 - 1) 통계청고시제 2010-150 호 (2010.7.6 개정, 2011.1.1 시행 ) - 4 - 요양급여의적용기준및방법에관한세부사항에따른골밀도검사기준 (2007 년 11 월 1 일시행 ) - 5 - - 6 - - 7 - - 8 - - 9 - - 10 -
Page 2 of 5 아니다 means to not be, and is therefore the opposite of 이다. While English simply turns words like to be or to exist negative by adding not,
Page 1 of 5 Learn Korean Ep. 4: To be and To exist Of course to be and to exist are different verbs, but they re often confused by beginning students when learning Korean. In English we sometimes use the
untitled
SAS Korea / Professional Service Division 2 3 Corporate Performance Management Definition ý... is a system that provides organizations with a method of measuring and aligning the organization strategy
MAX+plus II Getting Started - 무작정따라하기
무작정 따라하기 2001 10 4 / Version 20-2 0 MAX+plus II Digital, Schematic Capture MAX+plus II, IC, CPLD FPGA (Logic) ALTERA PLD FLEX10K Series EPF10K10QC208-4 MAX+plus II Project, Schematic, Design Compilation,
결과보고서
오픈 소스 데이터베이스 시스템을 이용한 플래시 메모리 SSD 기반의 질의 최적화 기법 연구 A Study on Flash-based Query Optimizing in PostgreSQL 황다솜 1) ㆍ안미진 1) ㆍ이혜지 1) ㆍ김지민 2) ㆍ정세희 2) ㆍ이임경 3) ㆍ차시언 3) 성균관대학교 정보통신대학 1) ㆍ시흥매화고등학교 2) ㆍ용화여자고등학교 3)
02이용배(239~253)ok
A study on the characteristic of land use in subcenter of Seoul. - Cases of Yeongdeungpo and Kangnam Ok Kyung Yuh* Yong-Bae Lee**,. 2010,,..,.,,,,.,,.,,.,,,, Abstract : This study analyzed the land use
<313120C0AFC0FCC0DA5FBECBB0EDB8AEC1F2C0BB5FC0CCBFEBC7D15FB1E8C0BAC5C25FBCF6C1A42E687770>
한국지능시스템학회 논문지 2010, Vol. 20, No. 3, pp. 375-379 유전자 알고리즘을 이용한 강인한 Support vector machine 설계 Design of Robust Support Vector Machine Using Genetic Algorithm 이희성 홍성준 이병윤 김은태 * Heesung Lee, Sungjun Hong,
TTA Verified : HomeGateway :, : (NEtwork Testing Team)
TTA Verified : HomeGateway :, : (NEtwork Testing Team) : TTA-V-N-05-006-CC11 TTA Verified :2006 6 27 : 01 : 2005 7 18 : 2/15 00 01 2005 7 18 2006 6 27 6 7 9 Ethernet (VLAN, QoS, FTP ) (, ) : TTA-V-N-05-006-CC11
다음 사항을 꼭 확인하세요! 도움말 안내 - 본 도움말에는 iodd2511 조작방법 및 활용법이 적혀 있습니다. - 본 제품 사용 전에 안전을 위한 주의사항 을 반드시 숙지하십시오. - 문제가 발생하면 문제해결 을 참조하십시오. 중요한 Data 는 항상 백업 하십시오.
메 뉴 다음 사항을 꼭 확인하세요! --------------------------------- 2p 안전을 위한 주의 사항 --------------------------------- 3p 구성품 --------------------------------- 4p 각 부분의 명칭 --------------------------------- 5p 제품의 규격
아니라 일본 지리지, 수로지 5, 지도 6 등을 함께 검토해야 하지만 여기서는 근대기 일본이 편찬한 조선 지리지와 부속지도만으로 연구대상을 한정하 기로 한다. Ⅱ. 1876~1905년 울릉도 독도 서술의 추이 1. 울릉도 독도 호칭의 혼란과 지도상의 불일치 일본이 조선
근대기 조선 지리지에 보이는 일본의 울릉도 독도 인식 호칭의 혼란을 중심으로 Ⅰ. 머리말 이 글은 근대기 일본인 편찬 조선 지리지에 나타난 울릉도 독도 관련 인식을 호칭의 변화에 초점을 맞춰 고찰한 것이다. 일본은 메이지유신 이후 부국강병을 기도하는 과정에서 수집된 정보에 의존하여 지리지를 펴냈고, 이를 제국주의 확장에 원용하였다. 특히 일본이 제국주의 확장을
Buy one get one with discount promotional strategy
Buy one get one with discount Promotional Strategy Kyong-Kuk Kim, Chi-Ghun Lee and Sunggyun Park ISysE Department, FEG 002079 Contents Introduction Literature Review Model Solution Further research 2 ISysE
歯1.PDF
200176 .,.,.,. 5... 1/2. /. / 2. . 293.33 (54.32%), 65.54(12.13%), / 53.80(9.96%), 25.60(4.74%), 5.22(0.97%). / 3 S (1997)14.59% (1971) 10%, (1977).5%~11.5%, (1986)
초보자를 위한 분산 캐시 활용 전략
초보자를위한분산캐시활용전략 강대명 charsyam@naver.com 우리가꿈꾸는서비스 우리가꿈꾸는서비스 우리가꿈꾸는서비스 우리가꿈꾸는서비스 그러나현실은? 서비스에필요한것은? 서비스에필요한것은? 핵심적인기능 서비스에필요한것은? 핵심적인기능 서비스에필요한것은? 핵심적인기능 서비스에필요한것은? 적절한기능 서비스안정성 트위터에매일고래만보이면? 트위터에매일고래만보이면?
#Ȳ¿ë¼®
http://www.kbc.go.kr/ A B yk u δ = 2u k 1 = yk u = 0. 659 2nu k = 1 k k 1 n yk k Abstract Web Repertoire and Concentration Rate : Analysing Web Traffic Data Yong - Suk Hwang (Research
No Slide Title
Copyright, 2001 Multimedia Lab., CH 3. COM object (In-process server) Eun-sung Lee twoss@mmlab.net Multimedia Lab. Dept. of Electrical and Computer Eng. University of Seoul Seoul, Korea 0. Contents 1.
KDTÁ¾ÇÕ-1-07/03
CIMON-PLC CIMON-SCADA CIMON-TOUCH CIMON-Xpanel www.kdtsys.com CIMON-PLC Total Solution for Industrial Automation PLC (Program Logic Controller) Sphere 8 Total Solution For Industrial Automation PLC Application
저작자표시 - 비영리 - 변경금지 2.0 대한민국 이용자는아래의조건을따르는경우에한하여자유롭게 이저작물을복제, 배포, 전송, 전시, 공연및방송할수있습니다. 다음과같은조건을따라야합니다 : 저작자표시. 귀하는원저작자를표시하여야합니다. 비영리. 귀하는이저작물을영리목적으로이용할
저작자표시 - 비영리 - 변경금지 2.0 대한민국 이용자는아래의조건을따르는경우에한하여자유롭게 이저작물을복제, 배포, 전송, 전시, 공연및방송할수있습니다. 다음과같은조건을따라야합니다 : 저작자표시. 귀하는원저작자를표시하여야합니다. 비영리. 귀하는이저작물을영리목적으로이용할수없습니다. 변경금지. 귀하는이저작물을개작, 변형또는가공할수없습니다. 귀하는, 이저작물의재이용이나배포의경우,
Oracle Database 10g: Self-Managing Database DB TSC
Oracle Database 10g: Self-Managing Database DB TSC Agenda Overview System Resource Application & SQL Storage Space Backup & Recovery ½ Cost ? 6% 12 % 6% 6% 55% : IOUG 2001 DBA Survey ? 6% & 12 % 6% 6%
지능정보연구제 16 권제 1 호 2010 년 3 월 (pp.71~92),.,.,., Support Vector Machines,,., KOSPI200.,. * 지능정보연구제 16 권제 1 호 2010 년 3 월
지능정보연구제 16 권제 1 호 2010 년 3 월 (pp.71~92),.,.,., Support Vector Machines,,., 2004 5 2009 12 KOSPI200.,. * 2009. 지능정보연구제 16 권제 1 호 2010 년 3 월 김선웅 안현철 社 1), 28 1, 2009, 4. 1. 지능정보연구제 16 권제 1 호 2010 년 3 월 Support
The_IDA_Pro_Book
The IDA Pro Book Hacking Group OVERTIME force (forceteam01@gmail.com) GETTING STARTED WITH IDA IDA New : Go : IDA Previous : IDA File File -> Open Processor type : Loading Segment and Loading Offset x86
Microsoft PowerPoint - Master-ChiWeon_Yoon.ppt
고속 Row Cycle 동작이가능한 VPM (Virtual Pipelined Memory) 구조에 대한연구 1998. 12. 28. 윤치원 1 발표순서 연구의필요성 관련연구 VCM (Virtual Channel Memory) POPeye : 메모리시스템성능측정기 POPeye를이용한 VCM 분석 VPM (Virtual Pipelined Memory) 결론및추후과제