Post Job Free
Sign in

Management Engineer

Location:
India
Posted:
December 01, 2012

Contact this candidate

Resume:

Title:No Title

*****@****.****.*******.**.**

Document

Source below

NAME:,

ADDRESS:

ADDRESS2:

CITY:

STATE:

ZIP:

CANDIDATE ID: 2551888

US CITIZENSHIP:

EDUCATION:

EXPERIENCE: 0

WILL RELOCATE: No -

JOB WANTED:

RATE NEEDED:

TELEPHONE: 386-***-****

EMAIL: *****@****.****.*******.**.**

HOMEPAGE:

COMMENTS:

HOTTEST SKILLS: programming, multimedia, database, sql, engineer, c++, oracle,

programmer, unix, communication, html, java, mathematica, risc, software engineer,

presentation, statistics, chemist, chemistry, genetic

REVISION: 07-SEP-02

RESUME:

Resume

Personal Details

Name Sangyong Shim

Date of Birth 2 July 1974

Sex Male

Residential Status Australian Citizen

Place of Birth Korea

Address 10 Warrawong St

Eastwood N.S.W

2122

Phone No. (02) 9804 6630

(0410) 567 338

Educational Background

Tertiary Education

1995

- Current The University of New South Wales

Bachelor of Engineering

(Computer

Engineering

)

Secondary Education

1992

- 1994 St. Ives High School

Tertiary Entrance Rank = 96.90

Subjects Studied : 2 unit Contemporary

English, 4 unit Math, Physics, Chemistry,

2 unit Japanese

Work Experience

Nov 1998

- Feb 1999Samsung Electronics Co Ltd

.

Assistant Programmer

in Printer R/D Division

Mar 1999

- Apr 1999Samsung SDS Co Ltd

.Contract Programmer for Dental Project using

C++

Technical Summary

Tools/ Environments Last Used Rating

Modular 2 Dec 1997 7

C Current 8

SQL/ PL SQL Dec 1998 9

Oracle 7 Dec 1998 8

HTML Current 7

MIPS Dec 1997 5

Visual Basic Current 4

Word for Windows Current 8

MS DOS Current 7

UNIX Current 8

Windows 3.X, 95, 98, NT Current 8

SR Dec 1997 6

Prolog Dec 1998 8

Java Current 6

Miranda Dec 1996 8

C ++ Current 8

Additional Skills and Hobbies

Language Korean, Simple Dialogue in Japanese

Travel BackPacking Travel around North Eastern USA (Chicago,

New York, Boston, Washington DC) early in 1999

Backpacking Travel around Korea in 1996

Sports Golf, Tennis, Basketball, Kendo, Skiing

Watching Movies, Listening Music (Rock Ballard) and Reading Books

(Novels),

Photograph (Black and White Developing and Printing),

Calligraphy (in Korean and Chinese)

Refrees

Seung Soo OAK Ph.D.

Senior Manager in

Printer R/D Division, Information & Communication

Business

Samsung Electronics Co. Ltd

.

TEL : 82 - 331 - 280 - 9893

E-Mail : *****@****.****.*******.**.**

Eunpaek Choi

Advisory Specialist

R&D Team

Samsung SDS Co. Ltd

.E-MAIL : *******@*******.**.**

High Level Computing Subjects Studied

COMP3311 DATABASE SYSTEMS 79 DN

Data models: entity-relationship, relational, object-oriented.

Relational

database management systems: data definition, query languages,

development

tools. Database application design and implementation. Architecture of

relational database management systems: storage management,

query processing, transaction processing. Lab: design and

implementation of

realistic database application using Oracle, SQL, PL/SQL, Developer

2000.

COMP4012 MULTIMEDIA AUTHORING 65 CR

Provides an introduction to multimedia computing and distributed

multimedia

systems. The subject includes multimedia and agent fundamentals;

multimedia

application, structures and organization;

interactive multimedia software authoring basics; information

management

issues; and dynamic agent and distributed processing.

COMP3411 ARTIFICIAL INTELLIGENCE 68 CR

Machine intelligence. Principles: knowledge representation, automated

reasoning, machine learning. Tools: AI programming languages, control

methods, search strategies, pattern matching.

Applications: computer vision, speech recognition, natural language

processing, expert systems,

game playing, computer-aided learning. Philosophical and psychological

issues. Lab: logic programming assignments.

