search for: proov

...Or something you're rolling? The reason why I ask is that I expressed an outrageous opinion at Supercomputing back in November, to wit, that CL is probably the best language suited for today's multicore problems... but I don't have the time to hack one of the current implementations to proove the point. Although, you'll notice that LLVM amply prooves "Greenbaum's hypothesis" (IIRC): inside every sufficiently complex program there is an implmentation of a Lisp interpreter. ;-) -scooter

>> I may sound stupid but can someone tell me that after applying >> optimization sequences randomly whether we can surely say that the >> final output is correct? > > Answering this question is equivalent to solving the Halting Problem. Prooving correctness of a compiler is really an NP problem. This goes for any compiler backend. All you can do is have enough test cases. Aaron

Hello, i want to implement a common lisp subset using llvm for fun. This requires the use of a garbage collector. I read the docs, but many things are still unclear to me. 1. how are collectors supposed to find all living objects? there is llvm.gcroot for marking objects on the stack,but how do collectors crawl heap objects? I did not see a way to provide custom mark functions. Are

...anned. > > The reason why I ask is that I expressed an outrageous opinion at > Supercomputing back in November, to wit, that CL is probably the best > language suited for today's multicore problems... but I don't have the > time to hack one of the current implementations to proove the point. interesting, what makes lisp superior in this area over languages with explicit support for parallell computing (like erlang? or Ada) or languages which may be easier auto parallelized (like haskell because of its functional nature). > Although, you'll notice that LLVM amply...

Hi all. I'm experiencing long connect delays due to password file locking errors. For each connection samba logs the following errors: do_pw_lock: failed to lock SMB passwd file. mod_smbpwd_entry: unable to lock file /usr/local/samba-1.9.18p10/private/smbpasswd In the archives I found some other messages reporting the problem (on May this year), but no solution. Did I

Dear Sebastian and all, This is a Japanese to live in Japan. I have a question. Ogg's window functon is f(x)=sin(1/2*pi*sin^2((x+0.5)/n*pi)) for 0 <= x < n But I cannot understand why this window function satisfys the equation f^2(x)+f^2(x+n/2)=2 which is for MDCT's perfect signal reconstruction. reference: Analysis/Synthesis Filter Bank Design Based on Time Domain Aliasing

Dear R-devel list members, we have developed a package and it works perfect in R 1.9.1 but when we prooved with R-devel we get the next output from the R CMD check: Error in eval(expr, envir, enclos) : couldn't find function "@<-" Execution halted ERROR: installing package indices failed ** Removing '/home/pgomez/genArise.Rcheck/genArise' ERROR Installation failed. We thi...

> Prooving correctness of a compiler is really an NP problem. This goes for > any compiler backend. All you can do is have enough test cases. No. To be in NP it would be necessary for a Non-deterministic Polynomial algorithm to exist. There is no such algorithm. The problem is undecidable. It doesn'...

...: >>The reason why I ask is that I expressed an outrageous opinion at >>Supercomputing back in November, to wit, that CL is probably the best >>language suited for today's multicore problems... but I don't have the >>time to hack one of the current implementations to proove the point. > > > interesting, what makes lisp superior in this area over languages with explicit > support for parallell computing (like erlang? or Ada) or languages which may be > easier auto parallelized (like haskell because of its functional nature). Lisp macros make it much...

...happens when any read offset (related to buffer begin) goes above the 64k mark. The offset per uniform block is restricted to 64k, but the offsets per uniform buffers should allow to access the complete memory. It seems that the shader fetch mask locations to the first 64k bytes of the buffer. To proove this, I moved the uniform block to offset 63k so that the first 1k bytes are read correctly and everything else starts at zero. My uniform buffer was 128k big and I copyed as I wanted to proove and I got a correct rendering. I think the mask is because of 16bit indices for uniform locations. This...

*Top 10 Buildings of the world <http://mega-structures.blogspot.com/>* <http://mega-structures.blogspot.com/> [image: Top 10 Records] <http://mega-structures.blogspot.com/> World Most Tuff Building Earthquake Proove buildings American Steel Buildings Allied steel building The Star Cooling Tower *Top <http://mega-structures.blogspot.com/> 10 Buildings<http://mega-structures.blogspot.com/> * http://mega-structures.blogspot.com/ <http://mnoor1.1majorhost.com/><http://www.awpedia.com/newst...

...is is a precondition for doing the reverse resolution registration on MS DNS. To the point I am totally lost on this topic as I am not an expert (actually not even a newbie :o). Is there anyone outside in the community that would help me on this topic ?? I really would appreciate any assistance to proove to the SBS guys in our company that open source prevails ! TIA ET PS: Please include my email address thomas.eitzenberger - at - siemens . com in the reply as I am running samba as daily digest and maybe oversee your reply which would be a pitty for me :o)

Hi there, Is there some way to configure ipfw to do traffic normalizing ("scrubbing", as in ipf for OpenBSD)? Is there any tool to do it for FreeBSD firewalling? I've heard that ipf was ported on current, anything else? TIA, /Dorin. __________________________________ Do you Yahoo!? Yahoo! Mail SpamGuard - Read only the mail you want. http://antispam.yahoo.com/tools

...ight, height, > calories and skinfold. There are 20 entries. I have had to carry out > linear regressions of calories on height, weight and on height and weight. > I have done this using the lm(calorie~height) function etc. > > This has given me the 't' values I needed to proove significance etc. > > Now I am trying to find the correlation matrix of estimated coefficients. > Can anyone tell me how to do this? > > Thanks in advance > -- View this message in context: http://r.789695.n4.nabble.com/Correlation-Matrix-tp2250826p2251274.html Sent from th...

I've tried almost any softphone available on the market with many different PC, soundcard, headphones combinations. None of them prooved production reliable in a call center environment. I've also tested many IP Phones and Gateways. Even the cheapest one supplies much better quality. Is this a fact or am I missing a point. I would certanly prefer a softphone because of cost and simplicity in CTI applications. Cenk. --------...

...ik.org] Sent: Saturday, June 11, 2005 10:03 AM To: asterisk-users@lists.digium.com Subject: [Asterisk-Users] Voice quality of Softphones vs. IP Phones and Gateways. I've tried almost any softphone available on the market with many different PC, soundcard, headphones combinations. None of them prooved production reliable in a call center environment. I've also tested many IP Phones and Gateways. Even the cheapest one supplies much better quality. Is this a fact or am I missing a point. I would certanly prefer a softphone because of cost and simplicity in CTI applications. Cenk.

Is there a way to find all roots of a polynomial equation? Lets say x^5+a*x^4+b*x^3+c*x^2+d*x+e=0 how to find its all roots? [[alternative HTML version deleted]]

...;http://www.awpedia.com/newstuff/highest-building/> Tuffest, largest, highest, underwater and underground buildings * <http://www.awpedia.com/newstuff/highest-building/> [image: Top 10 Records] <http://www.awpedia.com/newstuff/highest-building/> World Most Tuff Building Earthquake Proove buildings American Steel Buildings Allied steel building The Star Cooling Tower *Top <http://www.awpedia.com/newstuff/highest-building/> 10 Buildings<http://www.awpedia.com/newstuff/highest-building/> * http://www.awpedia.com/newstuff/highest-building/ --~--~---------~--~----~-----...

On Wed, Jul 19, 2006 at 03:09:44AM +0800, deveshti at comp.nus.edu.sg wrote: > I may sound stupid but can someone tell me that after applying > optimization sequences randomly whether we can surely say that the > final output is correct? Answering this question is equivalent to solving the Halting Problem. > I mean if we apply 12 options in random sequence provided by 'opt'

...e reason why I ask is that I expressed an outrageous opinion at >>>Supercomputing back in November, to wit, that CL is probably the best >>>language suited for today's multicore problems... but I don't have the >>>time to hack one of the current implementations to proove the point. >> >> >>interesting, what makes lisp superior in this area over languages with explicit >>support for parallell computing (like erlang? or Ada) or languages which may be >>easier auto parallelized (like haskell because of its functional nature). > >...