We verify in this paper that the linearity and orthogonality structures of a (not necessarily local trivial) Hilbert bundle over a locally compact Hausdorff space Ω determine its unitary structure. In fact, as Hilbert bundles over Ω are exactly Hilbert C0(Ω)-modules, we have a more general set up. A C-linear map θ (not assumed to be bounded) between two Hilbert C∗-modules is said to be “orthogo...

It is known, by Gelfand theory, that every commutative JB∗-triple admits a representation as space of continuous functions the form C0T(L)={a∈C0(L):a(λt)=λa(t),∀λ∈T,t∈L},where L principal T-bundle and T denotes unit circle in C. We provide full technical description all orthogonality preserving (non-necessarily nor bijective) linear maps between JB∗-triples. Among consequences this representati...

A C-linear map θ (not necessarily bounded) between two Hilbert C-modules is said to be ‘orthogonality preserving’ if 〈θ(x), θ(y)〉 = 0 whenever 〈x, y〉 = 0. We prove that if θ is an orthogonality preserving map from a full Hilbert C0()-module E into another Hilbert C0()-module F that satisfies a weaker notion of C0()-linearity (called ‘localness’), then θ is bounded and there exists φ ∈ Cb()+...

At EUROCRYPT 2012 Pandey and Rouselakis introduced the notion of property preserving symmetric encryption which enables checking for a property on plaintexts by running a public test on the corresponding ciphertexts. Their primary contributions are: (i) a separation between ‘find-then-guess’ and ‘left-or-right’ security notions; (ii) a concrete construction for left-or-right secure orthogonalit...

SUMMARY Recently the GMRESR inner-outer iteration scheme for the solution of linear systems of equations has been proposed by Van der Vorst and Vuik. Similar methods have been proposed by Axelsson and Vassilevski 1] and Saad (FGMRES) 10]. The outer iteration is GCR, which minimizes the residual over a given set of direction vectors. The inner iteration is GMRES, which at each step computes a ne...

In this paper, we propose a novel linear subspace learning algorithm called Flexible Orthogonal Neighborhood Preserving Embedding (FONPE), which is a linear approximation of Locally Linear Embedding (LLE) algorithm. Our novel objective function integrates two terms related to manifold smoothness and a flexible penalty defined on the projection fitness. Different from Neighborhood Preserving Emb...