similar to: t-test on a data-frame.

Displaying 20 results from an estimated 5000 matches similar to: "t-test on a data-frame."

2010 Jan 17
6
More than on loop??
hello every one, How to function more than one loop in R? I have the following problem to be solved with the a method of three loops, can you help me please? The data is attached with this message. The data is composed of two parts, cleaved (denoted by ?cleaved?) and non cleaved (denoted by ?noncleaved?). ? to access to the ith peptide, you can use X$Peptide[i] ? to access to the ith label,
2013 Nov 01
1
Package(s) for making waffle plot-like figures?
Dear all, I am trying to make a series of waffle plot-like figures for my data to visualize the ratios of amino acid residues at each position. For each one of 37 positions, there may be one to four different amino acid residues. So the data consist of the positions, what residues are there, and the ratios of residues. The ratios of residues at a position add up to 100, or close to 100 (more on
2013 Aug 08
2
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
Hi all, I have summarized the top 10 compiler passes for Polly when compiling LLVM test-ssuite. Results can be viewed on: https://gist.github.com/tanstar/581bcea1e4e03498f935/raw/f6a4ec4e8565f7a7bbdb924cd59fcf145caac039/Polly-top10 Based on the comparison between "clang -O3" and "polly -O3" listed on:
2013 Aug 08
0
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
On 08/08/2013 01:29 AM, Star Tan wrote: > Hi all, > > > I have summarized the top 10 compiler passes for Polly when compiling LLVM test-ssuite. Results can be viewed on: > https://gist.github.com/tanstar/581bcea1e4e03498f935/raw/f6a4ec4e8565f7a7bbdb924cd59fcf145caac039/Polly-top10 > > > Based on the comparison between "clang -O3" and "polly -O3"
2014 Dec 31
2
[PATCH 1/2] nv50: regenerate rnndb headers
The headers hadn't been regenerated in a long time, and there were a few minor divergences. Among other things, rnndb has changed naming to G80/etc, for now I've not tackled switching that over and manually replaced the nvidia codenames back to the chip ids. However no other modifications of the headergen'd headers was done. Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu>
2016 Oct 16
10
[PATCH 1/5] hwdefs: update nvc0_3d, add gm107_texture for new TIC format
These are copied directly from the mesa repository. Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu> --- src/hwdefs/gm107_texture.xml.h | 365 +++++++++++++++++ src/hwdefs/nvc0_3d.xml.h | 867 +++++++++++++++++++++++++---------------- 2 files changed, 892 insertions(+), 340 deletions(-) create mode 100644 src/hwdefs/gm107_texture.xml.h diff --git
2019 May 29
2
Basic block merging
Under certain circumstances, my compiler outputs basic blocks having the same function: bb_97: ; preds = %bb_1 %476 = getelementptr inbounds %LMtop.I0.ARType, %LMtop.I0.ARType* %0, i64 0, i32 6 %477 = bitcast i8** %476 to %LBstd.Cprocess.CRType** %478 = load %LBstd.Cprocess.CRType*, %LBstd.Cprocess.CRType** %477, align 8 %479 = getelementptr
2009 Apr 17
5
Binomial simulation
Hi Guy's I was wondering if someone could point me in the right direction. dbinom(10,1,0.25) I am using dbinom(10,1,0.25) to calculate the probabilty of 10 judges choosing a certain brand x times. I was wondering how I would go about simulating 1000 trials of each x value ? regards Brendan -- View this message in context:
2019 May 29
3
Basic block merging
Am Mi., 29. Mai 2019 um 13:31 Uhr schrieb Shawn Landden via llvm-dev <llvm-dev at lists.llvm.org>: > > On Wed, May 29, 2019 at 10:49 AM David Jones via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > > > Under certain circumstances, my compiler outputs basic blocks having the same function: > > > > bb_97: ;
2013 Jan 02
0
[LLVMdev] [DragonEgg] [Polly] Should we expect DragonEgg to produce identical LLVM IR for identical GIMPLE?
Hi Duncan & Tobi, Thanks a lot for your interest, and for pointing out differences in GIMPLE I missed. Attached is simplified test case. Is it good? Tobi, regarding runtime alias analysis: in KernelGen we already do it along with runtime values substitution. For example: <------------------ __kernelgen_main_loop_17: compile started ---------------------> Integer args substituted:
2016 May 16
2
Determination of statements that contain only matrix multiplication
Hi Tobias, could we use information about memory accesses of a SCoP statement and def-use chains to determine statements, which don’t contain matrix multiplication of the following form? for (int i = 0; i < Upper Bound1; i++) for (int j = 0; j < Upper Bound2; j++) for (int k = 0; k < Upper Bound3; j++) C[i][j] += A[i][k] * B[k][j] We could probably check that memory access
2017 May 06
2
Build polly-amd64-linux Failure
On Sat, May 6, 2017, at 04:28 PM, llvm.buildmaster at lab.llvm.org wrote: > The Buildbot has detected a failed build on builder polly-amd64-linux > while building polly. > Full details are available at: > http://lab.llvm.org:8011/builders/polly-amd64-linux/builds/6539 > > Buildbot URL: http://lab.llvm.org:8011/ > > Buildslave for this Build: grosser1 > > Build
2023 Dec 04
1
Fit NLE - was: computer algebra in R
Fit NLE - was: [R] computer algebra in R Original post: https://stat.ethz.ch/pipermail/r-help/2023-November/478619.html Dear Kornad, I think I have started to understand what you try to achieve. The problem is to fit a NLE and compute the parameters of the NL-Eq. I have included the R Help-list back in the loop, as I am not an expert in optimization. Goal: y ~ I0 + IHD * hd + ID * d; where: y
2014 Oct 23
2
[LLVMdev] Question regarding getElementPtr/Addressing modes in backend
Hi Steve, Thanks for the tip regarding MIOperandInfo, I didn't think of that part of the tablegen description. Sadly, I did actually mean: r1 = *(i0 += m0). So increment i0 by m0. Read memory the memory location "pointed" to by i0. Store in r1. Sadly I am not too familiar with compiler terminology, so I don't know if there is a proper term for such a load. On Thu, Oct 23,
2006 Jul 29
1
fancier plotting
Hi thank you for talking the time to help me with this. I have a sequence of numbers in a file and an equal sequence of various character, say(a b c d) each occurs more than once. I need to plot the numbers so that numbers corresponding to a in the other sequence would have green dots, those corresponding to b a red dot, nothing on c and blue square for d. i.e 2 a show a green dot 4 b show a
2010 Dec 10
2
survival package - calculating probability to survive a given time
Dear R users, i try to calculate the probabilty to survive a given time by using the estimated survival curve by kaplan meier. What is the right way to do that? as far as is see i cannot use the predict-methods from the survival package? library(survival) set.seed(1) time <- cumsum(rexp(1000)/10) status <- rbinom(1000, 1, 0.5) ## kaplan meier estimates fit <- survfit(Surv(time,
2012 Jul 23
3
How to do the same thing for all levels of a column?
Dear all, I am a R beginner, and I am looking for a way to do the same thing for all levels of a column in a table. Basically, I have a bunch of protein sequences composed of different amino acid residues, and each residue is represented by an uppercase letter. I want to calculate the ratio of different amino acid residues at each position of the proteins. Here is an example table: Proteins
2011 Apr 21
1
[LLVMdev] A problem from XCode 4 - help sought tracking it down
Sorry if this isn't the right place; but I'm facing an XCode 4 (LLVM 2.0 to Apple, I heard it's LLVM 2.9 under the hood) issue that may involve LLVM, and maybe some people on this list could help me short-circuit the source. I have a code pattern that, when used in XCode 4 in Objective C++ files, causes the whole IDE to go crash. It is a stripped sample to highlight the issue. In
2005 Jan 16
2
Empirical cumulative distribution with censored data
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
2012 Mar 11
1
[PATCH] Coalesce printable characters in debug and trace messages (RHBZ#802109).
From: "Richard W.M. Jones" <rjones at redhat.com> --- src/events.c | 25 +++++++++++++++++-------- 1 files changed, 17 insertions(+), 8 deletions(-) diff --git a/src/events.c b/src/events.c index f707e0b..9a1ca76 100644 --- a/src/events.c +++ b/src/events.c @@ -120,8 +120,7 @@ guestfs___call_callbacks_message (guestfs_h *g, uint64_t event, event == GUESTFS_EVENT_TRACE)