search for: comparsion

Has anyone else ran into this? debug: /Stage[main]/Mcollective/File[/var/tmp/facts.yaml]/content: Executing ''diff -u /var/tmp/facts.yaml /tmp/puppet-file20121214-13448-933j3r-0'' notice: /Stage[main]/Mcollective/File[/var/tmp/facts.yaml]/content: --- /var/tmp/facts.yaml 2012-12-14 00:53:20.000000000 +0000 +++ /tmp/puppet-file20121214-13448-933j3r-0 2012-12-14

Hi. I''m all set for doing performance comparsion between Solaris/ZFS and FreeBSD/ZFS. I spend last few weeks on FreeBSD/ZFS optimizations and I think I''m ready. The machine is 1xQuad-core DELL PowerEdge 1950, 2GB RAM, 15 x 74GB-FC-10K accesses via 2x2Gbit FC links. Unfortunately the links to disks are the bottleneck, so I''m goin...

Hello, I'm trying to do a comparsion on a large scale say 10L bottle of liquid and a small scale bottle of liquid 0.5L, I have 5 different samples from each and they are measured over the space of 8 days as % viability and the % viability decreases over time. However not all 10 samples got measured every day. How would I do a two-way...

...The patch is too large for the mailing list, and may be obtained from http://s3.amazonaws.com/VIDownloads/xi-20060626.patch The patch applies against changeset 10352 (and possibly others) We look forward to any comments and suggestions. Thanks, -b XI Shadow Test Report This report shows a comparsion of test runs done on xen-unstable changeset 10352 with and without the XI patch applied. It also compares pfault, sync_all, and invl_pg performance. With the XI patch 32bit SMP (PAE) guests now boot and pass the regression tests, closing Bug #661. With the XI patch 64bit SMP guests are much more...

...ain() { char ch; short sh = 0x1234; memcpy(&ch,&sh,2); printf("ch=0x%02x\n",ch); } At i586 target,the corect executive result was "ch=0x34",but once openning the SROA optimization pass it turned out as "ch=0x00". Then I had a try to dump IR code for comparsion between before and after SROA optimization pass. IR before SROA: define i32 @main() #0 { entry: %retval = alloca i32,align 4, %ch = alloca i8,align 1, %sh = alloca i16,align 2, store i32 0,i32* %retval, store i16 4660,i16* %sh,align 2,!tbaa!0, %0 = bitcast i16* %sh to i8* call void @l...

Note: Question is written after describing what I have coded. Hello LLVMDevs, I am trying to impliment floating point comparsion for an architecture which supports following type of floating point comparision if FPU is available: fcmp.un --> true if one of the operand is NaN fcmp.lt --> ordered less than, if any input NaN then return false fcmp.eq --> ordered equal, if any input NaN then return false fcmp.le -->...

On Thu, Mar 9, 2017 at 9:35 PM, Hal Finkel <hfinkel at anl.gov> wrote: > > On 02/25/2017 03:06 AM, vivek pandya via llvm-dev wrote: > > Note: Question is written after describing what I have coded. > > Hello LLVMDevs, > > I am trying to impliment floating point comparsion for an architecture > which > supports following type of floating point comparision if FPU is available: > fcmp.un --> true if one of the operand is NaN > fcmp.lt --> ordered less than, if any input NaN then return false > fcmp.eq --> ordered equal, if any input NaN then ret...

...* Day14:Cryogel4 -1.2834 0.4655 -2.757 0.00583 ** Day28:Cryogel4 -0.6300 0.4591 -1.372 0.16997 Day7:Cryogel4 -1.3436 0.4596 -2.923 0.00347 ** HOWEVER I want ALL the comparisons e.g. Cryogel 2 versus 4, 3 versus 2 etc on each of the days. I realise that such multiple comparsions need to be approached with care to avoid Type 1 error, however it is easy to do this in other programmes (e.g. SPSS, Genstat) and I'm frustrated that it appears to be difficult in R. I have tried the glht (multcomp) function but it gives me the same results. I assume that there is some way of...

Dear all, I would like to use the Levenberg-Marquardt algorithm for non-linear least-squares regression using function nls.lm. Can anybody help me to find a a way to compute confidence intervals on the fitted parameters as it is possible for nls (using confint.nls, which does not work for nls.lm)? Thank you for your help Michael

