Trojan Horse
Scavenging
Logic Bomb
Salami technique
Data diddling
Superzapping
Trap door
Asynchronous Attack
공통적인 습성이라))^^
14년 전
수요일, 5월 31, 2006
수요일, 5월 24, 2006
참지 말고 배출하세요.
- 변과 방귀를 참으면 대장암에 걸리나요?
= 변과 방귀를 참는다고 대장암에 걸리지는 않는다. 그러나 변과 방귀를 참는 것은 불필요한 독소를 몸 안에 품고 있는 일이므로 참지 말고 그 때 그 때 배출하는 것이 좋다.
출처 : 한겨레 신문 5월 24일자.
= 변과 방귀를 참는다고 대장암에 걸리지는 않는다. 그러나 변과 방귀를 참는 것은 불필요한 독소를 몸 안에 품고 있는 일이므로 참지 말고 그 때 그 때 배출하는 것이 좋다.
출처 : 한겨레 신문 5월 24일자.
화요일, 5월 23, 2006
강사가 되다.
강사가 되게 되었다..
숭실대 이상준 교수님 덕분에 BIT 컴퓨터 강사 자리를 구하게 됐다. 21시간 강의에 70정도의 pay이니 대략 시간당 3만원꼴.
그런데...거기에 이어서 숭실대의 공학인증 프로그램의 일환으로 기업체 전문인력의 특강 프로그램의 강사로 와보겠냐는 제의를 해주셨다. pay도 아주 두둑했다..오호라..이런 재쑤가.
열심히 준비해서, 잘 해봐야지.
기회가 왔을때 달려들어야지.
숭실대 이상준 교수님 덕분에 BIT 컴퓨터 강사 자리를 구하게 됐다. 21시간 강의에 70정도의 pay이니 대략 시간당 3만원꼴.
그런데...거기에 이어서 숭실대의 공학인증 프로그램의 일환으로 기업체 전문인력의 특강 프로그램의 강사로 와보겠냐는 제의를 해주셨다. pay도 아주 두둑했다..오호라..이런 재쑤가.
열심히 준비해서, 잘 해봐야지.
기회가 왔을때 달려들어야지.
토요일, 5월 20, 2006
home coming day
ctclab의 homecoming day에 갔다왔다.
피자로 점심을 대강 먹고, 이문규 교수님의 최근연구현황 발표..그리고, 소프트볼까지..
선후배, 동기들을 만나니 예전의 학생시절이 생각나고,
다시 그 학창시절로 돌아가게 되었다는 감회가 새로웠다.
교수님께서는 미국생활하려면 aggressive해야한다고 성향을 바꾸도록 노력하라고 하셨다.
저녁식사와 술자리는 생략..
간만에 운동을 했더니 허벅지, 종아리, 발목, 발바닥 근육피로감이 -_-;;
운동좀 꾸준히 해야겠다.
체력은 학력 -_-;;
피자로 점심을 대강 먹고, 이문규 교수님의 최근연구현황 발표..그리고, 소프트볼까지..
선후배, 동기들을 만나니 예전의 학생시절이 생각나고,
다시 그 학창시절로 돌아가게 되었다는 감회가 새로웠다.
교수님께서는 미국생활하려면 aggressive해야한다고 성향을 바꾸도록 노력하라고 하셨다.
저녁식사와 술자리는 생략..
간만에 운동을 했더니 허벅지, 종아리, 발목, 발바닥 근육피로감이 -_-;;
운동좀 꾸준히 해야겠다.
체력은 학력 -_-;;
월요일, 5월 15, 2006
dinner with ex-colleagues at suwon
이제 나에게는 '옛' 동료인 삼성전자의 옛 부서 동료들을 만났다.
회사 앞에서 만났는데, 며칠전까지 출근하던 것 같은 느낌이 들었다.
사당역에서 7001번인가 7701인가 영통가는 것을 타고 원천유원지 앞에서 내렸는데,
오..꽤 멀었다. 한 20분은 걸은 것 같다.
고생들은 하고 있겠지만, 그래도 경제적으로는 대부분 나보다 훨씬 나은 처지일테니
그점은 조금 부러웠다. 그리고, 불확실한 부분보다는 확실한 부분이 더 많은 미래인 것도..
회사다니면서 했던 고민들, 고생들도 이젠 추억으로 남는 것 같다.
하긴...불합격할 까봐 전전긍긍하던 그 시기의 고민도 이제는 추억으로 남는 것 같다.
세상이 무섭고, 힘들다는 것도 알았지만, 반면에 어느 정도 자신감도 생긴다.
재미있었다.
회사 앞에서 만났는데, 며칠전까지 출근하던 것 같은 느낌이 들었다.
사당역에서 7001번인가 7701인가 영통가는 것을 타고 원천유원지 앞에서 내렸는데,
오..꽤 멀었다. 한 20분은 걸은 것 같다.
고생들은 하고 있겠지만, 그래도 경제적으로는 대부분 나보다 훨씬 나은 처지일테니
그점은 조금 부러웠다. 그리고, 불확실한 부분보다는 확실한 부분이 더 많은 미래인 것도..
회사다니면서 했던 고민들, 고생들도 이젠 추억으로 남는 것 같다.
하긴...불합격할 까봐 전전긍긍하던 그 시기의 고민도 이제는 추억으로 남는 것 같다.
세상이 무섭고, 힘들다는 것도 알았지만, 반면에 어느 정도 자신감도 생긴다.
재미있었다.
토요일, 5월 13, 2006
기숙사.
기숙사 신청서를 너무 늦게 냈나보다. 이미 한탕 기숙사 offer를 보냈덴다. 짜브....
We have made a number of lease offers already and if all of these students accept them, we will be full.
짜브..
We have made a number of lease offers already and if all of these students accept them, we will be full.
짜브..
수요일, 5월 10, 2006
월요일, 5월 08, 2006
I-20 도착
PSU로 부터 I-20이 도착했다. student용과 dependant용이 왔다.
그리고, 학교 안내 소책자와 University Health Service에서 신체검사 받아야 한다는 통지,
등이 왔다.
이제 드디어 유학생활이 시작되는 느낌이다.
두번째 학창생활이 될텐데, 이번에는 성공적으로 마쳐야지.
그리고, 학교 안내 소책자와 University Health Service에서 신체검사 받아야 한다는 통지,
등이 왔다.
이제 드디어 유학생활이 시작되는 느낌이다.
두번째 학창생활이 될텐데, 이번에는 성공적으로 마쳐야지.
UPS express로 보냈다. 5월 5일 (PT)에 보냈는데 5월8일 12시경에 한국에 내 집에서 받았다. 빠르다.
이렇게 생긴 학교봉투에 담겨서 왔다.
International Student Pre-arrival Guide booklet
I-20 서류- 학생용과 dependant용 두개가 왔다.
그리고, 그 밖에 안내 서류들이 같이 왔다.
토요일, 5월 06, 2006
candidacy exam관련 과목
Candidacy Exam A
CSE 428. PROGRAMMING LANGUAGE CONCEPTS Fundamental concepts of programming language design, specification, and implementation; programming language paradigms and features; program verification.
강의 URL : http://www.cse.psu.edu/~cg428/
CSE 465. DATA STRUCTURES AND ALGORITHMS Fundamental concepts of computer science: data structures, analysis of algorithms, recursion, trees, sets, graphs, sorting.
강의 URL : http://www.cse.psu.edu/~cg465/
Candidacy Exam B
CSE 411. OPERATING SYSTEMS Design and implementation of computer operating systems; management of various system resources: processes, memory, processors, files, input/output devices.
강의 URL : http://www.cse.psu.edu/~cg411/
CSE 431. INTRODUCTION TO COMPUTER ARCHITECTURE Principles of computer architecture: memory hierarchies and design, I/O organization and design, CPU design and advanced processors.
강의 URL : http://www.cse.psu.edu/~cg431/
CSE 428. PROGRAMMING LANGUAGE CONCEPTS Fundamental concepts of programming language design, specification, and implementation; programming language paradigms and features; program verification.
강의 URL : http://www.cse.psu.edu/~cg428/
CSE 465. DATA STRUCTURES AND ALGORITHMS Fundamental concepts of computer science: data structures, analysis of algorithms, recursion, trees, sets, graphs, sorting.
강의 URL : http://www.cse.psu.edu/~cg465/
Candidacy Exam B
CSE 411. OPERATING SYSTEMS Design and implementation of computer operating systems; management of various system resources: processes, memory, processors, files, input/output devices.
강의 URL : http://www.cse.psu.edu/~cg411/
CSE 431. INTRODUCTION TO COMPUTER ARCHITECTURE Principles of computer architecture: memory hierarchies and design, I/O organization and design, CPU design and advanced processors.
강의 URL : http://www.cse.psu.edu/~cg431/
PSU CSE PhD degree requirements
PSU의 CSE department에 게시된 내용.
Doctor of Philosophy in Computer Science and Engineering
PLEASE NOTE: Students applying for and gaining admittance to the Ph.D. program will not be permitted to switch to the master's program at a later date, except under extenuating circumstances.
2. Graduate Courses--students must accumulate a minimum of 48 credits of non-thesis graduate level courses, with at least 27 credits of courses with numbers CSE 500-589 or CSE 598, and 21 additional credits of 400 level and above courses. This must include 3 credits of CSE 590 [colloquium; only 3 credits of CSE 590 can be counted towards the 48 minimum credits]. A maximum of 3 credits of X96 also can be counted. At most, 3 credits of background course work can be used to satisfy the degree requirements.
3. Ph.D. candidacy examination--candidacy examination consisting of:
a) CSE 591 Research Experience in Computer Science and Engineering [1 credit]--must be completed within the first two regular semesters after entering the Ph.D. program; can only be taken once, and
b) Written examination--must be completed during the first three regular semesters after entering the program; explicitly, both Exam A and Exam B must be attempted (with a strong effort demonstrated in each Exam each time it is attempted), no later than the second regular semester, and completed no later than the third regular semester after entering the program. If you choose to take the candidacy exams during your first semester in the program, you will have an additional opportunity (three chances) to past the candidacy by the end of the third semester in residence.
4. Comprehensive examination--student must pass the Ph.D. comprehensive examination, and the English competency and communication requirements.
5. Dissertation--students must complete and defend a Ph.D. thesis.
6. English Competency Assessment--all incoming Ph.D. students will have their English competencies assessed. Students whose native language is English will have their writing and presentational speaking competencies assessed. International students will have their writing, oral, and presentational speaking competencies assessed. These assessments will take place in each fall and spring or summer semester. Based on the results of these assessments, students with documented deficiencies will be required to pursue one or several opportunities that are identified for appropriate skill enhancement.ExceptionIn very rare situations, petitions will be considered for acceptance of certain CSE 597 course offerings (or a related course from another department) as meeting the requirements for master's and doctoral degrees. These petitions can only be submitted with prior approval of and strong support from your advisor; they will only be entertained under extenuating circumstances such as the late cancellation of a required course. Petitions should be submitted to the graduate officer, for consideration by the graduate committee.
Doctor of Philosophy in Computer Science and Engineering
PLEASE NOTE: Students applying for and gaining admittance to the Ph.D. program will not be permitted to switch to the master's program at a later date, except under extenuating circumstances.
1. Students who are entering the Ph.D. program with a Master of Science degree can count up to 30 credits to satisfy item 2) below.
2. Graduate Courses--students must accumulate a minimum of 48 credits of non-thesis graduate level courses, with at least 27 credits of courses with numbers CSE 500-589 or CSE 598, and 21 additional credits of 400 level and above courses. This must include 3 credits of CSE 590 [colloquium; only 3 credits of CSE 590 can be counted towards the 48 minimum credits]. A maximum of 3 credits of X96 also can be counted. At most, 3 credits of background course work can be used to satisfy the degree requirements.
Background courses--students must demonstrate knowledge in:
CSE 411 (Operating Systems),
CSE 431 (Introduction to Computer Architecture),
CSE 428 (Programming Languages),
CSE 465 (Data Structures and Algorithms), and
CSE 471 (Logical Design...) or CSE 468 (Theory of Automata).
Group A--Architecture and Communication Systems
CSE 513 (Distributed Systems)
CSE 514 (Computer Networks)
CSE 515 (Reliable Data Communications)
CSE 517 (Performance Evaluation)
CSE 530 (Fundamentals of Computer Architecture)
CSE 554 (Error Correcting Codes for Computers and Communication)
Group B--Systems
CSE 511 (Operating System Design)
CSE 520 (Science of Computer Programming)
CSE 521 (Compiler Construction)
CSE 522 (Semantics of Programming Languages)
CSE 541 (Database Systems I)
CSE 543 (Computer Security)
Group C--Theory
CSE 550 (Numerical Linear Algebra)
CSE 561 (Sequential and Parallel Complexity Theory)
CSE 565 (Algorithm Design and Analysis)
CSE 568 (Theory of Formal Languages and Automata)
CSE 588 (Complexity in Computer Algebra)
Group D--Application
CSE 557 (Concurrent Matrix Computation)
CSE 583 (Pattern Recognition)
CSE 585 (Digital Image Processing II)
CSE 586 (Topics in Computer Vision)
Group E--Hardware Systems Design
CSE 571 (Switching and Sequential Machine Theory)
CSE 572 (Microprocessors and Systems Design)
CSE 575 (Architecture of Arithmetic Processors)
CSE 577 (VLSI Systems Design)
CSE 578 (VLSI Computer-Aided Design Tools)
3. Ph.D. candidacy examination--candidacy examination consisting of:
a) CSE 591 Research Experience in Computer Science and Engineering [1 credit]--must be completed within the first two regular semesters after entering the Ph.D. program; can only be taken once, and
b) Written examination--must be completed during the first three regular semesters after entering the program; explicitly, both Exam A and Exam B must be attempted (with a strong effort demonstrated in each Exam each time it is attempted), no later than the second regular semester, and completed no later than the third regular semester after entering the program. If you choose to take the candidacy exams during your first semester in the program, you will have an additional opportunity (three chances) to past the candidacy by the end of the third semester in residence.
4. Comprehensive examination--student must pass the Ph.D. comprehensive examination, and the English competency and communication requirements.
5. Dissertation--students must complete and defend a Ph.D. thesis.
6. English Competency Assessment--all incoming Ph.D. students will have their English competencies assessed. Students whose native language is English will have their writing and presentational speaking competencies assessed. International students will have their writing, oral, and presentational speaking competencies assessed. These assessments will take place in each fall and spring or summer semester. Based on the results of these assessments, students with documented deficiencies will be required to pursue one or several opportunities that are identified for appropriate skill enhancement.ExceptionIn very rare situations, petitions will be considered for acceptance of certain CSE 597 course offerings (or a related course from another department) as meeting the requirements for master's and doctoral degrees. These petitions can only be submitted with prior approval of and strong support from your advisor; they will only be entertained under extenuating circumstances such as the late cancellation of a required course. Petitions should be submitted to the graduate officer, for consideration by the graduate committee.
금요일, 5월 05, 2006
PSU Candidacy Exam
좋은 학생 되기 1탄.
첫학기에 candidacy exam을 통과하기 위해 공부를 해야겠다.
====================================================
EXAM A covers the following topics:
I. Data Structures and Algorithms
Representation of Basic Data Structures: arrays, stacks, queues, linked lists, trees, graphs, binary search trees, balanced trees, hash tables.
Algorithmic Design Techniques: divide and conquer, greedy, dynamic programming.
Sorting and Order Statistics.
Graph Algorithms: searching, minimum spanning trees, shortest paths (single-source and all-pairs).
Growth of Functions, Recurrences and Time Analysis.
CLR 책 보면 되긴 할거 같다. 이 과목은 어느 정도 족보 - -;; 만 있으면 통과될 수 있지 않을까 싶다.
II. Programming Languages
Syntax: context free grammars, parsing [Sethi, Ch. 2]
Data Types and Representation [Sethi, Ch. 3]
Procedure Activations: parameter passing mechanisms, scope, activation records [Sethi, Ch. 5]
Functional Programming: standard ML, higher-order programming, simple and polymorphic types, type inference [Sethi, Ch. 8-9; Reade, Ch 1-3,5]
Logic Programming: prolog [Sethi, Ch 11]
Operational Semantics and Type Systems [Sethi, Ch. 13.3; Reade, Ch. 11; lectures notes (last semester of record) for course CSE 428 (see web page: http://www.cse.psu.edu/~cg428/)]
Inductive Proofs (Structural Induction) [Reade 3.7, 5.4]
The Lambda Calculus and the Typed Lambda Calculus [Sethi Ch. 14; Reade Ch. 12]
Concurrency in Java [Arnold and Gosling Ch. 9]
이 과목은 책도 없고...공부좀 해야할거 같다. 토플 아르바이트로 받은 돈 입금되면 책부터 사야겠다.
The following Penn State courses are recommended as providing a minimal background in the above topics: CSE 428 and CSE 465. We suggest looking at the exams of the last two semesters on record, and at the "Exercises for the final exam" of the last semester on record for course CSE 428 (see web page: http://www.cse.psu.edu/~cg428/).
Suggested references:
Arnold and Gosling. The Java Programming Language (Second Edition). Addison-Wesley, 1997.
Cormen, Leiserson, and Rivest. Introduction to Algorithms. MIT Press, 1990.
Lewis and Denenberg. Data Structures and Their Algorithms. Harper Collins, 1991.
Reade. Elements of Functional Programming. Addison-Wesley, 1989.
Sethi. Programming Languages: Concepts and Constructs (Second Edition). Addison-Wesley, 1996. Vicki Keller, Graduate Secretary (contact: vicki@cse.psu.edu)
====================================
EXAM B covers the following topics:
I. Operating Systems
Process Management: processes, threads, context switching, scheduling, interprocess communication.
Memory Management: virtual memory, swapping, allocation/de-allocation, paging, segmentation.
Input-Output: devices, device interface, I/O software.
File Systems: structure, management, directories, user interface, protection.
Protection: protection domains, access rights, capabilities.
Concurrent Programming: synchronization problems, synchronization mechanisms, deadlocks.
OS.. 이 과목도 책 좀 보면 될 거 같다.
II. Computer Architecture and Organization
Arithmetic Circuits: design and analysis of arithmetic circuits (adders, multipliers, dividers, etc.); floating point representations and operations.
CPU Design: hardware description languages; datapath design and busing structures, pipelined datapath data and control hazards; control unit design.
Processor Design: instruction sets; addressing modes; performance metrics; architectural support for subroutine calls and interrupt handling.
Memory Systems: memory hierarchy and memory types; cache memory designs; architectural support for virtual memories.
I/O Systems: types and characteristics of I/O devices; I/O device interfacing (I/O buses, interrupts, DMA, etc.)
The following Penn State courses are recommended as providing a minimal background in the above topics: CSE 411 and CSE 431.
컴퓨터 구조...족보만 있으면 어느 정도 통과할 수 있지 않을까 싶다.
Suggested references:
Silberschatz and Galvin. Operating Systems Concepts (Fourth Edition). Addison-Wesley, 1994.
Tanenbaum. Modern Operating Systems. Prentice Hall, 1992.
Goodman and Miller. A Programmer's View of Computer Architecture. Saunders, 1993.
Patterson and Hennessy. Computer Organization and Design: The Hardware/Software Interface. Morgan Kaufmann, 1994.
Waser and Flynn (Ch 3, 4, 5). Introduction to Arithmetic for Digital Systems Designers. Holt, Rinehart and Winston, 1982.
link에 가보니 이미 먼가 정보가 바뀐 것 같다. graduate secretary에게 한번 문의해봐야겠다. 이미 5월5일이다. 먼저 5월7일 ~ 6월 7일은 Data Structures and Algorithms. 6월 7일 ~ 7월 7일은 Programming Language를 보고, 7월7일부터 출국전까지는 족보분석에 들어가야겠다.
첫학기에 candidacy exam을 통과하기 위해 공부를 해야겠다.
====================================================
EXAM A covers the following topics:
I. Data Structures and Algorithms
Representation of Basic Data Structures: arrays, stacks, queues, linked lists, trees, graphs, binary search trees, balanced trees, hash tables.
Algorithmic Design Techniques: divide and conquer, greedy, dynamic programming.
Sorting and Order Statistics.
Graph Algorithms: searching, minimum spanning trees, shortest paths (single-source and all-pairs).
Growth of Functions, Recurrences and Time Analysis.
CLR 책 보면 되긴 할거 같다. 이 과목은 어느 정도 족보 - -;; 만 있으면 통과될 수 있지 않을까 싶다.
II. Programming Languages
Syntax: context free grammars, parsing [Sethi, Ch. 2]
Data Types and Representation [Sethi, Ch. 3]
Procedure Activations: parameter passing mechanisms, scope, activation records [Sethi, Ch. 5]
Functional Programming: standard ML, higher-order programming, simple and polymorphic types, type inference [Sethi, Ch. 8-9; Reade, Ch 1-3,5]
Logic Programming: prolog [Sethi, Ch 11]
Operational Semantics and Type Systems [Sethi, Ch. 13.3; Reade, Ch. 11; lectures notes (last semester of record) for course CSE 428 (see web page: http://www.cse.psu.edu/~cg428/)]
Inductive Proofs (Structural Induction) [Reade 3.7, 5.4]
The Lambda Calculus and the Typed Lambda Calculus [Sethi Ch. 14; Reade Ch. 12]
Concurrency in Java [Arnold and Gosling Ch. 9]
이 과목은 책도 없고...공부좀 해야할거 같다. 토플 아르바이트로 받은 돈 입금되면 책부터 사야겠다.
The following Penn State courses are recommended as providing a minimal background in the above topics: CSE 428 and CSE 465. We suggest looking at the exams of the last two semesters on record, and at the "Exercises for the final exam" of the last semester on record for course CSE 428 (see web page: http://www.cse.psu.edu/~cg428/).
Suggested references:
Arnold and Gosling. The Java Programming Language (Second Edition). Addison-Wesley, 1997.
Cormen, Leiserson, and Rivest. Introduction to Algorithms. MIT Press, 1990.
Lewis and Denenberg. Data Structures and Their Algorithms. Harper Collins, 1991.
Reade. Elements of Functional Programming. Addison-Wesley, 1989.
Sethi. Programming Languages: Concepts and Constructs (Second Edition). Addison-Wesley, 1996. Vicki Keller, Graduate Secretary (contact: vicki@cse.psu.edu)
====================================
EXAM B covers the following topics:
I. Operating Systems
Process Management: processes, threads, context switching, scheduling, interprocess communication.
Memory Management: virtual memory, swapping, allocation/de-allocation, paging, segmentation.
Input-Output: devices, device interface, I/O software.
File Systems: structure, management, directories, user interface, protection.
Protection: protection domains, access rights, capabilities.
Concurrent Programming: synchronization problems, synchronization mechanisms, deadlocks.
OS.. 이 과목도 책 좀 보면 될 거 같다.
II. Computer Architecture and Organization
Arithmetic Circuits: design and analysis of arithmetic circuits (adders, multipliers, dividers, etc.); floating point representations and operations.
CPU Design: hardware description languages; datapath design and busing structures, pipelined datapath data and control hazards; control unit design.
Processor Design: instruction sets; addressing modes; performance metrics; architectural support for subroutine calls and interrupt handling.
Memory Systems: memory hierarchy and memory types; cache memory designs; architectural support for virtual memories.
I/O Systems: types and characteristics of I/O devices; I/O device interfacing (I/O buses, interrupts, DMA, etc.)
The following Penn State courses are recommended as providing a minimal background in the above topics: CSE 411 and CSE 431.
컴퓨터 구조...족보만 있으면 어느 정도 통과할 수 있지 않을까 싶다.
Suggested references:
Silberschatz and Galvin. Operating Systems Concepts (Fourth Edition). Addison-Wesley, 1994.
Tanenbaum. Modern Operating Systems. Prentice Hall, 1992.
Goodman and Miller. A Programmer's View of Computer Architecture. Saunders, 1993.
Patterson and Hennessy. Computer Organization and Design: The Hardware/Software Interface. Morgan Kaufmann, 1994.
Waser and Flynn (Ch 3, 4, 5). Introduction to Arithmetic for Digital Systems Designers. Holt, Rinehart and Winston, 1982.
link에 가보니 이미 먼가 정보가 바뀐 것 같다. graduate secretary에게 한번 문의해봐야겠다. 이미 5월5일이다. 먼저 5월7일 ~ 6월 7일은 Data Structures and Algorithms. 6월 7일 ~ 7월 7일은 Programming Language를 보고, 7월7일부터 출국전까지는 족보분석에 들어가야겠다.
피드 구독하기:
글 (Atom)
글
