search for: rouding

hi i am creating some variables from same data, but somewhere is different rouding. look: P = abs(fft(d.zlato)/480)^2 hladane= sort(P,decreasing=T)[1:10]/480 pozicia=c(0,0,0,0,0) for (j in 1:5){ for (i in 2:239){ if (P[i]/480==hladane[2*j-1]){pozicia[j]=i-1}}} period=479/pozicia > P[2]/334 [1] 0.0001279107 > hladane[1] [1] 0.0001279107 > P[2]/334==h...

Dear group, I am trying to prepare a NONMEM friendly dataset for population PK analysis. My patient IDs are 10 digit long and NONMEM is losing precison and rouding the last couple of digits. I need to generate unique Patient IDs fromt he current 10-digit IDs. Ihave total 250 subjects so I appreciate if anybody can suggest me a way to code this in R. Regards, Ayyappa [[alternative HTML version deleted]]

There's some sintyax available to use, with ldb* tools, multiple ''server'', eg use multiple '-H', or write server in a roud-robin style? Thanks. -- dott. Marco Gaiarin GNUPG Key ID: 240A3D66 Associazione ``La Nostra Famiglia'' http://www.lanostrafamiglia.it/ Polo FVG - Via della Bontà, 7 - 33078 - San Vito al Tagliamento (PN)

Hello, I have a question about multichannel and the load-balancing algorithm. What kind of algorithm is it? (Roud-robin, dynamic round-robin, ...) What are the arguments the algorithm compute to load-balance the network traffic on the interfaces? I already know that if a 10Gb/s interface and a 1Gb/s interfaces are in the multichannel connection the 1Gb/s one will be ignored until the 10Gb/s goes

Mandi! Rowland Penny via samba In chel di` si favelave... > > There's some sintyax available to use, with ldb* tools, multiple > > ''server'', eg use multiple '-H', or write server in a roud-robin > > style? > No, there is no way built into samba-tool to do what you are asking, > you will have to script something around samba-tool, something

...ten every time. As the kernel has to + * round small waits up to guarantee that we actually wait at least + * the requested number of microseconds, this can become grossly + * inaccurate. We therefore keep a cumulating number of microseconds + * to wait, and only actually perform the sleep when the rouding + * becomes insignificant. (less than 10%) -- REW. **/ static void sleep_for_bwlimit(int bytes_written) { struct timeval tv; + static int time_to_sleep = 0; if (!bwlimit) return; @@ -427,9 +436,13 @@ assert(bytes_written > 0); assert(bwlimit > 0); - tv.tv_usec = bytes_wri...

...ten every time. As the kernel has to + * round small waits up to guarantee that we actually wait at least + * the requested number of microseconds, this can become grossly + * inaccurate. We therefore keep a cumulating number of microseconds + * to wait, and only actually perform the sleep when the rouding + * becomes insignificant. (less than 10%) -- REW. **/ static void sleep_for_bwlimit(int bytes_written) { struct timeval tv; + static int time_to_sleep = 0; if (!bwlimit) return; @@ -427,9 +436,12 @@ assert(bytes_written > 0); assert(bwlimit > 0); - tv.tv_usec = bytes_wri...

...llot/2837/ As I understand: we need to change "mode" definition to be ONLY a list of comma separated values. This is because order of several modes has no importance according to another rfc about SDP... We need a few adjustment: * cng and vbr should be optionnal to folow. * ptime rouding text is not well understood * it should be specified that the code is only defined for mono. * .. Also, we need to know why there is a "license" chapter (chapter 9) and we need to remove it because ietf don't like it... Probably a little more... Aymeric > Jean-Marc > > A...

Hi Jean-Marc, Alfred and Greg, Are you receiving the mails from IETF about draft-ietf-avt-rtp-speex The mails are not coming from AVT mailing list, but I think we are all 3 part of a minimal list (draft-ietf-avt-rtp-speex at tools.ietf.org) dedicated to latest discussion about the draft. I have answered some questions, but there are small changes and adaptation still required to the ietf