Bio-Inspired Computing and Networking

472

■

Bio-Inspired Computing and Networking

Algorithm 18.1

1. i ← 0

2. Generate node n

i

and initialize its concentration randomly using the Monte

Carlo method.

3. WHILE i < i

max

DO

generate the node set N

i

=



n

j

: j = 0, ..., J



within the neighbor

hood of node n

i

FOR j = 0TOJ

FOR k = 0toK

3.1 encode n

i

by the kth bit of binary code W

X

denoted as X

k

3.2 calculate the concentration values of n

j

by a nonlinear

dynamics equation

3.3 encode n

j

by the kth bit of binary code W

Y

denoted as Y

k

,

which is regarded as the output of the pathway

3.4 calculate mutual information I

i,j

← I(n

i

, n

j

) between

nodes n

i

and n

j

ENDFOR k

j



← arg max

j

I

i,j

, i.e., the node is selected which maximizes ...