search for: tightest

Flake is a completely independent codebase. When I used it years ago, I remember it being not only better compression but significantly faster as well. I believe some of the techniques used in libflake were added to libFLAC in 1.1.4. However, some of the improved compression in flake was due to options that are outside the FLAC 'subset', such as larger blocksize, greater number of

...2 at 01:57:03PM -0400, Hod McWuff wrote: > Agreed that the oversampling isn't useful in the long term. I'm not sure > what you mean by 'dictioniary overhead'. > > I'd like to see an easy-to-invoke set of parameters that will spare no > cpu expense and produce the tightest theoretically possible output. > > I'm guessing the best of Marco's idea can be achieved by adding > heuristics to dynamically determine optimal frame size based on say, a > maximum standard deviation of a complexity measurement. The idea is to > tie the frame breaks to dram...

...> due to options that are outside the FLAC 'subset', such as larger > > blocksize, greater number of prediction coefficients, and higher-order > > Rice codes. > > When I tested flake, it was almost shockingly fast (compared to what I > was used to with FLAC) but the tightest compression options didn't > produce .flac files that could play on every playback device and/or > software that I tested. > > It is a shame that development has stopped. > > The next official release of the FLAC command line should really have a > "-9" option for...

On 14-03-13 20:02, Declan Kelly wrote: > The next official release of the FLAC command line should really have > a "-9" option for absolute maxed-out big-memory CPU-burning compression. No. If you want such things, try TAK, OptimFROG, Monkey's Audio or even LA, you'll lose hardware compatibility anyway and they do much better than FLAC will with a -9 option. FLAC 1.0

...compression in flake was > due to options that are outside the FLAC 'subset', such as larger > blocksize, greater number of prediction coefficients, and higher-order > Rice codes. When I tested flake, it was almost shockingly fast (compared to what I was used to with FLAC) but the tightest compression options didn't produce .flac files that could play on every playback device and/or software that I tested. It is a shame that development has stopped. The next official release of the FLAC command line should really have a "-9" option for absolute maxed-out big-memory CP...

On 14-03-13 21:24, Declan Kelly wrote: > No. I want the tightest possible compression, while remaining 100% > compatible with the subset that all known FLAC decoders can successfully > stream or play now in cars, Hi-Fi units, "MP3 players" and cell phones. > The out and out most widely supported lossless audio format could (and > should) ha...

