We present a general method using kernel canonical correlation analysis to learn a semantic representation to web images and their associated text. The semantic space provides a common representation and enables a comparison between the text and images. In the experiments, we look at two approaches of retrieving images based on only their content from a text query. We compare orthogonalization ...

The GMRES method for solving nonsymmetric linear equations is generally used with restarting to reduce storage and orthogonalization costs. Restarting slows down the convergence. However, it is possible to save some important information at the time of the restart. It is proposed that approximate eigenvectors corresponding to a few of the smallest eigenvalues be formed and added to the subspace...

The representations currently used by local search and some evolutionary algorithms have the disadvantage that these algorithms are partially blind to “ridges” in the search space. Both heuristics search and gradient search algorithms can exhibit extremely slow convergence on functions that display ridge structures. A class of rotated representations are proposed and explored; these rotated rep...

A new version of the time-dependent close-coupling method is used to calculate the single and double photoionization of the Be and Mg atoms. Total cross sections are calculated using an implicit time propagator with a core orthogonalization method on a variable radial mesh. The double to single photoionization cross section ratios are found to be in good agreement with experiment for both Be an...

There is a robotic balancing task, namely real-time dextrous-hand grasping, for which linearly constrained, positive definite programming gives a quite satisfactory solution from an engineering point of view. We here propose refinements of this approach to reduce the computational effort. The refinements include elimination of structural constraints in the positive definite matrices, orthogonal...