We study asymptotic proximity as t ! 1 of the solutions of the inverse problem for a pseudo-parabolic equation with an unknown source function. The overdetermination condition is given in integral form. 2003 Elsevier Inc. All rights reserved.

The first sodium-magnesium and sodium-zinc ketimido complexes display contrasting inverse crown ring and pseudo-cubane structures respectively, while a sodium-zinc heterotrianionic alkide-alkoxide-amide adopts a third type of structure with a stepped ladder motif.

Real-time control of the endeffector of a humanoid robot in external coordinates requires computationally efficient solutions of the inverse kinematics problem. In this context, this paper investigates inverse kinematics learning for resolved motion rate control (RMRC) employing an optimization criterion to resolve kinematic redundancies. Our learning approach is based on the key observations t...

This paper presents a new approach for collision avoidance of manipulators. When the workspace is completely mapped and the obstacles are known, it is possible to define the task considering the presence of obstacles or their proximity can be monitored simply by the inverse kinematics resolution of the complete system. However, when the workspace is poorly mapped/unstructured and/or time-varyin...

Sparse high dimensional graphical model selection is a popular topic in contemporary machine learning. To this end, various useful approaches have been proposed in the context of `1-penalized estimation in the Gaussian framework. Though many of these inverse covariance estimation approaches are demonstrably scalable and have leveraged recent advances in convex optimization, they still depend on...

For redundant manipulators, the inverse kinematics equations are typically solved by taking the pseudoinverse of the Jacobian, or by adding enough constraints to algebraically remove the redundancy. Many popular measures of redundancy also depend on computing the algebraic rank or determinant of the Jacobian. We present fast, parallelizable algorithms to dynamically update all the pseudo-invers...

We propose an abstract approach to prove local uniqueness and conditional Hölder stability to non-linear inverse problems by linearization. The main condition is that, in addition to the injectivity of the linearization A, we need a stability estimate for A as well. That condition is satisfied in particular, if A∗A is an elliptic pseudo-differential operator. We apply this scheme to show unique...