(2) Let [u.sub.n] : [P.sub.n] [right arrow] [Z.sub.N(n)] be a

bijective function such that [u.sub.n]([R.sub.1]) [less than or equal to] [u.sub.n]([R.sub.2]) if [o.sub.n]([R.sub.1]) [[less than or equal to].sub.n] [o.sub.n]), where [R.sub.1], [R.sub.2] [member of] [P.sub.n]

With this observation, we may as well say that x [member of] [[u].sub.W] if and only if there are multisimilar constant [c.sub.W](x, u) and a

bijective function f on W defined as

Let [phi] : X [right arrow] Y be a

bijective function, (K, [K.sup.*]) be an (L, M)-dffb on X, and (B, [B.sup.*]) be an (L, M)-dffb on Y.

In a crisp graph, a

bijective function (Eq.) that produced a unique positive integer (to each vertex and/or edge) is called a labeling [4].

A

bijective function [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is an edge-magic labeling of G if there exists an integer k such that the sum f(x) + f(xy) + f(y) = k for all xy [member of] E.

We need to select or construct a strictly increasing

bijective function that maps the uniform nodes {[x.sub.i]} to nonuniform meshes with nodes {[w.sub.i]} tailored suitably in order to reduce the error.

It is assumed that for each wealth allocation rule ([W.sub.B], [W.sub.A]) [member of] S there is one and only one agenda [sigma] [member of] P such that ([W.sub.B], [W.sub.A]) = [psi]([sigma]), i.e., [psi] is a

bijective function. Hence, if two different sets of public policies are implemented, the allocation rules induced will be different.

Snell's Law as a

Bijective Function. Snell law (see (3)) can be used to determine the relation between the angle of incidence and refraction; however there is a one-to-one correspondence between these angles once the mediums are fixed.

The evidence-corresponding-relation is a

bijective function [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] Its inverse function is [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] here, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] means the evidences of [B.sub.2] which [B.sub.1] expects.

The

bijective function [??] gives a unique solution for an arbitrary spherical circle of radius r [member of] [0, [pi]/2].

JH compression function is constructed from

bijective function (a block cipher with constant key) [7].