Is it possible to create a pdf output file with an (as nearly as possible) exact size? For example, if I want to draw in an A4 paper (210 x 297 mm) a square of 100 x 100 mm, how can I do it? FWIW, about 6 months ago I learned here how to create an exact png image. For example, if I want a 500 x 500 black square in a 1000 x 1000 white png, occupying the center of the png, the procedure is this:

...finkel at anl.gov>> wrote: > > > On 02/25/2017 03:06 AM, vivek pandya via llvm-dev wrote: >> Note: Question is written after describing what I have coded. >> >> Hello LLVMDevs, >> >> I am trying to impliment floating point comparsion for an >> architecture which >> supports following type of floating point comparision if FPU >> is available: >> fcmp.un --> true if one of the operand is NaN >> fcmp.lt <http://fcmp.lt> --> ordered less than, if any...

...ou get angry for me, but I don't understand why. I don't want to dispute with you, but maybe I forgot to say some things... Here they are: 1. My program (clone) is not a finalized, and NOT A RELEASED (public) program. This is just a test, I wrote it to myself, to the (sound quality) comparsion of MP3 and OGG. 2. Because of this don't worry about the copyright information, I acknowledge your merit in this development, and I don't want to public this oggenc as my own program. 3. Sometimes your solutions are too complicate for me (long or passes my comprehension), bec...

Hi, I use the code below to aggregate / cnt my test data. It works fine, but the problem is with my real data (33'000 rows) where the function is really slow (nothing happened in half an hour). Does anybody know of other functions that I could use? Thanks, Hans-Peter -------------- dat <- data.frame( Datum = c( 32586, 32587, 32587, 32625, 32656, 32656, 32656, 32672, 32672, 32699 ),

>FWIW - selfhosting I did find that GDB wasn't able to find the source code >for some functions when using LLD's gdb_index, so I've switched back to >gold+gdb_index for now (given the performance problems you mentioned, >sounds like I wasn't gaining much/anything in terms of link time by using >lld anyway). > >On Thu, Mar 16, 2017 at 11:17 AM Rui Ueyama

...ents and suggestions. >>>>>> >>>>>> Thanks, >>>>>> -b >>>>>> >>>>>> >>>>>> >>>>>> XI Shadow Test Report >>>>>> >>>>>> This report shows a comparsion of test runs done on xen-unstable >>>>>> changeset >>>>>> 10352 with and without the XI patch applied. It also compares >>>>>> pfault, >>>>>> sync_all, and invl_pg performance. >>>>>> >>>>>&g...

I Want to have a copmparsion with NFS v3 that shows some statistics with both attribute intensive and data intensive clients. /P -------------- next part -------------- A non-text attachment was scrubbed... Name: vcard.vcf Type: text/x-vcard Size: 392 bytes Desc: Card for Patrik Linder Url : http://lists.samba.org/archive/samba/attachments/19990301/59f94bcf/vcard.vcf

...8000}'` localhost Program received signal SIGSEGV, Segmentation fault. 0x806cfbd in detect_attack ( ..., len=88016, IV=0x0) at deattack.c:138 136 for (i = HASH(c) & (n - 1); h[i] != HASH_UNUSED; We can inspect the table index (SEGV happened during h[i] != HASH_UNSIGNED comparsion): (gdb) printf "%x\n",i Results may vary with every connection, depending on the entropy seed used by the client, crypto keys, etc. You can easily produce a wide 32-bit range of indexes by changing client parameters or simply reconnecting. It is obvious there wouldn't be a problem t...

Hi i was wondering if there is a quick way to search for a item within an array. Here is my approach for this functionality. It''s an prototype for an Array method called "has": Array.prototype.has = function(needle) { for (var i=0;i<this.length;i++) { if(this[i] == needle){ return true; } } return false; } var someArray = [''jim'',

...~13 minutes (where I am not sure how many commands are run) and the Wine III versus Linux III discrepancy of 1m38s (where I know many fewer commands were run than in the Wine II and Linux II cases). Given the known Wine startup latency for simple commands and the possibility that all these timing comparsion results for the same build on Linux and Wine can be explained by that, what can I do to reduce that latency? Note, all Wine results above were done with "timeserver -p" run beforehand. Also, the environment variable controlling Wine debugging was set to WINDEBUG='-all" (as sugges...

I recently coded a recursion algorithm in R and ir ran a few days without returning any result. So I decided to try a simple case of computing binomial coefficient using recusrive relationship choose(n,k) = choose(n-1, k)+choose(n-1,k-1) I implemented in R and Fortran 90 the same algorithm (code follows). The R code finishes 31 minutes and the Fortran 90 program finishes in 6 seconds. So the