Search & Read at all times.
Your portable library is online!
34.226.234.102,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

Publisher

National Taipei University of Technology

Taiwan

國立臺北科技大學 Publishing 』

北科大_NTUT
2009年
Total7Pages
Most Recently Published/Page #
Full-Text Files at the Top
Most Recently Published/Page #
Sort by Ascending Titles
1

整合免疫遺傳演算法與向量式粒子群最佳化演算法於二階線性規劃問題之研究-以供應鏈之配銷模型為例

李永濠

免疫遺傳演算法粒子群最佳化演算法二階線性規劃供應鏈IGAPSOBi-level linear programmingSupply chain

Abstract | Reference(94) Search in Library Search in Library Unauthorized Unauthorized Track Track

2

整合粒子群最佳化與蜂群演算法求解彈性零工式生產排程問題之研究

賴阮明

彈性零工式生產排程粒子群最佳化蜂群演算法多目標排程Flexible job-shop scheduling problemParticle swarm optimizationHoney-bee mating optimizationMulti-objective scheduling

Abstract | Reference(48) | Times Cited(1) Search in Library Search in Library Unauthorized Unauthorized Track Track

3

應用分枝界限法解決資源具有限性下的專案選擇與排程問題

尹新瀚

專案選擇列舉法資源有限的專案規劃分枝界限法Project scheduling problemRCPSPBranch and bound method

10.6841/NTUT.2009.00625 DOI

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

4

應用模擬退火法與離散粒子群演算法在排列流程式排程問題之研究

沈銘倫

排程粒子群模擬退火法ScheduleParticle Swarm OptimizationSimulated Annealing

10.6841/NTUT.2009.00218 DOI

Abstract | Reference(45) | Times Cited(3) Download Download PDF Add to Cart Add to Cart Track Track

5

探討運轉員對於龍門核電廠系統架構之心智模式

呂昌鴻

龍門核電廠卡片分類運轉員心智模式Nuclear Power PlantOperator Mental ModelCard Sorting Technique

Abstract | Reference(40) | Times Cited(3) Search in Library Search in Library Unauthorized Unauthorized Track Track

6

整合主成分分析與多目標粒子群演算法結合蜜蜂交配演算法運用在投資組合選擇

陳凱宏

投資組合多目標粒子群演算法蜜蜂交配演算法台灣五十指數台灣中型一百指數Portfolio SelectionMulti-objective Particle Swarm OptimizationHoney-Bee Mating OptimizationTaiwan 50 IndexTaiwan Med-Cap 100 Index

10.6841/NTUT.2009.00414 DOI

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

7

應用機器視覺於熱熔保險絲檢測

李柏毅

紋理類神經網路物件標記法電腦視覺瑕疵檢測TextureConnected Component Labeling AlgorithmMachine VisionNeural NetworkSurface Inspection

Abstract | Reference(28) Search in Library Search in Library Unauthorized Unauthorized Track Track

8

發展標竿為基之混合式設計鏈夥伴評選方法論

張芷翎

設計鏈夥伴評選資料包絡分析法偏好順序評估法分析層級程序法Design Chain Partner SelectionDEATOPSISAHP

Abstract | Reference(47) Search in Library Search in Library Unauthorized Unauthorized Track Track

9

應用模糊德爾菲法與分析網路程序法於半導體晶圓針測與IC封測廠商評選之研究

田美英

半導體模糊德爾菲法分析網路程序法SemiconductorFuzzy Delphi method and Analytic Network Process

Abstract | Reference(51) | Times Cited(2) Search in Library Search in Library Unauthorized Unauthorized Track Track

10

實體商店結合網物購物之配送效率模擬

駱羿琳

網路購物網路商店配送效率系統模擬Online PurchasingOnline StoreDistribution Efficiency, Simulation

10.6841/NTUT.2009.00342 DOI

Abstract | Reference(38) | Times Cited(1) 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