INTEGRATIVE SOFTWARE SYSTEM, DEVICE, AND METHOD

1 . A non-transitory computer readable medium storing one or more sequences of one or more instructions for execution by one or more processors in a processing system to perform a method for determining a dichotomy for a parametric decision process, the instructions when executed by the one or more processors, cause the one or more processors to perform the operations of:

defining a network having a plurality of members an inter-member coherency coupling represented by elements of a coherency matrix, wherein for each i th member the network includes an intensity value, I i ;

determining non-diagonal elements T ij of the coherency matrix in which i≠j and in which i and j represent i th and j th members of the network, respectively;

constructing diagonal kernels K i or non-diagonal kernels H i based on the non-diagonal elements T ij of the coherency matrix and intensity values (I i ) of the members.

2 . The non-transitory computer readable medium of claim 1 , wherein for a given i th member, defining a diagonal kernel vector as a function of its diagonal kernel vector K i and a unit vector as:

{right arrow over (K)} i = ·K i .

3 . The non-transitory computer readable medium of claim 2 , wherein {circumflex over (k)} i is given by:

{circumflex over (k)} i =b x ê x +b y ê y +b z ê z

in which

| ê x |=|ê y |=|ê z |=1 ; ê x ·ê y =0;

ê x ·ê z =0 ; ê y ·ê z =0 and

b x 2 +b y 2 +b z 2 =1.

4 . The non-transitory computer readable medium of claim 2 , wherein for the given i th member, defining a parametric decision vector, {right arrow over (S i )}, as a function of parametric decision scalar S i , and unit vector, , as:

{right arrow over (S)} i = ·S i .

5 . The non-transitory computer readable medium of claim 2 , wherein is given by:

ŝ i =a x ê x +a y ê y +a z ê z

in which

| ê x |=|ê y |=|ê z |=1 ; ê x ·ê y =0;

ê x ·ê z =0 ; ê y ·ê z =0 and

a x 2 +a y 2 +a z 2 =1.

6 . The non-transitory computer readable medium of claim 4 , wherein the operation further comprises determining a moral skew factor for the ith network member as cos θ i in which

{right arrow over ( S i )}·{right arrow over ( K i )}= S i K i cos θ i .

7 . The non-transitory computer readable medium of claim 1 , wherein wherein the operations further comprise calculating a strength of diagonal kernels K i as:

K

i

=

∑

j

=

1

N



T

ij



I

i



I

j

.

In which I j is the intensity value of the j th member of the network.

8 . The non-transitory computer readable medium of claim 1 , wherein the operations further comprise calculating a decision weighted mean, <S>, based on diagonal kernels K i as:

〈

S

〉

=

∑

i

=

1

N



S

i



K

i

∑

i

=

1

N



K

i

.

9 . The non-transitory computer readable medium of claim 1 , wherein the operations further comprise calculating an i th -weight as

w

i

=

K

i

∑

i

=

1

N



K

i

;

0

≤

w

i

≤

1

,

and





∑

i

=

1

N



w

i

=

1.

10 . The non-transitory computer readable medium of claim 1 , wherein the members comprise an individual, a high-value-individual candidate, or a group of interest.

11 . The non-transitory computer readable medium of claim 1 , wherein matrix elements are non-symmetrical, such that T ij ≠T ji .

12 . The non-transitory computer readable medium of claim 1 , wherein Tij is defined as: Tii=1, and Tij≦1.

13 . A non-transitory computer readable medium storing one or more sequences of one or more instructions for execution by one or more processors in a processing system to perform a method for determining a moral skew factor for a parametric decision process, the instructions when executed by the one or more processors, cause the one or more processors to perform the operations of:

defining a network having a plurality of members in which each member comprises an intra-ego influence including a first unit vector, {circumflex over (k)}, and an inter-ego influence including a second unit vector, ŝ, representing a member strength,

constructing first and second kernel vectors parallel to said first and second unit vectors, respectively;

computing an angle, θ, between the first and second kernel vectors; and

determining the moral skew factor as cos(θ).

14 . The non-transitory computer readable medium of claim 13 , further comprising determining an inter-member coherency coupling represented by elements of a coherency matrix, wherein each i th member the network includes an intensity value, I i .

15 . A non-transitory computer readable medium storing one or more sequences of one or more instructions for execution by one or more processors in a processing system to perform a method for determining a moral skew factor for a parametric decision process, the instructions when executed by the one or more processors, cause the one or more processors to perform the operations of:

defining a network having a plurality of members an inter-member coherency coupling represented by elements of a coherency matrix, wherein for each i th member the network includes an intensity value, I i ;

determining non-diagonal elements R ij of the coherency matrix in which i≠j and in which i and j represent i th and j th members of the network, respectively;

determining a non-diagonal pseudo-vector, {right arrow over (G)} i , for the i th member;

determining a parametric decision vector, {right arrow over (S)} i , for the i th member;

computing an angle, θ, between the non-diagonal pseudo-vector and parametric decision vector; and

determining the moral skew factor as cos(θ).

16 . The method of claim 15 , wherein the operations further comprise determining a projection of non-diagonal pseudo-vector, {right arrow over (G)} i , onto parametric decision vector, {right arrow over (S)} i , and computing a non-normalized weight of the parametric decision vector as a sum of the projection and the intensity I i for that member.

17 . The method of claim 16 , wherein the operations further comprise determining whether a member is a high-value member based on the moral skew factor and the non-normalized weight.