The polarity algorithm issue

[Maple-Wang]

---

C=x_i^2/√(n)

Where:

x_i^T=∑((1 + c * (x_i^A - x_i^D)) * w(-1)^(∑x_i^N))

x_i^A=∑(w_neg * x_i^a)

x_i^D = max(x_i^D', -1)

x_i^D'=∑(- w_neg * x_i^a + x_i^d)

w_neg= (∑x_i^N) mod 2

---

The sigma in the last function is a sum of numbers or scores?

why dose "w_neg * x_i^a“ in the second and forth function?

[trinker]

Please spend some time to format your questions, after you've thoroughly read the documentation, to be be clearer in what you're talking about.

I don't understand the first question as I don't know what you mean by last. Use the equation in text to ask.

I don't understand what you mean by:

why dose "w_neg * x_i^a“ in the second and forth function?

[Maple-Wang]

I think you should write clear about the summation index.

[Maple-Wang]

From the first function ,we can see the polarity C >=0 forever.

[trinker]

I'm not a mathematician. Please do a pull request if you can improve the notation.

[Maple-Wang]

Please give me your material about the computation ,I can give you the precise mathematic function. My email： me.maple.wang@gmail.com