search for: disprov

I run a decent amount of 3ware hardware, all under centos-4. There seems to be some sort of fundamental disagreement between ext3 and 3ware's hardware RAID5 mode that trashes write performance. As a representative example, one current setup is 2 9550SX-12 boards in hardware RAID5 mode (256KB stripe size) with a software RAID0 stripe on top (also 256KB chunks). bonnie++ results look

Could anyone please explain how to set up contrasts between means in R. I want to know if "before I conduct an experiment and believe the mean for 1 and 2 will be different from means 3 and 4, Is this true?" That is what I have to prove or disprove, I thought that contrasts would be the way to go. Thanks for the help. Igor [[alternative HTML version deleted]]

Dear all, I was doing an experiment to disprove some theory therefore performing lot of random simulation. Goal is to show the audience that although something has very rare chance to occur but it doesn't mean that event would be impossible. In this case after getting that rare event I need to show that same scenario for multiple times...

...d one confusion. My confusion related to your naming of the two instructions as A and B. It's consistent all through LoopDependenceAnalysis. I'd prefer something like source and destination, so I can keep track of which is which. It didn't matter so much when you were simply proving or disproving dependence, but when you compute direction, it's suddenly crucial. The problem is the computation of direction from distance. The code says: if (distance->isZero()) S->Direction = Subscript::EQ; else if (isGT) S->Direction = Subscript::GT; else S->Direction = Subscript::L...

...can help guide this SoC project. I would also like to see if we can coordinate with Alex and Albert, who are doing the class project here. As a first comment, your 3 layers are a good organization but two comments: 1. Layer 1 shd also look at loop bounds and array bounds: those can be used to disprove some deps. 2. The interface will also need to compute direction and perhaps distance vectors. Those may or may not be easy to put in one of your layers (say, layer 3, where they belong). --Vikram http://www.cs.uiuc.edu/~vadve http://llvm.org ...... Original Message ....... On Tue, 18 Mar 200...

...it helped another use case). Add to this the upgrade code for GUID indexes didn't assert that if the re-index failed that we must abort the transaction, so the partial upgrade case gets committed and it all dies on the next DB open. At least that is the theory I'll be working to prove or disprove on Monday. I think the core short-term fix is in: commit 5c1504b94d1417894176811f18c5d450de22cfd2 Author: Gary Lockyer <gary at catalyst.net.nz> Date: Wed Feb 28 11:47:22 2018 +1300 ldb_tdb: Do not fail in GUID index mode if there is a duplicate attribute It is not the job...

Hello: I am planning to implement GFS for my university as a summer project. I have 10 servers each with SAN disks attached. I will be reading and writing many files for professor's research projects. Each file can be anywhere from 1k to 120GB (fluid dynamic research images). The 10 servers will be using NIC bonding (1GB/network). So, would GFS be ideal for this? I have been reading a lot

...up with a crossover cable between them for a straight, dedicated 1Gb/s But it certainly looks like rsync is not using more than a fraction of the (theoretically) available 100Mb/s There are several other hosts attached to the NetGear switch, and there is no "slowness" about them (which disproved my initial hypothesis of a saturated backplane) Is this a known rsync and/or Cygwin issue? I also get a "cannot send long-named file" message that halted rsync The file in question is probably a fluke, but this could happen again. How could I get rsync to just ignore the too-long file...

...re their level (depth) in the tree, which is always up-to-date. This is used for fast nearest common dominator computation and for building iterated dominance frontier. You can get it by calling .getLevel() on a DomTreeNode. - We have a new set of verifiers that are able to prove or disprove correctness of a DomTree -- you can explicitly do it by calling DT.verify(). The check has a disadvantage of being quite slow (O(n^3)), so the legacy DT.verifyDominatorTree() uses it only when ENABLE_EXPENSIVE_CHECK is enabled, or when the -verify-dom-info command line option is set...

...what he means specifically, or where he got this reference from. In an effort to refute what I believe is an error or misunderstanding on his part, I have spent time on Yahoo, Google, the ZFS section of OpenSolaris.org, etc. I really haven''t turned up much of anything that would prove or disprove his comments. The one thing I haven''t done is to go through the ZFS source code, but its been years since I have done any serious programming. If someone from Oracle, or anyone on this mailing list could point me towards any documentation, or give me a definitive word, I would sure appr...

