We present an improved solution for the Firing Squad Synchronization Problem (FSSP) for digraph-based P systems. We improve our previous FSSP algorithm by allowing the general to delegate a more central cell in the P system to send the final command to synchronize. With e being the eccentricity of the general and r denoting the radius of the underlying digraph, our new algorithm guarantees to s...

Motivated by applications in storage systems and property testing, we study data stream algorithms for local testing and tolerant testing of codes. Ideally, we would like to know whether there exist asymptotically good codes that can be local/tolerant tested with onepass, poly-log space data stream algorithms. We show that for the error detection problem (and hence, the local testing problem), ...

rainfall spatial analysis methods are very helpful since there are not enough rainfall gauge stations and watersheds are scattered in large extent. there are many different methods for estimating average precipitation such as; arithmetic method and thiessen polygon. however, the arrangement and location of data and their correlations are not considered by classic methods. thus, geostatistical t...

We present an improved solution for the Firing Squad Synchronization Problem (FSSP) for digraph-based P systems. We improve our previous FSSP algorithm by allowing the general to delegate a more central cell in the P system to send the final command to synchronize. With e being the eccentricity of the general and r denoting the radius of the underlying digraph, our new algorithm guarantees to s...

The average distance μ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G. We prove that if G is a λ-edge-connected graph of order n, then the bounds μ(G) ≤ 2n/15 + 9, if λ = 5, 6, μ(G) ≤ n/9 + 10, if λ = 7 and μ(G) ≤ n/(λ + 1) + 5, if λ ≥ 8 hold. Our bounds are shown to be best possible and our results solve a problem of Plesńık [12].