#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ioannis Voyiatzis, Antonis M. Paschalis, Dimitris Gizopoulos, Constantin Halatsis, Frosso S. Makri, Miltiadis Hatzimihail
- IEEE Trans. Computers
- 2008

Built-In Self-Test (BIST) techniques constitute an effective and practical approach for VLSI circuits testing. BIST schemes are typically classified into two categories: offline and online. Input vector monitoring concurrent BIST schemes are a class of online techniques that circumvent the problems appearing separately in online and in offline BIST in a… (More)

- Frosso S. Makri, Zaharias M. Psillakis
- Computers & Mathematics with Applications
- 2011

- Frosso S. Makri
- 2010

Consider a sequence of exchangeable or independent binary trials ordered on a line or on a circle. The statistics denoting the number of times an F -S string of length (at least) k1 + k2, that is, (at least) k1 failures followed by (at least) k2 successes in n such trials, are studied. The associated waiting time for the rth occurrence of an F -S string of… (More)

- Spiros D. Dafnis, Frosso S. Makri, Zaharias M. Psillakis
- 2010

A consecutive system, the failure of which depends on the occurrence of a number of failure-success patterns, is introduced. It extends several consecutive systems studied so far in the literature. The exact system reliability is determined for systems with independently functioning components. The derivations are based on the exact distribution of properly… (More)

The expected number of 0-1 strings of a limited length is a potentially useful index of the behavior of stochastic processes describing the occurrence of critical events (e.g., records, extremes, and exceedances). Such model sequences might be derived by a HoppePolya or a Polya-Eggenberger urnmodel interpreting the drawings of white balls as occurrences of… (More)

- Frosso S. Makri, Zaharias M. Psillakis, Nikolaos Kollas
- 2012

Consider a binary string (a symmetric Bernoulli sequence) of length �. For a positive integer �, 1 ≤ � ≤ �, we exactly enumerate, in all 2� possible binary strings of length �, the number of all runs of 1s of length (equal, at least) � and the number of 1s in all runs of 1s of length at least �. To solve these counting problems, we use probability theory… (More)

- Frosso S. Makri, Zaharias M. Psillakis
- Computers & Mathematics with Applications
- 2016

- Frosso S. Makri
- 2017

In a 0 1 sequence of Markov dependent trials we consider a statistic which counts strings of a limited length run of 0s between subsequent 1s. Its probability mass function is used to determine the chance that a stochastic process remains or not in statistical control. Illustrative numerics are presented.

- ‹
- 1
- ›