search for: attains

I have a matrix say, 1 4 23 30 and I want to find the previously attainable fisher's exact test p-value. Is there a way to do this in R? -- Thanks, Jim. [[alternative HTML version deleted]]

Dear list, I would like to plot the empirical cumulative distribution of the time needed by a treatment to attain a certain goal. A number of experiments is run with a strict time limit. In some experiments the goal is attained before the time limit, in other experiments time expires before the goal is attained. The situation is very similar to survivial analysis with censored data. I tryed

> > looks like its more like 3000 times slower. This means that all of the > > float operations must be removed for the code to work properly. ...or > > maybe there's a way to make the emulation in a library instead of making > > the kernel trap illegal instructions. > > Is it a long job to remove the remaining floating point ops? Is it likely > to be

Hi, all. I'd like to know if exists a manner to get the first index where a condition is attained in a vector. For example, There is a better solution than first.index <- table(subject[corretor==27])[1] (give me the subject for the first time that corretor is 27)? Thanks, ======================================== Cezar Freitas (ICQ 109128967) IMECC - UNICAMP Campinas, SP - Brasil

On 01/06/15 22:17, Tom G. Christensen wrote: > On sparc-sun-solaris2.6 and sparc-sun-solaris2.7 the testsuite fails: > run test cfgparse.sh ... > reparse minimal config > reparse regress config > listenaddress order > bad addr or host: ::1 (no address associated with name) > listenaddress order 1 > bad addr or host: ::1 (no address associated with name) > listenaddress

I have found this link http://owlriver.com/tips/tiny-centos for installing centos on a minimal system. I am looking at putting centos on a 1 GIG flash drive. The above page talks about removing packages after install to attain the small size. however, I am getting blocked at the install page about not enough room to install. All I have selected is the base package. nothing else. Is there a way

Hi all, What kind of input loop is expected for the loop-access pass to run smoothly? Also, what passes (like mem2reg) should be run to ensure the desired form is attained. Is running mem2reg, indvars and loop-simplify enough for that? Any help will be appreciated. Thanks and regards, Shraiysh -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi, I am new-comer to statistics and R-Project. I would like to know if these features can be attained in R-Project.Please help. 1) beta 1 and Beta 2, or gamma one and gamma two for skewness and kurtosis, respectively, including standard errors and tests for significance (relative to values for a Gaussian distribution). 2) linear correlation 3) quadratic regression 4) polynomial regression

Dear R contributors, Say I want to debug some C code invoked through .Call() - say "varbayes" in the VBmix package. following the instructions in "Writing R Extensions", I perform the following actions : R -d gdb run library(VBmix) CTRL+C break varbayes signal 0 mod <- varbayes(as.matrix(iris)[,1:4], 2) The breakpoint is indeed activated, seemingly at the correct position

On Thu, 25 Jun 2015, Michael Felt wrote: > Just running a standard make, and then a make install to a packaging > directory. It seems to be complaining about missing keys - not sure yet if > this is a show stopper For packaging you want the install-nokeys rule not install. -- Tim Rice Multitalents tim at multitalents.net

Hi Tobias, according to [1], we can expect 90% of the turbo boost peak of the processor with a C version of Matrix-Matrix Multiplication that is similar to the one presented in [1]. In case of Intel Core i7-3820 SandyBridge, the theoretical maximal performance of the machine is 28.8 gflops and hence the expected number is 25,92 gflops. However, in case of, for example, n = m = 1056 and k = 1024

Hi all, I recently came across a possible requirement of backing up certain files on a remote server ... in an encrypted format. This got me seriously thinking about the possibility of doing such a thing with rsync. I am not too knowledgable about encryption and the mechanisms of the rsync algorithm (at least as yet :), but I would like to know whether this is attainable or 'far fetched'

I found this example in an Introductory R book in the chapter on Matrices and Arrays The array is > m [,1] [,2] [,3] [,4] [,5] [1,] 0 12 13 8 20 [2,] 12 0 15 28 88 [3,] 13 15 0 6 9 [4,] 8 28 6 0 33 [5,] 20 88 9 33 0 The code is #returns the minimum value of d[i,j], i !=j and the row attaining #the minimum, for square

After much delay, I have finally reached the point in my work where I need to implement some kind of exception handling. I understand that "unwind" is currently unimplemented and will remain so for the forseeable future. In the mean time, are there any examples available for implementing Java or Python-style exceptions using __cxa_throw or something similar? I've read and

The Loop Optimization Working Group had a survey about “canonical” loop required by each loop transformation or analysis. That is, what should we normalize a loop before running a certain loop pass. Here is the survey result: https://tinyurl.com/rhuzny2 (Note that there are two workspaces: “By precondition” and “Breakdown”) Best - Min > On Dec 22, 2019, at 2:40 AM, Shraiysh Vaishay via

Concern: Supersize io operations (IO block size more than 4KiB) is split in to number of 4KiB blocks Supersize io operations (IO block size more than 4KiB) is split in to number of 4KiB blocks OS: CentOS 7.3 kernel Version: 3.10.0-514.el7.x86_64 Any IO (write) block size more than 4KiB is split in to number of 4KiB blocks on Centos 7.3 ( where I don't see similar issue on 7.2). I have a

Concern: Supersize io operations (IO block size more than 4KiB) is split in to number of 4KiB blocks Supersize io operations (IO block size more than 4KiB) is split in to number of 4KiB blocks OS: CentOS 7.3 kernel Version: 3.10.0-514.el7.x86_64 Any IO (write) block size more than 4KiB is split in to number of 4KiB blocks on Centos 7.3 ( where I don't see similar issue on 7.2). I have a

Jean-Marc Valin wrote: >>>looks like its more like 3000 times slower. This means that all of the >>>float operations must be removed for the code to work properly. ...or >>>maybe there's a way to make the emulation in a library instead of making >>>the kernel trap illegal instructions. >> >>Is it a long job to remove the remaining floating point

I have a big (8 quad core opterons) TYAN server with only the most basic mobo graphics capability and KDE under Xen is exceedingly slow and the attainable resolution is not very high. Is there wisdom on a particular card or chip that plays well with Xen (OpenSuSE 11.0)? THANK YOU! Patti _______________________________________________ Xen-users mailing list Xen-users@lists.xensource.com

...; follow a top-down strategy based on the Akaike's and Schwarz's information criteria in the datails to the ADF.test function. What does a "top-down strategy" mean? Probably the respective criterion is minimized and the mode vector contains the lag orders at which the criterion attains it local minima? When the calculation is over, the ADF.test function gives info about "Lag orders". What are these lag orders? Are they the local minima of the criterion? I will be very thankful if you clarify this to me. I browsed a lot, but I could not find a clear answer. Thank...