Displaying 20 results from an estimated 4577 matches for "tied".
Did you mean:
tie
2009 May 27
3
Defining functions - an interesting problem
I define the following function:
(Please don't wonder 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 =
2005 Sep 22
3
[LLVMdev] name collision - llvm::tie and boost::tie
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>
2015 Oct 08
3
rank(, ties.method="last")
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"
"random", "max",
2023 Apr 21
1
Confusion about ks.test() handling of ties and exact vs approximate results
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
2009 Jun 04
4
order() with randomised order in ties?
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
2005 Sep 23
2
[LLVMdev] name collision - llvm::tie and boost::tie
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
2006 Oct 11
6
Asterisk + E1 with MFC/R2 in Argentina?
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
2005 Sep 23
0
[LLVMdev] name collision - llvm::tie and boost::tie
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
2005 Sep 22
3
[LLVMdev] name collision - llvm::tie and boost::tie
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
2007 Nov 06
2
Kolmogorov-Smirnoff test
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
2005 Sep 22
0
[LLVMdev] name collision - llvm::tie and boost::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
2005 Sep 22
0
[LLVMdev] name collision - llvm::tie and boost::tie
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
2011 Nov 21
2
count ties after rank?
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
2007 Mar 03
0
2 bugs in max.col() (PR#9542)
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 and seems to be faster. However,
2004 Mar 19
1
cor.test() -> p-values may be incorrect due to tie
Hi R specialists,
When testing the association between two time series the cor.test gives
the following message...-> p-values may be incorrect due to tie
What does it mean? (it is not described in the help)
Thankx,
Jan
> cor.test(Origi[,1],Origi[,2], alternative = c("two.sided"),method =
c("spearman"), conf.level = 0.95)
Spearman's rank correlation rho
2005 May 23
2
E&M Tie Line
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
2003 Dec 01
2
wilcoxon-pratt signed rank test in R - drug-effiacy
Hi.
I'm going to introduce the R-package for a group of medical doctors later
this week and is a little confused about there use of a test named
"willcoxon-pratt" for testing if the clinical and biochemical markers has
decreased significantly after the use of some drugs for a group of patients.
Looking into the R-functions I would in R recommand using a matched-pairs
Wilcoxon
2017 Jun 06
2
Putting "tied-to" constraints on virtual registers in SelectionDAGISel's Select() method
...ame virtual
register - this gives me the following error: "getVRegDef assumes a single definition or
no definition" later, after instruction selection.
Therefore, I try to use 2 virtual registers for the same physical register. I know in
TablGen instruction specs we can give "tied-to" constraints on virtual registers of the form:
string Constraints = "$regInput = $regOutput";
Can we put such "tied-to" constraints programatically also at instruction selection,
in the Select() method of the SelectionDAGISel class?
Thank you,
Alex
2010 Sep 10
0
Virtualization Digest, Vol 60, Issue 17
Hi,
Can someone please point me to where I can find this early version of the IEEE802.1Qbg implementation? When I downloaded the 0.9.38 version of lldpad, it does not have the latest set of code mentioned below.
Thanks.
Arpit.
-----Original Message-----
From: virtualization-bounces at lists.linux-foundation.org [mailto:virtualization-bounces at lists.linux-foundation.org] On Behalf Of
2010 Sep 10
0
Virtualization Digest, Vol 60, Issue 17
Hi,
Can someone please point me to where I can find this early version of the IEEE802.1Qbg implementation? When I downloaded the 0.9.38 version of lldpad, it does not have the latest set of code mentioned below.
Thanks.
Arpit.
-----Original Message-----
From: virtualization-bounces at lists.linux-foundation.org [mailto:virtualization-bounces at lists.linux-foundation.org] On Behalf Of