COMP3121 ALGORITHMS AND PROGRAMMING TECHN 72 CR

Correctness and efficiency of algorithms. Computational complexity:

time

and space bounds. Techniques for best-case, worst-case and

average-case

time and space analysis. Designing algorithms using induction,

divide-and-conquer and greedy strategies. Algorithms: sorting and

order statistics, trees, graphs, matrices. Intractability: classes P,

NP,

and NP-completeness, approximation algorithms.

COMP3131 PARSING AND TRANSLATION 63 PS

Grammars: formal description, Chomsky hierarchy, EBNF,

attributed-grammars.

Top-down parsing: LL(k) grammars, construction of recursive-descent

parsers. Bottom-up parsing: LR(k) grammars,

construction of LR sets, LR-parser generators. Lexical analysis:

regular expressions, finite automata, linear grammars. Compilation:

introduction to code generation and optimisation. Lab:

compiling techniques using functional models and translator

generators.

COMP3211 COMPUTER ORGANISATION AND DESIGN 64 PS

Combinatorial and sequential circuit design and realization.

Arithmetic

and logical unit design strategies. Instruction set design: role of

performance metrics, RISC vs CISC. Processor design: datapath design,

microprogramming, and an introduction to the use of pipelining in

enhancing

performance. memory Hierarchy: cache and virtual memory systems.

Processor,

memory and I/O interface. Testing and design for testability.

COMP3221 MICROPROCESSORS AND INTERFACING

The concept of a microprocessor system, busses, address spaces, memory

devices, bus timing, bus standards, the VME bus, I/O device

interfacing,

polling, interrupts, DMA interfaces, the 68000 processor family, the C

programming language, device drivers, the device driver software

environment,

other microprocessors, advanced topics. Laboratory work involves

interfacing

to and programming MC68000-series microprocessor-based systems. Lab:

experimental work involving hardware and software.

COMP9417 MACHINE LEARNING

Decision tree learning algorithms (such as C4.5), covering algorithms

(such as AQ), instance based learning, case-based learning, nearest

neighbour classifiers, genetic algorithms, topics from data mining,

inductive logic programming and computational theory learning.

COMP3111 SOFTWARE ENGINEERING

Informal specification: Data flow diagram methodology, analysis,

design,

testing, management and documentation of software. Formal

specification:

set theory, logic, schema calculus, case studies. The Z specification

notation. Managing the project life cycle. CASE tools. A major group

project is undertaken.

COMP3231

OPERATING SYSTEMS

Operating system organisation and services. Process management:

scheduling,

synchronisation and communication. Memory management: virtual memory,

paging and segmentation, storage management: Disk scheduling, File

systems.

Protection and security. Distributed operating systems and file

systems.

Case studies drawn from UNIX, MS-DOS and Mach. Lab. programming

assignments.

COMP3331 COMPUTER NETWORKS AND APPLICATION

Networking technology and protocol overview. Local Area Networks:

architectures; media; generalised Medium Access Control methods.

IEEE802

LAN standards. Datalink layer: design principles and protocols such as

stop and wait, sliding windows, and Automatic Repeat Request schemes.

Network Layer: design principles; addressing; message routing;

congestion

and traffic control. Internetworking: issues; bridges and routers. The

Internet Protocol (IP) and the Internet. Internet Routing via exterior

and interior router level protocols such as EGP, RIP, OPSF and HELO.

Internet Transport Control Protocol (TCP). RPC and Session control.

Network

management using SNMP. The Domain Name System (DNS). Mail systems.

File

transfer protocols. Encryption and Security. A view to the future of

networking.

COMP4001 OBJECT-ORIENTED SOFTWARE DEVELOPMENT

This course will cover object-oriented design and implementation

methods

for complex software systems. Topics covered include: object-oriented

program design techniques, object-oriented programming in C++,

software

reuse and designing for reuse, design patterns and styles, object

persistence and distribution. Examples from a wide range of

application

areas will be used at all stages to illustrate concepts and

techniques.

Assessment will involve two short assignments and one substantial

programming project to be carried out in small groups.

High Level Math Subjects Studied

MATH2501 PURE MATHEMATICS 2 - LINEAR ALGEBRA 75 DN

MATH3141 MATHEMATICAL METHODS EE 68 CR

Thesis Topic Active Vision and Motion Detection



Contact this candidate