On Mar 14, 2013, at 13:24, Declan Kelly wrote: > I want the tightest possible compression, while remaining 100% > compatible with the subset that all known FLAC decoders can > successfully > stream or play now in cars, Hi-Fi units, "MP3 players" and cell > phones. > The out and out most widely supported lossless audio format could (and &...

...ves in a cluster tree, or dendrogram. The algorithm used in hclust is to order the subtree so that the tighter cluster is on the left (the last, i.e. most recent, merge of the left subtree is at a lower value than the last merge of the right subtree). Single observations are the tightest clusters possible, and merges involving two observations place them in order by their observation sequence number. I have a factor vector (if that's the right term) for the observations, and I'd like to order the display of the leaves so that leaves of the same level are grouped...

--- Hod McWuff <hod@wuff.dhs.org> wrote: > On Fri, 2002-10-04 at 10:26, Marco "elcabesa" Belli wrote: > > oversampling.. i maean digitally change the wave file rate form > 44khz to 440 > > khz > > > > it make next sample easyer predictable > > OK, IANASPE (signal processing engineer) but it seems to me that if a > simple shift like that can

...PAM + Winbind. I tried setting up my /etc/krb5.keytab file, and now I'm afraid my system is a mess. I told Samba to use the system keytab, and now Samba/Winbind related commands fail (net ads commands, wbinfo commands, even pam_winbind). Any suggestions would be appreciated. I just want the tightest integration between Linux & Active Directory that extends to Linux services like ssh, apache, postfix/sasl, etc. I've also been documents my efforts: http://michael.susens-schurter.com/interop/ and on my blog: http://michael.susens-schurter.com/blog/ Thanks in advance, Michael Schurter R...

...> due to options that are outside the FLAC 'subset', such as larger > > blocksize, greater number of prediction coefficients, and higher-order > > Rice codes. > > When I tested flake, it was almost shockingly fast (compared to what I > was used to with FLAC) but the tightest compression options didn't > produce .flac files that could play on every playback device and/or > software that I tested. > > It is a shame that development has stopped. > > The next official release of the FLAC command line should really have a > "-9" option f...

...> Agreed that the oversampling isn't useful in the long term. I'm not sure > > > what you mean by 'dictioniary overhead'. > > > > > > I'd like to see an easy-to-invoke set of parameters that will spare no > > > cpu expense and produce the tightest theoretically possible output. > > > > > > I'm guessing the best of Marco's idea can be achieved by adding > > > heuristics to dynamically determine optimal frame size based on say, a > > > maximum standard deviation of a complexity measurement. The idea...

...;sles" | "suse-based" | "opensuse" -> Some "lp151" > + | "oraclelinux" -> Some ( > + [(sprintf "rhel%d" inspect.i_major_version)] As a general rule in functional languages function application [ie. calling a function] binds tightest. So: f 1 + 2 means: (f 1) + 2 You don't need the parentheses around the sprintf statement above or later in the patch. > + @ (match inspect.i_major_version with > + | 6 -> ["el6"] > + | 7 -> ["el7"] > + | _ -> []) >...

Agreed that the oversampling isn't useful in the long term. I'm not sure what you mean by 'dictioniary overhead'. I'd like to see an easy-to-invoke set of parameters that will spare no cpu expense and produce the tightest theoretically possible output. I'm guessing the best of Marco's idea can be achieved by adding heuristics to dynamically determine optimal frame size based on say, a maximum standard deviation of a complexity measurement. The idea is to tie the frame breaks to dramatic changes in the signa...

...d McWuff wrote: > > Agreed that the oversampling isn't useful in the long term. I'm not sure > > what you mean by 'dictioniary overhead'. > > > > I'd like to see an easy-to-invoke set of parameters that will spare no > > cpu expense and produce the tightest theoretically possible output. > > > > I'm guessing the best of Marco's idea can be achieved by adding > > heuristics to dynamically determine optimal frame size based on say, a > > maximum standard deviation of a complexity measurement. The idea is to > > tie...

...st for spike train models announced in the previous release in now fully functional thanks to feed-back from Vilmos Prokaj. The test requires the computation of the parameters of a tight confidence region within which a standard Wiener process "stays" in, say, 95% of its realizations. The tightest region was shown by Kendall et al (2007, Statistics and Computing, 17, 1) to have boundaries well approximated by: a + b*sqrt(t) (where a and b have to be adjusted to get the correct coverage probability). These 2 parameters are found using the method of Loader and Deely (J Statist Comput Simulatio...

...test the function as I only had time to test on a few datasets. Any feed back is much appreciated. The function is called ecluster.fn and I have also attached a simple example on how to use it. So far my code works (attached) fine. The only problem is that subtree are ordered in terms of the 'tightest' leftmost (according to the details section of hclust) . So sometimes I have blocks of red, green and then red (again) although the branches can be mannually reorder ed so that most of the reds are to one side and most of the reds. This gets a bit more complicated when rows are also to be order...

...st for spike train models announced in the previous release in now fully functional thanks to feed-back from Vilmos Prokaj. The test requires the computation of the parameters of a tight confidence region within which a standard Wiener process "stays" in, say, 95% of its realizations. The tightest region was shown by Kendall et al (2007, Statistics and Computing, 17, 1) to have boundaries well approximated by: a + b*sqrt(t) (where a and b have to be adjusted to get the correct coverage probability). These 2 parameters are found using the method of Loader and Deely (J Statist Comput Simulatio...

...sites so if anyone wants to test Skype calling on their Asterisk network please send me email and I'l enable longer calling. Also in the 2 hard coded examples below (563 and echo) i want to also reference gizmo5 and not repeatedly have proxy01.sipphone. Can someone tell me how to construct the tightest syntax for that? Thanks. -- MR ------------------------------------------------------------------------------------------------------------------------ [gizmo5] type=peer ;COPY THIS CONFIG host=198.65.166.131 ;INTO YOUR sip....

On Thu, Mar 14, 2013 at 08:12:14PM +0100, mvanb1 at gmail.com wrote: > No. If you want such things, try TAK, OptimFROG, Monkey's Audio or even > LA, you'll lose hardware compatibility anyway and they do much better > than FLAC will with a -9 option. No. I want the tightest possible compression, while remaining 100% compatible with the subset that all known FLAC decoders can successfully stream or play now in cars, Hi-Fi units, "MP3 players" and cell phones. The out and out most widely supported lossless audio format could (and should) have a better "ba...