similar to: long algo

Hi, I've got two suggestions how to speed up median() about 50%. For all iterative methods calling median() in the loops this has a major impact. The second suggestion will apply to other methods too. This is what the functions look like today: > median function (x, na.rm = FALSE) { if (is.factor(x) || mode(x) != "numeric") stop("need numeric data")

Hello, I've been playing around with the really simple example of not cache friendly loop like this: #define N 100 void foo(int** __restrict__ a, int** __restrict__ b) { for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) a[j][i] += b[j][i]; } link to compiler explorer:

Hello, I need to perform the analysis of loop induction variables. However, as I understood, directly it is possible to extract only a canonical induction variable which is only one. If I have multiple induction variables with the step not one, are there any methods to extract their phi node? int a[10]; int b[10]; for (int i = 0, j = 1; i < 10, j < 10; i++, j+=2) {

Hello! I was using Speex all the time, and I am now moving to Opus. I had encapsulated the decoder a bit, I had the following cpp file: #include "StdAfx.h" #include "spxcodec.h" #define MAX_FRAME_SIZE 2000 #define MAX_FRAME_BYTES 2000 CSpxCodec::CSpxCodec() : enh(1), rate(8000) { } CSpxCodec::~CSpxCodec() { } void CSpxCodec::Init() { speex_bits_init(&bits);

Hello, We are currently evaluating LLVM as a compiler technology against Open64 and have a few questions regarding its currently status with respect to optimizations in particular. Control flow is often expensive on the architectures we are considering and as such loop optimizations, e.g. unroll and jam, can play an important role. For example, consider the following program int

Create the fixed-point intrinsics optimization celt_fir_neon() for ARM NEON. Create test tests/test_unit_optimization to unit test the optimization. --- .gitignore | 1 + Makefile.am | 39 ++++- celt/arm/arm_celt_map.c | 17 +++ celt/arm/celt_lpc_arm.h | 65 ++++++++ celt/arm/celt_lpc_neon_intr.c

Sorry, it seems I have only replied to Lakhdar, not to the newsgroup. Below is my reply to Lakhdar, and I would like to make it more clear now, using some pseudo values for simplicity: I read bytes 1 to 124 from my encoded spx file. I decode themt and get the values: ---Frame 1---- -293 -8234 2134 17 ---Frame 2---- -9323 -732 189 2329 Both frames are just perfect as I need them. But now when I

Hi, I am a Ph.D. student from Québec, Canada. I’m a beginner with R and Bioconductor. Until now the only experience I have is in analyzing microarray data using affy and limma packages. Now I am trying to analyze Rat Gene 10 st arrays and I would like to run RMA analysis and Smyth moderated t test on those arrays. Since no cdf official package is available for those arrays, after reading many

All I realise that this isn''t strictly the correct place to discuss the prototype lib but being as scriptaculous is dependent on it I thought people might have some opinions. Easier to explain with the example below, copy into a html file and ensure the path to prototype.js is correct. You''ll see the first example prints an extra element "extend" when iterating over

Hello Under the proviso that it's been a while since I looked into any of these things... On 05/15, Bardia Mahjour via llvm-dev wrote: > I also get correct results for my example (for a 64-bit target) if the upper > bounds are changed to unsigned. The reason is simply because clang zero-extends > `m` for address calculations but sign-extends it for the loop upper bound. This >

Hi all, This is Linfeng Zhang from Google. I'll work on ARM NEON optimization in the next few months. I'm submitting 2 patches in the following couple of emails, which have the new created celt_fir_neon(). I revised celt_fir_c() to not pass in argument "mem" in Patch 1. If there are concerns to this change, please let me know. Many thanks to your comments. Linfeng Zhang

Hello Yes, I agree that the SCEV cannot be simplified. Is my understanding correct that it is passed to a function like "isKnownNegative"? Which could still be able to prove is always true. The delinearisation may be valid, depending on exactly how you define delinearisation (under what conditions it should be giving results). It would be invalid for DA to return a dependency of [0

How do you update R on Windows and how do you install your own package with windows interface ? regards, Ghislaine GUIGON Biostatisticienne Plate-forme 2 Puces a ADN INSTITUT PASTEUR 25-28 rue du Dr ROUX 75724 Paris cedex 15 FRANCE tel: (33) (0)1 40 61 86 51 fax: (33) (0)1 45 68 84 06

Hi all, I encountered a big problem when trying to use Scriptaculous and Htmlarea in the same page. The Htmlarea code uses a lot of "for (var i in array_variable)" to iterate on array elements. Problem is that prototype.js augments Array.prototype, which then show up in the iteration, severely breaking htmlarea. The easy workaround is for sure to use "for (var i = 0; i <

<div> </div><div> </div><div>Hello,</div><div> </div><div>To me this is an issue in llvm loop vectorizer (if N is large enough to prevent complete unrolling of j-loop).</div><div> </div><div>Woud you mind to share stencil.ll than I would say more definitely what the issue

Your problem is due to GVN partial reduction elimination (PRE) which introduces a PHI node the current loop vectorizer cannot handle: opt -O3 stencil.ll -pass-remarks=loop-vectorize -pass-remarks-missed=loop-vectorize -pass-remarks-analysis=loop-vectorize remark: <unknown>:0:0: loop not vectorized: value that could not be identified as reduction is used outside the loop remark:

.. And a version without the API changes. -------------- next part -------------- Index: libspeex/resample_sse.h =================================================================== --- libspeex/resample_sse.h (revision 0) +++ libspeex/resample_sse.h (revision 0) @@ -0,0 +1,128 @@ +/* Copyright (C) 2002-2008 Jean-Marc Valin + * Copyright (C) 2008 Thorvald Natvig + */ +/** + @file resample_sse.h +

Hi, Here's the (hopefully) final version of the resampler, now always using st->mem as the buffer area. It only allocates buffers on the stack when it's necesarry to convert the output between int and float. -------------- next part -------------- Index: include/speex/speex_resampler.h =================================================================== ---

I'm reading a old statistics book "MARVIN J. Karson (1982), Multivariate Statistical Methods, The IOWA State University Press, Iowa". In the chapter XI i can find some information about discrete multivariate analysis. This chapter is restricted to an introduction to log-linear models for analysis of multidimensional contingency tables. For example, in the log-linear model for

Hi everyone I have a matrix (let's say that it contains the values of elevation) and want to plot its values on a map using a function such as image.plot or filled.contour. The problem is that my grid is not rectilinear, it is bended. Here is an example lon<-matrix(0,20,25) lat<-matrix(0,20,25) elev<-matrix(0,20,25) for (i in 1:20) { for (j in 1:25) {