search for: tighter

On Sun, Apr 06, 2003 at 04:40:42PM -0500, David W. Tamkin wrote: > If processing time is not a big factor -- say, I could put up with four > to six times the duration of compressing at -8 -- what command-line > settings could one use to get even more compression? > > I have a case where the FLACs encoded at -8 are about 653.3 MB, but the > set comes with artwork whose jpegs

Miroslav Lichvar wrote: > Ok, you need 0.04% improvement, that should not be a problem. Perhaps a little more than that, since the sizes I listed were after stripping out the padding and all metadata blocks except SEEKTABLE and STREAMINFO. > Try flac --lax -e -p -l 32 -r 10 --no-padding > and if it is not enough, increase -r up to 16. Thank you. I'll do that. What, though,

On Sat, Apr 12, 2003 at 05:49:06PM -0500, David W. Tamkin wrote: > Early this past week, Miroslav Lichvar suggested for me: > > >Ok, you need 0.04% improvement, that should not be a problem. Try > >flac --lax -e -p -l 32 -r 10 --no-padding > > Thank you again, Miroslav. I tried that, and it took almost two full > days (surprisingly, Windows ME stayed up that long

I was just thinking about the problem of host groups and such trying to set up our puppet infrastructure properly and came to the realization that using MCollective better in puppet dashboard would allow for more cloud like scaling of infrastructure services. Here is the concept: Right now in puppet dashboard groups can have nodes, facts (parameters) and Classes. What I am suggesting would

If processing time is not a big factor -- say, I could put up with four to six times the duration of compressing at -8 -- what command-line settings could one use to get even more compression? I have a case where the FLACs encoded at -8 are about 653.3 MB, but the set comes with artwork whose jpegs are 50.5 MB (I tried zipping the jpegs, realizing it would do very little, and the zip file

Hello Everyone! Here are a couple of thought/questions on refClasses integration in R core functionality. First, coexistence with S4: > X <- setRefClass("classX", fields = c("a", "b"), + representation = list(c = "character")) > x <- X$new() > x at c <- "sss" > x An object of class "classX"

Early this past week, Miroslav Lichvar suggested for me: > Ok, you need 0.04% improvement, that should not be a problem. Try > flac --lax -e -p -l 32 -r 10 --no-padding Thank you again, Miroslav. I tried that, and it took almost two full days (surprisingly, Windows ME stayed up that long without crashing) to re-encode the entire set on my 266-MHz machine. After all, in the help file

This is not intended for v1.14. In fact, we may decide that the second patch is too gross, although the first one still seems like a useful improvement in isolation. I will also point out that all our filters are in-tree, and set the user-controlled field .version to the current release string. We could replace the second patch with a simpler one that just checks ._api_version as an int (as

...://stat.ethz.ch/pipermail/r-help/2002-June/022295.html http://www.harding.edu/fmccown/R/#histograms Now, consider the code snippet taken from http://www.harding.edu/fmccown/R/#histograms # Get a random log-normal distribution r <- rlnorm(1000) # Get the distribution without plotting it using tighter breaks h <- hist(r, plot=F, breaks=c(seq(0,max(r)+1, .1))) # Plot the distribution using log scale on both axes, and use # blue points plot(h$counts, log="xy", pch=20, col="blue", main="Log-normal distribution", xlab="Value", ylab="Frequency&...

...tp://www.sueddeutsche.de Was slow. I tried adding ${fwcmd} add pass tcp from any to any established from src/etc/rc.firewall case - simple. Which solved it. But I was scared, not undertstand what the established bit did, & how easily an attacker might fake something, etc. I found adding these tighter rules instead worked for me ${fwcmd} tcp from any http to me established in via tun0 ${fwcmd} tcp from me to any http established out via tun0 Should I still be worrying about established ? Julian -- Julian Stacey. BSD Unix C Net Consultancy, Munich/Muenchen http://berklix.com Mail Ascii, no...

Hal Finkel <hfinkel at anl.gov> writes: [snip] > Many of my colleagues say that, with gcc, they wait for > the x.y.1 release before upgrading because the .0 is too buggy. But if > we're not doing point releases, then I think we need tighter standards > for release. Doing otherwise is not fair to our users. What happened to the LLVM/Clang maintenance release project?

...first_run < Time.now), and then runs every 24 hours from that time, so 6am every day. I was expecting more cron-ish behaviour, where it would start at the first_run time and repeat based on that initial time. Is this the proper behaviour? Personally, I like the cron style better - it gives me tighter control, which might be required for better resource utilization. If I want it to start running immediatley, I can put in first_run Time.now. Thoughts? Cheers, Brett

Hi everyone, I'm Akshay, an Information Science undergrad from Bangalore. I'm interested in Information Retrieval and I'd like to contribute to Xapian as a part of GSoC and later to feed my interests. I liked the idea of adding more weighting schemes (Project #2). I did a project last semester on Document Retrieval on Hadoop using TF-IDF and Cosine Similarity (the query had to be a

On RHEL 7.5 we need to include <linux/falloc.h> for FALLOC_FL_* macros. Without the macros, fallocate is never used and we fall back to manual zeroing. Here are examples runs with this change with a local file on ext4: $ export SOCK=/tmp/nbd.sock $ export FILE=/var/tmp/nbd.img $ export BLOCK=/dev/loop2 $ src/nbdkit -f plugins/file/.libs/nbdkit-file-plugin.so file=$FILE -U $SOCK $ time

On Tue, Apr 05, 2005 at 08:26:45AM -0700, Ralph Giles wrote: > AM radio is lower quality (mono) but I don't know > what the digital equivalent would be. Just a minor nit-pick: AM radio can be stereo. However its use is almost nonexistent. See <http://users.hfx.eastlink.ca/~amstereo/amstereo.htm> for more information. > Telephone is nominally 8 kHz mono > (i.e. really bad)

...9;s successors, %eh.resume and %terminate.lpad, because the destructor call in lpad is an invoke instruction. However, if we insert the lifetime.end markers for all of them, the lifetimes of the strings will overlap clang generates only one resume block and one terminate block per function. To get tighter bounds for the strings' lifetimes, I'm considering attaching lifetime.end metadata to the destructor calls in clang: invoke void @foo("basic_string"* %str) to label %eh.resume unwind label %terminate.lpad, !lifetime_end !10 !10 = !{i32 0} SelectionDAGBuilder will then insert a...

...preventing it from seeing the memory accesses of the next iteration and thus failing to pipeline the memory accesses across iterations. Small changes in scheduling, instruction count, etc. will tickle this and cause large performance changes. The solution is to make the relocation application loop tighter. Especially by separating some of the stuff that we currently have inside one huge loop to be in separate loops, but also by making the loops tighter.) -- Sean Silva > > If you haven't read it, I think you would enjoy this paper: >> http://static.googleusercontent.com/media/resea...

...on to prevent read-reordering. > x86 memory ordering rules state that all writes are seen in a globally > consistent order, and are globally ordered wrt reads *on the same > addresses*, but reads to different addresses can be reordered wrt to writes. The modern x86 rules are actually much tighter than that. Every store is a release, and every load is an acquire. So a non-atomic store is actually a perfectly fine unlock. All preceding stores will be seen by other cpu's before the unlock, and while reads can pass stores, they only pass *earlier* stores. For *taking* a lock you need an a...

...on to prevent read-reordering. > x86 memory ordering rules state that all writes are seen in a globally > consistent order, and are globally ordered wrt reads *on the same > addresses*, but reads to different addresses can be reordered wrt to writes. The modern x86 rules are actually much tighter than that. Every store is a release, and every load is an acquire. So a non-atomic store is actually a perfectly fine unlock. All preceding stores will be seen by other cpu's before the unlock, and while reads can pass stores, they only pass *earlier* stores. For *taking* a lock you need an a...

Hi, I had an idea which I would like to post. Not sure if this is the right place but I don't see anywhere else. Where you can run wine as a window. "Emulate Virtual Desktop", would it be possible to set a workspace up as a virtual desktop? I am interested to know what other people think, am I the only one who would like this or do other peopel thin its a good idea too? Also I a