‎a new approximation method for the set of common fixed points of‎ ‎nonexpansive mappings and the set of solutions of systems of‎ ‎variational inequalities is introduced and studied‎. ‎moreover‎, ‎we‎ ‎apply our main result to obtain strong convergence theorem to a‎ ‎common fixed point of a nonexpannsive mapping and solutions of ‎a ‎system of variational inequalities of an inverse strongly mono...

Null space velocity control is essential for achieving good behaviour of a redundant manipulator. Using the dynamically consistent pseudo-inverse, the task and null space motion and forces are decoupled. The paper presents a globally stable null space velocity controller and the gradient projection technique in conjunction with the dynamically consistent pseudo-inverse. The physical meaning and...

In this paper, we present the pseudo-collision, pseudo-second-preimage and pseudo-preimage attacks on the SHA-3 candidate algorithm Luffa. The pseudocollisions and pseudo-second-preimages can be found easily by computing the inverse of the message injection function at the beginning of Luffa. We explain in details the pseudo-preimage attacks. For Luffa-224/256, given the hash value, only 2 iter...

This paper discusses a complex-valued Hopfield associative memory with an iterative incremental learning algorithm. The mathematical proofs derive that the weight matrix is approximated as a weight matrix by the complex-valued pseudo inverse algorithm. Furthermore, the minimum number of iterations for the learning sequence is defined with maintaining the network stability. From the result of si...

In this paper, we investigate an inverse eigenvalue problem for matrices that are obtained from pseudo-Jacobi by only modifying the (1,r)-th and (r,1)-th entries, 3?r?n. Necessary sufficient conditions under which is solvable derived. Uniqueness results presented algorithm to reconstruct given spectral data proposed. Illustrative examples provided.

The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of graph. Examples include random-walk centrality betweenness measures, average hitting commute times, other connectivity measures. These measures arise the analysis social computer networks. In this short paper, we show how linear system involving may be solved time n...

in this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where a~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisti...