search for: proofs

Hey After a lot of work by Marcus the next Newsletter release is nearing completion. Could some people please proof read it. Cheers Didi ---- My www page: www.ribalba.de Email / Jabber: ribalba at gmail.com Skype : ribalba

We are the marketing specialists www.host4bulk.com that provide cheap bullet proof bulk email friendly hosting for your website ($400 for one month of bullet proof hosting) and cheap bulk email campaigns ($200 for 1 million emails sent) As you may already know, many web hosting companies have Terms of Service (TOS) or Acceptable Use Policies (AUP) against the delivery of emails advertising or

We are the marketing specialists www.host4bulk.com that provide cheap bullet proof bulk email friendly hosting for your website ($400 for one month of bullet proof hosting) and cheap bulk email campaigns ($200 for 1 million emails sent) As you may already know, many web hosting companies have Terms of Service (TOS) or Acceptable Use Policies (AUP) against the delivery of emails advertising or

...-0400, Hubert Kario wrote: > creating composites that will pass even 100000 rounds of Miller-Rabin is > relatively simple.... > (assuming the values for M-R tests are picked randomly) Can you point me to the algorithms for doing that? This would suggest that we really do want primality proofs (and a good way to verify them). Do those algorithms hold for creating composites that pass M-R tests for both p and (p-1)/2 ? > I'd be against shipping any primes that are not generated from known, expected > values, like hash of "OpenSSH 1024 bit DH prime, try #1" This is...

Hi, I am interested in the "Dovecot Email Archive" solution. Does anyone know if it is suitable revision-proof archiving? Is it available for smaller companies? I tried to contact people at dovecot.fi but I haven?t gotten any response yet. Thanks Regards,

Hi. I know that R computes sums of squares based on the diagonal of t(Q) %*% y %*% t(y) %*% Q, where Q comes from the QR-decomposition of the model matrix. Does anyone know where I can find a proof for this result? All Best and Happy New Year, Ethan [[alternative HTML version deleted]]

A couple of minor points about the odesolve package (which I am otherwise enjoying very much): 1. "scalar" is misspelled as "scaler" in the definitions of the rtol and atol parameters 2. it is possible to crash R by doing something dumb, e.g failing to read the documentation carefully enough and (a) returning only a vector of derivatives and not a list of (derivatives,

...not reveal compositeness"). Taking the final integer in that sequence (a(11)) fails even the default 25-round M-R test in gmp: >>> k = gmpy2.mpz(3825123056546413051) >>> gmpy2.is_prime(k) False >>> Indeed, the arxiv suggests that in 2012 people were still writing proofs about a(11) for this sequence: http://arxiv.org/abs/1207.0063 but i see no evidence that an algorithm for generating a(n) where n is arbitrarily large exists. Does such a thing exist? > yes, using ECPP and distributing proof with the prime (or just placing it on > the project website)...

On Mon, Nov 24, 2014 at 7:00 PM, Robinson, Paul < Paul_Robinson at playstation.sony.com> wrote: > It should report that the > particular new feature is not support. In this case, something like > "unknown 'g' flag in datalayout". > > Currently that would hit an llvm_unreachable(). How should we > re-engineer this to provide sensible error recovery in

Thanks very much for the quick response. I have read the text many times, but it was not very clear to me why checking the two conditions involving dominance frontiers is equivalent to proving the pair {entry, exit} defines a refined region. I was asking for an mathematical proof really. It sounds to me like there should be a theorem or two in the graph theory endorsing it. Or do you mean, the

Frederick, This is great news! Thanks for your effort. Your proof-of-concept raises a few questions for me: 1) I know that the ratio of uncompressed to compressed data is unpredictable, but I never really considered whether the input block size or the output block size is constant. I'm assuming that if you're breaking the uncompressed input file into multiple pieces, then the

On Wed, Mar 16, 2016 at 12:09:01AM +0530, Amanda Jayanetti wrote: > Seems like it takes a lot of time for 'proof of enrollment' document to get > processed. Will upload the proposal as soon as it gets accepted. You should be able to upload a proposal while the proof of enrollment is still awaiting review. Cheers, Olly

Hey again FLAC devs, I managed to hack out another proof-of-concept multithreaded FLAC encoder that is more amenable to streaming and also uses a fixed buffer size. The performance is pretty much the same as my earlier version; that is, I can encode a 636 MB wave file in ~7s with 8 threads on an 8-core 2.8 GHz Xeon (I erroneously stated 3.0 GHz in my last e-mail) vs ~32s with 1 thread. I had

Greetings all, First of all, a disclaimer: Please forgive my horrible assembly code. This is just a quick munging of code to achieve x86 versus x86_64 detection within pxelinux. So please look at it as a proof of concept and not a real piece of code. :) For example it only works on pxelinux and has no thought for extending it beyond simple x86 versus x86_64 architectures. I had the need for

I work for a multi-billion dollar international organization currently using Novell technology for F&P/Directory/etc... A project has just arisen to develop several potential replacement proofs of concept. Several solutions are being evaluated, including: * Microsoft CIFS * Some NAS device using AD or eDirectory * Linux/Samba I was chosen as part of the Linux/Samba team and I'd like to make sure our POC solution does the technology justice. I am a firm Open Source evangelist, so my...

Hey FLAC devs, I managed to hack out a proof-of-concept multithreaded FLAC encoder based on the example libFLAC one. It turned out to be fairly straightforward to get near-linear speedup; I can encode a 636 MB wave file in 6.8s with 8 threads on an 8-core 3.0 GHz Xeon vs. 31.4s with a single thread. Basically I mmap() the input file, divide up the mmap()ed region into nearly equal pieces,

Hi all, I wrote a program which recovers deleted file from Ext3/Ext2 FS.It's like crash proof program.For past few months i'm trying hard to get feedback or comments or criticizm on the tool.I hope to get from you. The link is , https://sourceforge.net/projects/giis/ Warm Regards, Lakshmipathi.G

Hi List, I've been working on documenting an amavisd-new, spamassassin and clamav installation for postfix on CentOS5 with regards to writing this up for the Wiki (with invaluable help from forum member WhatsHisName - thanks!). I hope to make a start on a Wiki page in the next week or so, so if anyone has any experience with this combo and would like to offer advice, tips and

Has anyone found a good wayt o do a gate intercom using Asterisk? I am looking at a Xorcom PBX with programmable contact, so I have no issue with opening the gate, but the interface at the gate is a bit tricky. I thought about a weather proof housing containing a phone but it seems a bit tacky. I also looked at a handsfree erather proof phone, but at $600 it is a bit steep. Any solutions that

Been using a few different FXO interfaces (X100P, Voicetronix, and SPA-3000) at a couple sites and they've all run into nasty issues at times. I'm looking at moving one of my offices and am in the market for a solution for connecting 4 FXOs. I got excited about recent offerings from Digium and Sangoma in the way of new cards but I hear they're causing troubles for more than a few.