02 ky nang trinh bay

8/12/2019 02 Ky Nang Trinh Bay

1/45

Knng trnh by

Bmn CNPMKhoa CNTT -HKHTN TPHCM2012


2/45

N i dun

1.

u2. Qu trnh thc hin bi trnh by3. Ni dung trnh by.

2


3/45

Cc hnh thc trnh b

Ni trnh din v thao tc

Ni v trnh din

Ni v vitc, ni

3


4/45

T i sao vi c trnh b l i uan tr n ?

Hi tho, hi ngh, seminar, ging bi Thuyt trnh mn hc

Cng nghip Tm vic / Tuyn dng u n uy n, o c o n, o c o c o qu n ,

gii thiu cho khch hng

Khc Chnh tr gia, hotng cngng

4


5/45

Ththch

rong p Gii thiu bn thn Trnh by

iu tm c nht ng u t t m n m c mtrong cuc sng

5


6/45

N i dun

1.

u2. Qu trnh thc hin bi trnh by3. Ni dung trnh by.

6


7/45

Trc khi trnh b

Xc nh m c tiu trnh b lm ?

Chun bni dung Ni dung, thit kslides V d, demo

Handoutsp uy n

Trnh by th , Qun l thi gian

7


8/45

Trc khi trnh b

m u n g : Trnh Sl n

Tm hiu mi trng Phng c Trang thit b, nhn lc htr

8


9/45

So n tho n i dun

Thu thp thng tin

Mu (5%) tng quan

Kt lun (10%) nu bt li chnh

9


10/45

So n tho n i dun

ung c n Sp xp logic Ch trng tnh dnghe, dhiu Sd n minh h a so snh

10


11/45

T d t

Tp luyn trc gng ng m y u m, g n

Tp trong mt nhm thn quen n an ou no es page

,

11


12/45

T d t

The Kings speech

12


13/45

Tron khi trnh b

Kim tra thi gian

Tm dng/cu hi/demo Ung nc (!)

13


14/45

Tron khi trnh b

ong c c Trang phc lch s, ttin Chng chc, nghim tc

Thng ngi, hng vkhn gi Dng ngn ngcth

14


15/45

Tron khi trnh b

ong c c Khng khoanh tay trc ngc Khng Micro qu gn hoc qu xa

15


16/45

Tron khi trnh b

ng n Trnh nhp iu u u, phi c im nhn Khng dng Uh, A,

Khng c Ting a phng

16


17/45

Tron khi trnh b

g an Ti a 1-2 pht / slide ng ni ht nhng g bn lm

17


18/45

Tron khi trnh b

Thu ht ngi nghe Buc ngi khc yn lng bng syn lng ca bn Di chuyn

Ngng khi cn thit

18


19/45

Tron khi trnh b

m c n u ng in thoi reng Thnh gibra khi phng

Qun mt ang ni g, ti u

19


20/45

Tron khi trnh b

K ng n n Lm dng bng a qu n an p o ngi nghe bng kin thc ca mnh

, i qu su vo chi tit

20


21/45

Nhn iu m thnh imun

21


22/45

Kt thc trnh b

Cm n

22


23/45

Kt thc trnh b

p cui phn trnh by Nghtrc thnh gic thhi g

backup slides Xc nhn li cu hi

23


24/45

Kt thc trnh b

p Trli c ngn gn, trc tip Cu hi phc tp trao i offline

Khng trli c trao i offline ng givbit khi mnh khng bit

Nhiu cu hi cng ni dung FAQ

24


25/45

Kt thc trnh b

p Bnh tnh vi cu hi kh Khng dn n tranh ci

Khng lm vo thb Khng i lc

25


26/45

Kt thc trnh b

Kt thc thi gian hi p

ng o u n sau Tuyn bcu hi cui chm dt

26


27/45

Sau khi trnh b

Hiu chnh theo yu cu

Gii p, tho lun offline Xut bn ti liu

27


28/45

Videos

Top 10 mistakes (part 1)How to control nervesMichelle Obama's full DNC speech (19:30)

28


29/45

N i dun

1. u2. Qu trnh thc hin bi trnh by3. Ni dung trnh by

.

29


30/45

N i dun trnh b Gii thiu Mc tiu v ng c Hin trng m c t/ c t Kt qut c hoc dkin oc c mc u Tng kt

u am o

30


31/45

Gii thi u

u n n n m, Ni dung c t c tr n y

Thi gianNgi nghe bit cn tp trung i m no?

31


32/45

l n i dun ti trnh b

We describe the hiloso h and desi n of the control flow machine, and resent the results

of detailed simulations of the performance of a single processing element. Each factor is

compared with the measured performance of an advanced von Neumann computer running

equivalent code. It is shown that the control flow processor compares favorably in the

program.

logic program. The control flow is defined as an algebraic manipulator of idempotent

substitutions and it virtually reflects the resolution deductions. We also present a bottom-up

compilation of medium grain clusters from a fine grain control flow graph. We compare the

basic block and the dependence sets algorithms that partition control flow graphs intoclusters.

A hierarchical macro-control-flow computation allows them to exploit the coarse grain

parallelism inside a macrotask, such as a subroutine or a loop, hierarchically. We use a

hierarchical definition of macrotasks, a parallelism extraction scheme among macrotasks

defined inside an upper layer macrotask, and a scheduling scheme which assigns hierarchical

.

We apply a parallel simulation scheme to a real problem: the simulation of a control flow

architecture, and we compare the performance of this simulator with that of a sequential one.

Moreover, we investigate the effect of modeling the application on the performance of the

simulator. Our study indicates that parallel simulation can reduce the execution time

32

significantly if appropriate modeling is used.


33/45

Thhi n n i dun trnh b

Dng Font chlnng on c n

Dng Font chlnDng Font chlnDng Font chln

Quy tc 7x6 (7 words x 6 lines)

33


34/45

Dng nhiu hnh nh minh ha

34


35/45


Khng dng qu nhiu Font ch

Dng nh dng v mu scnhn mnh

Dng mu ti trn nn sng

Back round thch h

35


36/45

Li vtr textLi vtr text Khng cha l Cc dng v chqu st nhau Gy ri cc trnh by Slide n dn minimal line s acin V khng t vthm m Dng Power Point templates nu bn khng ttin

Vn : Li khng sdng spacing gia cc


37/45

Slide thn c khn ?

ng n n Kckhi bn dng mu chsng Rt kh c

Gy cm gic bun ng Handout in ra cng khng tt

37


38/45


ng ng qu n u u ng ng

Bn nghg khi i cu ny hin ra y ? Nhvy tt hn

Tng dng mt On Click hay With Previous?

38


39/45


Dng m thanh / video

39


40/45

Cn c trnh din

ap opProjectorRemote - Laser pointer

40


41/45

N i dun

uQu trnh thc hin bi trnh byNi dung trnh by

41


42/45

c m t bui trnh b hi u u

VisualsVisuals

AnalysisAnalysis

Effectiveresen a on

ContentContent

Practice &Practice &

Do It!Do It!

MessageMessageSupportingSupporting

PointsPoints

42


43/45

Tm tt

u n

Thc hnh nhiuTtin khi trnh by

Bn thn

43


44/45

V d m t bi thi thu t trnh

44


45/45

Cu hi?

02 ky nang trinh bay

Documents