...o this the upgrade code for GUID indexes didn't assert that if the >> re-index failed that we must abort the transaction, so the partial >> upgrade case gets committed and it all dies on the next DB open. >> >> At least that is the theory I'll be working to prove or disprove on >> Monday. >> >> I think the core short-term fix is in: >> >> commit 5c1504b94d1417894176811f18c5d450de22cfd2 >> Author: Gary Lockyer <gary at catalyst.net.nz> >> Date: Wed Feb 28 11:47:22 2018 +1300 >> >> ldb_tdb: Do not fail...

...becomes unkillable. The only resolution is to reboot the server completely. This has occurred at least once when a workstation crashed but we have not proven that this is always the case. I was rather hoping that it was a Windoze problem to do with not having SP2 installed but this has now been disproved. This is a serious problem. I have seen postings here before about disabling OPLOCKS but am reticent to do this becasue of the drop in performance which could put cracks in our arguments for using Samba in the first place. Also I thought 2.2.2 had fixes for OPLOCK bugs! Does anyone have any s...

...ike opt -basicaa -mem2reg -simplifycfg -loop-simplify -loop-rotate -simplifycfg -instcombine -indvars -da Also, a confused dependences mean that the analysis wasn't able to prove anything; a FullDependence means the analysis was able to prove some facts, though it wasn't actually able to disprove the dependence. It's not reasonable to cast a Dependence to a FullDependence. Preston -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130808/4d30fe92/attachment.html>

...SHA-256. So I'm out of luck here. The different formats are no longer relevant then. CRYPT-SHA512 is not anywhere near as secure as PBKDF2. But I've read and learned a lot about secure password hashing in the past 24 hours. My initial point that PBKDF2 is the state of the art has been disproved already. This order seems to be the case [1]: MD5/SHA1 << SHA2 << PBKDF2 < bcrypt < scrypt < Argon2 So I've changed my plans and try to go for Argon2 now. I found support for .NET Core [2] and Python [3]. My original question is kind of obsolete now because I also fou...

To whom it may concern, I happened to run the following R code just to check the layout of the output, but found that the code doesn't work the way I thought it should work. '' > lm(rnorm(100) ~ rnorm(100)) Call: lm(formula = rnorm(100) ~ rnorm(100)) Coefficients: (Intercept) -0.07966 Warning messages: 1: In model.matrix.default(mt, mf, contrasts) : the response appeared

1. ————— Dan, The reasoning given below for how GVN operates seems odd to me, Poison is an attribute of a value, just like nsw is an attribute of an operation, So when GVN sees a pair of equal values, one of which has an extra attribute, The proper choice for representative value is the one without the attribute, Just like when GVN sees a pair of add operations, one of which has an

Hello all, I''m new to Mongrel and am very impressed with what I see so far. This thing beats FastCGI hands down, and is even simpler to use than SCGI. Great job Zed! Thanks for all the hard work. I am a bit surprised at the memory usage patterns though. I''m not sure if I''m doing something wrong (most likely I am), or if this is a problem with the app I''m

...at your goal here is, or what you see your role as. > I can tell you, again, completely personally, that i find your approach off-putting at times. > To give a concrete example, here, what i see (again, from *my* perspective), is you are asserting things to me and asking me to confirm them or disprove them. I generally have not found this to be a good collaborative approach to increasing understanding. You then say"If Dan agrees with the above then can we come up with a better example". In practice, so far, that has meant "can *Nuno* come up with a better example" (IE the...

...the scanner. The scanner is far from perfect so there might be a lot of false positives(I have marked those in the commentary). Also, there are things I could not figure out whether they are false positives or not. I would like to ask someone with a deeper knowledge of the code to either confirm or disprove my findings. After that I will be more than happy to send a patch that will fix some of these issues. Thanks and regards, Michal -- You are receiving this mail because: You are the QA Contact for the bug.

...tdlib implementation. > > The gcc code will use the open-source "newlib" while the Visual C++ compiled > > code will rely on Microsoft's libc. > > In general, you have to compile everything with the same compiler to get > it to link correctly. I am bound to disprove that ;) The calling conventions are only an issue if there is a mismatch. I believe both sides are currently using __cdecl calling conventions. The only link errors that are left are related to GCC's software FPU emulation. GCC references emulation functions that are part of glibc only (I us...