search for: kamada

Hi, I am plotting a graph with kamada.kawai layout. But I am getting direction arrows in the graphs. Please let me know how to avoid this. g <- watts.strogatz.game(1, 2000, 5, 0.4) comps <- clusters(g)$membership colbar <- rainbow(max(comps)+1) V(g)$color <- colbar[comps+1] png(filename) plot(g, layout=layout.kamada...

...ease refer following Mr. Steven''s mail posted on June 24th. Message-ID: <20080624131313.GB18379@weybridge.uk.xensource.com> Message-ID: <20080624131256.GA18379@weybridge.uk.xensource.com> Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

Add vscsiif.h Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> Signed-off-by: Akira Hayakawa <hayakawa.akira@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

...mands. TEST UNIT READY REZERO UNIT REQUEST SENSE FORMAT UNIT READ BLOCK LIMITS READ(06) WRITE(06) WRITE FILEMARKS SPACE INQUIRY ERASE MODE SENSE(06) SEND DIAGNOSTIC READ CAPACITY READ(10) WRITE(10) REPORT LUN Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

Patch in order to make pvSCSI work on HVM. Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> Signed-off-by: Akira Hayakawa <hayakawa.akira@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

This patch is for backend driver. Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Tsunehisa Doi <Doi.Tsunehisa@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> Signed-off-by: Akira Hayakawa <hayakawa.akira@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

This patch is for Makefile and Kconfig file for scsifront and scsiback driver. Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Tsunehisa Doi <Doi.Tsunehisa@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> Signed-off-by: Akira Hayakawa <hayakawa.akira@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

This patch is for modifying xend in order to use pvscsi driver. (attach/detach HBA, etc.) Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Tsunehisa Doi <Doi.Tsunehisa@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> Signed-off-by: Akira Hayakawa <hayakawa.akira@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

Dear r-help, I create a graph of my baysian network. I use the package igraph. The names of vertex are within the circle, I would leave them outside the circle? > E(g)$color <- "black" > tkplot(g, ,vertex.label=names,layout=layout.kamada.kawai, edge.color=E(g)$color) Best Regards [[alternative HTML version deleted]]

...th(gp) for (j in 1:N){ for (k in j:N){ adjm[gp[k],gp[j]] = adjm[gp[k],gp[j]]+1 adjm[gp[j],gp[k]] = adjm[gp[k],gp[j]] } } } for(i in 1:10){adjm[i,i]=0} require(igraph) gg=graph.adjacency(adjm,mode="max") V(gg)$name = 1:10 V(gg)$label = V(gg)$name plot.igraph(gg, layout=layout.kamada.kawai, vertex.color=gray(0.7)) ################################################################# Thanks in advance, -Steven Wolf MSU Dept of Physics

I''ve been having a look through scsifront again, and I saw this bit: ring_req->timeout_per_command = (sc->timeout_per_command / HZ); ring_req->nr_segments = 0; spin_unlock_irq(host->host_lock); scsifront_do_request(info); wait_event_interruptible(info->shadow[ring_req->rqid].wq_reset, info->shadow[ring_req->rqid].wait_reset); in

pvSCSI backend driver Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> ----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

I''m updating the gplpv pvscsi driver to support the pvscsi driver in 3.3, and it''s not working properly. The first command windows issues is a ''report luns'' command, with a 16 byte buffer. The response that Dom0 gives me says that this was executed successfully. Windows then issues another ''report luns'' command that is also returned from Dom0

----- Jun Kamada _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

I have a number of (directed) graphs based on social groups, where the members have expresed likes and dislikes in respect to the other members. tkgraph makes it simple to draw the graphs in a very pleasing way, but I would like to differentiate between positive and negative relations in the graph by having the edges for the negative relations dashed and the positive ones continuous. Is

Dear R users, I am trying to draw a network using igraph package. I intend to place the hub nodes (the ones with the relatively more connection with other nodes) in the center of the graph. Also, the graph need to be in the fashion that the higher the correlation between two nodes is , the closer the two nodes will be. Is there any layout that can help or any other way to do this? Thanks in

...sed to programming develop their function writing skills, and secondly, can anyone suggest a way to generate an igraph object in lattice. Thanks Andrew ######generates the igraph plot library(igraph) LE<-read.csv("LE.csv") LG<-graph.data.frame(LE, directed=F) LG$layout<-layout.kamada.kawai(LG) plot(LG, vertex.size=4, vertex.label=NA, vertex.color="red", vertex.shape="square", edge.color="blue4") ###### ###### library(lattice) ###### ###### xyplot.igraph <- function(plot.igraph, ...) { dat <- graph.data.frame(x = object, directed=FALSE) p...

...be to pass an argument that restricts vertices to occupy the same coordinates given their size. A second option would be to increase the area of the plot (and multiply the distance between vertices with a constant) while keeping the size of vertices the same. I would like to keep my current layout (kamada.kawai). Any suggestions? Thanks, Math -- View this message in context: http://r.789695.n4.nabble.com/Plotting-network-without-overlapping-vertices-tp4604559.html Sent from the R help mailing list archive at Nabble.com.

...etc. - attributes can be associated with the vertices/edges of the graph, or the graph itself. The attributes can be arbitrary R objects. - graph visualization using regular R devices, interactive visualization using Tcl/Tk, 3D visualization using RGL. - graph layout generators, the standard Kamada-Kawai and Fruchterman-Reingold algorithms are included, plus many more. - Functions for graph and subgraph isomorphism, the BLISS and the VF2 algorithms are included. - Functions for maximal network flows, minimal cuts, vertex and edge connectivity. - igraph can read and write many popul...

...etc. - attributes can be associated with the vertices/edges of the graph, or the graph itself. The attributes can be arbitrary R objects. - graph visualization using regular R devices, interactive visualization using Tcl/Tk, 3D visualization using RGL. - graph layout generators, the standard Kamada-Kawai and Fruchterman-Reingold algorithms are included, plus many more. - Functions for graph and subgraph isomorphism, the BLISS and the VF2 algorithms are included. - Functions for maximal network flows, minimal cuts, vertex and edge connectivity. - igraph can read and write many popul...