search for: octagon

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Dear Celts, I've become intrigued by the problem of spherical quantizers, so I decided to see if I could come up with something better than PVQ. What I wound up writing is something I call an "octagon quantizer. In two dimensions, PVQ uses a "diamond" (square) shape. An octagon code (OVQ) uses an octagon, which is a much better approximation to the circle. In two dimensions, PVQ uses an octahedron, and OVQ uses a rhombicuboctahedron, which is (again) a much better approximation to t...

...is insert cd#2 in the middle of it all, and I'm not able to change cd. Supermount is not an option here, since there is no patch for later 2.4.X kernels. So any other way to get around that? If anyone would like to help me, I would be VERY grateful! Thank you in advance! --- Rune Elvemo --- Octagon / Digital Minds relvemo@grm.hia.no http://home.c2i.net/elvemo

...we know of, PredicateSimplifier seems the best starting point for making a more generic abstract interpreter into which collections of transfer functions could be plugged. Does that seem right or can anyone suggest a better starting point? It would be pretty cool, for example, to see what the Octagon domain could learn about LLVM programs. John Regehr

This does what I was hoping it would: aggregate(tm[,-1],by=list(tm[,10]),FUN="mean") but I don't know what "tm[,-1]" means (well - the -1 bit anyway. Does it somehow means the whole matrix? Please don't tell me to check the manual - I tried and failed dismally... -- View this message in context: http://n4.nabble.com/tm-1-tp1588804p1588804.html Sent from the R

For a paper dealing with generalized ellipsoids, I want to illustrate in 3D an ellipsoid that is unbounded in one dimension, having the shape of an infinite cylinder along, say, z, but whose cross-section in (x,y) is an ellipse, say, given by the 2x2 matrix cov(x,y). I've looked at rgl:::cylinder3d, but don't see any way to make it accomplish this. Does anyone have any ideas? thx,

...eSimplifier seems the best starting point for making > a more generic abstract interpreter into which collections of transfer > functions could be plugged. Does that seem right or can anyone suggest > a better starting point? It would be pretty cool, for example, to see > what the Octagon domain could learn about LLVM programs. Predsimplify is believed to have bugs (it results in miscompiled programs) and certainly isn't efficient (it was written before much of include/ADT). Finally, predsimplify is likely to go away once I or someone else writes a proper VRP pass. The only...

Thanks for the fast response John. On Thu, Oct 1, 2015, at 04:51 PM, John Criswell wrote: > Dear Ed, > > First, someone has updated the DSA code in the poolalloc project to LLVM > 3.7, and a Master's student worked for me over the summer to update a > large chunk of SAFECode to LLVM 3.7. However, the update to LLVM 3.7 > isn't finished (we need to finish integrating

...noticed that the limit to linear array access was way >behind state of the art (we have a lot of experience with constraint >solvers). Using an SMT solver would make sense, as you can use the >theory that suits the particular problem - linear isn't good enough? >You've got IDL, octagons etc. > >To start off with we'd like to get something running, even if it has >limitations. Unless you think it's a really bad idea I will for the >moment try to get the old APA working to some extent again. It isn't >really an issue if I have to run APA and safecode as...

Hi, I have a problem using AGI cmd "SAY DIGITS". For some reason I cannot here any thing when the script got executed. However if I use the cmd "SAY NUMBER" I can here * reading the number fine. I am running asterisk-1.0.6 and below is my PHP script. Help please. - Natt #!/usr/bin/php -q <?php ob_implicit_flush(true); set_time_limit(10); /*