Hi Pedro,
This looks too simple to me, but it seems to work:
swap<-function(x,i1,i2) {
tmp<-x[i1]
x[i1]<-x[i2]
x[i2]<-tmp
return(x)
}
mpo<-function(x) {
L<-unique(as.vector(x))
for(i in 1:nrow(x)) {
i1<-which(L==x[i,1])
i2<-which(L==x[i,2])
if(i2 wrote:
>
> Dear All,
>
> This should be
Hi Rui and Ivan,
Yes both works well.
table(dd$ATTRIBUTE, dd$TRAIT) #or
xtabs( ~ ATTRIBUTE + TRAIT, dd)
I have another question,I also want to extract all the PCT_SCORE to draw
box plot. I have tried to draw box of PCT_SCORE for all attribute scores.
boxplot(dd$PCT_SCORE, ylim=c(0,100),
Yes, it does.
table(dd$ATTRIBUTE, dd$TRAIT) #or
xtabs( ~ ATTRIBUTE + TRAIT, dd)
Thank you so much Rui and Ivan.
On Fri, Mar 15, 2019 at 5:51 AM Rui Barradas wrote:
> Hello,
>
> Or more simple,
>
> xtabs( ~ ATTRIBUTE + TRAIT, dd)
>
>
> Hope this helps,
>
> Rui Barradas
>
> Às 19:27 de 14/03/201
Hi Luigi,
Upon careful reading of the help page, you can do it with scatter3D:
scatter3D(X, Y, Z, col.var = Z, pch = 16, cex = 2,clim=c(0.5,3))
scatter3D(X, Y, K, col.var = K, pch = 16, cex = 2,clim=c(0.5,3))
Jim
On Thu, Mar 14, 2019 at 9:32 PM Luigi Marongiu wrote:
>
> Dear all,
> I am trying
Hello,
Or more simple,
xtabs( ~ ATTRIBUTE + TRAIT, dd)
Hope this helps,
Rui Barradas
Às 19:27 de 14/03/2019, Ivan Krylov escreveu:
On Fri, 15 Mar 2019 03:06:28 +0800
roslinazairimah zakaria wrote:
how many of ATTRIBUTE related to TRAITS.
The table() function can be used to count occurr
available.packages() and installed.packages() map package names to version
and a lot of other things.
Bill Dunlap
TIBCO Software
wdunlap tibco.com
On Thu, Mar 14, 2019 at 1:03 PM Sebastien Bihorel <
sebastien.biho...@cognigencorp.com> wrote:
> That is great!
>
> Is there a way to know version r
That is great!
Is there a way to know version required in the dependent packages?
From: "William Dunlap"
To: "Sebastien Bihorel"
Cc: r-help@r-project.org
Sent: Thursday, March 14, 2019 3:50:58 PM
Subject: Re: [R] How to list recursive package dependency prior to
installation/upgrade of
> tools::package_dependencies("lme4")
$lme4
[1] "Matrix""methods" "stats" "graphics" "grid" "splines"
[7] "utils" "parallel" "MASS" "lattice" "boot" "nlme"
[13] "minqa" "nloptr""Rcpp" "RcppEigen"
> tools::package_dependencies("lme4", recursive=TRUE)
On Fri, 15 Mar 2019 03:06:28 +0800
roslinazairimah zakaria wrote:
> how many of ATTRIBUTE related to TRAITS.
The table() function can be used to count occurrences of each
combination of factor levels. Does extracting the two columns by
dd[,c('ATTRIBUTE','TRAIT')] and passing the result to table(
Hi
Is there an elegant way to recursive list all dependencies of a package prior
to its installation or upgrade?
I am particularly interested in finding which of the packages currently
installed in my test/production environment would require an upgrade prior to
actual installation/upgrade of
Hi r-users,
I have these data and I would like to count (frequency) how many of
ATTRIBUTE related to TRAITS.
> dput(dd)
structure(list(ID = structure(c(1L, 1L, 1L, 1L, 1L, 1L, 1L, 1L,
1L, 1L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 3L, 3L, 3L, 3L,
3L, 3L, 3L, 3L, 3L, 3L, 4L, 4L, 4L, 4L, 4L, 4L, 4
On Thu, 14 Mar 2019 15:44:07 +0100 (CET)
julien.lacr...@student.uliege.be wrote:
> My question is therefore the following, how or where could I find
> these source code ? (Note : I have the package Igraph installed)
Functions wrapped in .Call() are implemented in a compiled language,
with corresp
Dear all,
I currently work on a translation of a cost surface function from R to Python
for my dissertation at university. In this context, I have to understand the
"AccCost" method (https://rdrr.io/cran/gdistance/src/R/accCost.R). This method
calls the function "shortest.paths" among other fun
Thanks I am now in personal communication with Frank anyway!
Dan
-Original Message-
From: peter dalgaard
Sent: 14 March 2019 10:37
To: Jackson, Daniel
Cc: r-help@r-project.org
Subject: Re: [R] Rank ANCOVA
1. This is the R-help mailing list, not "Frank and Dennis"
2. You seem to be refe
This is called topological sorting in some circles. The function below
will give you one ordering that is consistent with the contraints but not
all possible orderings. I couldn't find such a function in core R so I
wrote one a while back based on Kahn's algorithm, as described in Wikipedia.
> S
Thanks for this.
Yes, this is checked before trying to process this.
Pedro
On 14/03/2019 14.09, Bert Gunter wrote:
This cannot be done unless transitivity is guaranteed. Is it?
S L
a b
b c
c a
Bert
On Thu, Mar 14, 2019, 4:30 AM Pedro Conte de Barros
mailto:pbar...@ualg.pt>> wrote:
Dea
This cannot be done unless transitivity is guaranteed. Is it?
S L
a b
b c
c a
Bert
On Thu, Mar 14, 2019, 4:30 AM Pedro Conte de Barros wrote:
> Dear All,
>
> This should be a quite established algorithm, but I have been searching
> for a couple days already without finding any satisfact
Try this. Anything that appears only in Smaller is candidate for smallest.
Among those, order is arbitrary.
Anything that appears only in Larger is a candidate for largest. Among
those order is arbitrary.
Remove rows of matComp containing the already classified items. Repeat
with the smaller set
Dear All,
This should be a quite established algorithm, but I have been searching
for a couple days already without finding any satisfactory solution.
I have a matrix defining pairs of Smaller-Larger arbitrary character
values, like below
Smaller <- c("ASD", "DFE", "ASD", "SDR", "EDF", "ASD")
1. This is the R-help mailing list, not "Frank and Dennis"
2. You seem to be referring to two posts from July 2010 by Frank Harrell and
Dennis Fisher.
-pd
> On 13 Mar 2019, at 12:06 , Jackson, Daniel
> wrote:
>
> Hi Frank and Dennis
>
> I am in a similar situation but I would prefer to use
Dear all,
I am trying to display multivariate data using the library plot3D. I
have 3 variables that go on the axis and a fourth that I would like to
display as a color shade. However, the scale differs between plots
because the data I am using varies.
Would be possible to maintain a single scale s
21 matches
Mail list logo
