search for: factorisation

Dear list, I often need to convert several variables from numeric or integer into factors (before plotting, for instance), as in the following example, d <- data.frame( x = seq(1, 10), y = seq(1, 10), z = rnorm(10), a = letters[1:10]) d2 <- within(d, { x = factor(x) y = factor(y) }) str(d) str(d2) I'd like to write a function factorise() which takes a data.frame and

...(q1%*%c)%*%q1 - (q2%*%c)%*%q2 q3 <- (1/sqrt(sum(C^2)))*C Orthonormal.basis <- matrix(c(q1,q2,q3),3,3) > Orthonormal.basis [,1] [,2] [,3] [1,] 0.7071068 0.7071068 0 [2,] 0.0000000 0.0000000 1 [3,] 0.7071068 -0.7071068 0 ########################## # QR Factorisation X = QR ########################## x.qr <- qr(x) Q <- qr.Q(x.qr) R <- qr.R(x.qr) X <- qr.X(x.qr) > Q [,1] [,2] [,3] [1,] -0.7071068 -0.7071068 0 [2,] 0.0000000 0.0000000 1 [3,] -0.7071068 0.7071068 0 Thanks, cruz

Dear R users, please can you help me understand the behaviour of abline using function lm. I'm trying to learn linearity over groups. So I make three groups with 10 values each: test=data.frame(cbind( l=c(rnorm(10,0,30),rnorm(10,100,30),rnorm(10,200,30)), t = c(rep(0,10), rep(1,10), rep(2,10)) )) when I do: plot(test$l~test$t) abline(lm(test$l~test$t)) the abline is a straight line

...Trying to use rsync here is not a good solution because the ciphering transformation on file versions disperses the correlations between them and then when Rsync tries to localize common blocks between ciphered versions, he hardly ever finds and the compression resulting from the common sequences factorisation can't happen. My method proposes a solution to this problem and allows to save ciphered versions on a distant server with costs (storage, communications, algorithmic complexity) comparable to rsync. I want to know if anyone finds my work of interest and if anyone of you knows if such a proble...

Hi, For some reason (outbound call tracking) I've got a few different outbound call process (using a macro for queuemetrics logging, or direct call) i wanted to factorise the routing process so i came up with something like the following. All in one it's working like expected, however every "ael reload" command trigger a lot of warning like that "application call

With the current implementation, the root inode of the given partition is ignored. The root inode is now reported. Its name will be a single dot '.' reproducing the TSK API. Signed-off-by: Matteo Cafasso <noxdafox@gmail.com> --- daemon/tsk.c | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/daemon/tsk.c b/daemon/tsk.c index dd368d7..4a0517b 100644 ---

...es have the same spacing as the breaks used for the histogram. I could of course log the whole data set, but then explaining that transformation within a presentation is generally not a pleasant exercise. On the other hand I would like to keep the code short and thus would like to avoid issues like factorisation. Something like x<- breaks .... hist(data, breaks= x, "xaxisbreaks=x") At the moment the axis is equalspaced by units (2,4,6,8) with 0-2 having 2 areas and the blocks 4-6 and 6-8 only having one block. I tried also the xlog entry (i.e. log="x") which returned "log&quot...

...lowable frame sizes < 512, a lot of which are odd numbers. However some are even numbered, so this should work. Unfortunately it doesn't and en exception is raised. Some investigation reveals the problem to be in the module kiss_fft.c, during allocation of storage for the FFT. The factorisation function kf_factor returns a failure if the frame size has a prime factor > 5. This results in the block which wasn't yet allocated being freed, and hence the exception. Given this restriction, their is no frame size that the both the driver and CELT will accept. I'd like to avoi...

In case more of you come across my request from this morning, I've already gotten several great tips, which I summarize here since one or two of these did not come across R-help as well. A team of fellow political scientists is on this problem like "white-on-rice"! Brandt, Patrick, John T. Williams Benjamin O. Fordham, and Brian Pollins. 2000. "Dynamic Modeling for Persistent

Hello everybody, so, here's the summary of my progress (note that it also includes a few items to discuss, so I'm cc-ing this to nut-upsdev as well). I. The planning: 1/ libnutconf: The core (i.e. config. classes and their (de)serialisers) is coded, UT in progress. Signalisation shall follow; I have a couple of practical thoughts & comments to this, see below. In general, I'd

Hi, I am trying to do a bayesian prediction for soil pollution data above a certain threshold, using geoR. Everything is working fine until i am doing the krig.bayes. I tried to do the prediction on a grid 67 by 113 cells and my computer is freezing to death. At larger numbers of cells it tells me after a while that it reaches the max. memory of 511 Mb. My computer has only 512 Mb of RAM.

The Wine development release 1.1.3 is now available. What's new in this release (see below for details): - Beginnings of ddraw overlay support. - Many more crypt32 functions. - Improved support for tables in Richedit. - Support for NETWM window maximization. - Many installer fixes. - Tweaks for better PulseAudio support. - Various bug fixes. The source is available from the

This is especially true when variables or functions are just called dsm without specifying the v1. Changes since v1: * Fix typo in commit explanation * Change has_dsm to has_mux in nouveau_dsm_detect Signed-off-by: Pierre Moreau <pierre.morrow at free.fr> --- drm/nouveau/nouveau_acpi.c | 72 +++++++++++++++++++++++----------------------- drm/nouveau/nouveau_acpi.h | 4 +--

This is release 0.9.49 of Wine, a free implementation of Windows on Unix. What's new in this release: - Many copy protection fixes. - GLSL is now the default for Direct3D. - Lots of memory errors fixed thanks to Valgrind. - Support for TOPMOST windows. - Beginnings of an inetcomm dll implementation. - Lots of bug fixes. Because of lags created by using mirrors, this message may