The optimal consecutive-k-out-of-n : G line for n <= 2k
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
287 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
281 | en_US |
dc.citation.volume |
128 | en_US |
dc.citation.woscount |
8 | |
dc.contributor.author |
Jalali, A | en_US |
dc.contributor.author |
Hawkes, AG | en_US |
dc.contributor.author |
Cui, LR | en_US |
dc.contributor.author |
Hwang, FK | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:35:46Z | |
dc.date.available |
2014-12-08T15:35:46Z | |
dc.date.issued |
2005-01-15 | en_US |
dc.description.abstract |
Two proofs for the problem in the title have been published but both are incomplete. In this note we observe the subtle errors in these proofs and give a new proof by a different approach. (C) 2003 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.jspi.2003.09.018 | en_US |
dc.identifier.issn |
0378-3758 | en_US |
dc.identifier.journal |
JOURNAL OF STATISTICAL PLANNING AND INFERENCE | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.jspi.2003.09.018 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/24160 | |
dc.identifier.wosnumber |
WOS:000225197800018 | |
dc.language.iso |
en_US | en_US |
dc.subject |
reliability | en_US |
dc.subject |
consecutive systems | en_US |
dc.subject |
optimal assignment | en_US |
dc.title |
The optimal consecutive-k-out-of-n : G line for n <= 2k | en_US |
dc.type |
Article | en_US |
檔案
- 000225197800018.pdf (194.5 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Jalali, A., Hawkes, A., Cui, L., & Hwang, F. (2005). The optimal consecutive-k-out-of-n : G line for n <= 2k. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 128(1), 281–287. https://doi.org/10.1016/j.jspi.2003.09.018
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/24160