search for: comparse

...0 0 @ 1.90GHz + type: Rack Mount Chassis domain: mochimedia.net timezone: UTC title: mcollective - diskdrives: sda + diskdrives: sda ipaddress_eth1: 10.0.8.71 processor8: Intel(R) Xeon(R) CPU E5-2420 0 @ 1.90GHz processor11: Intel(R) Xeon(R) CPU E5-2420 0 @ 1.90GHz When Puppet comparse the /var/tmp/facts.yaml file to the file in the Filebucket it adds some replaces some entries with an extra space. It appears to add a couple different entries each run. Here is the file resource -- "/var/tmp/facts.yaml": owner => root, group => root,...

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 going to use not more than 4 disks, probably.

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 anova on this in R? Thanks for any help. Regards, Al

A post last week contained the design document for a shadow page table mechanism. This post contains more information, and a pointer to the code. As a recap, the "XI Shadow Mechanism" is a design for shadow page table code for fully virtualized HVM domains running on a 64-bit Xen hypervisor. This work was undertaken to address a number of goals. These are enumerated in the document

SROA optimization pass did some optimizations and transforms for memcpy function,such as ld/st operations.When someone has written down code like size>sizeof(dest) in memcpy(*dest,*src,size), there was much likely a wrong code generation.for example,considered as such testcase: int main() { char ch; short sh = 0x1234; memcpy(&ch,&sh,2); printf("ch=0x%02x\n",ch); } At

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

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

I am struggling to generate p values for comparisons of levels (post-hoc tests) in a glm with a negative binomial distribution I am trying to compare cell counts on different days as grown on different media (e.g. types of cryogel) so I have 2 explanatory variables (Day and Cryogel), which are both factors, and an over-dispersed count variable (number of cells) as the response. I know that both

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:

On 03/14/2017 07:16 AM, vivek pandya wrote: > Hello Hal, > setCondCodeAction(expand) for un ordered comparison generates > semantically wrong code for me for example SETUNE gets converted to > SETOE that causes infinite loops. Can you please explain what is happening? It sounds like a bug we should fix. > > What is ideal place where I can convert unordered comparison to un

Dear Developer Team (Monty/Michael Smith/and others), It seems you 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.

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

Hi, Robert, I found out another confusing code snippet: in void xi_invl_mfn(struct domain *d, unsigned long mfn) if (ext && pfn < ext->large_page_aligned_size) According to the code, it should be if (ext && (pfn>>SPT_ENTRIES_ORDER) < ext->large_page_aligned_size) If I made any mistake, please point it out.

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

Remote vulnerability in SSH daemon crc32 compensation attack detector ----------------------------------------------------------------------- Issue date: 8 February 2001 Author: Michal Zalewski <lcamtuf at razor.bindview.com> Contact: Scott Blake <blake at razor.bindview.com> CVE: CAN-2001-0144 Topic: Remotely exploitable vulnerability condition exists in most ssh daemon

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'',

I am an experienced Linux developer but a Wine newbie. Recently I have been exploring the possibility of using CMake-2.8.1 and MinGW-4.5.0 in a Wine-1.1.42 environment (the backported Debian Lenny packages from WineHQ) to check that CMake-based build systems I use for various software projects work properly for that Windows platform. I am collecting notes for a wiki entry I am planning to write

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