search for: ties

...about the use of this function, this is just a simplified version of my actual function. And please don't spend your time in finding an alternate way of doing the same as the following does not exactly represent my function. I am only interested in a good explanation) > f1 = function(x,ties.method="average")rank(x,ties.method) > f1(c(1,1,2,4), ties.method="min") [1] 1.5 1.5 3.0 4.0 I don't know why it followed ties.method="average". Anyways I randomly tried the following: > f2 = function(x,ties.method="average")rank(x,ties.method=t...

The BGL (Boost Graph Library) defines tie(), which is exactly what the tie() defined in STLExtras.h. The header files of GBL use boost::tie(), and other boost libraries use boost::tie() too. How to resolve the ambiguity for compiler? -- Tzu-Chien Chiu, 3D Graphics Hardware Architect <URL:http://www.csie.nctu.edu.tw/~jwchiu>

Hi, I ran into a problem where I actually need rank(, ties.method="last"). It would be great to have this feature in base and it's also simple to get (see below). Thanks & cheers, Marius rank2 <- function (x, na.last = TRUE, ties.method = c("average", "first", "last", # new "last" "ra...

Hello, Today I was investigating ks.test() with two numerical arguments (x and y) and was left a bit confused about the policy behind handling ties. I might be missing something, so sorry in advance, but here is what confuses me: The documentation states: "The presence of ties always generates a warning, since continuous distributions do not generate them" But when I run a test with ties there is no warning: ks.test(1:4, 4:7) How...

Hi I want to use order() to get the order of a vector. But I would need a different behavior when ties occur: similar to the parameter ties.method = "random" in the rank() function, I would need to randomise the ties. Is this possible? Example: x <- rep(1:10, 2) order(x) [1] 1 11 2 12 3 13 4 14 5 15 6 16 7 17 8 18 9 19 10 20 order(x) [1] 1 11 2 12 3 13 4 14 5 15 6 16...

On Thursday 22 September 2005 19:12, Chris Lattner wrote: > On Thu, 22 Sep 2005, Tzu-Chien Chiu wrote: > > On 22/09/05, Bill Wendling <isanbard at gmail.com> wrote: > >> Couldn't you state the explicit namespaces. So not using "using > >> namespace llvm" and instead prefix all calls with "llvm::"? > > > > The header files in

Hello, Has somebody installed this configuration: Asterisk + E1 with MFC/R2 (Telef?nica Argentina) in Argentina before? I need to know if it?s possible with MFC/R2 argentine variation. Thanks in advance. R.R. Libera

On 9/23/05, Vladimir Prus <ghost at cs.msu.su> wrote: > In fact, I believe that > > using namespace llvm; > using namespace boost; > using boost::tie; > > should resove the problem witout needed to explicitly nominate all boost names > you use. Except that this does not work on global scope, but only in > namespace: <SNIP> Also, it might be an idea

On 22/09/05, Bill Wendling <isanbard at gmail.com> wrote: > Couldn't you state the explicit namespaces. So not using "using > namespace llvm" and instead prefix all calls with "llvm::"? The header files in boost do not use fully-qualified tie(). I probably should not modify them. But my .cpp file #include them. I hope I could "using namespace" boost

I am trying to determine whether two samples are identical or not. I'm aware that somebody can use the Kolmogorov-Smirnoff test to compare empirical distributions, but since my samples have ties I'm not sure if I'm getting the right p-values for the comparison. Can the Kolmogorov-Smirnoff test be adjusted for the case when ties exists and are there any functions that already exists in R ( Kolmogorov-Smirnoff test )performing that can be used in the case of the existance of tie...

On 9/22/05, Tzu-Chien Chiu <tzuchien.chiu at gmail.com> wrote: > The BGL (Boost Graph Library) defines tie(), which is exactly what the > tie() defined in STLExtras.h. > > The header files of GBL use boost::tie(), and other boost libraries > use boost::tie() too. > > How to resolve the ambiguity for compiler? > Couldn't you state the explicit namespaces. So not

On Thu, 22 Sep 2005, Tzu-Chien Chiu wrote: > On 22/09/05, Bill Wendling <isanbard at gmail.com> wrote: >> Couldn't you state the explicit namespaces. So not using "using >> namespace llvm" and instead prefix all calls with "llvm::"? > > The header files in boost do not use fully-qualified tie(). I probably > should not modify them. But my .cpp

Hello! I need to use Kruskal-Wallis test and post-hoc test (Dunn's test) for my data. But when I searched around, I only found this function: kruskal.test. But nothing for Dunn's test. So I started to write one myself. But I do not know how to count ties in the data frame. I can use for loops but it seems long and unnecessary since the rank function actually knows the ties. So can anyone give me a hint on how I can "count" the number of ties? Many thanks. [[alternative HTML version deleted]]

Dear R-Developers, I think I found two bugs in max.col(). Ties between zeros are not broken, which might affect simulations. -Inf and Zero can be treated the same, which can give completely wrong results, e.g. when the second max is sought by replacing all maxs by -Inf. To fix max.col I do offer the C-code behind my function rowMax(), which also handles NAs...

...quot;spearman"), conf.level = 0.95) Spearman's rank correlation rho data: Origi[, 1] and Origi[, 2] S = 101457, p-value = < 2.2e-16 alternative hypothesis: true rho is not equal to 0 sample estimates: rho 0.8938577 Warning message: p-values may be incorrect due to ties in: cor.test.default(Origi[, 1], Origi[, 2], alternative = c("two.sided"),

How do I setup my T1 card as an E&M tie line? Any special configuration? -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.digium.com/pipermail/asterisk-users/attachments/20050523/8aac4dbf/attachment.htm

...r a group of patients. Looking into the R-functions I would in R recommand using a matched-pairs Wilcoxon test with a formula like: wilcox.test(pre,post,alternative='greater',paired=T) Looking deeper into the writings of Pratt I found some 1964-stuff "Pratt JW. Remarks on zeros and ties in the Wilcoxon signed rank procedures. J.Americ.Statistical Assoc. 1959; 54: 655-67. " Do'es any of you know what is the wilcoxon-pratt test compared with the formula described above and how it should be implemented in R. Thanks in advance /Niels Cand. Polit. Niels Steen Krogh Sols...

Hello. I expand an instruction to a sequence of MachineSDNodes at instruction selection, in the Select() method of the SelectionDAGISel class. For efficiency, in order to generate fewer instructions, I would like to assign twice to the same physical register - but since I don't want to "mess" with the register allocator, I am using only virtual registers. However,

...at yahoogroups.com Cc: chrisw at redhat.com Message-ID: <1282739262-14968-1-git-send-email-jens at linux.vnet.ibm.com> Hi, this set of patches contains the initial implementation of the IEEE 802.1Qbg standard: code for the exchange of EVB TLVs in LLDP frames to negotiate VSI capabalities as well as VDP VSI TLVs between a host with virtual machines and an adjacent switch. It supports setting the parameters of the TLV exchange from the command line using lldptool. VDP profiles consisting of mode,mgrid,typeid,typeidversion,instanceid,mac,vlan can be given to lldpad with lldptool or...

...at yahoogroups.com Cc: chrisw at redhat.com Message-ID: <1282739262-14968-1-git-send-email-jens at linux.vnet.ibm.com> Hi, this set of patches contains the initial implementation of the IEEE 802.1Qbg standard: code for the exchange of EVB TLVs in LLDP frames to negotiate VSI capabalities as well as VDP VSI TLVs between a host with virtual machines and an adjacent switch. It supports setting the parameters of the TLV exchange from the command line using lldptool. VDP profiles consisting of mode,mgrid,typeid,typeidversion,instanceid,mac,vlan can be given to lldpad with lldptool or...