Search & Read at all times.
Your portable library is online!
3.235.173.74,Hello!
Search Symbol (Half-width) Description of Search Symbols
Space "AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " ) Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" : " image process "
? Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
* Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )
AND、OR、NOT

Boolean logic combinations of key words is a skill used to expand or refine search parameters.
(1) AND (1) AND: Refines search parameters
(2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters

close

DOI stands for Digital Object Identifier ( D igital O bject I dentifier ) ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「http://dx.doi.org/」 「 http://dx.doi.org/ 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: http://dx.doi.org/ 10.5297/ser.1201.002
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registrationdoi.airiti.com ) 。

Close

Reference :

Close

Times Cited : (2)

Abstract

Abstract

Close

What is "Preprint"?

In order to provide readers the forefront academic information, after articles are accepted to publish in the journal, we publish them in network before they're printed. Those "on-line first articles" are called the "preprint articles". The preprint articles do not have volume No., page No., publication date, but can be identified by the DOI number. 「 http://dx.doi.org/ 」 Link to the latest version of the article.

How to cite Preprint Articles?

Please use the online publication date and the DOI number of the preprint article to cite the literature.

Cited example (may vary with different formats you cited):

Author name. Article name. Journal name. YYYY/MM/DD online publish in advance.

doi:DOI Number

Basic Information
Publisher

National Taiwan University

Taiwan

國立臺灣大學 Publishing 』

台大_NTU
2009年
Total7Pages
Most Recently Published/Page #
Full-Text Files at the Top
Most Recently Published/Page #
Sort by Ascending Titles
21

多信道無線網狀網路下近似最佳化之分散式具服務品質路由演算法

謝友仁

無線網狀網路分散式路由演算法鏈結狀態路由協定服務品質限制路由演算法拉格蘭日鬆弛法Wireless Mesh NetworksDistributed Routing AlgorithmLink-State Routing ProtocolQoS Constrained Routing AlgorithmLagrangean Relaxation

10.6342/NTU.2009.01297 DOI

Abstract | Reference(25) Download Download PDF Add to Cart Add to Cart Track Track

22

考慮服務品質需求下達到資訊遺漏最小化之近似最佳化機密分享與防禦資源配置規劃

陳冠瑋

資訊安全網路規劃秘密分享服務品質最佳化資源配置可靠度存活度拉格蘭日鬆弛法Information SecurityNetwork PlanningSecret SharingQuality of ServiceOptimizationResource AllocationReliabilitySurvivabilityLagrangean Relaxation Method

10.6342/NTU.2009.01300 DOI

Abstract | Reference(24) Download Download PDF Add to Cart Add to Cart Track Track

23

考量誘捕系統下攻擊者成功機率最小化之近似最佳化防禦策略

王猷順

網路攻防網路存活度最佳化資源配置數學規劃誘捕系統不完美知識Network Attack and DefenseNetwork SurvivabilityOptimization, Resource AllocationMathematical ProgrammingHoneypotsImperfect Knowledge

10.6342/NTU.2009.01301 DOI

Abstract | Reference(22) Download Download PDF Add to Cart Add to Cart Track Track

24

無線感測網路之低能耗物體追蹤樹建置演算法

許宴毅

無線感測網路物體追蹤最佳化高效率節能拉格蘭日鬆弛法Wireless Sensor Networks (WSNs)Object TrackingOptimizationEnergy-EfficientLagrangean Relaxation (LR)

10.6342/NTU.2009.01302 DOI

Abstract | Reference(19) Download Download PDF Add to Cart Add to Cart Track Track

25

考量自然災害與智慧型攻擊下確保服務持續性之冗餘及防禦資源配置演算法

駱睿斌

服務持續性冗餘配置問題存活度攻防情境多重核心節點攻擊經驗累積最佳化數學規劃拉格蘭日鬆弛法Service ContinuityRedundancy Allocation Problem (RAP)SurvivabilityAttack/Defense ScenarioMultiple Core NodesAttack Experience AccumulationOptimizationMathematical ProgrammingLagrangean Relaxation

10.6342/NTU.2009.01303 DOI

Abstract | Reference(21) Download Download PDF Add to Cart Add to Cart Track Track

26

移動式隨意網路下多群組群播之 低延遲與能耗排程演算法

李培維

移動式隨意網路排程群播高效率節能低延遲移動性拉格蘭日鬆弛法MANETMulticastSchedulingEnergy-Efficientlow-latencyMobilityLagrangean Relaxation Method

10.6342/NTU.2009.01304 DOI

Abstract | Reference(17) Download Download PDF Add to Cart Add to Cart Track Track

27

使用者導向之異質行動網路管理

許君

WiMAXHSDPA資源管理行動管理換手服務品質無縫HSDPA3.5GWiMAX802.16resource managementhandoffmobilityseamlessQoS

10.6342/NTU.2009.01315 DOI

Abstract | Reference(23) Download Download PDF Add to Cart Add to Cart Track Track

28

以封包標注為基礎之分散式阻絕服務攻擊封包過濾及阻塞之近似最佳化聯防策略

范姜竣韋

分散式阻絕服務攻擊封包標注封包過濾封包阻塞數學規劃最佳化拉格蘭日鬆弛法Distributed-Denial-of-Service (DDoS)FilteringBlockingPacket MarkingMathematical ProgrammingOptimization and Lagrangean Relaxation

10.6342/NTU.2009.01375 DOI

Abstract | Reference(25) Download Download PDF Add to Cart Add to Cart Track Track

29

探勘時間性社交網路樣式

解巽評

資料探勘時間性社交網路封閉性樣式data miningtemporal social networkclosed patterns

10.6342/NTU.2009.01403 DOI

Abstract | Reference(34) Download Download PDF Add to Cart Add to Cart Track Track

30

使用具鑑別力原型之物件辨識方法

劉英和

具鑑別力的區域顯著區域Crisp Construction Process演算法原型C4.5決策樹discriminative regionsalient regionCrisp Construction Process algorithmprototypeC4.5 decision tree

10.6342/NTU.2009.01429 DOI

Abstract | Reference(106) Download Download PDF Add to Cart Add to Cart Track Track

Most Recently Published/Page #
Full-Text Files at the Top
Most Recently Published/Page #
Sort by Ascending Titles
2009年
Total 7 Pages

close

close