[Home ] [Archive]    
Main Menu
Journal Information::
Home::
Archive::
For Authors::
For Reviewers::
Principles of Transparency::
Contact us::
::
Search in website

Advanced Search
..
Committed to

AWT IMAGE

Attribution-NonCommercial
CC BY-NC


AWT IMAGE

Open Access Publishing


AWT IMAGE

Prevent Plagiarism

..
Registered in


..
Statistics
Journal volumes: 17
Journal issues: 34
Articles views: 645775
Articles downloads: 299456

Total authors: 581
Unique authors: 422
Repeated authors: 159
Repeated authors percent: 27

Submitted articles: 368
Accepted articles: 266
Rejected articles: 25
Published articles: 219

Acceptance rate: 72.28
Rejection rate: 6.79

Average Time to Accept: 282 days
Average Time to First Review: 27.2 days
Average Time to Publish: 26.1 days

Last 3 years statistics:
Submitted articles: 77
Accepted articles: 52
Rejected articles: 12
Published articles: 24

Acceptance rate: 67.53
Rejection rate: 15.58

Average Time to Accept: 201 days
Average Time to First Review: 11.4 days
Average Time to Publish: 139.4 days
____
..
:: Volume 4, Issue 2 (3-2008) ::
JSRI 2008, 4(2): 161-174 Back to browse issues page
Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
Mohammad Khanjari Sadegh 1, Bagher Moghaddaszadeh
1- , mkhanjari@birjand.ac.ir
Abstract:   (3000 Views)

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task.

Keywords: Minimal path set, consecutive-k-out-of-n: F system, generation function.
Full-Text [PDF 1559 kb]   (1203 Downloads)    
Type of Study: Research | Subject: General
Received: 2016/02/21 | Accepted: 2016/02/21 | Published: 2016/02/21
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA



XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Khanjari Sadegh M, Moghaddaszadeh B. Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System. JSRI 2008; 4 (2) :161-174
URL: http://jsri.srtc.ac.ir/article-1-176-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 4, Issue 2 (3-2008) Back to browse issues page
مجله‌ی پژوهش‌های آماری ایران Journal of Statistical Research of Iran JSRI
Persian site map - English site map - Created in 0.05 seconds with 42 queries by YEKTAWEB 4645