Xinrong Ma

  • Citations Per Year
Learn More
We consider an optimization problem motivated by the tradeoff between connectivity and resilience in key predistribution schemes (KPS) for sensor networks that are based on certain types of combinatorial designs. For a specific class of designs, we show that there is no real disadvantage in requiring the underlying design to be regular.
They found that transformation of (1) or (2) is related to Fibonacci numbers. Recently, Shapiro et al. [8] and Sprugnoli [10] introduced the theories of the Riordan array and the Riordan group, respectively, in an effort to answer the following question: What are the conditions under which a combinatorial sum can be evaluated by transforming the generating(More)
The work presented in this paper focuses on parallel iterative method for solving banded linear systems. We establish the parallel row operation algorithm on distributed-memory multi-computer based on 3-D projection technology. Moreover, convergent theorem is proved when the coefficient matrix is nonsingular. In the end, two examples have been implemented(More)
  • 1