similar to: Octagon Coding

The attached code implements PVQ encoding/decoding with separated signs [1]. It's in Python to use the unlimited-precision integers. The concept is to map vectors on some L-dimensional pyramid into integers 0...N, just like the standard PVQ. The only change is the mapping itself. The mapping is altered so that all sign data is in the least significant bits. A vector with Z nonzero

The in-vq operations were protected by a lock, but the out-vq operations were not. This caused panics / errors as described in patch 2. Fix that. The first patch renames the existing cvq_lock to c_ivq_lock to match c_ivq. The second patch introduces the c_ovq_lock for the c_ovq. Please apply. I also believe this is a candidate for stable. Amit Shah (2): virtio: console: rename cvq_lock

The in-vq operations were protected by a lock, but the out-vq operations were not. This caused panics / errors as described in patch 2. Fix that. The first patch renames the existing cvq_lock to c_ivq_lock to match c_ivq. The second patch introduces the c_ovq_lock for the c_ovq. Please apply. I also believe this is a candidate for stable. Amit Shah (2): virtio: console: rename cvq_lock

The in-vq operations were protected by a lock, but the out-vq operations were not. This caused panics / errors as described in patch 2. Fix that. The first patch renames the existing cvq_lock to c_ivq_lock to match c_ivq. The second patch introduces the c_ovq_lock for the c_ovq. Please apply. I also believe this is a candidate for stable. v2: * Use spin_lock instead of spin_lock_irq.

The in-vq operations were protected by a lock, but the out-vq operations were not. This caused panics / errors as described in patch 2. Fix that. The first patch renames the existing cvq_lock to c_ivq_lock to match c_ivq. The second patch introduces the c_ovq_lock for the c_ovq. Please apply. I also believe this is a candidate for stable. v2: * Use spin_lock instead of spin_lock_irq.

I have problems running Monkey Island 3 here. Installing it works fine, but the problems comes when trying to run it. When pressing "Play Game" (I think that's what the button says), the program just wants to install DirectX 5.0. I guess that trying to install it is NOT an option, when you're using wine. Second, installing Monkey Island 4 is not successful, because you have this

PredicateSimplifier is a pretty interesting pass, but it doesn't look like opt invokes it at any standard -Ox level, and so I assume that llvm-gcc also does not use this pass? If that is right, I'm curious about why this is the case -- does it simply not provide enough code speedup to compensate for the increase in compile time? Also, a colleague and I (we both teach advanced

Hello, I don't have advanced on the NHW codec, but now, as a lot of people, I am following the AOMedia AV1 codec.Just a (late) update of my previous post, there won't be problem in AOM AV1 with the CABAC scheme, as the codec will use Daala's multi-symbol entropy coder and/or ANS.That's great! I have even read on the wiki page, that AV1 will use Daala's PVQ as quantization

Hi John, John Regehr wrote: > PredicateSimplifier is a pretty interesting pass, but it doesn't look > like opt invokes it at any standard -Ox level, and so I assume that > llvm-gcc also does not use this pass? If that is right, I'm curious > about why this is the case -- does it simply not provide enough code > speedup to compensate for the increase in compile time? I

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 So you're the encoder. Tou get two vectors in (for some band), L and R. One thing you could do with this is compute M = L+R and S = L-R. (Yes, I know, this is not how the encoder actually works. Bear with me.) Then let m = normalize(M) and s = normalize(S). You transmit, m, s, |L|, and |R|. The decoder needs to find unknown positive constants

Hi, I'm studying at ETH Zurich and want to use a pyramid vector quantization for my semester thesis. Unfortunately, I have some troubles with generating the codebooks for high dimensions. For vectors with dimension bigger than 12 it takes such a long computation time to generate. I thought maybe you could help me out with a efficient way to do this? Is there some code available? Thanks for

A prebuilt binary. Needs non-free Watcom compiler to build. Signed-off-by: Lubomir Rintel <lkundrak at v3.sk> --- dosutil/mdiskchk.com | Bin 8106 -> 0 bytes 1 file changed, 0 insertions(+), 0 deletions(-) delete mode 100644 dosutil/mdiskchk.com diff --git a/dosutil/mdiskchk.com b/dosutil/mdiskchk.com deleted file mode 100644 index

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

Hello all, Here is a new iteration of the patch series that implements a transport for guest and host communications. The code has been updated to reuse the virtio-console device instead of creating a new virtio-serial device. I've tested for compatibility (old qemu & new kernel, new qemu & old kernel, new qemu & new kernel) and it all works fine. There are a few items on my

Hello all, Here is a new iteration of the patch series that implements a transport for guest and host communications. The code has been updated to reuse the virtio-console device instead of creating a new virtio-serial device. I've tested for compatibility (old qemu & new kernel, new qemu & old kernel, new qemu & new kernel) and it all works fine. There are a few items on my

Hi, In paper" A High-Quality Speech and Audio Codec With Less Than 10 ms Delay", you are mention that: There are still several ways to improve CELT, such as by incorporating better psychoacoustic masking in the dynamic bit allocation. This is a difficult problem both because there are few bits available for coding the allocation and because the analysis window is short. it is

Hi All, It is possible to make Opus/CELT a lossless coder if I allow a sufficiently high bit rate? We considered using FLAC, but FLAC's latency is well beyond the acceptable range. Thanks -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.xiph.org/pipermail/opus/attachments/20120822/60c69469/attachment.htm

(Note to self: learn to scan the full digest for later messages in a thread before replying to an earlier message.) Ed, Your reply to John answered some of my questions, but not all, and raised a new one: > Maybe I should have been a bit clearer; we're really interested in full > memory and type safety. We want to harden the system against memory > corruption vulnerabilities.

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,

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