Time is a thing that we can't reobtain
V](t, x) of the process; we expect to reobtain
G = G > 0 in the particular case in which G is deterministic, according with Eq.
As is described, based on the key K, the sender encrypts messages noted by M to generate the ciphertext C which is transmitted over insecure channel, and the authorized receiver decrypts it using the same key that has helped in the encryption , and reobtain
the transmitted plaintext M.
For example we can reobtain
several classes introduced earlier by (Jahangiri, 1998), (Shaqsi & Dams, 2008), (Ahuja & Jahangiri, 2003).
Note that for s = 1 we reobtain
the definition of (almost) cosymplectic structure.