On Wed, 2003-10-01 at 15:45, Ian Clarke wrote: > On Wed, Oct 01, 2003 at 12:35:08PM -0700, Ian Clarke wrote: > > Line 160: > > > > double pNotConnectFailedOrSearchFailed = > > (1 - pConnectFailed) * (1- pSearchFailed); > > > > My high-school math is a bit rusty, but shouldn't that be: > > > > ... = 1-(pConnectFailed+pSearchFailed); > > Well, thinking about it what is there is: > > not(connectFailed) and not(searchFailed) > > My suggested correction was: > > not (connectFailed or searchFailed) > > Which, if I am not mistaken, is the same thing. > > So n/m. > > Ian.
Well, actually p(CF or SF) = pCF + pSF - p(CF and SF), which is what the existing code calculates: In[1]:= 1-(pCF+pSF) Out[1]= 1 - pCF - pSF In[2]:= (1-pCF)*(1-pSF) Out[2]= (1 - pCF) (1 - pSF) In[3]:= %//Expand Out[3]= 1 - pCF - pSF + pCF pSF In[4]:= -- Ed Huff
signature.asc
Description: This is a digitally signed message part
_______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
