similar to: [LLVMdev] Speeding up make by 4 seconds :)

For some reason all documentation lists the max rice partition order to be 16, while the maximum is 15. This fixes thee HTML online documentation --- documentation_tools_flac.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/documentation_tools_flac.html b/documentation_tools_flac.html index bc1f2b8..5100cb4 100644 --- a/documentation_tools_flac.html +++

I'm sure there must be various peak-finding algorithms out there. Not knowing of any, I have written one myself*, but I thought I'd ask to see what's out there. Basically, I have a 2-dimensional data set and I want to identify local peaks in the data, while ignoring "trivial" peaks. My naive algorithm first identifies every peak and valley (point of inflection change

For some reason all documentation lists the max rice partition order to be 16, while the maximum is 15. This fixes flac -H, the man page and the HTML source code documentation --- doc/html/documentation_tools_flac.html | 2 +- man/flac.1 | 8 ++++---- man/flac.sgml | 8 ++++---- 3 files changed, 9 insertions(+), 9 deletions(-) diff --git

This shaves about 20% off the compile time for the daemon subdirectory. See also: https://rwmj.wordpress.com/2015/09/30/make-and-queuing-theory/#content --- daemon/Makefile.am | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/daemon/Makefile.am b/daemon/Makefile.am index 1d29a0f..4ea3c88 100644 --- a/daemon/Makefile.am +++ b/daemon/Makefile.am @@ -76,7 +76,11 @@ else

Read the content of /proc/cmdline using bash features, and use its [[ ... ]] expression to find texts in a variable. This shaves off 5 grep invocations. --- appliance/init | 12 +++++++----- 1 file changed, 7 insertions(+), 5 deletions(-) diff --git a/appliance/init b/appliance/init index f6fe9b9..8d662fa 100755 --- a/appliance/init +++ b/appliance/init @@ -75,7 +75,9 @@ $UDEVD --daemon

I played with `mkdiskimage' some last night, here is what i came up with: mkdiskimage -z -F binary.img 1000 i="$(losetup -f --show binary.img)" j="$(kpartx -savu "${i}" | awk '{print "/dev/mapper/"$3 }')" mount "${j}" /mnt cp /usr/lib/syslinux/vesamenu.c32 /mnt cat > /mnt/syslinux.cfg <<EOF UI vesamenu.c32 DEFAULT linux LABEL

On Friday, 4 November 2016, Martin Maechler <maechler at stat.math.ethz.ch> wrote: > >>>>> Dirk Eddelbuettel <edd at debian.org <javascript:;>> > >>>>> on Fri, 4 Nov 2016 10:36:52 -0500 writes: > > > On 4 November 2016 at 16:24, Martin Maechler wrote: | My > > proposed name '--no-stop-on-error' was a quick

All, I am using a sum of squared differences in the objective function of an optimization problem I am doing and I have managed to speed it up using the outer function versus the nested for loops, but my suspicion is that the calculation could be done even quicker. Please see the code below for a simple example. If anyone can point out a faster way I would appreciate it greatly. Thanks, Roger

Yes, regarding the unsigned to signed conversion you are right, it is implementation defined. I just had an issue a couple of years ago with a compiler which incorrectly treated unsigned overflow as undefined rather than implementation defined? Regarding the 64 bit profiling: I looked at the disassembly (gcc ?c ?S ?O2 ../opus/silk/sum_sqr_shift.c ?I../opus/include ?I../opus/celt) of the 64 bit

Hi all, I have to transfer thousands of files across my network. We are looking at using rsync via a squid proxy to help improve the network tuning. What I am witnessing now is that with each successive file, the transfer speed resets to 0 and ramps up to 2.5MB/s. Is there anyway that I can group these transfers together to take better advantage of our bandwidth? I should be able to peak at

I see that some of the speed patches that I posted have been incorporated into the current development version (eg, my patch-for, patch-evalList, and patch-vec-arith). My patch for speeding up x^2 has been addressed in an inadvisable way, however. This was a simple addition of four lines of code that speeds up squaring of real vectors by a factor of about six (for vectors of length 10000), by

I have written the R code below to perform White's Data Mining Reality Check (DMRC) but as it stands at the moment it is painfully slow. It is written as a function as I call it many times from a script file with different data input, and the output is sunk() to a text file. Could anyone suggest improvements to the code to increase its speed? boot_white_test <- function(data) {

"Reith, William [USA]" <reith_william@bah.com> wrote on 07/20/2012 09:52:02 AM: > Would this matrix eat up memory making the rest of my program > slower? Each x needs to be multiplied by a matrix and the results > checked against a set of thresholds. Doing them one at a time takes > at least 24 hours right now. > > Optimizing a program is not my thing.

Just a quick heads up that Sylvain Zimmer has posted a performance upgrade for Prototype''s $$ selector, making the function up to 20 times faster. This could be just the thing I''ve been looking for recently as a site I''m currently developing makes heavy usage of that $$ selector and I have noticed that this can lead to a noticeable lag on page load. See

Hi All, is there any general advice about speeding up recursive functions (not mentioning 'don't use them')? Regards, Federico Calboli -- Federico C. F. Calboli Department of Epidemiology and Public Health Imperial College, St. Mary's Campus Norfolk Place, London W2 1PG Tel +44 (0)20 75941602 Fax +44 (0)20 75943193 f.calboli [.a.t] imperial.ac.uk f.calboli [.a.t]

Hi, I have noticed that aperm is very slow, and I wondered if there was a way of speeding it up. Let me tell you a bit about the context of my problem, because perhaps I shouldn't be using aperm at all. The context is probabilistic inference in graphical models. One of the most fundamental operations is two compute an element-wise multiplication of two arrays of different sizes, say A and B.

For info, I put a little study I did about the byte code compiler and other speedup approaches (but not multicore) on the Rwiki at http://rwiki.sciviews.org/doku.php?id=tips:rqcasestudy which looks at a specific problem, so may not be relevant to everyone. However, one of my reasons for doing it was to document the "how to" a little. JN > > 2. Have you tried the

I currently managed to get wine to run Starcraft. However, it seems to run very slow. I have a 700mhz processor and a 32mb GeForce2 MX so I'm pretty sure that my system is capable of handling the game. What can I do to accelerate the game or any other programs in general?

I have a 3.2 GHz P4 Win XP Pro connected to a Fedora Core 4 server running on a 2 GHz Celeron. I get about 350 MB/s FTP transfer over a Gigabit Ethernet connection. Samba is very much slower between the same computers. Can Samba be sped up to where it approaches the FTP performance? -- Chuck Forsberg caf@omen.com www.omen.com 503-614-0430 Developer of Industrial ZMODEM(Tm) for Embedded

Using rsync --link-dest, I end up with a file system that has a relatively large number of directory entries but relatively small number of inodes. Copying this volume takes hours...far more than other volumes of similar size. I blame the much larger amount of directory traversal (and comparisons between source and destination) that are occurring. I'm using ext3, but I'm not wed to