Note: Descriptions are shown in the official language in which they were submitted.
CA 02638134 2008-07-21
The proposed new encryption technology can be directly applied to variety of
applications such as:
= Highly secure communications between two or multiple remote locations. This
kind of communications include governments, military, defenses, etc. For these
communications, the pre-shared key(s) have been provided when the secret
relationship is first established. Due to lack of secure key distribution
technology,
periodically refreshing key reduces the security of communications. They
require
a new technology which can theoretically prove that it is perfect during the
course of long time communications.
= Financial institutes. They need absolutely secure communications between
their
branches, offices for financial transactions, daily updates, etc. In this kind
of
communications, they usually follow a client-server model. Their server and
client
machines usually have pre-shared keys. The proposed technology can directly
apply to them. There are only a very minor changes to the existing
applications.
For senders, the application will call "encryption" API with key(s) and data
and
then send the encrypted cipher text. At the remote side, the application needs
to call "decryption" API and data will be decrypted without security risk.
= This proposed technology can be provided to all virtual private networks
(VPN).
Most VPN network use device authentication with tunneling between peers. The
pre-shared key between peers is natural. This disclosure can provide perfect
security between two remote VPN communications.
= With proposed ID-based key agreement, the shared key between
communication parties can be automatically established by providing a public
"salt" plus shared secret such as password, secret question-n-answer:
o Secure email service: this is a client-server communication. Client user
usually has a user name and a password.
^ Username can be used to identify the user and password can be
used to generated shared secret key
^ When a user tries to login to the secure email server, the server can
send a run-time generated "salt" - any run-time string, to the client
^ The client enters his/her username/login ID and password. The
username may not need to encrypt. The password will be used to
generate a shared secret key. This key will be used to encrypt
email contents and send to the email server.
^ The email server will use the username/login ID to identify the user
and then find the password. The email server will use the "salt" and
the password to generate the shared secret key to decrypt the
email content.
^ For view email, the procedure will be the same. The email server
uses the generated secret key to encrypt all emails for the user.
~
CA 02638134 2008-07-21
And the user will use the same shared key to decrypt all emails and
view them.
o Online banking service: this is a client-server model too. An account
holder and his/her bank share account ID, personal info, and user
password:
^ When a user open the personal banking website, the bank server
picks up "salt" and send to the user. The salt should be associated
with a session.
^ The user gets the "salt". After the user enters his ID and password,
the password and "salt" will be used to generate the shared key to
encrypt all data sent to the server.
^ The server will use the "ID" to identify the user and then look for the
password. If the password is found with the ID. The server will use
the password and the "salt" to generate the shared key. The key
can be used to decrypt data received.
o Secure wireless communication:
o Wireless sensor network: this invention can be a perfect candidate for
wireless sensor network. For this kind of wireless network, the
communication need highly secure level and also less processing power.
This invention meets all requirements for wireless sensor network.
What is the marketable advantage that your invention has over the existing
systems
(i.e. why would someone buy your product rather than another)?
A: Theoretically proven perfect secrecy. Except for one-time-pad (OTP),
existing
security technologies are not proven to be perfectly secure. They are all
built
based on computing difficulties. For example, AES (advanced encryption
standard) is built for the reason that an established shared key (usually
through
D-H protocol) can be reused for a period (key refresh period).
The advantages of AES are:
= It is fast
= The key length can be extended from 128 bits to 256 bits or 512 bits
to increase security level.
= Key can be reused
The disadvantages of AES are:
CA 02638134 2008-07-21
= It is a non-linear method which leads the worst case that brute force
attack can break the AES encryption.
= It needs periodical key refreshing to reduce the risk. In return, the key
exchanging itself is not perfectly secure.
= The large S-box table (4096 bytes) makes the possibility for cache-
timing attack which is faster than brute force attack.
= It needs more than 10 rounds for encryption/decryption
= The performance for decryption is worse than that for encryption.
The proposed solution keeps all AES's advantages:
= It is a first time theoretically proven to be perfect secure technology by
using the so-called multi-dimensional key.
o ID-based key agreement with the uniquely equally likely key
generation
o M-K-C: 1 - N - 1 mapping -* key re-usable
= It is faster than AES. In general, the proposed idea just needs CPU
equivalent to 3-4 rounds in AES: in 2-dimensional key,
o it needs just one addition and one XOR operations for
encryption.
o In the receiving side, it just needs one subtraction and one XOR
operations.
o Roughly one operation here equals one round in AES.
o It also overcomes the slow decryption in AES. In the proposed
solution, encryption and decryption have the same speed.
= The key length is scalable. Because it is theoretical perfect, it does not
need to increase key length to raise security level. Even 64-bit key is
good enough.
= The key can be reused as long as you want. Key re-sharing can be
easily achieved through our ID-based key agreement. There is no
need to exchange keys during communications.
= No worry on the security of communications, regardless what the
network infrastructures between communication peers.
= All disadvantages in the existing secure technologies disappear.
In general terms, how does the invention provide this marketable advantage?
A:
CA 02638134 2008-07-21
1. Use the same shared secret info as the existing secure technologies, the
proposed invention can provide unbreakable, perfect secure
communications
2. Even more, the proposed invention can provide even faster than the existing
fastest encryption/decryption technologies.
3. Mathematically proven 100% secure. No more worry about insecure
communications.
What technical features are required, as a minimum, to implement the invention
that gives this marketable advantage?
A: No specific requirements are needed. There is no any difficulty to
implement
the invention in any existing operation system by hardware or by software.
2. Put another way:
What is the problem the invention is trying to solve?
A: the existing well-known security problem is: No perfect security for
practical
uses. The only theoretically perfect secure encryption algorithm is OTP.
However, the drawbacks of OTP:
= True random generated key and the key length must be the same as the
length of message
= There is no authentication:
o Identity authentication
o Message authentication, also called message integrity check, or
message access code (MAC).
= There is no technology available for perfect secure key distribution. Even
quantum key distribution (QKD) cannot provide perfect key distribution
without using classical authentication method.
Thus, the OTP is not practical. That is the reason why it is not widely used.
To be clear that people desperately look for a practically usable method for
perfectness of security. The proposed disclosure is to solve this problem from
both theoretical and practical aspects.
4
CA 02638134 2008-07-21
How does the invention solve this problem?
A: here is how the invention solves the problem:
= Identify the origin of the problem: it is due to the fact that we treat key
(better to call classical key) to be a one dimensional bit string (can be
considered as an integer):
o The max entropy H(K) of n bits key, based on Shannon, is n bits,
which is obtained from a truly random number generation
o The max entropy H(M) of an n bit message is also n bits.
o H(K) > H(M) gives the lower limit for perfect secrecy.
o Perfect secrecy from Shannon have two conditions:
^ True random key
^ Message-key-cipher text (M-K-C) is 1-1-1 mapping. This leads
to the result that it can be easily broken by known plaintext
attack.
= In order to raise key entropy dramatically, we need to redefine key
terminology. In the proposed disclosure, a key can be defined as a multi-
dimensional key operator with n-bit in length:
o Key operator is defined as a bit string (also an integer) with an
operation associated. For example, k+ is a key operator which
operates on a message by adding them together. Kx is a key
operator which operates on a message by XORing them.
o Multi-dimensional key operator is defined as a concatenation of
non-exchangeable key operators.
o Each dimensional n-bit string is independently selected: entropy for
each dimension is n bits
o m dimensional key operator can have entropy H(K) = m n, m? 2,
which is at least double the entropy of one dimensional true
random key.
o Each dimension of the key operator can be expressed by a
variable ki, i= 1, ..., m.
o Total possible keys are: ( 2n)m
o Each m-dimensional key will uniquely transform all messages from
the n-bit message space into all possible cipher texts in the n-bit
cipher text space.
o For a given message M, m-dimensional key space will
automatically group into n groups with (m-1)n keys in each group:
^ Each key group will transform the message into a different
cipher text in the cipher text space
CA 02638134 2008-07-21
^ So the M-K-C mapping 4 1-(m-1) N - 1 mapping. For a
special case of 2 dimensional key space, the M-K-C
mapping is 1-N-1, where N = 2n.
^ So the known-plaintext-attack does not work in this algorithm
o In order to make the m-dimensional key space is irreducible,
reduced to a lower dimensional key space, two neighbor
operations between key variable should not be exchangeable (i.e.
order of operations is important). For example, M represents n bits
message integer
^ ki +(k2 XOR M) #( ki + k2 )XOR M,
^ but ki XOR (k2 XOR M) = (ki XOR k2) XOR M= ka XOR M, 4
reduce to 1-dimensional
^ andki +(k2+M)=(k,+k2)+M=k3+M4 reduce to 1-
dimensional
o for a long and biased message, the strong internai logics between
message blocks may potentially leak key operator information by
applying a brute force attack. To solve this problem, this invention
proposes:
^ Introduce a pseudo random generated block, initial vector
(IV):
= IV is used to actively avoid "choosing plaintext
attack".
= IV also takes an important role on message integrity
check
^ Add a block for message integrity check, also called
message access code (MAC), after the last message block
= Take shared secret with block size - 2 bytes
= The last 2 bytes are used to carry message length
= Using message block chaining to remove the logic between
blocks.
= starting from IV
= At the i-th block, the (i-1)-th chained message block is
combined with the i-th block to be chained by using
a different operation as in the key operator applied
to the block:
o If k+x operator is used for the i-th block, the
chaining operation at the i-th chaining block
will be "+", then the encryption will be like : ki +
k2 XOR mi' = ki + k2 XOR (mw' + mi), and mo = IV
6
CA 02638134 2008-07-21
o If kX+ operator is used, the chaining operation
at the i-th chaining block will be "XOR", then
the encryption will be like : ki XOR k2 + mi' = ki
XOR k2 +(mi-,' XOR mi), and mo = IV
^ Run-time selection of encryption key operator:
= For a given pair of keys (ki, k2), in a 2-dimensional key
operator system, we at least have 4 different key
operators:
o Ko+X = ki + k2 XOR
o Ki+x = k2 + ki XOR
o K2X+ = ki XOR k2 +
o KsX+ = k2 XOR ki +
= By using shared secret between communication
peers such as password, a key generated from an ID-
based key generation with RC4 key scheduling
algorithm to produce a state table called
ctrTable[256]. For the example here, at block i, the
selected key operator should be at an index keylndex
= ctrTable[i mod 2561 mod 4. If keylndex = 0, the
selected key operator will be Ko+X and keylndex = 2,
then selected key operator should be K.
= For IV encryption, the key operator is always
determined by ctrTable[0]. All other blocks can be
optionally combined IV with block index to select
ctrTable element. For example, keylndex = ctrlTable[
(IV + i) mod 256] mod 4. In such a way, the adversary
must try all operators for each block for a given
selected key pair (ki, k2). This leads an exponential
complexity for each try in the brute force attack.
= By increasing potential key operators, the complexity
of each step in a brute force attack is exponentially
increased. For each step in the brute force attack is
equivalent to a new brute force.
^ introducing a control table to control selection of
encryption key operator for each message block:
= Using shared secret, such as password, secret answer,
or a generated key from an ID-based key agreement,
etc, but not ki or k2, on both sides of communication
peers,
7
CA 02638134 2008-07-21
= Using a key scheduling algorithm such as RC4 to
generate a 256 bytes state table called
ctrTable[256]. The size of the table can be any size in
practical but both sides must agree on it.
= For the example here, at block i, the selected key
operator should be at a key index keylndex =
ctrTableji mod 2561 mod 4. If keyindex = 0, the
selected key operator will be Ko+x and keylndex = 2,
then selected key operator should be K211+
= For IV encryption, the key operator is always
determined by ctrTable[Olmod 4.
= All other blocks can be optionally combined IV with
block index to select ctrTable element. For example,
keylndex = ctrlTable[ (IV + i) mod 2561 mod 4. In such
a way, the adversary must try all operators for each
block for a given selected key pair (ki, k2) and a
given key operator right before the message block.
This leads an exponential complexity for each try in
the brute force attack.
= Due to the control table is independent from the
message, the cipher text, or the keys, it is impossible
to determine which key operator is used for a specific
message block. In order to apply brute force attack
on the long and biased message encryption, the
adversary must successfully guess the shared secret
for her to generate right ctrTable. Otherwise, the
attacker must apply brute force (exhaust all key pair
(ki, k2)), and for each key pair, all possible key
operators (for the example here 4 operators) for each
block:
o IV: 4
o Block 1: 42,
o Block 2: 43
0
o Block 50: 451
0 ....
So each "try" is equivalent to a new brute force.
^ This run-time determining encryption key operator method
can generally apply to any dimensional key operator space,
D
CA 02638134 2008-07-21
even for 1-dimensional space where one need to use at
least 2 keys at the same time.
What is required to implement this solution?
A: it is very straightforward to implement this solution:
= it can be easily implemented by pure software. The key bit length is
scalable.
= It can also be implemented by hardware
3. Are there any existing solutions, or attempts to address the problem noted
in item 2 (only
one paragraph required for each existing method)?
A: AES is most common used standard today. It tries to solve key reuse problem
in two
ways:
= Enlarge key length: 128 bits, 192 bits and 256 bits. Longer is harder.
= Multiple rounds:
0 128 bits key: 10 rounds
0 192 bits key: 12 rounds
0 256 bits key: 14 rounds
The round key is non-linearly set up based on shared secret key. By using
multiple
rounds, the complexity is introduced to the solution. However, it still can't
avoid the worst
case attack, brute force attack. There are other found attacks existing: cache-
timing
attack, etc.
Basically, there is no solution found which can solve both perfect security
and key long
time reusable.
What problems do these solutions leave that the invention corrects?
A: all existing solutions just make it harder to break (then a key can be used
for
longer time), however, the invention cannot be broken.
The proposed disclosure invents a new algorithm which can't be broken even if
a key is continuously used.
4. Any additional options?
A: the left options can be:
1
CA 02638134 2008-07-21
= Different multi-dimensional key construction: I always use 2-dimensional
key in my examples to make the idea much easier to understand. Any
number of dimensions may be used.
= Initial key establishment:
o I propose a new ID-based key agreement here. Someone can use
this or its variety.
o Someone can propose a different initial key agreement. Any
shared secret or key sharing agreement could be used.
5. In detail, how will the invention be implemented in your current
application?
A:
Ctrtable: RC4 KSA - input seceret[], sLen (length of secret)
for i from 0 to 255
S[i] .= i
endfor
j .= 0
for i from 0 to 255
j := (j + S[i] + secret[i mod slen) mod 256
swap(S[i],S[j])
endfor
Encryption: example for a 2-dimensional key operator
INPUT := kl, k2, msg[], buf[], len
//generated a pseudo random IV
iv := pseudRand(;
for i from 0 to blocks
switch (S[i] % 4)
case 0: C = kl +(k2 A (iv += m)); break;
case 1: C = k2 +(kl A (iv += m)); break;
case 2: C = kl A (k2 +(iv A=m)); break;
case 3: C = k2 A (kl +(iv A= m)); break;
//put the cipher text C into buf
/D
CA 02638134 2008-07-21
endfor
Decryption: just a reverse procedure of the encryption.
6. If you are aware of problems others might expect in implementing the
invention in
their environments, describe ways of overcoming these problems will support
broader claims.
A: the software itself is very straightforward. There is no any problem to
implement it in any environment.
~~
CA 02638134 2008-07-21
0
.~
p CL
U }~,
cu
cn
E
O 0
~ ~ E
-~-r >1 c 4)
V ~ ~
o o ~
CL CT)
4) ,, o
._, (L) (i) >, CU
S~e se L. -o 2:% c
E
~ 0_ L Q~ c)) C_o
-0 = (n Q ~c (u _I--+
}, U to = -
o CU U cn
=-
~
E E
~ =- p 4)
c -o C) C/)
CU
-~-~ = -
p
'- Cn-I
x I I I 0
. . .
1~
CA 02638134 2008-07-21
~
U O
cu
o o1-
E m a~
~ Q ~ ~
7o~
o Oc: c:
cu
o~~ ~ ~
o
N X O
.~ o N QO
~ ~ ~ C V cu
O O U CU
cu v) ~C U = ~ .'.-=
~NO (~j
Cn V) cU'N -~-!E -0
O o ~ W~=v
E 0--
N c:tt=O~
U O
(D ~
~ ~ - ~~ WN~
~ p C E cn ~ Mc ~ N~W V.
+r0 1 ~,'c dj ~cn Q
O ~~= Y cc (/) ~ ~ ~ v
~ W ~
~ ~ Y
av' c vi OO~v
~ (1) U N(L) tm'c: U~ cn N~
U L
E ~ c +r tA O co N
7o'L~ cu~v, E
L~ cn E Ctm a) i ci 4?
o = N ~~N~~ c~cn
O i
v ~ a~i o ~ o cn o Y c~i ~ oE? V+ ~~
p)U~ (u ~~~-,O O>+
~ ~ CM ~=~ OO~U
L
QU Q~ U N
W-a
0 0 N=r"~ ~
= U U O
,tE ~ a) E
:3 U o n o O O+r '~'' _~-+
O~ww ~ ~.Y~ T C N r~ (6
a)a) . o O,-mcn`~(n
~~ I I a) I I I I I~< :5 O~ Q
/3
CA 02638134 2008-07-21
E
cn
U)
~ cu
U)
_ 0
cu
c:
O
CL
~
.~ o
c:
4) ~
E
~
CA 02638134 2008-07-21
a.+
:3
0
~ XO~Y
O N _ ~
= ~c~ i.c
~'c
0
~
~
W O ~Y M
v) `=' =~
b
~ ~ If rn
~ >
C.0
^~ F.' x~ NC
~ Q L
~ /~{~ O =p) V
cu M
0
~ ~- HE
(D
3:
4) a~i a~i c'o CU
O ~ ....~
U) N 00
(1)
Z. E >+Rf.C
E O O CO)
o
~_ ^ ~~ >+O+~
00 (1'f O
L
~ /1 Q >+ N ~ Vil cN >+ VII ~ 13 ~ C
V = O N C- (D
!~ C 0 O co O
c: ~+ ~ _ ~+ =- ,+_v~.. _ -~==r U
~- ~, O-=~ ~ ~ ^ fl- U O
0
4W cv L O~ N N C~ Y O N~r
O ~ ~ ~, p. ~ " .'.1 -.N
o L,
~-+ - Q N 2 2 rn Qw Y rn Q NZ''
E O II ~ ~Y ~
~
~ 0 II N 2 X I I I C Y X I I I ~
O'= =Z ~,2~ (~~=(n~N
O
Q E N cCfC ++~U
. . . ~c . = o L ca ,-
~ ~ F- Q Q I-~ O~
~ I I I I I
~ W
l5
CA 02638134 2008-07-21
~_ E (u c:
4) v~ ~ r n
4-0 (1) cu cl) O
U)
(1) >,
>1 -0
c ct3
U)
~ 0 O (1)
U_~4)
CL c/) Jc
~ L tU
~ O
U~ O +~ ~ (D
c E
O cu U)
=3
i -~ c.) ca ~ CX
> U) =-
~
-
ca E J-Z ~
~
O
> .- O cU 0 .~c
L.t_
~ ca _ ~ CL)
~
~- ci)
V ~ E 0`u a)
E c: cu " O
U) c: 0 c ~ ~ >
(f) O r, L O Ocn
co ~
cU O v }' -~ ~e
a) c:O Xi~C
U ~ LlJ ca
X LlJ -0 cn N
. . .
r~
CA 02638134 2008-07-21
L ~
0 ~
~ >
~ ~-O+
E
L .~
a)- N ~ a)
U ~ a)
N
c ~ ~
? N o
N U
cu
14 L N ta E ~
O N >
M + o
_ Q C i o
~ ~ >r
~ _
0 C;) VII ^= 0 t
W
E Q
4-1 3
~ C_ 0 ~ ~~' ~
O c~ C~ N o
^~ Otq 0 C~ Q O~-' o O
4-a C O) O
c: >1 0 c U c: cu o
(D U c N >+ a) V
N >+V ~(a
(/~ ^ Y (c (6 p tn a
N (u + 44 v;o o+ O P,
a)
E N
L o x p~
c:
Ri O>, O (1) Q (1)
Cd,,, ~+ `~ o = ~ 2 a a'
% ~ O N V 0
~ .~ C ,C N `~ fL O =~ :~ ~' ~ ~ M~ N tn 3~ a o o Y ~~'~ a ~3
U) ~, v N o ~ p' o= s? 5,~ ~ u 3
^ V= '~ (n = V L' 0 N
U O c~~~o c~~
~ Q~ (~f c p ^ ^ p y;,, Cd - f'1 V
U O ~ L tB ~ ~
~ Q
N N C U O O O~ v~i G C II I~ .U
Qcl) o O~ N(~ L O 04)0 O~ I I I I ~~~
O~ Q~~~c ~
-~e 0a).- VQ~ . . . Q. . . 0
F-
Y~ I I I I I Y I I I
= =
~7
CA 02638134 2008-07-21
-c
N L
0 O 0
O E N
co O ~ t~ O
~ 00
~ =~ o ~ >+
~ co O O
~ E m y t~
~ t rn~
E-- ~c E .0
N -0O X N
cc
Q
O =O ~ ~C
~ ca
N
0 oc~ cc N
N ma
o +x
Q aa~i
(D
O'2:
~/~~ E
\~/ ~~ /.~ r~y =~ . . rr A=
N Y (V YY/ ~ O
0
co M
N N N'~ 11 QC o
O Y O Y
+_ _ ~c Y O
~C Y~ y v xN YE N 0~
N N LY +Y=t30 N
^ ~ U II II O~ Q Y Y N= O~(Q N(a
~~~.,~II u~~~ ~vo.ooooo
~
OYYY~'N~ .-.1^ON =N C C ~C c
+ ~ Q + N ~ ~ =3 ?~ O N O O c O N
~ N N ~ ~ ~ C ~ ~
YY4=f+" 3 ~~'pZ7~~p"C
~YY U1 +~
0 + (8) 4) +, -0 Lj co cMMNN
~ II O~ O .. .
~+ Y Y ~ X _~d + + = = C a..' ,." to 0 + ~ +
~ II II Y~C 4)- O Y ~ Y Y~G
^ ~ Y ~c ~c r E m d N_ + ~c ~c
O N- ~CY tA_N~ E YYYYYY
N ~ I fl N p V +I X I +I I I XI +I
x M o x + + +
~d Y I
^ ~ V~ .Y ~ (n = 'p = (~ Y ~ Y Y Y _ $
~ ~ = = = = = = ~ = = = = = =
1
N
. =
lg
CA 02638134 2008-07-21
~
~ N
E ~
W
~ C
+r = Q =~ O 0
~
~ ,=+~-"'+
N ~ Q
~ cn a~ 3 '
E ~ o
0 CL >,
U E
C,u (L)
=
~ C Q' C O O Y
N O
Q ca ~ ~ II II ~ ~G N
0 o 0 0 o 0
0 0 -W- .z ~ Q
o O
i L N N ~ CU
~ 4- a ai a +~ Y c O N
0 0 0
~+= O
++ >+ Q O >+ Y Y_ N V, O
0
cu 4--
~ m
~ ~ ~ o N
.c ~
CD .=i
o Q .~..~y ~ Q? ~ Q~ ~ ~ = ~"'
~ p - ~o c _ ~ o-
O. CDO
~ > ~ N ~ N L L L =~ ~ .~ o
~~~ > 0 O O Z3 0 Q~ V)
c~ E 2
m L-'e E (u
N^ O C~
0.0 O~ O ~ O~~ O=~
~ N= ~N AAr ~ -~.~O
~ . N N ~
0~. ~,I)E ~~ .Y .~C 0 O .^~
~ m
~ O~~ oo OM M O~ O U L
0 ~ 0 o cv M Q
c a v Q ~N O~
~ O O~
O O~~ NN NN N N N O +
-0
E'c Y'cY E+E +
~ ~LL
0 ~ ~i = = = ~ = = 7 = = Q) QN
M -c-=O-c
5C O
.
/9
CA 02638134 2008-07-21
(D
~ z
U
Co
C/La
,~.., ~ N
~
cu X N
w
cl)
1
1
cl)
d)
~ Q U
Y U)
'N 3
U '>
~0
CA 02638134 2008-07-21
>1
L 0 O ~ N
O cv
N
cc O N U)
Q rn ~s=N
c N
O . ~ ~~ _-a
s N, x 0~c CL
'bC (D
0'c
Ri = -o L- L ~L
Q~~mO
C> >,~, ~a m .~ N Om
4-1
CJ Y.ta`0 `n ~~ C O O~~
~ Y~ O ~+0
=~+ v N +~Y N~~O ~
0 o W O 0 ca
4) cr ~ m ~ = 0~
^~ 0 y_N >% ^^>+~ #,~~
O ~ O'-~ O
o d 0 L ++ N ~ ~
O E 11 0 Y ~~Q
Q 0)0
Cc
~ O 00-0
c t cl -iY O O'- - ~cco)
~ > co
>, ,.. O
~4) C/) (D
0^U)0 E (D Y~D,COOQE
+ + ~d caOco RfO)
c c: 4"0 ~ N c
~ ~ O CL 0- L. O
3~Q N~C ~C I I c~ N p~~
c)A QocnY_~ + + E E0 ~~'>a~
~~= +~+ O `y Olij Mx x 0 (n 0 0
cu i E >,.. L ca
E I I I I Y N ~-= -
~ O.~s~~c ~+ + ++N=E
~Y
~ ~yt-Q N YYNYY ~ Op~F-
~ ~ ~ = . O . . . . 75 O
~~ U)
a)LL ENv~ca
Q~~ O O
~~
CA 02638134 2008-07-21
a-+
~
~
~
~
L y_
-!=-O o
~ ~
cc Q
O
0
Q.
-ima 0 cu
~ Q N Q CA
cu M
:3 0 N
cr
E N Q II
0 Qw X
~ Q N ~ p ^
yO- .*-+
C
"L .
O V, LL 0 + ~ ~ ~ L
O L CL C3) =
0 II Q Q _ 0 N O
~ ~ cu 4-0
0) O D)
ca a- "- w= ''= Q
o ^ -Y
Q Q 2 daa ^ ~ N ~
o o 0 ~ ~~~ QwY~o~
o 0 Y _ II ~ WW......_
~ c~l
- ~
~ .}, E
W~Y ~ w II n n n n n~~~ II
cu O ' ' = O =- O v
~ ~ II II II + ~ ~
N X o
W O .. E 2S ~_ ~i~~2
~ O . . . . ~ . . ~ .
m ~ I I I
.
aa
CA 02638134 2008-07-21
N
F ~ V N
Y~. ^ .-.
o =
ov~, 2 2
~ c
a) "I-'
(D 4-0 a) E
QN
U) N N -0
^ ~ ____ --- -------- ~
co cn
-------
^ ~ Y
~ N _ -- ____--- ~
.'
,
cl)
E
cn.+ ------- '" ' N ~-cn-+ cn
0 a.
1
a)~ - ,
E
,
cn >+ = / ;
E -le
cn cn
CI)
C C ~ ~
~~~ N N OY cu
=i ~
~3
CA 02638134 2008-07-21
Q,
cn
It
z C
o
c
L N0- cu
~
u
o
C;)0
CL 0
C.)
~~
(D o CU
E
CL z cncu
a)
CL CLr
cu oo~
L
~
~ O
~
o
~ CD~
~ U z ~c cu
>% ~
C;)
z o
Co
U)
U)
a)
CY) U
cu cu
N Q
C/)
CA 02638134 2008-07-21
U
CL
O Jc
i O. o~ L" 0
O ~ ~ ~ 0
4-0 ~ o E "' Q o O
-+-, ca Q Z ~
O O
._ L N ca N 0 0
O Q(1) >, Y C 4-0
N
0 0~ ~=- ~c
O O 04
CIO o N o~ N o~ ~ Z
N N
L cu c/) Jc_
0 L N .C ~ cl) ~ L
X Ic Q~ N C_ I `(/~) (n
O Qc: (D 'o Z O co
L (V ~0 ~ = II E
~,C T ~.
~
L. ~a) E -. ~ CCUL G)' E
Jc Z~;,N o ~
o EL
~- ~- Z 75 a) ~ -0 =3
n c =3~ ~-cn 0
ca0'
o v+r
cr ~ = ~ O
~ ~~ o c, Q.
ca= ~~~ ~ ~L ~ ~o~NZ ~~a~c (1)
~ ~
QQ
(
~~''Q~'~Z~
~ O cu(1)._ o L a~ CU L O N= O v) Q_~ E L L ~
CC3o'~~ ca ~Ua) o~o~
Q = ~ N
~ =
U) (D .c: E O O O CU a) V
>Y Z >+UVYYY~
CY)CY)_.~X~ . . . . ~L Oj,(~O
taZQH+~ (c O+r~~
O O
1
O~ I I I O~
2-
1.1_. ZULLO -O
. . = .
CA 02638134 2008-07-21
c:
O
E ^ -
cn
~ c:
cu
O
- .*.~
CCS C-
~ ~
O
.-
U)
Q) U
O
E -
.- ~
=-
j5)7
CA 02638134 2008-07-21
0
~ /'1
0
^~~ 0
=J
CL ! /'\
O ^ ~
U ~
(D (n II cu Lo
a) ~ E
C)
~ Q }, 43 ^ ~
-0 v rv~`*-~ CN-cv
~- N Q Q Q
r{=~ ~ +
~ V cu
C~ ~ II 0~~I II II II II
o ~ +X E :T
j x i
-1--
+ +
C)
O = = L >
O
^ rr~ O
cu r =
~ ~ ~ ~O"' O
U p (1) ~ 0 (1) ~ :.
~ CL 0.
(u ;,!_
w v~w0 0
~ I I I(D ~ I
W Q
a~7
CA 02638134 2008-07-21
~
^^~
~
~ I = + = `
~ I =
=
X I ~
~ --------~ --;
,
Z
~, ,---------, ,
,
CL
2
p Y H=~`,' 1
(o ~
d) V cu
oa
x
o >
~i--------- ~ i i
x
._ ~ ------- ---v
c
CL
^~ ~..~~~ , cZ'
V
~
Z
c0 o
(1) m
ch CL L L O
O C j
O o =
O
~ Y -w
a8
CA 02638134 2008-07-21
~
E cn
o 0 .
~
~ L ~ t!~
Co Z O O O O
- r- ~ c: cn c:
~ ~ m m
~ = o o E
< ._
O O~ E
-1-+ =-
X o 0
~ ~ ~ V
C- E ~ ~ ~ ~ 4-0
C~S ~ OQ ~~ c~
C: E .-~O E
^~ L .
O .- .~.
CO +-,/ ~ O ~' O
- X cl)
r w ~ tU
~... ~? a~ ..o(D E
c: = ,.,.., 0
cu cu 0
>C cn cu E
CL CL cu c CD cm 0
N >%. tn ~ D O
O = =-
~ O
CL
~
c O 0
( ~O~ ..
~ v N =- O
~ ) tm L' L
.c q V
(3) O.~C
c: c: C:L r cU a)
Z3 (o .-a,(1)CU CULL~
. ~. (!) (D,. > > O N O > N O cu
- = - C c c >+~ C2. c
o v~ ~'
(1) cu cu m cu o
EE
>
aq
CA 02638134 2008-07-21
E ca ~
O NO)C
L CU -0 a)
OE
OE ~
W OO
_i -QO = ~ cu Z(,a)
~
L
U ~ oN ~
cu ~ ~
~a~-ca~=v_~
=-
-~-+ ~ L N
(I)O 0 0 0
~ ~ Q ~
cO (D L)
c 0~'s2
C N
Q~U~
z'~
O
V 3 =3 c
(L) a) -~--' .~
~ a+= (D
.c o
~ rL~=~~N
70.c Z co ~'Oa) ca
E >+V ~~CNt~
~-0 N~.~[~
O
>, = ~ NU ~ O N O~ O
-1-+ E E a> >, ~ c
'
cu U E U a) a
- a) ~
-21 ` ~ ~oa) m
E X x aN
.cn~ ~ .~~ ~U z ~~''" L '= cn
~
O ~ ~ N =L L mS .~
O CMW ~Q =
cu _~ O ~
~ C =U L
U m Q~~ O ~
V) O
~=V O ccc a) cl) cl)~~
Nc))-a C1 NU MON''''
i._c ~ O.>NO~> N N
4- tn ~ OE V Y N cU/~ L
UCO C cv >,a)Na? 0
M~ 0 ~ O, a) Z m E~.~ cU)
mX 4-0
c:
I I I I
~0
CA 02638134 2008-07-21
>1
~
^
W ~ -
0
Co = cf)
cn O O U a~
c~ O
ci) E cn
l6t ~e cn
(D U 0
O E
d. -
o E
cn cn
O
c: cu
~ O c-
~.- 4-.+ }+ -0
cn U
C!) -~ O c~
=- 4)
U) U)
W O cu
~ Z
~
. .
CA 02638134 2008-07-21
c:
0
4-J
E
a) ~
~ U
cn
>% -o
U) -0
c:
O
4-0
CL
CU >1
c:
U
O
. ^=
C/) W
c:
C6
E (D
cn
~ O
E
.
-- ~
c:
O
CA 02638134 2008-07-21
+ 0
(,) M
0 CD V
I I
> .
N
(~ n a) ~v _ , ~ p~
0 cn a) cc +_
U) V O -
V) a) N a) 02 > :
&-& o " 'c
co
U ~ ~ V Yp ~ v~~
cc /L) V c)) p p o+ +
p N
O
4-1 CY) m
W U~ p~ N N~ N (1)
cu cu (u 5, N > N~ =:- 0 o
._ .~ Q VU N N
W O~ E
~ p N N E 0
E -c ~~ 0-0 t~ OE~ O` - o o
~ O 0 L E 'N ~
c
~ Y ,~ ~
v0 N N _'v ~ Y .~ ~
0 v
E ~.~=..~N~ r +~.NO
~-.
,~ ~ N ~
,~ -~ o ~~
.~
p N
~ ~
M
O E U ~ N N 2 U (D 0 0 CO) U) o
ct)
) V V V N 0 -0 i. > .N ~.
0 -.~ d
~ :3 ~~~ _2 N N w(L) ~ V N O~ ~ O U
p I I
~+ ~ O %C = w-D
o o ~ ~
~ rN
- Y o ~
~ (V 0 ~ ~ p 3 ~ O
`d x c
ca p p N % ~~-' .c O + 0
O ~
p V O ~ ~ ~. ~ ~
m tA ~C N
U) Z3>> tOcA co.c cu~Q=
O- v -I-I- ~ v~Q....O
~ I I Q~ I I I~ I I
. . .
33
CA 02638134 2008-07-21
4- = n
p X v~I
w \ /
p
cl) 4-4
(
u cu
cu ^- -c
p ~ U
V ~
0
~ =
~ E
U
.0 so O~-o 0 (cnD E
a~ ~ ~ 0
~ ~~
U ( ~ v =~ O O -~ ..~
co cCa E cn
~ tn O O.~ V~~ ~=- y--
~ c:
o cu ~
=N `~- p o~ ~ p Q ~
E
-V~
._ cO +..
O
73 '3 O' -p ~ (a 0 c: pco p~ v p ~
CC~ o ~ ,~ ~ o
O cn cm U V) 0
,
a) p
r-- ~~a~~~>
iE~o C;)
C.) 4- _ E a) i 0 ~ ~ 0 +-+ 0 0 (1) ~ ~ U) 4) v)
O L. (u o `~ =-+ ~
~ O-~~ 2.~ ~O - F-
~ O O O O
=
3~
CA 02638134 2008-07-21
y U ..++~ ~. ry
rA
~= ~.. ~ .~ .~ ~'' Gi,
O m U 0
`d
rA
ti-'=~ oo~n~a
n' N ~ ~ ~ r.: C >, ~= ai
n' O a~i 'a~ = ~ o ~ +~-' ~ W M rA. ~/~ ~+, i.. s= o r~
=/= ~_=.-
/~ = ~+ ~ bA VI .~
~ O ~=~ uN U
'm m ~/ ~] ~.~
~ 0
Co ~ o
o Z
~ y U s. R3
N E
^ CL O~ 48 OcoISoX
0 N Rs E
O
o i> o~~
t~
E
O O s~.~ Q U ~
xo o~~>, U~1 ~A'
~ ^ .. Cd 4- cO
i.i
o
o
~ >
O v~ +=
C>+L o~~ ~~~ ~.~ O~.~
^ ^ p 0 ~ +
" cd~' cd 0 0^~ =..~
0 a0 + N OCp^ 0 s. d' 0 3 ~ i. 4 4~ V~ O ++
V C~x~cx'~~~~ N~ vy.p~ _õc~i La
O ~/~~ N ~c tt tt tt +~ v~t, .~ c =~ - ~ ~ o o cYi cr
W .' ~ + + XN X~y 0 O ~ U = Vf V1 0 ~ U ~.1 ~ .~ = 0 . W
=~~ ~~~YYY ~~,~ O~ 7w p i~- o~ .t~. L~iG~1 :m :
O ~ = = = = h-~' "+ = = = 'C7 -z 0 t ^ = = = = = = c/)
O LL-a 0~'~.+~ iE-=
C
U) :3
CA 02638134 2008-07-21
U
~~.
4i{
^ .tv; ~ ~~~.
W
~= ir3, .> ~
r .
i. = ~
I~ .
K F
{l J
T T_ +
cl)
2 N
N M Cy)
36
CA 02638134 2008-07-21
0
~O
cn E >
+=~ O -
0 cu
c:
~ ~ E
c: ~ L- = -
.
0 ~ (D (U +~-+
=-
+a
C). c: cn c:
.0 =~ CU
4-
Co o E c
=-
c: c: ,~
Wc:~
~~ ~ E o
CL =- co ~o c:
x ~ m c: a)
CY)
C~W ~ ~E
t!) ~ o cm
n
i ~
U) 0 -o
E m Jc
o = cn
.. c~ ~
(V
O U mo U ~
r. m m
4~ U 4) ~ (D
(f )
U)
= =
~7
CA 02638134 2008-07-21
r)
Y
0
U
0
O L
~ - L
~
CL N Q.
O
0 Y ~ ti ti ti
? I^ ? ^ ? >
cl)
U O m r) N N o"~ Ilo"~ Ilo"~ Ilo"~-
Ll Y 0 E N~ E + E+
N
CY)
c~ E `. E.. ~~ ~~
N
c:
W c: ~ _ UUUU N '~ ++ + N
E
~/~) A W ` L = n E .. u E u E E
ii~ = N= =+ ~
LC) O C S ~ S N ~ Y M C Y
~ X N
~vY Y
W
N -a It ICT d=
f~ 4) N N N 0
O Y Y y Y E 0 0 0 0
N ~, u n n n a + E c_ E E E
+ CO CD u CO
~ ++ Z22Y (A N V N 0 CV N
N U y (a O Y == O V O O
4 O ~ N N
N E E -2 U E E
II II ~ =a
~ N
co ~v~~~ + + ~y + +
~ Qa =D N 0 t(n N t
~ ~ E E E E N Q F ~ - u ~ 'Ut ~ NUt ~ vYi
M U
xoooo u) b Emfl-Em Em Em
a~ a~ a~ a~ =Q c~c
i O~ N N N c~0 N(D C) Vm ~ .. .. tm H ..
oiS .. ..
~ ~
4) 0 ~-' c
~~ U U U U Q N ~ ~~ L) V
o- o C.) a) ya) 0
EF -5 c ; mm 0 c
V..W m (~ E :3 W
~
0 0 . ~ . . .
CL
~ I I I I
3g
CA 02638134 2008-07-21
G)
N M U .
ai
~ s==~ ~O O cd
m au
au
0 3 ~ . = ,-
0
v ~ ~ a) ~ ~ w
0 U 0 =- CU
c: ,~..~
O cn
03~,~,
^ ~~ V -, U (U
4~, .~ ~ cn ~ 4~
~z cd
d) cl, 0
rn rn C404 GU)
~ E-a ~ = .~ 'C = 'C = ~,' . ~ ~L
U =
Y
~ M
O
(~ o U U U cj
^ = ~ o Y ~C Y
+. `~
a
N ~, II II C")
CU O Y .==. .. II
U) 70 o o a
n ~ 0 E E 0
cn ~ ^ co c E
rn
~ t~ -0 ~ U ti c V N ~ ~ N
7 O
0 0 ~ E Y Y Y Y ~ ~ 0 > E E > o >
~ E n E
i cc + E ~" ~ i' ~ + E
0 N N - ~ N
~~. t N W m ca Cl. Otf E E EY E EY E
>
~ ~ c~ ci II O _ (D"~
O Q
cc
M_ii_ ii
EN ~ ? ..=? ? ? V cnF- ~ EH E _ EF- E
~ ~,,, .. ~ .. ~
Uao~.? n . ? N E E E E E
- E-
= = I = I = I = I = = I I . = I .. I . = I = =
~9
CA 02638134 2008-07-21
Y
~..i~
V +r
~
`VVV~
= ~
"' (u a
.^Md. (o Rf
~M ~~ E
O U
~
U i ~ T
w ~
~ ~
~~+ = , O
< v x m
. . k cu
~
cl)
V ~ ~E ~ QCU co
Nr E Oca
O W T lzt- a) C 0
LL
iu cu a~
#--A
~_ ~ M >
vo w ET '~t '111
o
~ V X
V cc
4-0
Y L CO tn 0 U)
CL E zN o
~D
CA 02638134 2008-07-21
~
. r..~
~/'~ ~+ =~ ~ ~
.. /
c: O 00
0
Cd
co
O
ro
0
,
O O ~ 4-)
=
cd o
CO Cd
.~ O
~ O =~ v
~ r
TTT
~ T r g ~ , ~
~, ,
~ =~ =0 Q~ V'
cn ~4
o o .~ , o ~
= O lzi'~ O cd
m cd cid 1~ O . ~ +
~ =~ '~ ~ ~
,.~.~ Cld ~ ~ . ~ . r r"y ' ~ 'v~ ~ C.,~ m =., ~ ~ ~ ~ ,i~; ~
i-~
.~ It 00 ~ ~
r-, N .. .. == == == ~ U U 4~)
U 0
~ cv d~ ~ O ~;
00 _ O ~~ ~ O
~ O O
= = = = = = = w.
~/
CA 02638134 2008-07-21
(
V A'
~ ~
L.
O
N w-
o > ~ O
cl) CU O
4--+ 0 ~e 0)
cu cu
E
~ oo tu
cU N ~ L
~ O fflo
cn m
L. O
c: tn .0 ~
O `i=- t~
~ > V O ~.. O
v oo ~
cl) ;~ c:
0 o- ~ a)
-~-, ~ CC~ ~ c: m - -
~ ~~>, a)~
c: a)~
a) ~ o ~.,
-o`t E c).-
a) 0)
-~ tn O tj a)
O
0. 0 a) c: 0 0 O tn - =
~ tC~
~ t O L. U
~ v 4) ~ =-
~ - ~ > C> > 4) O
F-- cy n ~.S Oo
. . .
~a
CA 02638134 2008-07-21
QD
E m
c:
O
~ cu
C:
W O
Q ^~
~
~
~../
~
(D
cn O
mo
c:
m
' ry
A13
CA 02638134 2008-07-21
Q
~ L
= O
CD
E E N
II v =L co
Z v CM
E
0 CL C6=c:
L ~=- o~
O OCU~
=~
M cn cE
3-
0
cu a) U N = ~ p CD
~ ~ =~ cn tC~ ~ p
v ~ ~=t~ a) cu N
Qc 0 ~ Q. p
N ~ ~ 0 p 2
L-
~ cu . Z cu
O
~,
~ -~d O O) V)
~ - L
cn 'v p c:~r' 'v^N O
~ L V L II ~'tn ~ V \ ~ cu
0 O ~ O 3 I ~' ~
X r
> N ~
N C p ~~.. = ~
O ~^~ ~ Z O
~
u .~ N z (U I I ~ p
~ E V)
(CE N ~L,j
~ p.> 0 N cy
=, N cu
O '5 E x ~ L' r ~ I ~ ~ ~
" ~ Z ~
0 Oc . . -0 ~z~~~CU
cr) Z
= = .
~~
CA 02638134 2008-07-21
L
~
c:
C"'~
E
~. -
E M
c: ~
CU ca
~ cu c: a~ cu
> c:
L. O 0 c O N
4~? > C~6
4-' (1) U
Q cu _ E r.
'a =~-+
~ CU O
O tt~ Z3
+ L.
U 0
r
CD =
O -~ c L N 0
(~S O ^ =~ (1) O
c))
c >% L
~ L- I f ~ = V
CU
CD
N CM '0 CV
c: II a) O O(u
Ci) ~ ~ c :3
> I c O ~ I
w cc~ ~
. =
CA 02638134 2008-07-21
.~ ~
~ N o
..oo cl*o.
.
~ ~ (1) ~
NE cl)~
Q cya r-- O o
~
E 11 c:
O
4-4 A L ~ (~
Q C)
~ N ~ 11 O ~ o
Q O
~ O 0) a
~., .~ o cu x IL)
4) o E o~.; 4? ocn co
L +j
~ ~ ~ (Cf ca o =
~-+E~ cn N~=~
+ L ~ L
E o o ,~ cD
Z cn~,~ EE 0 E
N E0~ oa~
E c3 . _ ...~ L t~ a) o
o a~
0 L- 11 O ~- o Ii a
~ ~^ o o a)
L E Q r 4-1
s.. 1
cD
O ~ .0 `V = (1) o
(u .r, u L. =- x co o (1)
(CS O ,.~ X a) 0 o
~ O o
11 -: ..... W I
cl)
O Q x x
cu.>_ o~~=,=,00
. . .
-oC~tD cu ~~ ~z
=c I l cn
. . .
440
CA 02638134 2008-07-21
-c
c/) T- 1--+
II C ~C L =3
' 0
N (a
X N
O L- ~
cu U) ONY ~ 0 31) - c) ~04l
tn L= (1)
~
L o X Co N
E m o cN O II cn N
cn
c: =- ~ ~ N ll Q~
W .5.~ cu
O)o (D cf)
s.. o a I ^~ x
~ c~ c o
X o ~c c^ N~=- O
a) 4) N =tA U ~,
E ~ O _-,O~=~ X~~ cts
1-+ ~ ~ ~ c
II CL O
O ~- I CID ^ -Y =dj ~ a~i
Z ~ , L = o
`~ u _ L .Q 0
X X O O~ ~~~v)
Eo II O) 1 c (1) ~ X ~ ~
~ ~ ~+ ca =-
-0 ~ X~X cn.~ a
O co -'
:-.
~ X O E O 0 O X O a~
~ ~ E >~ ~ ~ 11 ~ _O cn
_ 0
0 _ 0 0
a)X
~=.ao==~...
0 oco 0
c: (1)
. . .
~7
CA 02638134 2008-07-21
V /
mo
W
W
V /
0)
^~
O
U)
O
~
W
cu
E
E
cl) CU
cu X ~
c:
Q
.
~~
CA 02638134 2008-07-21
0
^
}cu,
Q N
^ ' ~ J
c:W
WV = ~
~
C;)
W ~
U
ma ~
Cu N
E-C
*1_0
X L~-
~ N U-
x
Z
=~' _ O
mo 06
~ ~ ~ U O ^
O ~ _ ~ .=~ ~C L
~ . '=.' Rf ~
N + :3 II u + ~ (D
cu O ~ dj II dj ~~~ II
~ us
N
~ L N~.~ y~.-. II II `_
v v
Q U
:3
N Y N ~ O O O
Cal c c 11 11 II ~
x ~ cn II L Y L
E ~,O II O r~
=-, v- tir
> ,r
49
CA 02638134 2008-07-21
C
O ~
O ~ =c
E
~ ~ E
0
E
40-
N c
72 ~ ~
0
O ~ ~
~ c o
~ o> 75 4- N
I
_ E tn L co ~o ~
CD ~
CCS p c -c
^= .-.V ~ =~ ~
W < ~ .0 N
>
C/) ~ ' ~ Na
O Cn ~ _c~ - LO -0 ~ c~cn
~ - ~ ~~~
~
+
~~ -p ~
a?
-1--+ 0_ = O ~ ll 0
~ ~ 0 4-0- 0 U^ ~ c
m Q) Q f~ ~ ~~
a) -c v =~~ `n ~ C)
A-0 O
C~
O_ ~+-- N X
~ O "' a 0 ~=- 0 o
~a v Y~X~=3
cL
~ (n =- ~ ~ N p c ~ ~
~ n
~ 0 E X N ~ ~
= ~ ~ ~ ~ N. r~CD M
>f~ ~ ~ = a 0 ~ ~ ~ I I
O ~ ~ ~ ~ N 0 ~ J ~
d- ~~QNH . ~-~-~ . .
V~
CA 02638134 2008-07-21
cu
z ~ Q
E
-W E
O .*e
+ Y
~ _
~F-- ~ 7-
0 a~
1 -~ ~ a
(a .9 E
Rf _
N --~=
~
(n ~~~ p V + + CY.
O u
~~ Y G. p
^~
4-+ O ,n- E Y
co (/) 3: Y~tir = r-,X
N M
W
(D
~
W
x
cu -he +
(a
cl) W vJ N ^~~-_+ M ~
V) E N Y
U) EU /~~~YN +~
~ W X u 11 =/ u
`v i, ~ ~+ ~ rn N 5:(/1 ,r Y y
~ cc ~ ~ ~ C >+ 11 ~ Y
YS QYYLL+ E
CO) r
YcoC7 OC
e- N C7 V tA
CA 02638134 2008-07-21
~
J ~ r-----------,
- - - - - - - - - - - - - T- - - - - - - r - - - - -
CO .qr
N
_ 0 aC] Y Q E ~ --------------~------~-----~,
F--9 ...
Q) ~ ,
u
cf) (o I ^_ +
~ N cn
~ U
o o
p~ L
^= ~ .O .~ .,` U U U cn
U
ca (D d
`.
cf) CU m
~ cm OC ,
.~ a 0 ~ .
~----~-~--- --- --~------T-----
-c
~ Q L aY
t
------------~--~------*-~-.___I
~------------+
CA 02638134 2008-07-21
c~
~+ YY
^~ ~ ~
0 N
U m YY _
N N
= ~ Y Y Y
i ~ Y j
~
Q Q
II II +
~ U U Y
N
W m ~ U } Y N
W Y
Q H N ~ G) Y Y
4-1
4-1
U) N ~
m N a jC Y
c: ~ OC +
a pC ~ Y
Y }
LLJ
U L Q a ~ N Q II Y
(D
Co 4.
^ r
N N ="i ~
~ N N Y Y Y 4) fl.
~ ~ Y Y x m + x
~
m p II u Y Q
co ~ Q U U Y
+
Y
/\ Q cl)
CD Q. v
1-= (1) cn v ~=
~ ~ a N
m
~ '=~~ ~ ~ ~ ~ ~ N
~ ~ Q Q YY
V Q YY *7
YCN
53
CA 02638134 2008-07-21
.
Conclusions
The present invention has been described with regard to one or more
embodiments.
However, it will be apparent to persons skilled in the art that a number of
variations and
modifications can be made without departing from the scope of the invention as
defined
in the claims.
The method steps of the invention may be embodied in sets of executable
machine
code stored in a variety of formats such as object code or source code. Such
code may
be described generically as programming code, software, or a computer program
for
simplification. Clearly, the executable machine code or portions of the code
may be
integrated with the code of other programs, implemented as subroutines, plug-
ins, add-
ons, software agents, by external program calls, in firmware or by other
techniques as
known in the art.
The embodiments of the invention may be executed by a computer processor or
similar
device programmed in the manner of method steps, or may be executed by an
electronic system which is provided with means for executing these steps.
Similarly, an
electronic memory medium such computer diskettes, hard drives, thumb drives,
CD-
Roms, Random Access Memory (RAM), Read Only Memory (ROM) or similar computer
software storage media known in the art, may be programmed to execute such
method
steps. As well, electronic signals representing these method steps may also be
transmitted via a communication network.
All citations are hereby incorporated by reference.
5q
