The purpose of this paper is to determine when and under which conditions the solution game value infinite interval matrix games will exist. Firstly, concept a reasonable defined in was extended games. Then, were characterized by using sequences numbers (defined Chiao, 2002) their convergence numbers. Considering that each row or column payoff sequence numbers, we assume converges same number α...

0309-1708/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.advwatres.2012.07.017 q The US Department of Agriculture (USDA) prohi programs and activities on the basis of race, color, n and where applicable, sex, marital status, familial sta sexual orientation, genetic information, political belie part of an individual’s income is derived from any pu all prohibited bases apply ...

This report considers the problem of writing data distribution independent (DDI) programs in order to eliminate or reduce initial data redistribution overheads for distributed memory parallel computers. The functionality and execution time of DDI programs are independent of initial data distributions. First, modular mappings, which can be used to derive many equally optimal ant1 functionally eq...

We consider the problem of structure prediction for sparse LU factorization with partial pivoting. In this context, it is well known that the column elimination tree plays an important role for matrices satisfying an irreducibility condition, called the strong Hall property. Our primary goal in this paper is to address the structure prediction problem for matrices satisfying a weaker assumption...

In this paper we propose a new numerically reliable computational approach to determine the J inner outer factorization of a rational matrix G The proposed approach is completely general being ap plicable whenever G is proper or not or of full column row rank or not In contrast to existing one shot methods which require the solution of Riccati or generalized Riccati equations the new approach i...

Let ℱ and G be two t-uniform families of subsets over [k] = {1, 2, ..., k}, where |ℱ| |G|, let C the adjacency matrix bipartite graph whose vertices are in G, there is an edge between A ∈ B if only ∩ ≠ ∅. The pair (ℱ,G) q-almost cross intersecting every row column has exactly q zeros. We further restrict our attention to pairs that have a circulant intersection Cp, q, determined by vector with ...

A new numerically reliable computational approach is proposed to compute the facto-rization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved \one-shot" methods which require the solution of Riccati or generalized Riccati equations, the new approach relies on an eecient recursive pol...

The spectrum of branching-time relations for probabilistic systems has been investigated thoroughly by Baier, Hermanns, Katoen and Wolf (2003, 2005), including weak simulation for systems involving substochastic distributions. Weak simulation was proven to be sound w. r. t. the liveness fragment of the logic PCTL\X , and its completeness was conjectured. We revisit this result and show that sou...

In this paper we propose a new numerically reliable computational approach to determine the inner-outer factorization of a rational transfer matrix G of a linear descriptor system. In contrast to existing computationally involved “one-shot” methods which require the solution of Riccati or generalized Riccati equations, the new approach relies on an efficient recursive zeros dislocation techniqu...