similar to: moving distance between two sets of data

Dear all, I have saved few variable names into local files, I wanted to make a function that load this files and "generates" the variable names into my working environment. I have tried to do that as a function but my problem is  that this function does not return the variable names load_data<-function(path,Reload=FALSE){     if (Reload==TRUE){            print("Loading

I have a large computation that performs various bootstrap resampling loops over pairs of samples using lapply(). After a few seconds it stops like this > do.summarize.effects(compute.power=T) ... Error: Unimplemented feature in rep > .Traceback [[1]] [1] "rep(no, length = length(ans))" [[2]] [1] "ifelse(t.howto == \"n\", boot.result, l.meanboot.test(onew.x,

> The C55 and C64 builds diverge in exactly the same place as before (byte > 0x1000). The output from C55 build 11387 (svn head) diverges from C55 build > 11343 slightly later (byte 0x1116). Similarly, the output from C64 build > 11387 (svn head) diverges from C64 build 11343 slightly later (byte 0x1126). > So, your change clearly had an effect, not just on the 16-bit machine,

Thanks for the response, Jeremie. I wholeheartedly agree about testing. In my case, this feature would be used purely to reduce computation time. I?m calculating an expensive (and embarrassingly parallel) likelihood function, and for some parameter combinations my objective function diverges to infinity. In those instances, I?d like to throw an error that stops subsequent computations and that I

On 25.10.2016 16:28, Nicolai Hähnle wrote: > But I fear that this path leads to eternal fuzziness. Let me try a > completely different approach to define what we need by augmenting the > semantics of IR with "divergence tokens". In addition to its usual > value, every IR value carries a "divergence set" of divergence tokens. > > The basic rule is: the

Hi list! I have prepared a custom function (below) in order to calculate separability indices (Divergence, Bhattacharyya, Jeffries-Matusita, Transformed divergene) between two samples of (spectral land cover) classes. I need help to cross-compare results to verify that it works as expected (since I don't know of any other foss-tool that will give me quickly some results). Does anybody

Hi, for those of you who haven''t read: http://meyerweb.com/eric/thoughts/2006/05/08/flummoxed-by-frameworks/ ""Oh", they gush, "you should absolutely try Ruby on Rails! It''s so easy! It''s almost like writing regular English!" Which means they''re clearly on crack, because Ruby on Rails is so very different from a human-written language

On Jan 20, 2013, at 10:18 PM, Chandler Carruth wrote: > Sorry, I wasn't trying to suggest anything vague, but rather refer to my previous (perhaps ill founded) understanding about the expected path forward for LLD. Anyways, I'll explain in a bit more detail so we can talk about the concrete issue. > > My concrete hope is that LLD migrates toward the coding standards that are

Hello, Yes? Where is allActive defined, I couldn't find it. Basically, a BB is control divergent if it's execution depends on a branch that itself depends on a divergent ssa value. On Fri, Jul 21, 2017 at 4:13 PM, Zaks, Ayal <ayal.zaks at intel.com> wrote: > What would be the definition of “isControlDivergent(BasicBlock*)”; the > complementary of “allActive(BasicBlock*)” –

Hello, It seems to me that our current DivergenceAnalysis does not save which BasicBlocks may suffer from divergent control. Am I correct? I want to modify our DivergenceAnalysis to add a "bool isControlDivergent(BasicBlock*) const" method and save in the divergence propagator the basicblock that are divergent. I am not sure that is entirely correct, if you have input on that please

This is a followup to a recent post on using atop() to obtain multiline expressions. My reading of the plotmath docs makes it clear that issuing (in base graphics) the specification par(cex = 2) doubles symbols and regular text in subsequent plotmath expressions. However, it is unclear to me what specifying cex _within_ the annotation function using plotmath should do, and the following seems

On Sun, Jan 20, 2013 at 8:35 PM, Nick Kledzik <kledzik at apple.com> wrote: > > On Jan 19, 2013, at 1:55 AM, Chandler Carruth wrote: > > We're looking more at doing some serious hacking on LLD, and I'd like to > avoid doing lots of work in the codebase only to change the style around > later. > > > > My understanding was that LLD was always intended to

I tried to reduce the test case in https://bugs.llvm.org/show_bug.cgi?id=42706. Here it is crashing opt: $ ~/llvm-debug/bin/opt -use-gpu-divergence-analysis -divergence stripped.ll WARNING: You're attempting to print out a bitcode file. This is inadvisable as it may cause display problems. If you REALLY want to taste LLVM bitcode first-hand, you can force output with the `-f' option.

Dear experts, I have in all 14 matrices which stands for gene expression divergence and 14 matrices which stands for gene sequence divergence. I have tried joining them by using the concatanation function giving SequenceDivergence <- c(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14) ExpressionDivergence <- c(Y1,Y2,Y3,Y4,Y5,Y6,Y7,Y8,Y9,Y10,Y11,Y12,Y13,Y14) where X1,X2..X14 are the

The documentation (in ver 1.1) for contrasts and contrasts<- does not list all the arguments for those functions. In addition to x, the factor whose contrasts are being extracted or set, contrasts() has the argument 'contrasts=TRUE', and contrasts<-() has the argument 'how.many'. It was this latter that had me flummoxed, because I wanted to reparametrize a model by

New to the list (and forum, but waiting for a moderator to approve - hence my question here) but not new to icecast. I have a question - I'm running an Airtime install with Icecast - and yes I asked them first but this has flummoxed them over at Sourcefabric - anyone had a problem with a HQ (192kbs) stream rebuffering every few seconds during a FTP/SSH upload to a remote streaming server?

*Hi, I am considering a language extension to Clang for optimizing GPU programs. This extension will allow the compiler to use different optimization strategies for divergent and non-divergent branches (to be explained below). We have observed significant performance gain by leveraging this proposed extension, so I want to discuss it here to see how the community likes/dislikes the idea. I will

I've looked everywhere and tinkered for three days now, so I figure asking might be good. So here's a general rundown of what I am trying to get my code to do I am giving you the whole rundown because I need a solution that retain certain ways of doing things because they give me the information i need. I want to examine the effect of increasing my sampling interval on my data. Example:

I was flummoxed for a long time by errors generated when I did something like install.packages(foo,lib="Rlib") where ``Rlib'' is my personalized directory of R packages, which lives in my home directory (from which I started R before issuing the foregoing install.packages() call. Recently someone (I forget who, but thanks very much to whomever it was) pointed out that I

I''ve been working on an AJAX search, very similar to the Flickr one in the screencast linked from the main rails page. I''ve been doing my testing in Safari, where everything has worked fine, only to now discover the results of the search action seem disinclined to load in Firefox. I can enter a URL to return the HTML fragment that''s supposed to be dropped into