similar to: Predict when regressors are passed through a data matrix

Hi, I wonder why my attempt to extend an existing loess fit to a new data set is producing error. I was trying the following: dat = read.csv(choose.files()) x = dat[,2]; y = dat[,1] x.sort = sort(x) y.loess = loess(y~x, span=0.75) # For testing the above fit with a new dataset: test = read.csv(choose.files()) # test data new_x = test [,1]; new_y = test[,2] new_x.sort = sort(new_x) predicted

Greetings, A couple general questions regarding the use of splines to interpolate depth profile data. Here is an example of a set of depths, with associated attributes for a given soil profile, along with a function for calculating midpoints from a set of soil horizon boundaries: #calculate midpoints: mid <- function(x) { for( i in 1:length(x)) { if( i > 1) { a[i] = (x[i] -

Example: define i8 @narrow_add(i8 %x, i8 %y) { %x32 = zext i8 %x to i32 %y32 = zext i8 %y to i32 %add = add nsw i32 %x32, %y32 %tr = trunc i32 %add to i8 ret i8 %tr } With no data-layout or with an x86 target where 8-bit integer is in the data-layout, we reduce to: $ ./opt -instcombine narrowadd.ll -S define i8 @narrow_add(i8 %x, i8 %y) { %add = add i8 %x, %y ret i8 %add } But on

Hello Thanks for looking into this. I can't be very confident what the knock on result of a change like that would be, especially on architectures that are not Arm. What I can do though, is run some benchmarks and look at that results. Using this patch: --- a/lib/Transforms/InstCombine/InstructionCombining.cpp +++ b/lib/Transforms/InstCombine/InstructionCombining.cpp @@ -150,6 +150,9 @@

Hi, I'm Luca from Savona, Italy. I'm using Compiz and I'm writing an application with Xlib to draw two windows, let's say window_A and window_B. I would like to keep fixed the relative position between two established corners of them that they have when mapped. So that if I move or resize one of the window, the other if necessary automatically moves to observe the condition.

Thanks for the perf testing. I assume that DAG legalization is equipped to handle these cases fairly well, or someone would've complained by now... FWIW (and at least some of this can be blamed on me), instcombine already does the narrowing transforms without checking shouldChangeType() for binops like and/or/xor/udiv. The justification was that narrower ops are always better for

Hi Luca, In recent versions of compiz (0.9.10) if you have lazy positioning on (org.compiz.move 'lazy-positioning') other clients won't get a configure notification until the end of the move. This is a performance optimization to avoid a slow path on the nvidia drivers with vsync. If you want such notifications you need to turn this option off. Either that or implement this as a

Buenas Tengo un Data table de la siguiente manera: datos<-data.table(grupo=rep(c("a","b"),5),x=c(1:10),y=rnorm(10,2,1)) Lo que quiero es añadir una fila por cada grupo y en esa nueva fila, al valor de la x ponerle el valor anterior de la y Lo que hago es añadir una nueva fila por grupo, con: datos[,.SD[1:(.N+1)],by=grupo] Y para añadir el valor anterior uso la función

Hello, I have been trying for weeks to compile a 64-bit Rblas. I started with ATLAS where I have had success in the past, but 64 bit was not behaving, and as each compilation takes between 9 and 12 hours, "test, check, and revise" was not going to be really viable. I therefore switched to OpenBLas (OPBL). I was successful in compiling R-3.0.1 and an OPBL-based BLAS for Windows 64bit

Kostya, I think I've found what looks like a reproducible bug in libFuzzer. The code under test is built with ASan and the first ASan CHECK failure shows fuzzer in the stack trace. (see below) One of the factors that may be unique in my testing is that each iteration can take a very long time to execute (tens or hundreds of seconds). Let me know if you need more info, I think it

Kostya, Here's the git repo: https://bitbucket.org/ebadf/fuzzpy I've only tested it on arm7 and x86_64 linux, I expect there's a good chance it may not work on other OSs. If you can build it successfully ("./build.sh", requires clang and clang++ in your path), then you should run the "testemail" case like so: while true; do ITERS=1000 ./run.sh

Request: An additional hook in plot.new() that is called prior to the call to .Internal(plot.new()). Reason: To allow the hook to set up or modify a graphics device that the new plot will appear in. The code change needed for this is simple - just 4 new lines of R code in src/library/graphics/R/plot.R:plot.new() Current definition of plot.new() in src/library/graphics/R/plot.R: plot.new <-

Ah, yes -- you need to clone with --recursive. I will try the workaround though. On Dec 3, 2015 1:12 PM, "Kostya Serebryany" <kcc at google.com> wrote: > > > On Wed, Dec 2, 2015 at 7:17 PM, Brian Cain <brian.cain at gmail.com> wrote: > >> Kostya, >> >> Here's the git repo: https://bitbucket.org/ebadf/fuzzpy >> >> I've only

Hi, I'm trying to do some constrained non-linear optimisation, but my function does not have second order derivatives everywhere. To be a little more specific (the actual function is huge and horrible, so it would probably be better to just describe it) my model has four variables and I'm using optim to minimise an error term. My data is split into discreet days and I have two types of

Thanks Krzysztof. That's very helpful - I was missing the distinction between a register containing an undefined value and a register marked as containing an undefined value. Cheers! On 1/23/18, via llvm-dev <llvm-dev at lists.llvm.org> wrote: > Send llvm-dev mailing list submissions to > llvm-dev at lists.llvm.org > > To subscribe or unsubscribe via the World Wide Web,

Hello All, I am trying to estimate the parameters of a stochastic differential equation (SDE) using quasi-maximum likelihood methods but I am having trouble with the 'optim' function that I am using to optimise the log-likelihood function. After simulating the SDE I generated samples of the simulated data of varying size (I want to see what effect adding more observations has on the

Looks correct. Can you post the output of libFuzzer here? Something like #0 READ cov: 0 bits: 0 units: 97701 exec/s: 0 #1 pulse cov: 732 bits: 0 units: 97701 exec/s: 0 #2 pulse cov: 737 bits: 0 units: 97701 exec/s: 1 #4 pulse cov: 858 bits: 0 units: 97701 exec/s: 2 #8 pulse cov: 880 bits: 0 units: 97701 exec/s: 4 On Thu, Sep 3, 2015 at 10:50 AM, Greg Stark

Is there a way of removing all rows with missing values from a data frame? I usually use subset(x, var1!="NA") and repeat for each variable. It would be nice to be able to do it in one fell swoop. Also, surprisingly, it doesn't always work. Sometimes I'm left with an empty set even though not all rows have missing values for the variable. Cheers, mikkel Mikkel Grum,

Any time I try to use any methods of the Date class, I get errors of ''invalid date''. For example, I have this happening: With the code Date.today, I get this error from Rails: - - - - - - - - - - ArgumentError in Student#show Showing app/views/student/show.rhtml where line #10 raised: invalid date Extracted source (around line #10): 7: <p> <%=

Changes from v3: - mini-os configuration files moved into stubdom/ - mini-os extra console support now a config option - Fewer #ifdefs - grant table setup uses hypercall bounce - Xenstore stub domain syslog support re-enabled Changes from v2: - configuration support added to mini-os build system - add mini-os support for conditionally compiling frontends, xenbus -