Waiting time problems for a two-dimensional pattern

被引:0
|
作者
Sigeo Aki
Katuomi Hirano
机构
[1] Osaka University,Division of Mathematical Science, Department of Systems Innovation, Graduate School of Engineering Science
[2] The Institute of Statistical Mathematics,Department of Mathematics, Faculty of Engineering
[3] Kansai University,undefined
关键词
Waiting time problem; two-dimensional pattern; probability generating function; discrete distribution; conditional distribution; reliability; consecutive system;
D O I
暂无
中图分类号
学科分类号
摘要
We consider waiting time problems for a two-dimensional pattern in a sequence of i.i.d. random vectors each of whose entries is 0 or 1. We deal with a two-dimensional pattern with a general shape in the two-dimensional lattice which is generated by the above sequence of random vectors. A general method for obtaining the exact distribution of the waiting time for the first occurrence of the pattern in the sequence is presented. The method is an extension of the method of conditional probability generating functions and it is very suitable for computations with computer algebra systems as well as usual numerical computations. Computational results applied to computation of exact system reliability are also given.
引用
收藏
页码:169 / 182
页数:13
相关论文
共 50 条
  • [1] Waiting time problems for a two-dimensional pattern
    Aki, S
    Hirano, K
    ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2004, 56 (01) : 169 - 182
  • [2] Waiting Time Dynamics in Two-Dimensional Infrared Spectroscopy
    Jansen, Thomas L. C.
    Knoester, Jasper
    ACCOUNTS OF CHEMICAL RESEARCH, 2009, 42 (09) : 1405 - 1411
  • [3] ON TWO-DIMENSIONAL PATTERN-MATCHING LANGUAGES AND THEIR DECISION-PROBLEMS
    MORITA, K
    NAKAZONO, K
    SUGATA, K
    INFORMATION SCIENCES, 1986, 40 (01) : 53 - 66
  • [4] Two-dimensional pattern matching by two-dimensional online tessellation automata
    Polcar, T
    Melichar, B
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 327 - 328
  • [5] Two-dimensional potential problems
    Morris, RM
    PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1937, 33 : 474 - 484
  • [6] Two-dimensional partitioning problems
    Middendorf, M
    THEORETICAL COMPUTER SCIENCE, 1996, 164 (1-2) : 73 - 106
  • [7] A constant time optimal parallel algorithm for two-dimensional pattern matching
    Crochemore, M
    Gasieniec, L
    Hariharan, R
    Muthukrishnan, S
    Rytter, W
    SIAM JOURNAL ON COMPUTING, 1998, 27 (03) : 668 - 681
  • [8] TWO-DIMENSIONAL PATTERN-MATCHING BY TWO-DIMENSIONAL ONLINE TESSELLATION ACCEPTORS
    TODA, M
    INOUE, K
    TAKANAMI, I
    THEORETICAL COMPUTER SCIENCE, 1983, 24 (02) : 179 - 194
  • [9] Jamming pattern in a two-dimensional hopper
    To, KW
    Lai, PY
    PHYSICAL REVIEW E, 2002, 66 (01):
  • [10] Two-dimensional pattern matching with rotations
    Amir, A
    Butman, A
    Crochemore, M
    Landau, GM
    Schaps, M
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 17 - 31