Displaying 20 results from an estimated 24 matches for "nnode".
Did you mean:
inode
2015 Oct 19
2
"failed to connect to the hypervisor"
...socket, or bad cert, or
whatever). But that's not the case, here. And what puzzles me more is
that -- while I don't know what the output *should* look like -- to my
eye, strace seems to say that we're getting information back:
1940 read(5, "Node 1 MemTotal: 33011680 kB\nNode 1 MemFree:
32565612 kB\nNode 1 MemUsed: 446068 kB\nNode 1 Active:
57948 kB\nNode 1 Inactive: 77036 kB\nNode 1 Active(anon):
27688 kB\nNode 1 Inactive(anon): 84 kB\nNode 1 Active(file):
30260 kB\nNode 1 Inactive(file): 76952 kB\nNode 1 U...
2015 Oct 20
2
Re: "failed to connect to the hypervisor"
...at's not the case, here. And what
>> puzzles me more is that -- while I don't know what the output *should*
>> look like -- to my eye, strace seems to say that we're getting
>> information back:
>>
>> 1940 read(5, "Node 1 MemTotal: 33011680 kB\nNode 1 MemFree:
>> 32565612 kB\nNode 1 MemUsed: 446068 kB\nNode 1 Active:
>> 57948 kB\nNode 1 Inactive: 77036 kB\nNode 1 Active(anon):
>> 27688 kB\nNode 1 Inactive(anon): 84 kB\nNode 1 Active(file):
>> 30260 kB\nNode 1 Inactive(file): 76952 kB\nNode 1 U...
2015 Oct 20
0
Re: "failed to connect to the hypervisor"
...rt, or whatever). But that's not the case, here. And what
>puzzles me more is that -- while I don't know what the output *should*
>look like -- to my eye, strace seems to say that we're getting
>information back:
>
>1940 read(5, "Node 1 MemTotal: 33011680 kB\nNode 1 MemFree:
>32565612 kB\nNode 1 MemUsed: 446068 kB\nNode 1 Active:
>57948 kB\nNode 1 Inactive: 77036 kB\nNode 1 Active(anon):
>27688 kB\nNode 1 Inactive(anon): 84 kB\nNode 1 Active(file):
>30260 kB\nNode 1 Inactive(file): 76952 kB\nNode 1 Unevictable:
>52 k...
2015 Oct 21
0
Re: "failed to connect to the hypervisor"
...e case, here. And what
>>>puzzles me more is that -- while I don't know what the output *should*
>>>look like -- to my eye, strace seems to say that we're getting
>>>information back:
>>>
>>>1940 read(5, "Node 1 MemTotal: 33011680 kB\nNode 1 MemFree:
>>>32565612 kB\nNode 1 MemUsed: 446068 kB\nNode 1 Active:
>>>57948 kB\nNode 1 Inactive: 77036 kB\nNode 1 Active(anon):
>>>27688 kB\nNode 1 Inactive(anon): 84 kB\nNode 1 Active(file):
>>>30260 kB\nNode 1 Inactive(file): 76952...
2012 Oct 04
3
[PATCH] btrfs ulist use rbtree instead
...f_node->val,
diff --git a/fs/btrfs/qgroup.c b/fs/btrfs/qgroup.c
index b650155..a0aad87 100644
--- a/fs/btrfs/qgroup.c
+++ b/fs/btrfs/qgroup.c
@@ -1133,7 +1133,7 @@ int btrfs_qgroup_account_ref(struct btrfs_trans_handle *trans,
seq = fs_info->qgroup_seq;
fs_info->qgroup_seq += roots->nnodes + 1; /* max refcnt */
- ULIST_ITER_INIT(&uiter);
+ ULIST_ITER_INIT(roots, &uiter);
while ((unode = ulist_next(roots, &uiter))) {
struct ulist_node *tmp_unode;
struct ulist_iterator tmp_uiter;
@@ -1146,7 +1146,7 @@ int btrfs_qgroup_account_ref(struct btrfs_trans_handle *trans,...
2011 Feb 03
1
problem with parLapply from snow
...in checkForRemoteErrors(val) :
2 nodes produced errors; first error: no applicable method for 'lapply' applied to an object of class "list"
".
Where this is the problem line of code "yusum <- parLapply(cl, yu, sum)"
The function is
CallSnow <- function (Nnodes = 2, Nsamples = Nnodes)
{
require(Rmpi)
require(snow)
cat("Using snow package, asking for ", Nnodes, "nodes \n")
cl <- makeCluster(Nnodes, type="MPI")
on.exit(stopCluster(cl))
#print(do.call("rbind", clusterCall(cl, function(cl) Sys.info()["...
2012 Feb 04
1
combining data structures
Group
It's unlikely I'm trying this the best way, but I'm trying to create a
data structure from elements like
nNode = 2
nn = vector("list",nNode)
nn[[1]] = list(Node = "1", Connect.up = c(NULL), Connect.down = c(2,3))
nn[[2]] = list(Node = "2", Connect.up = c(1), Connect.down = c(4,5))
.... #( and eventually many more nodes)
NodeList = as.data.frame(nn[[1]])
for(i in 2:nNode) {...
2007 Feb 15
2
Does rpart package have some requirements on the original data set?
Hi,
I am currently studying Decision Trees by using rpart package in R. I
artificially created a data set which includes the dependant variable
(y) and a few independent variables (x1, x2...). The dependant variable
y only comprises 0 and 1. 90% of y are 1 and 10% of y are 0. When I
apply rpart to it, there is no splitting at all.
I am wondering whether this is because of the
2012 May 07
0
R CMD check, interfacing c++ linking errors
...{
SEXP memberssxp = VECTOR_ELT(bootClusters,i);
int l = LENGTH(memberssxp);
int* members = INTEGER(memberssxp);
//bootstraps[i] = new int[l];
for(int j = 0; j<l;++j)
{
bootstraps[i][j] = members[j];
//Rprintf("id: %d\n",members[j]);
}
}
double confnew = REAL(conf)[0];
int Nnode = LENGTH(VECTOR_ELT(bootClusters,0));
MTRand *R = new MTRand(long(443)); // Set random seed
vector<bool> significantVec = vector<bool>(Nnode);
findConfCore(treeMap,bootstraps,significantVec,confnew,R);
vector<pair<int,int> > mergers;
findConfModules(treeMap,boots...
2012 May 08
0
R CMD check, c++ source linking errors
...)
{
SEXP memberssxp = VECTOR_ELT(bootClusters,i);
int l = LENGTH(memberssxp);
int* members = INTEGER(memberssxp);
//bootstraps[i] = new int[l];
for(int j = 0; j<l;++j)
{
bootstraps[i][j] = members[j];
//Rprintf("id: %d\n",members[j]);
}
}
double confnew = REAL(conf)[0];
int Nnode = LENGTH(VECTOR_ELT(bootClusters,0));
MTRand *R = new MTRand(long(443)); // Set random seed
vector<bool> significantVec = vector<bool>(Nnode);
findConfCore(treeMap,bootstraps,significantVec,confnew,R);
vector<pair<int,int> > mergers;
findConfModules(treeMap,boots...
2012 May 08
1
R CMD check linking errors, when interfacing c++
...)
{
SEXP memberssxp = VECTOR_ELT(bootClusters,i);
int l = LENGTH(memberssxp);
int* members = INTEGER(memberssxp);
//bootstraps[i] = new int[l];
for(int j = 0; j<l;++j)
{
bootstraps[i][j] = members[j];
//Rprintf("id: %d\n",members[j]);
}
}
double confnew = REAL(conf)[0];
int Nnode = LENGTH(VECTOR_ELT(bootClusters,0));
MTRand *R = new MTRand(long(443)); // Set random seed
vector<bool> significantVec = vector<bool>(Nnode);
findConfCore(treeMap,bootstraps,significantVec,confnew,R);
vector<pair<int,int> > mergers;
findConfModules(treeMap,boots...
2009 Jan 02
0
Parallel computing with snow
I've been using parApply() in snow package for parallel computing with
the following lines in R 2.8.1:
library(snow)
nNodes <- 4
cl <- makeCluster(nNodes, type = "SOCK")
fm <- parApply(cl, myData, c(1,2), func1, ...)
Since I have a Mac OS X (version 10.4.11) with two dual-core
processors, I thought that I could run 4 simultaneous clusters.
However with the 1st job it seems only two clusters (362...
2018 Jan 16
0
Help
Hi
I try ? Iramuteq ? and when I?ll like ? methode reinert ? I have this message
Erreur R
Loading required package: Matrix
There were 50 or more warnings (use warnings() to see the first 50)
There were 50 or more warnings (use warnings() to see the first 50)
Error in Ntip + Nnode : non-numeric argument to binary operator
Calls: plot.dendropr -> plot.phylo
Execution halted
1
None
Loading required package: Matrix
There were 50 or more warnings (use warnings() to see the first 50)
There were 50 or more warnings (use warnings() to see the first 50)
Error in Ntip + Nnode : no...
2002 Apr 25
1
understanding and resolving seg faults
...double **dsplit,
Sint **isplit, Sint **csplit, double **dnode,
Sint **inode, double **deltaI, int id)
rpmatrix is called by "s_to_rp.c" where
ddeltaI is a pointer from an ALLOC call:
void s_to_rp2(Sint *n, Sint *nsplit, Sint *nnode, Sint *ncat,
Sint *numcat, Sint *maxcat, Sint *xvals, Sint *which,
double *cptable, double *dsplit, Sint *isplit, Sint *csplit,
double *dnode, double *deltaI, Sint *inode)
double **ddeltaI; /* declaration of ddeltaI */
d...
2010 Jun 02
1
compute the associate vector of distances between leaves in a binary non-rooted tree
...[,1] [,2]
[1,] 6 7
[2,] 7 1
[3,] 7 8
[4,] 8 2
[5,] 8 3
[6,] 6 4
[7,] 6 5
$tip.label
[1] "t4" "t3" "t2" "t1" "t5"
$edge.length
[1] 0.9126727 0.2765674 0.4996832 0.7904400 0.8508797 0.8174133 0.9027958
$Nnode
[1] 3
My question is: how to compute the vector of distances between the 5 leaves. This vector is in this case:
v=(d(t1,t2),d(t1,t3),d(t1,t4),d(t1,t5),d(t2,t3),d(t2,t4),d(t2,t5),d(t3,t4),d(t3,t5),d(t4,t5))=(4,4,3,2,2,3,4,3,4,3).
Thanks in advance,
Arnau.
---------------------------------------...
2004 Jun 17
2
using "= matrix (...)" in .C calls
...dnode = matrix(double(1), nodes, 3+numresp),
inode = matrix(integer(1), nodes, 6),
PACKAGE = "rpart")
Which in communicates with the C code in "s_to_rp.c"
void s_to_rp2(Sint *n, Sint *nsplit, Sint *nnode, Sint
*ncat,
Sint *numcat, Sint *maxcat, Sint *xvals, Sint
*which,
double *cptable, double *dsplit, Sint *isplit, Sint
*csplit,
double *dnode, Sint *inode)
Apparently the lines like:
dsplit = matrix(double(1), nsplit,3)...
2008 Nov 30
2
Snow and multi-processing
...e of the item in the list, the 500,000 line by x column matrix had to be shipped along with the item in the list and the traffic time was actually longer than the computing time.
However, if I export the 500,000 object first across the spawned processes as in this mock script
cl <- makeCluster(nnodes,method)
mArrayData <- getData(experiments)
clusterExport(cl, 'mArrayData')
Results <- parLapply(cl, theMapList, function(x) t.testFnc(x))
With a function that define the mArrayData argument as a default parameter as in
t.testFnc <- function(probeList, array=mArrayData){
x &...
2008 Sep 30
1
Problem compiling tinc-1.0.8 on gcc-2.95
...sult || lenout != lenin) {
logger(LOG_ERR, _("Error while decrypting metadata from %s (%s): %s"),
diff -ubr tinc-1.0.8/src/net.c tinc-1.0.8.my/src/net.c
--- tinc-1.0.8/src/net.c Wed Feb 14 11:20:27 2007
+++ tinc-1.0.8.my/src/net.c Thu Sep 25 11:19:53 2008
@@ -65,7 +65,7 @@
nnext = nnode->next;
n = nnode->data;
- if(!n->status.reachable) {
+ if(!n->status.st.reachable) {
ifdebug(SCARY_THINGS) logger(LOG_DEBUG, _("Purging node %s (%s)"), n->name,
n->hostname);
@@ -93,7 +93,7 @@
nnext = nnode->next;
n = nnode->data;
- i...
2013 Apr 25
10
[PATCH v4 0/3] Btrfs: quota rescan for 3.10
The kernel side for rescan, which is needed if you want to enable qgroup
tracking on a non-empty volume. The first patch splits
btrfs_qgroup_account_ref into readable ans reusable units. The second
patch adds the rescan implementation (refer to its commit message for a
description of the algorithm). The third patch starts an automatic
rescan when qgroups are enabled. It is only separated to
2007 Mar 02
0
Dice dissimilarity output and 'phylo' function in R
...her softwares.
The codes I used for a small example are shown below:
samptest4<- scan (file = "samp-test4.txt")
samptest4<- matrix(data = samptest4,nrow=8, ncol=4,
byrow=T)
library(MASS)
library(arules)
library(ape)
#CFI<- numeric (M)
CFI <- function(ctree)
{
(ctree$Nnode -1)/(length(ctree$tip.label) - 2)
}
#calculation of dissimilarities & construction of
trees#
#Calc Jacc disimi#
disjacc <- dissimilarity(samptest4,
y=NULL,method="jaccard")
#Calc Dice disimi#
disdice <- dissimilarity(samptest4,
y=NULL,method="dice")
#Construct Ja...