v1 = 23, -1, -3, ..., n
v2 = 12, 0, -26, ..., n
- - -
vn = -1, -1, 1, ..., n
p1 = 3, -11, 3, ..., n
p2 = 1, 0, 6, ..., n
pn = -1, 1, 1, ..., n
Have to normalize all values to 0 and 1 first:
if value is<=0 make value=0; if value>0 make value=1
After normalize, compare using Boolean logic, the vn lists with the pn list.
pn ALWAYS as result of vn boolean interactions, returning true or false as ouput.
I have to compare the whole list... not element by element...
Have to use only these booleans == (equal to), != (not equal to), and 'and'.
Final results should be something like:
v1 = pn; v2 is not pn; vn and v2 and ... = pn
Optional Information: Language (or Software): Python Browser (if necessary): Safari
15. # XXXXX Boolean logic compare all elements in vn with all elements in pn. Return vn "inhibits" or "activates" pn.
17. for i=1 to n
18. for j=1 to n
19. if vi==pj then print vi,' activates ',pj
20. if vi!=pj then print vi,' inhibits ',pj
21. *** MISSING "AND" COMPARISON ***
Thank you RRJha,
I need is the relationship of pj (the output) from vi (the input)...
I am attaching a table to see it can be more explanatory...
I did some extra work too...
If you could have a look, it would be very helpful.
I am trying to attach the table, but it gives me error...
Below it is what I did so far:
The number of pns are equal to the number of vns.
You can think vns as v1(t), v2(t),..., vn(t)
and pns as v1(t+1), v2(t+1),...,vn(t+1)
NOT (pn is not true for vn):
AND (example: vn and vn are true for pn)
vn vn pn
1 1 1
1 0 0
0 1 0
0 0 0
Let me know if you need more information.
Yes, you are right.
All combinations possibles for v... I got stuck on there...
Thanks for your help.