similar to: function to find coodinates in an array

Displaying 20 results from an estimated 2000 matches similar to: "function to find coodinates in an array"

2007 Aug 17
1
[BioC] function to find coodinates in an array
The arr.ind in the which function does the job very nicely!!! Thank you everyone for the suggestions! Ana > > >---- Mensaje Original ---- >De: marc_schwartz at comcast.net >Para: m_olshansky at yahoo.com >Asunto: Re: [BioC] [R] function to find coodinates in an array >Fecha: Thu, 16 Aug 2007 21:53:44 -0500 > >>If I am correctly understanding the problem, I think
2009 Jul 24
2
Stting non-overlaping text positions
Dear List I am having problems to set text labels in a scatter plot. At some areas dots are close and labels overlap and texts cannot be read. I have too many dots to adjust this manually. Is there any function that will calculate the label offsets to avoid this overlapping problem? Thanks Ana -- Ana Conesa Bioinformatics and Genomics Department Centro de Investigaciones Principe Felipe
2003 Dec 04
1
Table to pdf
Hi all, I am new in R world and I haven't been able to find the answer to my question in the documentation I looked up so far. I hope someone can help. In the R function I am writing I have set the graphical output to be saved into a pdf file. I would also like to include in this file a table with some data, however I can't find the way to direct a table to a graphics
2007 Oct 23
1
Compute R2 and Q2 in PLS with pls.pcr package
Dear list I am using the mvr function of the package pls.pcr to compute PLS resgression using a X matrix of gene expression variables and a Y matrix of medical varaibles. I would like to obtain the R2 (sum of squares captured by the model) and Q2 (proportion of total sum of squares captured in leave-one-out cross validation) of the model. I am not sure if there are specific slots in the
2005 Nov 24
1
hamming distance
Hi, Does anyone know an R function to impute hamming distance? Thanks Ana O@@@@@ &nb @@@O@@O@ Centro de Gen?mica @O@@@@O@ Instituto Valenciano de Investigaciones Agrarias (IVIA) @@@O@@@@ Carretera Moncada - Naquera, Km. 4,5 @@@@O@ 46113 Moncada (Valencia) SPAIN || & || &
2003 Dec 04
0
AW: Table to pdf
Hi, See ?Sweave in library(tools). HTH Thomas -----Urspr?ngliche Nachricht----- Von: Ana Conesa [mailto:aconesa at ivia.es] Gesendet: Donnerstag, 4. Dezember 2003 09:34 An: r-help at stat.math.ethz.ch Betreff: [R] Table to pdf Hi all, I am new in R world and I haven't been able to find the answer to my question in the documentation I looked up so far. I hope someone can
2010 May 18
1
BIC() in "stats" {was [R-sig-ME] how to extract the BIC value}
>>>>> "MM" == Martin Maechler <maechler at stat.math.ethz.ch> >>>>> on Tue, 18 May 2010 12:37:21 +0200 writes: >>>>> "GaGr" == Gabor Grothendieck <ggrothendieck at gmail.com> >>>>> on Mon, 17 May 2010 09:45:00 -0400 writes: GaGr> BIC seems like something that would logically go into stats
2010 Sep 03
6
[LLVMdev] Why clang inlines with -O3 flag and opt doesn't?
When I compile my C fibonacci example fib.c with 'clang -O3 -c -emit-llvm -o fib-clang.bc fib.c&& llvm-dis fib-clang.bc' I get fib-clang.ll that has some degree of inlining in it. But when I get an equivalent to fib.c file fib.ll and run it through opt with the command 'llvm-as fib.ll&& opt -O3 fib.bc -o fib-opt.bc&& llvm-dis fib-opt.bc' resulting
2016 Jul 28
2
Eliminar filas al principio y final de un .csv en R
Muchas gracias Carlos, la lógica es perfecta pero no se como identificar con código las lineas en blanco entre el bloque 2 y el bloque 3. Para de esta forma quedarme solo con el bloque 2. Tienes alguna idea? Muchas gracias. Joan 2016-07-28 17:00 GMT+02:00 Carlos Ortega <cof en qualityexcellence.es>: > Hola, > > Se me ocurre esta solución en pseudo-código...: > > >
2004 Aug 17
4
[LLVMdev] JIT API example (fibonacci)
Hi LLVMers, the example attached I have used to prove that JIT and some visible optimizations are really invoked. Proved OK. I got 30% speed-up in comparison to gcc 3.3.3 on my Athlon XP 1500. Nice. P.S. guys, no fears, I don't plan to flood the cvs repository with my "brilliant" examples ;) --- Valery A.Khamenya -------------- next part -------------- An
2004 Aug 17
5
[LLVMdev] JIT API example (fibonacci)
On Tue, 17 Aug 2004, Reid Spencer wrote: > That's pretty cute actually. Do you want this "brilliant" :) example in the cvs > repository? I'd be happy to put it in. Here's an idea: how about we take the ModuleMaker, Valery's previous example, and this one and put them all in one "small examples" project? -Chris > Valery A.Khamenya wrote: > >
2014 May 08
3
[LLVMdev] Small problem with the tail call elimination pass
Hello everybody, On the documentation page for the tailcallelim pass you can read: "This pass transforms functions that are prevented from being tail recursive by an associative expression to use an accumulator variable, thus compiling the typical naive factorial or fib implementation into efficient code” However, I don’t see this behavior when trying to compile this variant of the
2016 Jul 28
2
Eliminar filas al principio y final de un .csv en R
Hola a todos, tengo 170 .csv donde tengo que eliminar las primeras 20 lineas (primer bloque) y luego todo un último bloque de datos (tercer bloque) que está separado por dos filas sin datos del segundo bloque (que es el que me interesa). El tercer bloque empieza en cada .csv en una linea diferente por lo tanto no se si puedo automatizar en R quedarme tan solo con la información a partir de la
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
Valery, That's pretty cute actually. Do you want this "brilliant" :) example in the cvs repository? I'd be happy to put it in. Reid. Valery A.Khamenya wrote: > Hi LLVMers, > > the example attached I have used to prove that JIT and some visible > optimizations are really invoked. > > Proved OK. I got 30% speed-up in comparison to gcc 3.3.3 >
2010 Mar 24
3
mounting gfs partition hangs
Hi, I have configured two machines for testing gfs filesystems. They are attached to a iscsi device and centos versions are: CentOS release 5.4 (Final) Linux node1.fib.upc.es 2.6.18-164.el5 #1 SMP Thu Sep 3 03:33:56 EDT 2009 i686 i686 i386 GNU/Linux The problem is if I try to mount a gfs partition it hangs. [root at node2 ~]# cman_tool status Version: 6.2.0 Config Version: 29 Cluster Name:
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
On second thought, the makefiles don't (easily) allow this do they? You can only build one program per directory. Were you suggesting that you wanted me to move the entire directories under a "small examples" directory? Reid. Chris Lattner wrote: > On Tue, 17 Aug 2004, Reid Spencer wrote: > > >>That's pretty cute actually. Do you want this
2007 Mar 16
1
Problems with MFCR2 and Meridian
Hi List, I'm trying to connect Asterisk with a Nortel Meridian using an E1 with MRFR2 signaling. I've connected both cards, and compiled all the required software... The problem is every call (outgoing or incoming) got dropped, complaining about some "T1 timed out" Only for testing purposes I'm using an application called testcall included on the lib-unicall package, and
2004 Aug 18
1
[LLVMdev] JIT API example (fibonacci)
On Tue, 17 Aug 2004, Reid Spencer wrote: > On second thought, the makefiles don't (easily) allow this do they? You can > only build one program per directory. Were you suggesting that you wanted me to > move the entire directories under a "small examples" directory? You're right. The simples way to do this would be to have: projects/ SmallExamples/
2007 Nov 25
2
[LLVMdev] Fibonacci example in OCaml
Here's my translation of the Fibonacci example into OCaml: open Printf open Llvm let build_fib m = let fibf = define_function "fib" (function_type i32_type [| i32_type |]) m in let bb = builder_at_end (entry_block fibf) in let one = const_int i32_type 1 and two = const_int i32_type 2 in let argx = param fibf 0 in set_value_name "AnArg" argx; let
2005 May 12
2
[LLVMdev] Scheme + LLVM JIT
> llvm_function_new/llvm_value_set_name/llvm_executionengine_run_function, > etc. > > If kept simple, standardized, and generic, I think it would be very useful > to people (even if incomplete). This would allow others to build on it, > and we could 'ship' it as a standard llvm library. It looks like my interface will look vaguely like this. Functions like