In this paper, we obtain optimal perturbation bounds of the weighted Moore-Penrose inverse under the weighted unitary invariant norm, the weighted Q-norm and the weighted F -norm, and thereby extend some recent results.

In this paper, some new representations of the Moore-Penrose inverse of a complex m × n matrix of rank r in terms of (s × t)-constrained submatrices with m ≥ s ≥ r, n ≥ t ≥ r are presented.

| A kinematically redundant manipulator is a robotic system that has more than the minimum number of degrees of freedom that are required for a speciied task. Due to this additional freedom, control strategies may yield solutions which are not repeat-able in the sense that the manipulator may not return to its initial joint connguration for closed end-eeector paths. This paper compares two meth...

In this paper, we study representations of the Moore-Penrose inverse of a 2 × 2 matrix M over a ∗-regular ring with two term star-cancellation. As applications, some necessary and sufficient conditions for the Moore-Penrose inverse of M to have different types are given.

In this paper, we obtain optimal perturbation bounds of the weighted Moore-Penrose inverse under the weighted unitary invariant norm, the weighted Q-norm and the weighted F -norm, and thereby extend some recent results.

In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching problem can be classified into software and hardware based on implemental methods. It is important of enhance pattern matching performance. This paper proposes enhanced pattern matching performance using improved Boyer Moore Horspool Algorithm. It combines the determinis...

Michael Moore's Causation and Responsibility^ is a comprehensive and fascinating study of the relationship between the law, moralify, and metaphysics. One of the most interesting (and, at the same time, controversial) theses Moore defends in this book is the claim that some central legal concepts are grounded in metaphysical concepts. In particular, Moore emphasizes the key role played in the l...

Extremal graphs which are close related to Moore graphs have been defined in different ways. Radially Moore graphs are one of these examples of extremal graphs. Although it is proved that radially Moore graphs exist for radius two, the general problem remains open. Knor, and independently Exoo, gives some constructions of these extremal graphs for radius three and small degrees. As far as we kn...

A digraph with maximum out-degree d and radius k has at most 1+d+ · · ·+d vertices, as the Moore bound states. Regular digraphs attaining such a bound and whose diameter is at most k + 1 are called radially Moore digraphs. Knor [4] proved that these extremal digraphs do exist for any value of d ≥ 1 and k ≥ 1. In this paper, we introduce a digraph operator, based on the line digraph, which allow...