This paper addresses the problem of robust stability for two-dimensional systems with delays in the state. To solve this problem, the Lyapunov second method is used. The resulting condition is written in terms of linear matrix inequalities and it is dependent on the size of delays. This fact allows us to reduce the conservatism in the stability analysis of twodimensional systems with state dela...

The problem of pattern matching with rotation is that of 2nding all occurrences of a twodimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such di4erent possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some 2nite alphabet , we present a new method yielding an O(nm) time algorithm for ...

The widely studied benchmark problem, 2-D driven cavity flow problem is discussed in details in terms of physical and mathematical and also numerical aspects. A very brief literature survey on studies on the driven cavity flow is given. Based on the several numerical and experimental studies, the fact of the matter is, above moderate Reynolds numbers physically the flow in a driven cavity is no...

A multigrid method using conforming P -1 finite elements is developed for the twodimensional pure traction boundary value problem of linear elasticity. The convergence is uniform even as the material becomes nearly incompressible. A heuristic argument for acceleration of the multigrid method is discussed as well. Numerical results with and without this acceleration as well as performance estima...

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a new optimum-time algorithm for synchronizing twodimensional cellular automata. Its state-efficient implementation is also given.

Given a list of d-dimensional cuboid items with associated profits, the orthogonal knapsack problem asks for a packing of a selection with maximal profit into the unit cube. We restrict the items to hypercube shapes and derive a ( 5 4 + )-approximation for the twodimensional case. In a second step we generalize our result to a ( 2 +1 2d + )approximation for d-dimensional packing.

A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...

Level-expanding quasi-birth-and-death (QBD) processes have been shown to be an efficient modeling tool for studying multi-dimensional systems, especially twodimensional ones. Computationally, it changes the more challenging problem of dealing with algorithms for two-dimensional systems to a less challenging one for block-structured transition matrices of QBD type with a varying finite block siz...