jaslibrary-support Mailing List for JAS
Brought to you by:
sonnessa
Menu
▾
▴
jaslibrary-support — Technical support list
You can subscribe to this list here.
| 2003 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(2) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(2) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2004 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2005 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(2) |
Jun
|
Jul
(3) |
Aug
(1) |
Sep
|
Oct
|
Nov
|
Dec
|
|
From: Riccardo B. <bo...@ec...> - 2005-08-01 15:13:59
|
Perhaps you should address such question to the list of Jgrapht users: http://lists.sourceforge.net/lists/listinfo/jgrapht-users Anyway, if a method to retrieve the complete set of distances is not implemented (check it in the java doc or in the source code), it wouldn't be difficult to add it, becasue if the algorithm really computes all distances and then returns just the one to the target, it will keep the computed distances in a collective object. best luck Riccardo Boero Julien Thomas de Boer wrote: > Hi everyone, > I want to compute the mean distance in a Jgrapht graph. So, I have to > compute distances for each possible pairs in the graph. But computing > Dijsktra for each pairs is taking too much time. I heard that actually > Dijkstra gave you the shorthest path between the source node and the > target node but also between the source and all nodes in the graph at > the same time. is it the case in the current implementation of dijkstra > in Jgraht. If yes, how can I retrieve this list of distances. > Thanks for your help. > |
|
From: Julien T. de B. <jul...@ep...> - 2005-07-29 13:52:42
|
Hi everyone, I want to compute the mean distance in a Jgrapht graph. So, I have to compute distances for each possible pairs in the graph. But computing Dijsktra for each pairs is taking too much time. I heard that actually Dijkstra gave you the shorthest path between the source node and the target node but also between the source and all nodes in the graph at the same time. is it the case in the current implementation of dijkstra in Jgraht. If yes, how can I retrieve this list of distances. Thanks for your help. -- Sincerely, Julien THOMAS DE BOER Swiss Federal Institute of Technology of Lausanne (EPFL) |
|
From: Venkatesh P. M. <vm...@ny...> - 2005-07-27 20:13:31
|
Hello, Please see the attached .doc file. Kindly respond to Clare Coleman (cla...@me...) and not me ! Thanks ! -Venkatesh ---------------------------------------------- NYU Bioinformatics Group http://www.bioinformatics.nyu.edu/~mpvenkat/ ---------------------------------------------- |
|
From: Venkatesh P. M. <vm...@ny...> - 2005-07-06 23:11:04
|
Hi, I am trying to get performance statistics on JAS by running several examples on a linux cluster. I am turning off the graphics by commenting all addSimWindow() calls, and directly invoking The Observer class of the model from command line. Is there a more elegant way, similar to the batch modes in Swarm and Repast ? Secondly, can somebody please refer me to JAS libraries that enable code parallelization ? Thanks ! regards, Venkat ---------------------------------------------- NYU Bioinformatics Group http://www.bioinformatics.nyu.edu/~mpvenkat/ ---------------------------------------------- |
|
From: Sonnessa M. <son...@di...> - 2005-05-05 08:55:14
|
Dear Thomas,
the problem with your code is related to the deep connection
between NetworkStatComputer and the IRelationalAgent interface.
Some statistics require a node is a RelationalAgent to work.
Not only but in order to compute some statistics it is necessary
that the graph is a weighted and directed one.
So, a working version of your code can be something similar
to the following:
import jas.graph.*;
import jas.graph.statistics.*;
import org._3pq.jgrapht.graph.DirectedWeightedMultigraph;
public class TestConnectivity {
public static void main(String[] arguments) {
DirectedWeightedMultigraph g = new DirectedWeightedMultigraph();
IRelationalAgent[] agents = new IRelationalAgent[6];
agents[0] = new RelationalAgent(g);
agents[1] = new RelationalAgent(g);
agents[2] = new RelationalAgent(g);
agents[3] = new RelationalAgent(g);
agents[4] = new RelationalAgent(g);
agents[5] = new RelationalAgent(g);
agents[0].addRelation(agents[1], 1);
agents[0].addRelation(agents[2], 1);
agents[3].addRelation(agents[4], 1);
agents[1].addRelation(agents[5], 1);
agents[4].addRelation(agents[5], 1);
NetworkStatComputer stat = new NetworkStatComputer(g);
for(int i=1;i<25;i++){
try{
System.out.println(i + " : " + stat.getDoubleValue(i));
}
catch(Exception e) { System.out.println("Erreur pour "+ i +" "+ e);}
}
}
}
I hope it can be useful.
All the best,
Michele Sonnessa
Scrive Julien Thomas de Boer <jul...@ep...>:
> Hello,
> I ve got a problem with the function NetworkStatComputer.getDoubleValue.
> For some value_id, the error "java.lang.ClassCastException:
> java.lang.String" is returned. Actually, except for 1,14,16,18,19, i ve
> got this problem. Here is the code i typed ( i tested with some other
> graphs and i had still the same error) :
>
> public class test_connectivity {
> public static void main(String[] arguments) {
> ListenableDirectedGraph g = new ListenableDirectedGraph();
> g.addVertex("A");
> g.addVertex("B");
> g.addVertex("C");
> g.addVertex("D");
> g.addVertex("E");
> g.addVertex("F");
> g.addVertex("G");
> g.addEdge("A", "B");
> g.addEdge("A", "C");
> g.addEdge("D", "E");
> g.addEdge("B", "F");
> g.addEdge("F", "G");
> NetworkStatComputer stat = new NetworkStatComputer(g);
> for(int i=1;i<25;i++){
> try{
> System.out.println(i+":"+stat.getDoubleValue(i));
> }
> catch(Exception e) { System.out.println("Erreur pour"+i+" "+e);}
> }
> }
> }
>
> Thanks for your help.
>
>
|
|
From: Julien T. de B. <jul...@ep...> - 2005-05-04 14:42:32
|
Hello,
I ve got a problem with the function NetworkStatComputer.getDoubleValue.
For some value_id, the error "java.lang.ClassCastException:
java.lang.String" is returned. Actually, except for 1,14,16,18,19, i ve
got this problem. Here is the code i typed ( i tested with some other
graphs and i had still the same error) :
public class test_connectivity {
public static void main(String[] arguments) {
ListenableDirectedGraph g = new ListenableDirectedGraph();
g.addVertex("A");
g.addVertex("B");
g.addVertex("C");
g.addVertex("D");
g.addVertex("E");
g.addVertex("F");
g.addVertex("G");
g.addEdge("A", "B");
g.addEdge("A", "C");
g.addEdge("D", "E");
g.addEdge("B", "F");
g.addEdge("F", "G");
NetworkStatComputer stat = new NetworkStatComputer(g);
for(int i=1;i<25;i++){
try{
System.out.println(i+":"+stat.getDoubleValue(i));
}
catch(Exception e) { System.out.println("Erreur pour"+i+" "+e);}
}
}
}
Thanks for your help.
|
|
From: <ben...@id...> - 2004-05-22 12:26:39
|
Dear Open Source developer I am doing a research project on "Fun and Software Development" in which I kindly invite you to participate. You will find the online survey under http://fasd.ethz.ch/qsf/. The questionnaire consists of 53 questions and you will need about 15 minutes to complete it. With the FASD project (Fun and Software Development) we want to define the motivational significance of fun when software developers decide to engage in Open Source projects. What is special about our research project is that a similar survey is planned with software developers in commercial firms. This procedure allows the immediate comparison between the involved individuals and the conditions of production of these two development models. Thus we hope to obtain substantial new insights to the phenomenon of Open Source Development. With many thanks for your participation, Benno Luthiger PS: The results of the survey will be published under http://www.isu.unizh.ch/fuehrung/blprojects/FASD/. We have set up the mailing list fa...@we... for this study. Please see http://fasd.ethz.ch/qsf/mailinglist_en.html for registration to this mailing list. _______________________________________________________________________ Benno Luthiger Swiss Federal Institute of Technology Zurich 8092 Zurich Mail: benno.luthiger(at)id.ethz.ch _______________________________________________________________________ |
|
From: Michele S. <son...@di...> - 2003-12-17 13:37:35
|
The jas.space.MultiObjGrid contains an array of object for each cell.
It is a problem for the LayerObjGridDrawer constructor, which looks for=20
IColored objects in each cell.
The jas.plot package contains a special drawer for the MultiObjGrid=20
objects: the jas.plot.LayerMultiObjectGridDrawer.
In order to plot IColored agents - using the MultiObjGrid - you have to use=
=20
the LayerMultiObjectGridDrawer.
An instruction like the following (in the observer code) should fix the=20
problem.
LayerMultiObjectGridDrawer s =3D new=20
LayerMultiObjectGridDrawer("Bugs", (MultiObjGrid) model.world);
Cheers,
Michele
At 13.46 17/12/2003, you wrote:
>Hi,
>
>I've got a collection of agents in a MultiObjGrid, and each of them=20
>implements the IColored interface, as they provide their own colour. I get=
=20
>this warning:
>
>java.lang.IllegalArgumentException: The matrix passed to=20
>LayerObjGridDrawer must contain IColored objects if no color is passed to=
=20
>the constructor.
>
>If I give LayerObjGridDrawer a default colour in the constructor, it uses=
=20
>the default colour and does not recognise the agents in the grid=20
>implementing IColored.
>
>This doesn't seem to be a problem related to version 1.0beta, it happens=20
>with 0.2 as well.
>
>Any suggestions?
>
>Thanks,
>Nils
>--
>--------------------------------------------------------
>Nils Weidmann
>
>Wissenschaftliches Zentrum f=FCr Umweltsystemforschung
>Universit=E4t Kassel, Kurt-Wolters-Stra=DFe 3, 34109 Kassel
>Tel: +49 (0)561 - 804 3905, Fax: +49 (0)561 - 804 3176
>wei...@us...
>http://www.usf.uni-kassel.de
>
>
>
>-------------------------------------------------------
>This SF.net email is sponsored by: IBM Linux Tutorials.
>Become an expert in LINUX or just sharpen your skills. Sign up for IBM's
>Free Linux Tutorials. Learn everything from the bash shell to sys admin.
>Click now! http://ads.osdn.com/?ad_id78&alloc_id371&op=CCk
>_______________________________________________
>Jaslibrary-support mailing list
>Jas...@li...
>https://lists.sourceforge.net/lists/listinfo/jaslibrary-support
>
|
|
From: Nils W. <wei...@us...> - 2003-12-17 12:46:38
|
Hi, I've got a collection of agents in a MultiObjGrid, and each of them=20 implements the IColored interface, as they provide their own colour. I=20 get this warning: java.lang.IllegalArgumentException: The matrix passed to=20 LayerObjGridDrawer must contain IColored objects if no color is passed=20 to the constructor. If I give LayerObjGridDrawer a default colour in the constructor, it=20 uses the default colour and does not recognise the agents in the grid=20 implementing IColored. This doesn't seem to be a problem related to version 1.0beta, it happens=20 with 0.2 as well. Any suggestions? Thanks, Nils --=20 -------------------------------------------------------- Nils Weidmann Wissenschaftliches Zentrum f=FCr Umweltsystemforschung Universit=E4t Kassel, Kurt-Wolters-Stra=DFe 3, 34109 Kassel Tel: +49 (0)561 - 804 3905, Fax: +49 (0)561 - 804 3176 wei...@us... http://www.usf.uni-kassel.de |
|
From: <ge...@te...> - 2003-05-06 21:32:39
|
Have you thought about a graph library to include in JAS? If so, which one do you think you'll use? -- glen e. p. ropella =><= Hail Eris! H: 503.630.4505 http://www.ropella.net/~gepr M: 971.219.3846 http://www.tempusdictum.com |
|
From: glen e. p. r. <ge...@te...> - 2003-05-02 14:26:15
|
Hello! I'm finally getting around to checking out JAS. How does one build the package? I see the JBuilder project file (and I have JBuilder 3 at home - so I will be able to try that when I get home). But, I also saw the build.xml file. Is that an Ant file by chance? Are there other ways to build it? Should I just pile all the .java files into a big javac command? Thanks. -- -- glen e. p. ropella Peace Hail Eris! Home: 503.630.4505 =><= Cell: 971.219.3846 |
