search for: accurs

In the Green Book, section 7.5 discusses new vector classes and uses quaternions as an example of a vector class that needs more than one number per element. I would like to define a new class that has a numeric vector and a logical vector of the same length that specifies whether the measurement was accurate. The following code does not behave as desired: >

On 10/30/13 7:09 PM, Philip Reames wrote: > David, Quentin - Thanks for the feedback. Responses inline. > > On 10/30/13 11:21 AM, David Blaikie wrote: >> Actually CCing Eric. >> >> >> On Wed, Oct 30, 2013 at 11:00 AM, Quentin Colombet >> <qcolombet at apple.com <mailto:qcolombet at apple.com>> wrote: >> >> Philip, >>

On Oct 30, 2013 7:25 PM, "Philip Reames" <listmail at philipreames.com> wrote: > > On 10/30/13 7:09 PM, Philip Reames wrote: >> >> David, Quentin - Thanks for the feedback. Responses inline. >> >> On 10/30/13 11:21 AM, David Blaikie wrote: >>> >>> Actually CCing Eric. >>> >>> >>> On Wed, Oct 30, 2013 at

I accidentaly re-ripped some of my CDs and did take this as a chance to do some comparison. Here is what I have found for on of the songs. Peak level 100.0% Track quality 100.0% Copy CRC C8F5065F Track not present in database Used drive : _NEC DVD_RW ND-3500AG Adapter: 0 ID: 1 Read mode : Secure with NO C2, accurate stream, disable cache Combined read/write offset correction

Hi, Is it possible to accurately seek to a certain position in an OGG file that is streamed off the hard-drive/CD? Or alternatively, is there a way to put a marker somewhere in the OGG and seek to that? Thanks for your help in advance. Cheers, J <p><p>__________________________________________________ Do you Yahoo!? Faith Hill - Exclusive Performances, Videos & More

I'm solving the differential equation dy/dx = xy-1 with y(0) = sqrt(pi/2). This can be used in computing the tail of the normal distribution. (The actual solution is y(x) = exp(x^2/2) * Integral_x_inf {exp(-t^2/2) dt} = Integral_0_inf {exp (-xt - t^2/2) dt}. For large x, y ~ 1/x, starting around x~2.) I'm testing both lsoda and rk4 from the package odesolve. rk4 is accurate using step

Folks: I thought the following excerpt from Bruce McCullough's post would be a good candidate for the R fortunes package -- except that it's about Excel, not R! So I nominate it... but leave it to others to say whether it's really "qualified" to be nominated. ---- "The idea that the Excel solver "has a good reputation for being fast and accurate" does not

Zviad O. Giorgadze wrote: > My ISP provides guarantied 115kbit bandwidth for GLOBAL TRAFFIC. During the low load period (early morning, evening, night) customers can get up to 1mbit traffic. That''s download traffic we''re talking about, since you seem to be shaping on your local LAN interface? Variable rate ISPs are tough to shape right, I guess... Does this 115kbit vs.

Actually CCing Eric. On Wed, Oct 30, 2013 at 11:00 AM, Quentin Colombet <qcolombet at apple.com>wrote: > Philip, > > Thanks for the clarification. > > As far as I can tell, there is currently no way to preserve a full and > accurate stack trace while utilizing most of LLVM’s optimization abilities. > > The work on debug information may help you get the information

David, Quentin - Thanks for the feedback. Responses inline. On 10/30/13 11:21 AM, David Blaikie wrote: > Actually CCing Eric. > > > On Wed, Oct 30, 2013 at 11:00 AM, Quentin Colombet > <qcolombet at apple.com <mailto:qcolombet at apple.com>> wrote: > > Philip, > > Thanks for the clarification. > > As far as I can tell, there is currently

Just as the subject states, how close and accurate can time synchronization be with Samba as a PDC and Windows Clients connecting to the PDC with net time? I have setup a logon script, so when all Win2k clients connect to the PDC, they will receive the logon script and use the PDC as their time server. What I have noticed in my testing is that it is not entirely 100% accurate? For example, I

Dear All, I was using rk4 and lsoda to solve a ODE system. However, both of them gave bad accurate solutions, especially compared with Matlab solver ODE45. For example, ODE45 gave solutions that can go to a stable level (about 1.6) when time goes to infinity, however, the solutions from lsoda are decreasing to very very small (about 1e-130) numbers. Does R have more accurate ODE solvers as

On 10/30/13 9:56 AM, Quentin Colombet wrote: > Hi Philip, > > Could you define what is an accurate stack trace for your project? > In other words, what do you mean by full and accurate stack frame? > > Without this definition, this is difficult to give you any feedback. > In particular, I do not see what it means when we use inlining. Sure. Just to note, I *think* your

Philip, Thanks for the clarification. As far as I can tell, there is currently no way to preserve a full and accurate stack trace while utilizing most of LLVM’s optimization abilities. The work on debug information may help you get the information you need, but I do not think we will provide information on stack frames that have been removed via inlining or tail call. Moreover, if at some point

Hi, I want to use a more accurate value of exp(1).  The value given by R is 2.718282. I want a value which has more than 15 decimal places. Can anyone let me know how can I increase the accuracy level. Actually there are some large multipliers of exp(1) in my whole expression, and I want a more accurate result at the last step of my program, and for that I need to use highly accurate value

Hi Philip, Could you define what is an accurate stack trace for your project? In other words, what do you mean by full and accurate stack frame? Without this definition, this is difficult to give you any feedback. In particular, I do not see what it means when we use inlining. E.g., what do you expect from code like this: static void fct1(…) { ... } static void fct2(…) { … fct1(…) ... }

I just thought that returning a more accurate result was better and that (1:10)/10 was an obvious way to calculate. It turned out that it was not that easy. I found that calculation that I proposed previously was not accurate for seq(-5, 5, length=101). I then thought of from + (0:(length.out - 1))/((length.out - 1)/(to - from)) , that is dividing by (1/by) instead of multiplying by 'by'.

On Wed, Oct 30, 2013 at 8:58 PM, Eric Christopher <echristo at gmail.com>wrote: > > On Oct 30, 2013 7:25 PM, "Philip Reames" <listmail at philipreames.com> > wrote: > > > > On 10/30/13 7:09 PM, Philip Reames wrote: > >> > >> David, Quentin - Thanks for the feedback. Responses inline. > >> > >> On 10/30/13 11:21 AM,

Is there a known way to preserve a full and accurate stack trace while utilizing most of LLVM's optimization abilities? We are investigating using LLVM as a JIT for a language which requires the ability to generate an accurate stack trace from any arbitrary point(1) during the execution. I know that we can make this work by doing inlining externally, manually recording virtual frames,

I don't see how ASan and debuggers are different. It feels like both need reasonably accurate source location attribution for any instruction. ASan just happens to care more about loads and stores than interactive stepping debuggers. Actually they are pretty different in their requirements. ASan cares about *accurate* source location info for *specific* instructions, the ones that do