




版權(quán)說(shuō)明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡(jiǎn)介
1Paper
Writing12Paper
Writing?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method)?
Experimental
Results?
Conclusion
&
Future
Work23Introduction?
Background
Topic
(1-2
paragraphs)?
Literature
Review
Motivation
(1
paragraph)?
Algorithm
Overview
(1
paragraph)?
Contributions
(1
paragraph)?
Experiment
Overview?
Roadmap
(1
paragraph)34Background
TopicBackgroundTime
Oriented4Application
OrientedTopic?
Concept,
Characteristics,
Application,
Importance,and
etc.5BackgroundTopic56Introduction?
Background
Topic
(1-2
paragraphs)?
Literature
Review
Motivation
(1
paragraph)?
Algorithm
Overview
(1
paragraph)?
Contributions
(1
paragraph)?
Experiment
Overview?
Roadmap
(1
paragraph)67Literature
Review
Motivation7?
Notable
Method
Summarization
(Focus
onnearest
neighbors)?
Comments
(Weakness)?
Motivation
(against
the
weakness)8Literature
ReviewMotivation89Introduction?
Background
Topic
(1-2
paragraphs)?
Literature
Review
Motivation
(1
paragraph)?
Algorithm
Overview
(1
paragraph)?
Contributions
(1
paragraph)?
Experiment
Overview?
Roadmap
(1
paragraph)910Algorithm
Overview
&
Contribution10?
Method
Definition?
Principle
Description?
Contribution11Algorithm
Overview
&
Contribution1112Contributions12?
New
Concept?
New
Model?
New
Algorithm
(More
Efficient,
Less
Memory,Parallelism
and
etc.)?
New
Result
(Significant
in
Application
Domain)13Introduction?
Background
Topic
(1-2
paragraphs)?
Literature
Review
Motivation
(1
paragraph)?
Algorithm
Overview
(1
paragraph)?
Contributions
(1
paragraph)?
Experiment
Overview?
Roadmap
(1
paragraph)1314Experiment
Overview?
Implementation?
Data?
Result1415Introduction?
Background
Topic
(1-2
paragraphs)?
Literature
Review
Motivation
(1
paragraph)?
Algorithm
Overview
(1
paragraph)?
Contributions
(1
paragraph)?
Experiment
Overview?
Roadmap
(1
paragraph)1516Roadmap1617Five
Main
Sections?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method)?
Experimental
Results?
Conclusion
&
Future
Work1718Related
Work
(Main
Content)18?
Detail
some
notable
works?
Give
comments
individually
or
by
group?
Summarize
irrelevant
works
in
a
few
words?
In
time
or
advancing
order?
Try
to
put
the
methods
to
compare
late.1919202021Related
Work
(Supplement)21?
Add
the
headThere
are
plenty
of
covert
channel
methods
in
literature.
Here,
wewill
only
review
some
notable
work
due
to
space
limitation.Now
(Here/
In
this
section),
we
will
review
some
notable
methods(previous
work)……22Related
Work
(Supplement)?
Add
the
tail22Hence,
we
are
motivated
to……23Five
Main
Sections?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method)?
Experimental
Results?
Conclusion
&
Future
Work2324Preliminaries24?
Applying
to
paper
with
lots
of
definitions?
Three
Components:OverviewDefinitionsProblemDefinition252526Five
Main
Sections?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method)?
Experimental
Results?
Conclusion
&
Future
Work2627Algorithm
(Method)27?
Overview?
Preliminaries
(Definitions,
Model
Description)?
Put
the
whole
idea
in
Phases
or
Steps?
Emphases
which
phase/step/part
makes
thealgorithm
outstanding?
Use
running
examples,
figures,
tables,pseudo-code......?
Supplementary
(limitations,
suggestions,
future
work…28Algorithm
(Overview)2829Algorithm
(Main
Content)29?
Phase
1Step
1Step
2?
Phase
2In
the
1st
stepIn
the
2nd
step?
Phase
3?
……30Algorithm
(Try
to
Make
it
Clear)Alice
and
Bob
would
take
the
following
five
steps
to
transmit
the
secret
messagStep
1:
AliceandBob
communicate
normally.
They
both
record
the
messagelengths
sent
by
Alice,and
make
the
record
as
Reference.Step
2:
Aliceand
Bob
select
a
length
l
from
the
Reference
by
the
same
randomalgorithm.Step
3:
In
the
ith
sending,
Alice
sends
to
Bob
a
message
of
length
lnext
=l+SUMiThe
Reference
is
updated
by
appending
lnext.Step
4:
Bob
decodes
the
ith
message
into
Wi
by
subtracting
l
from
lnext.In
our
method,
the
Step
2
and
3
ensure
that
each
sending
message
wouldlearn
from
the
normal
network
traffic
(Reference)
so
that
messages
from
ourchannel
have
similar
length
distribution
as
normal
network
messages.To
better
resist
the
detection,
our
scheme
could
be
further
enhanced
throughthe
way
that
Alice
periodically
sends
to
Bob
redundant
normal
networkmessages
during
the
transmission.3031Five
Main
Sections?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method)?
Experimental
Results?
Conclusion
&
Future
Work3132Experimental
Results32?
Overview:
environment,
data,
methods
to
compare?
Data
Description?
Data
Preprocessing?
Compare
against
Other
Algorithms
(Methods)?
Parameter
Studies33Experimental
Results33Experimenting
ontheClartnet
dataset
[9],
we
compared
our
scheme
withGirling’s[3]
and
Yao’s[8]
models,
and
estimated
the
upper
bound
of
ourmodel’s
bandwidth.4.1
DatasetClarknet
dataset
contains
the
logs
of
1.6
million
HTTP
queries
from
two
weeks.We
take
the
7239queriesfrom
Client
‘’
as
the
messagesfor
our
experiments.
In
each
query,
the
average
size
of
transmitted
message
is489
bytes
(39
bytes
message
+
450
bytes
header).34Experimental
Results3435Five
Main
Sections?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method)?
Experimental
Results?
Conclusion
&
Future
Work3536Conclusion
&
Future
Work36?
Summarize
what
we
did
in
the
paperMethodExperimental
ResultsAdvantage
(Application)?
Future
Work37Conclusion
&
Future
Work3738Five
Main
Sections?
Abstract,
Keywords?
Introduction?
Related
Work
(Literature
Review)?
Preliminary?
Algorithm
(Method
溫馨提示
- 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
最新文檔
- T-ZZB 3683-2024 水松紙卷筒料圓壓圓燙金機(jī)
- 二零二五年度房屋租賃合同(含瑜伽館)
- 2025年度肥料產(chǎn)品包裝設(shè)計(jì)及印刷合同
- 2025年度綠色生態(tài)果園轉(zhuǎn)讓協(xié)議書(shū)
- 二零二五年度智慧城市建設(shè)項(xiàng)目業(yè)績(jī)提成合同
- 天津市2025年度勞動(dòng)合同解除經(jīng)濟(jì)補(bǔ)償金支付與發(fā)放合同
- 二零二五年度科研機(jī)構(gòu)與高校人才合作就業(yè)協(xié)議書(shū)范本
- 二零二五年度臨時(shí)協(xié)議書(shū):智慧社區(qū)建設(shè)與物業(yè)管理合作
- 2025年度智能車庫(kù)租賃與智慧城市建設(shè)項(xiàng)目合同
- 2025年度裝配行業(yè)人才培養(yǎng)終止合同協(xié)議
- 生物質(zhì)顆粒廠建設(shè)項(xiàng)目可行性研究報(bào)告
- 春新教科版四年級(jí)科學(xué)下冊(cè)《電路》單元解讀
- 《電力信息系統(tǒng)信息安全檢查規(guī)范》
- 2023年考研數(shù)學(xué)一真題
- 2020年8月自考00371公安決策學(xué)試題及答案含解析
- H公司招聘問(wèn)題與對(duì)策研究
- 2024年CNCERT-CCSC管理Ⅱ級(jí)理論考試題庫(kù)及答案
- T-CARM 002-2023 康復(fù)醫(yī)院建設(shè)標(biāo)準(zhǔn)
- 復(fù)雜網(wǎng)絡(luò)分析與建模
- 幼兒園活動(dòng)區(qū)自制玩學(xué)具及其效用研究
- 中國(guó)古代史選擇題50題專練 高考?xì)v史統(tǒng)編版二輪復(fù)習(xí)
評(píng)論
0/150
提交評(píng)論