search for: transormation

Hi, I am trying to transform a data matrix into a vector and have not be able to accomplish want I am looking for. The setup is as follows. I start with a 3 x 3 matrix: 5 1 3 3 3 2 1 2 4 I would like to transorm it into a 27 x 1 vector of the follwing form 5 5 5 1 1 1 3 3 3 . . . 1 1 1 2 2 2 4 4 4 In essense I want to create a vector in which each element of the original matrix is repeated

Hello, I'm Carla, an italian student, I'm looking for a package to transform non normal data to normality. I tried to use Box Cox, but it's not ok. There is a package to use Johnson families' transormation? Can you give me any suggestions to find free software as R that use this trasform? Thank yuo very much Carla ____________________________________________________________ 6X velocizzare la tua navigazione a 56k? 6X Web Accelerator di Libero! Scaricalo su INTERNET GRATIS 6X http://www.libero.it

hi, i'm trying to figure out if there's any possibility to write a whole vector into a matrix or data.frame or something like that. i don't mean transormation. Here an example: [,1] [,2] [1,] "a" "d" [2,] "b" "e" [3,] "c" "f" where e.g. a is a<-c(0,1) vector of length 2, b a vector of length 4,... (i know that the matrix enties are strings :)). i'm trying to put some variables...

Please, is there any R-list about survival package ? Thanks Mauricio

Numeric data that is part of a mixed type data frame is converted into character. How can I tell apply to maintain the original class of a column and not convert it into character. I would like to do this of the vector and not inside the apply function individually over each element. Consider the following two scenarios, in the second column 'a' maintained its class while it lost its

I took function mdct_butterfly_8 and write out transformation matrix. Then I rewrote this matrix into sequence of additions and substractions (see attachement). As I suspected I got the same as in the original code but I swaped some rows to get little higher speed. I hope I'll do the same with 16 point butterfly function combined with 8 point butterflies in a month. Who still believe that this

...n after tail call optimization. 3. Introduce context-aware optimization passes to minimize the actual use of contexts by non-recursive code. For example, some coroutines can be inlined with the help of indirect branches. 4. Have the language front-end always emit code like that produced by the transormation pass described in (2), and ensure the language's runtime libraries also conform. It is not possible in LLVM to completely eliminate the use of stack space, however. //===----------------------------------------------------------------------===// // Moving forward // An easy first step would...

Kenneth Uildriks <kennethuil at gmail.com> wrote: > As I see it, the context switching mechanism itself needs to know > where to point the stack register when switching.  The C routines take > an initial stack pointer when creating the context, and keep track of > it from there.  If we don't actually need to interoperate with > contexts created from the C routines, we have