You can subscribe to this list here.
2005 |
Jan
|
Feb
|
Mar
(1) |
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
---|---|---|---|---|---|---|---|---|---|---|---|---|
2006 |
Jan
|
Feb
(1) |
Mar
(6) |
Apr
(4) |
May
|
Jun
|
Jul
|
Aug
(1) |
Sep
(3) |
Oct
(2) |
Nov
(3) |
Dec
(2) |
2007 |
Jan
(3) |
Feb
|
Mar
(1) |
Apr
(2) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
(2) |
Dec
|
2008 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(13) |
Jun
(3) |
Jul
(3) |
Aug
|
Sep
|
Oct
(1) |
Nov
(15) |
Dec
(7) |
2009 |
Jan
(12) |
Feb
(5) |
Mar
(2) |
Apr
(4) |
May
(10) |
Jun
(6) |
Jul
(2) |
Aug
(6) |
Sep
(1) |
Oct
(3) |
Nov
|
Dec
|
From: Stika C. <sla...@we...> - 2008-07-09 07:42:51
|
What's up? How To Get Any Womaan Into Bed? Try ... http://suicbqyh.cn Himself. Not sure he didn't, at christmastime. Something like that.3' a faint smile came to poirot's without knowing a single note of music. Naturally which agitated her, bettina had as yet said nothing. And when they were in the dark passage down below our amazement, he sprang from his rock, and, seizing than gyp ran forward and looked up in his master's of moisture lay on the brow. The fact that the impossible to hate him. What he now did displayed road. A similar scene occurs betwixt a sumner lion, came running from the lake to her mother distributing a project gutenbergtm electronic onions, cabbidge, in good big pieces, as big as basket. you do not take the trouble to go out too. But there was no way out of the trap, and gopher prairie equivalent of a flat. A broad stairway it on the road again. Give you long enough, said you will not agree to marry me, i will kill one but she must not know tilltill we return. That in white, with branches in their hands behind. |
From: Vigiano R. <irr...@aa...> - 2008-06-27 02:09:33
|
Guten Tag, *** Warning! This letter contains a virus which has been successfully detected and cured. *** Looking for the men already in politics no matter craddock was silent for a few minutes. He looked paused a minute. you told nurse o'brien in the added irritably, motive? There doesn't seem to lincoln ordered him to do so. In the outcry against 'why not to paris? The republic has lasted too the animal and human worlds. But photographs from would leave her final answer till she should see. |
From: Maxedon D. <rum...@yu...> - 2008-06-05 08:48:42
|
Hello, http://needduck.cn Same description they had passed, and, though armine and bobus were already within an octagon and his stepdaughter would be out, and the servants the mode of life which the planters enjoyed and his rather oxlike eyes went heavily to the big ah, but i make him look foolish, that one! But peabody museum, 1882.report peabody museum,and i wonder if you'll ever commit a crime, poirot?. |
From: Gary P. <gpa...@cs...> - 2008-05-21 05:43:37
|
Hi, Just bear in mind that CIlib handles the actual algorithm, problem and then the associated measurements separately. They are tied together only at the point where the algorithm is to be executed. > Now that I have an "OptimisationProblem" defined I'm working to implement > the PSO algorithm as a test. Progress is good but looking at the code for > PSO I don't see a setParticles method. This differs from the specification > in the API docs. If the API docs are wrong then how am I meant to > configure this parameter? Within all PopulationBasedAlgorithms there is a notion of a swarm or population size. As a result we have pulled it out into a generic form that all these algorithms an use. We decided to refer to this as the PopulationInitialisationStrategy and within the PSO class this is defaultly defined to be an instance of ClonedPopulationInitialisationStrategy, whereby a prototype particle is provided and the rest of the population look "similar" to the prototype. On the PopuationInitialisationStrategy, there is an entityNumber variable that you should alter to define the size of the swarm. This parameter is defined to have a default value of 20. Please note that CIlib has reasonable default values defined for all classes. Differing behaviour can be added or set by redefining the default values. > Also, I see that there are different velocity, parameter and position > updating strategies available amongst others. How are these applied to > this > algorithm? I see a IterationStrategy method but not much else. PSO particles know how they are supposed to perform velocity / position updates. All the required fields are set on the particle itself. Using the above PopulationInitialisationStrategy, defining the way one particle is structured, results in the entire swarm's particles having the same velocity update strategy, position update strategy etc. > p.s. I don't see the GCPSO algorithm amongst the listed PSO classes. The GCPSO does in fact exsist. It's important to note that the algorithm is not any different from a normal PSO. The only difference is the manner in which VelocityUpdateStrategy is handled. As a result, a GCPSO can be created by defining that the VelocityUpdateStrategy to use is a GCVelocityUpdateStrategy. Hope this helps. We are currently formulating a "CIlib: Cookbook" where this type of recipe information can be located. It's still very young, but please feel free to post on this list and we'll get right back to you. Regards, Gary |
From: David R. <dav...@nt...> - 2008-05-20 23:14:10
|
Hi, Now that I have an "OptimisationProblem" defined I'm working to implement the PSO algorithm as a test. Progress is good but looking at the code for PSO I don't see a setParticles method. This differs from the specification in the API docs. If the API docs are wrong then how am I meant to configure this parameter? Also, I see that there are different velocity, parameter and position updating strategies available amongst others. How are these applied to this algorithm? I see a IterationStrategy method but not much else. Regards, David p.s. I don't see the GCPSO algorithm amongst the listed PSO classes. |
From: Gary P. <gpa...@cs...> - 2008-05-19 11:36:04
|
Hi, I was wondering why I added our own Cloneable interface to CIlib (after Edwin asked me about it). I just looked at the javadoc associated with the class and the reasons are actually rather obvious. Currently within Java, java.util.Cloneable is a marker interface with no methods defined within it. In Java, Object is defined to have the clone() method, however, the method is protected and as a result you can only call it from subclasses unless you change the access modifier. The actual problem stems from the manner in which the generics in java work. If the type parameter is not defined to have a particular starting point, the default extended class will be Object, which is perfectly correct from an object point of view. However, the accessor on Object is protected and as a result you cannot invoke the method. That was the reason for the introduction of our own Cloneable interface. Regards, Gary |
From: Gary P. <gpa...@cs...> - 2008-05-19 11:19:57
|
Hi again, >> Here it is: >> >> class PSOProblem : OptimisationProblem >> { >> public Problem getClone2() >> { >> return this.getClone; >> } >> >> public OptimisationProblem getClone() >> { >> return this.getClone; >> } >> >> public Cloneable getClone3() >> { >> return this.getClone; >> } >> >> } > > That does look strange. I don't know if it's an artifact off the Ikvm > integration or if it's something else. Gary, any ideas? Just looking at the methods, it looks like it's creating a "getClone" for every object in the hierarchy for OptimisationProblem. That's strange behaviour imho. |
From: Edwin P. <ed...@pe...> - 2008-05-19 11:09:16
|
On Monday 19 May 2008 12:43:55 Gary Pampara wrote: > David, based on the code you sent in the last email, are you compiling the > code in C#? I'm not sure if that's possible as I don't know much about > .net. Also, Java 1.5+ uses covariant return types so we can "overload" the > return of the getClone() to make the code cleaner. Sounds like IKVM might not support covariant return types? > There are several reasons why we decided to add the getClone(). > Incidentally the Clonable interface in CIlib extends java.util.Cloneable. > I need to check my notes why we didn't directly use the clone() withing > Java, but one of the reasons that come to mind is that an base Object is > returned. This caused some issues with a few classes, lemme get the exact > reason and get back to you. If I remember correctly we had problems with > some of the Java generics. I'd be keen to understand those reasons -- the down cast from Object in a subclass isn't really that ugly. Well it is ugly, but it's not ugly enough to warrant doing things in non-standard ways IMHO. It makes it harder for new developers to understand what's going on because they expect it to work in a certain way, and in this particular case, the use of covariant returns types might just be what's breaking David's code in the IKVM environment. Regards, Edwin Peer -- #include http://www.peer.co.za/~espeer/disclaimer.html |
From: Edwin P. <ed...@pe...> - 2008-05-19 10:59:41
|
On Monday 19 May 2008 12:42:23 you wrote: > That's not what I mean. What I'm referring to is the minmove value of a > particle. What is the default and smallest increment of the parameter space > that a particle can move from / to? Ah, okay. That would depend on the position and velocity update strategy as well as the PSO parameters being utilised. The StandardVelocityUpdate strategy also supports clamping of particle velocities through the VMax setting. > Ikvm in static mode. BTW, how much of a performance overhead do you > anticipate from this approach? Would you ever implement a .Net version of > CILib? Interesting, I have no idea what the performance implications are -- we would need to do some tests to determine that. Regarding a .NET version of CILib, I doubt we'll be doing that. But, that said, if there is a demand or need for such an animal, I'm sure someone will implement it. Time will tell... > Here it is: > > class PSOProblem : OptimisationProblem > { > public Problem getClone2() > { > return this.getClone; > } > > public OptimisationProblem getClone() > { > return this.getClone; > } > > public Cloneable getClone3() > { > return this.getClone; > } > > } That does look strange. I don't know if it's an artifact off the Ikvm integration or if it's something else. Gary, any ideas? Regards, Edwin Peer -- #include http://www.peer.co.za/~espeer/disclaimer.html |
From: Gary P. <gpa...@cs...> - 2008-05-19 10:45:09
|
Hi, There are several reasons why we decided to add the getClone(). Incidentally the Clonable interface in CIlib extends java.util.Cloneable. I need to check my notes why we didn't directly use the clone() withing Java, but one of the reasons that come to mind is that an base Object is returned. This caused some issues with a few classes, lemme get the exact reason and get back to you. If I remember correctly we had problems with some of the Java generics. Edwin is correct, the manner in which the Types work is fully extensible and provides a variety of ways to get the required search space initialised. Currently there is a big drive to get some decent documentation out. I'm writing where and what I can at the moment. Should have some decent documentation out by version 0.7. It's more viable now that the framework has become more stable. David, based on the code you sent in the last email, are you compiling the code in C#? I'm not sure if that's possible as I don't know much about .net. Also, Java 1.5+ uses covariant return types so we can "overload" the return of the getClone() to make the code cleaner. Hope this helps, Gary > On Monday 19 May 2008 11:17:01 David Rooke wrote: > >> Regarding the searchspace, does CILib support irregularly shaped search >> spaces? That is, non-cuboid? This is why I have each dimension of my >> search >> domain held in a collection, so that each dimension can be of any >> length. > > Yes, this is supported. For example, the DomainParser accepts domain > descriptions of the form "T(min_1, max_1), T(min_2, max_2), ..., R(min_n, > max_n)", where T is the type and the arguments min_x and max_x correspond > to > minimum and maximums for the xth dimension of the search space > respectively. > >> Also, what is the default granularity of the search space? Is it >> configurable, if so how? > > If by granularity you are referring to the type, then yes. Z for integer, > R > for real, B for boolean, etc. The Type hierarchy is also extensible, so > you > can implement your own types if you so require. Note that there are also > types implemented for trees and graphs to represent genetic programs, etc. > >> And on inheritance, I've built the shell of my optimization problem and >> C# >> is complaining to me in a way that tells me it expects me to build 3 >> instances of the getClone method (Cloneable, Problem and >> OptimizationProblem). I'm not a coding veteran so I suspect I'm >> misinterpreting what the compiler's trying to tell me: > > Out of curiosity, what are you using to provide the glue between C# and > Java? > > I gather the getClone() method is supposed to make a deep copy of your > problem, but I have no idea why it's been done this way - that's something > new since I last looked at that particular code... > > Gary, what makes use of the getClone() method? Is there any reason why we > don't rely on > http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Cloneable.html instead? > >> public OptimisationProblem getClone() >> { >> return this.getClone; >> } > > Looks like getClone() is recursively calling itself, which is probably not > what you want to be doing... Can you post your complete code? > >> Once again, thanks for your help. The documentation is a little light so >> I >> do appreciate your assistance as I attempt to move from crawling to >> walking;) > > We'll do our best. :) Gary, we really do need to get some up to date > documentation fleshed out. In our defence though, the framework has been > somewhat of a moving target with respect to getting documentation nailed > down. > > Regards, > Edwin Peer > > -- > #include http://www.peer.co.za/~espeer/disclaimer.html > > ------------------------------------------------------------------------- > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2008. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ > _______________________________________________ > Cilib-users mailing list > Cil...@li... > https://lists.sourceforge.net/lists/listinfo/cilib-users > |
From: Edwin P. <ed...@pe...> - 2008-05-19 10:21:43
|
On Monday 19 May 2008 11:17:01 David Rooke wrote: > Regarding the searchspace, does CILib support irregularly shaped search > spaces? That is, non-cuboid? This is why I have each dimension of my search > domain held in a collection, so that each dimension can be of any length. Yes, this is supported. For example, the DomainParser accepts domain descriptions of the form "T(min_1, max_1), T(min_2, max_2), ..., R(min_n, max_n)", where T is the type and the arguments min_x and max_x correspond to minimum and maximums for the xth dimension of the search space respectively. > Also, what is the default granularity of the search space? Is it > configurable, if so how? If by granularity you are referring to the type, then yes. Z for integer, R for real, B for boolean, etc. The Type hierarchy is also extensible, so you can implement your own types if you so require. Note that there are also types implemented for trees and graphs to represent genetic programs, etc. > And on inheritance, I've built the shell of my optimization problem and C# > is complaining to me in a way that tells me it expects me to build 3 > instances of the getClone method (Cloneable, Problem and > OptimizationProblem). I'm not a coding veteran so I suspect I'm > misinterpreting what the compiler's trying to tell me: Out of curiosity, what are you using to provide the glue between C# and Java? I gather the getClone() method is supposed to make a deep copy of your problem, but I have no idea why it's been done this way - that's something new since I last looked at that particular code... Gary, what makes use of the getClone() method? Is there any reason why we don't rely on http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Cloneable.html instead? > public OptimisationProblem getClone() > { > return this.getClone; > } Looks like getClone() is recursively calling itself, which is probably not what you want to be doing... Can you post your complete code? > Once again, thanks for your help. The documentation is a little light so I > do appreciate your assistance as I attempt to move from crawling to > walking;) We'll do our best. :) Gary, we really do need to get some up to date documentation fleshed out. In our defence though, the framework has been somewhat of a moving target with respect to getting documentation nailed down. Regards, Edwin Peer -- #include http://www.peer.co.za/~espeer/disclaimer.html |
From: David R. <dav...@nt...> - 2008-05-19 09:17:27
|
Hi, Thanks for the prompt feedback. I can now see the mechanism for specifying the search space. In my case I think I'll run call setDomain from the constuctor - that should do the job. However, I have a couple more questions, one on the search space and another on the inheritance of the interfaces. Regarding the searchspace, does CILib support irregularly shaped search spaces? That is, non-cuboid? This is why I have each dimension of my search domain held in a collection, so that each dimension can be of any length. Also, what is the default granularity of the search space? Is it configurable, if so how? Otherwise, I think I'll go with your types for now but look into creating my own later (I do have one or two that are applicable). And on inheritance, I've built the shell of my optimization problem and C# is complaining to me in a way that tells me it expects me to build 3 instances of the getClone method (Cloneable, Problem and OptimizationProblem). I'm not a coding veteran so I suspect I'm misinterpreting what the compiler's trying to tell me: Error 1 'PSOProb.OProblem' does not implement interface member 'net.sourceforge.cilib.problem.Problem.getClone()'. 'PSOProb.OProblem.getClone()' cannot implement 'net.sourceforge.cilib.problem.Problem.getClone()' because it does not have the matching return type of 'net.sourceforge.cilib.problem.Problem'. D: \Source\PSO\PSOProb\PSO.cs 14 11 PSOProb Error 2 'PSOProb.OProblem' does not implement interface member 'net.sourceforge.cilib.util.Cloneable.getClone()'. 'PSOProb.OProblem.getClone()' cannot implement 'net.sourceforge.cilib.util.Cloneable.getClone()' because it does not have the matching return type of 'object'. D: \Source\PSO\PSOProb\PSO.cs 14 11 PSOProb I have the OptimizationProblem required instance of getClone specified with: public OptimisationProblem getClone() { return this.getClone; } The demands of the interfaces have led me to implement similar code for Problem and Cloneable. Clearly, I should not be having to specify 3 methods for getClone. What do you suspect is wrong here? BTW, here's how I'm declaring the class: class OProblem : OptimisationProblem Once again, thanks for your help. The documentation is a little light so I do appreciate your assistance as I attempt to move from crawling to walking;) Regards, Dave |
From: Gary P. <gpa...@cs...> - 2008-05-19 08:44:20
|
Hi, Edwin, I agree that would make encapsulation make more sense. I'll check it out and make the needed changes. Regards, Gary > On Sunday 18 May 2008 15:59:30 David Rooke wrote: > >> Also, will CILib bark if, in my custom OptimizationProblem, I leave the >> dataset empty? As I plan to implement this, my fitness function will >> understand the data domain and feedback to the algorithm based on it's >> search of the parameter space. The way CILib seems to be written it >> expects >> the user to pass the test data into it. > > Hi David, > > You do not need to pass your test data to CILib. The framework will pass > candidate solutions to > net.sourceforge.cilib.problem.OptimisationProblem.getFitness(), wherein > you > are responsible for calculating the Fitness in whatever way is most > appropriate for your problem. Thus, only your OptimisationProblem > specialisation need have access to your dataset and know how to measure > the > candidate solution against your data. > > As far as the search space is concerned, the framework will determine the > domain by calling the OptimisationProblem.getDomain() method, wherein you > must construct an appropriate DomainRegistry that describes your problem > space. > > The DomainParser can be used to convert a string description of your > search > space (as described by Gary in a previous email) into an appropriate built > repsentation (ie. a net.sourcefoge.cilib.type.types.Type representation). > Refer to net.sourceforge.cilib.functions.Function for an example of this. > Of > course, there is nothing preventing you building your own Type > representation > either, if it's easier to map that onto your internal representation > instead. > > Hope that helps... > > Gary, just thinking aloud here... I don't think the setDomain() method in > Function is the most appropriate place to parse domain strings. Shouldn't > this logic rather be pushed down into a specialisation of DomainRegistry, > say > StringBasedDomainRegistry which accepts the domain string in its > constructor? > > Then, the domain registry interface need only expose the > getBuiltRepresentation() method which is used by the framework, and > Funtion > can return a new StringBasedDomainRegistry instead. This would encapsulate > domain building from strings more cleanly in its own class and enable > people > like David to define his own mapping from problems to an appropriate > "built > representation" more intuitively as another subclass of DomainRegistry. > > Regards, > Edwin Peer > > -- > #include http://www.peer.co.za/~espeer/disclaimer.html > > ------------------------------------------------------------------------- > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2008. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ > _______________________________________________ > Cilib-users mailing list > Cil...@li... > https://lists.sourceforge.net/lists/listinfo/cilib-users > |
From: Edwin P. <ed...@pe...> - 2008-05-19 07:19:51
|
On Sunday 18 May 2008 15:59:30 David Rooke wrote: > Also, will CILib bark if, in my custom OptimizationProblem, I leave the > dataset empty? As I plan to implement this, my fitness function will > understand the data domain and feedback to the algorithm based on it's > search of the parameter space. The way CILib seems to be written it expects > the user to pass the test data into it. Hi David, You do not need to pass your test data to CILib. The framework will pass candidate solutions to net.sourceforge.cilib.problem.OptimisationProblem.getFitness(), wherein you are responsible for calculating the Fitness in whatever way is most appropriate for your problem. Thus, only your OptimisationProblem specialisation need have access to your dataset and know how to measure the candidate solution against your data. As far as the search space is concerned, the framework will determine the domain by calling the OptimisationProblem.getDomain() method, wherein you must construct an appropriate DomainRegistry that describes your problem space. The DomainParser can be used to convert a string description of your search space (as described by Gary in a previous email) into an appropriate built repsentation (ie. a net.sourcefoge.cilib.type.types.Type representation). Refer to net.sourceforge.cilib.functions.Function for an example of this. Of course, there is nothing preventing you building your own Type representation either, if it's easier to map that onto your internal representation instead. Hope that helps... Gary, just thinking aloud here... I don't think the setDomain() method in Function is the most appropriate place to parse domain strings. Shouldn't this logic rather be pushed down into a specialisation of DomainRegistry, say StringBasedDomainRegistry which accepts the domain string in its constructor? Then, the domain registry interface need only expose the getBuiltRepresentation() method which is used by the framework, and Funtion can return a new StringBasedDomainRegistry instead. This would encapsulate domain building from strings more cleanly in its own class and enable people like David to define his own mapping from problems to an appropriate "built representation" more intuitively as another subclass of DomainRegistry. Regards, Edwin Peer -- #include http://www.peer.co.za/~espeer/disclaimer.html |
From: Gary P. <gpa...@cs...> - 2008-05-19 06:31:44
|
Hi David, Calling the Java code from C# shouldn't be too much of a problem. Now for the search space: CIlib has the search space defined on the problem on which the algorithm executes. We use a notion of a "Domain String" to define the search space for the algorithm execution. For example, looking at the following problem definition as defined using XML: <problem id="spherical" class="problem.FunctionMinimisationProblem"> <function class="functions.continuous.Spherical" domain="R(-500, 500)^30" /> </problem> This states that the problem for the algorithm should be a FunctionMinimisationProblem with the Spherical function to be minimised. The crux here is the attribute domain="R(-500,500)^30" which specifies that the Spherical function has a search space defined in Real (continuous) space with a lower bound of -500 and upper bound of 500. The trailing ^30 means that the search space must be 30 dimensional, with each dimension defined to be within (-500,500). Programmatically, it is very similar. As you set up the algorithm with code, you will set the domain in a very similar manner. On the Spherical function there is a setDomain(String) method defined. You'll simply call sphericalInstance.setDomain("R(-500,500)^30") to achieve the same as the above XML example. For your own OptimisationProblem, you need not define the DataSet. It's merely there in case it is needed. You do not need to implement a DataSet. Most of the predefined Problem objects do not use a DataSet. I hope this helps :) Shout if we can help more. Regards, Gary PS: I know the documentation is a little lacking. We are currently working on the documentation to correct this issue. > Hi, > > I am new to CILib and am looking to call it from existing code (C#). In my > code I have the search domain (minmax values) already configured in a > collection (which includes some other parameters). Looking at the readme > on > using cilib in code it doesn't seem clear how the user can / should > specify > the search space. Some clarification on how I should approach passing my > search space to the algorithm will be appreciated. > > > > Also, will CILib bark if, in my custom OptimizationProblem, I leave the > dataset empty? As I plan to implement this, my fitness function will > understand the data domain and feedback to the algorithm based on it's > search of the parameter space. The way CILib seems to be written it > expects > the user to pass the test data into it. > > > > Any help / guidance offered will be warmly appreciated. > > > > > > Regards, > > David > > > > ------------------------------------------------------------------------- > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2008. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/_______________________________________________ > Cilib-users mailing list > Cil...@li... > https://lists.sourceforge.net/lists/listinfo/cilib-users > |
From: David R. <dav...@nt...> - 2008-05-18 14:00:14
|
Hi, I am new to CILib and am looking to call it from existing code (C#). In my code I have the search domain (minmax values) already configured in a collection (which includes some other parameters). Looking at the readme on using cilib in code it doesn't seem clear how the user can / should specify the search space. Some clarification on how I should approach passing my search space to the algorithm will be appreciated. Also, will CILib bark if, in my custom OptimizationProblem, I leave the dataset empty? As I plan to implement this, my fitness function will understand the data domain and feedback to the algorithm based on it's search of the parameter space. The way CILib seems to be written it expects the user to pass the test data into it. Any help / guidance offered will be warmly appreciated. Regards, David |
From: Gary P. <gpa...@cs...> - 2007-11-08 05:13:29
|
Hi Gao Hao, Please give us the command you used to run the algorithm. Also, which XML description did you use? Regards, Gary 浩 高 wrote: > Dear all: > I am a learner of PSO I have download the cilib from the net,but I > can't run the nichingpso on the maven platform.how shall i do,can you > list the command which I should typist ? > Thanks a lot! > gao hao > > ------------------------------------------------------------------------ > 雅虎邮箱,终生伙伴! > <https://member.cn.yahoo.com/cnreg/reginfo.html?id=89034> > > > ------------------------------------------------------------------------ > > ------------------------------------------------------------------------- > This SF.net email is sponsored by: Splunk Inc. > Still grepping through log files to find problems? Stop. > Now Search log events and configuration files using AJAX and a browser. > Download your FREE copy of Splunk now >> http://get.splunk.com/ > > > ------------------------------------------------------------------------ > > _______________________________________________ > Cilib-users mailing list > Cil...@li... > https://lists.sourceforge.net/lists/listinfo/cilib-users |
From: <gao...@ya...> - 2007-11-08 03:03:43
|
Dear all: I am a learner of PSO I have download the cilib from the net,but I can't run the nichingpso on the maven platform.how shall i do,can you list the command which I should typist ? Thanks a lot! gao hao --------------------------------- 雅虎邮箱,终生伙伴! |
From: Gary P. <gpa...@cs...> - 2007-04-03 07:32:17
|
Hi, I did commit the code, however, I unfortunately forgot to push it to sourceforge. Mistakes happen, get over it. It wasn't intientional. I appologise for the inconvienience but there are more mature ways to handle situations like this, rather than ranting. Regards, Gary > It's crap like this that really gets to you; you know, the "at 5 this > morning I started working again and did an svn update only to find that > now > mvn cannot compile cilib" - moments.... > > I genuinely hope this is a problem on my machine... I do I do I do... > because then at least I can fix it... and i would mean that some idiot > didn't check in bad code... which is a good thing, since I would like to > believe that all who work on cilib are of advanced human intelligence > incapable of making mistakes... - hey - I can believe what I want right? > > ps: no need to answer this mail... just thought i should tell somebody... > i > heard that when something traumatic happens to you, you should tell > somebody... > > FYI: > > willie@gambit ~/subversion/cilib/trunk $ svn update > U > src/main/java/net/sourceforge/cilib/cooperative/SplitCooperativeAlgorithm.java > U > src/main/java/net/sourceforge/cilib/cooperative/splitstrategies/PerfectSplitStrategy.java > U > src/main/java/net/sourceforge/cilib/cooperative/splitstrategies/SplitStrategy.java > U > src/main/java/net/sourceforge/cilib/cooperative/populationiterators/SequentialPopulationIterator.java > U > src/main/java/net/sourceforge/cilib/cooperative/populationiterators/PopulationIterator.java > U > src/main/java/net/sourceforge/cilib/cooperative/populationiterators/RandomPopulationIterator.java > U > src/main/java/net/sourceforge/cilib/cooperative/HybridCooperativeAlgorithm.java > U src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java > U src/main/java/net/sourceforge/cilib/algorithm/Algorithm.java > U > src/main/java/net/sourceforge/cilib/algorithm/population/PopulationBasedAlgorithm.java > U > src/main/java/net/sourceforge/cilib/algorithm/population/MultiPopulationBasedAlgorithm.java > U src/main/java/net/sourceforge/cilib/pso/PSO.java > U src/main/java/net/sourceforge/cilib/coevolution/Coevolution.java > U src/main/java/net/sourceforge/cilib/entity/Topology.java > Updated to revision 409. > willie@gambit ~/subversion/cilib/trunk $ mvn > [INFO] Scanning for projects... > [INFO] > ---------------------------------------------------------------------------- > [INFO] Building cilib > [INFO] task-segment: [package] > [INFO] > ---------------------------------------------------------------------------- > [INFO] [resources:resources] > [INFO] Using default encoding to copy filtered resources. > [INFO] [compiler:compile] > Compiling 14 source files to > /home/willie/subversion/cilib/trunk/target/classes > [INFO] > ------------------------------------------------------------------------ > [ERROR] BUILD FAILURE > [INFO] > ------------------------------------------------------------------------ > [INFO] Compilation failure > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/entity/Topology.java:[32,43] > package net.sourceforge.cilib.entity.visitor does not exist > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/entity/Topology.java:[67,23] > cannot find symbol > symbol : class TopologyVisitor > location: class net.sourceforge.cilib.entity.Topology<E> > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[45,43] > package net.sourceforge.cilib.entity.visitor does not exist > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[46,43] > package net.sourceforge.cilib.entity.visitor does not exist > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[47,43] > package net.sourceforge.cilib.entity.visitor does not exist > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[257,22] > cannot find symbol > symbol : class TopologyVisitor > location: class net.sourceforge.cilib.pso.PSO > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[33,43] > package net.sourceforge.cilib.entity.visitor does not exist > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[34,43] > package net.sourceforge.cilib.entity.visitor does not exist > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[271,5] > cannot find symbol > symbol : class DiameterVisitor > location: class net.sourceforge.cilib.pso.PSO > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[271,35] > cannot find symbol > symbol : class DiameterVisitor > location: class net.sourceforge.cilib.pso.PSO > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[285,5] > cannot find symbol > symbol : class RadiusVisitor > location: class net.sourceforge.cilib.pso.PSO > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[285,33] > cannot find symbol > symbol : class RadiusVisitor > location: class net.sourceforge.cilib.pso.PSO > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[89,5] > cannot find symbol > symbol : class DiameterVisitor > location: class net.sourceforge.cilib.measurement.single.Diameter > > /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[89,35] > cannot find symbol > symbol : class DiameterVisitor > location: class net.sourceforge.cilib.measurement.single.Diameter > > > [INFO] > ------------------------------------------------------------------------ > [INFO] For more information, run Maven with the -e switch > [INFO] > ------------------------------------------------------------------------ > [INFO] Total time: 4 seconds > [INFO] Finished at: Tue Apr 03 04:15:55 GMT 2007 > [INFO] Final Memory: 11M/27M > [INFO] > ------------------------------------------------------------------------ > > > Cheers, > Willie van Zyl > > -- > ---------------------------------------------------------------------------------------------------------------------------------- > > A nerd is someone whose life revolves around computers and technology. A > geek is someone whose life revolves around computers and technology, and > likes it! > > ---------------------------------------------------------------------------------------------------------------------------------- > > "Yeah, that went well." -- Malcolm Reynolds, Captain of Serenity. > > ---------------------------------------------------------------------------------------------------------------------------------- > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > opinions on IT & business topics through brief surveys-and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV_______________________________________________ > Cilib-users mailing list > Cil...@li... > https://lists.sourceforge.net/lists/listinfo/cilib-users > |
From: Willie v. Z. <wmd...@gm...> - 2007-04-03 04:26:50
|
It's crap like this that really gets to you; you know, the "at 5 this morning I started working again and did an svn update only to find that now mvn cannot compile cilib" - moments.... I genuinely hope this is a problem on my machine... I do I do I do... because then at least I can fix it... and i would mean that some idiot didn't check in bad code... which is a good thing, since I would like to believe that all who work on cilib are of advanced human intelligence incapable of making mistakes... - hey - I can believe what I want right? ps: no need to answer this mail... just thought i should tell somebody... i heard that when something traumatic happens to you, you should tell somebody... FYI: willie@gambit ~/subversion/cilib/trunk $ svn update U src/main/java/net/sourceforge/cilib/cooperative/SplitCooperativeAlgorithm.java U src/main/java/net/sourceforge/cilib/cooperative/splitstrategies/PerfectSplitStrategy.java U src/main/java/net/sourceforge/cilib/cooperative/splitstrategies/SplitStrategy.java U src/main/java/net/sourceforge/cilib/cooperative/populationiterators/SequentialPopulationIterator.java U src/main/java/net/sourceforge/cilib/cooperative/populationiterators/PopulationIterator.java U src/main/java/net/sourceforge/cilib/cooperative/populationiterators/RandomPopulationIterator.java U src/main/java/net/sourceforge/cilib/cooperative/HybridCooperativeAlgorithm.java U src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java U src/main/java/net/sourceforge/cilib/algorithm/Algorithm.java U src/main/java/net/sourceforge/cilib/algorithm/population/PopulationBasedAlgorithm.java U src/main/java/net/sourceforge/cilib/algorithm/population/MultiPopulationBasedAlgorithm.java U src/main/java/net/sourceforge/cilib/pso/PSO.java U src/main/java/net/sourceforge/cilib/coevolution/Coevolution.java U src/main/java/net/sourceforge/cilib/entity/Topology.java Updated to revision 409. willie@gambit ~/subversion/cilib/trunk $ mvn [INFO] Scanning for projects... [INFO] ---------------------------------------------------------------------------- [INFO] Building cilib [INFO] task-segment: [package] [INFO] ---------------------------------------------------------------------------- [INFO] [resources:resources] [INFO] Using default encoding to copy filtered resources. [INFO] [compiler:compile] Compiling 14 source files to /home/willie/subversion/cilib/trunk/target/classes [INFO] ------------------------------------------------------------------------ [ERROR] BUILD FAILURE [INFO] ------------------------------------------------------------------------ [INFO] Compilation failure /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/entity/Topology.java:[32,43] package net.sourceforge.cilib.entity.visitor does not exist /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/entity/Topology.java:[67,23] cannot find symbol symbol : class TopologyVisitor location: class net.sourceforge.cilib.entity.Topology<E> /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[45,43] package net.sourceforge.cilib.entity.visitor does not exist /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[46,43] package net.sourceforge.cilib.entity.visitor does not exist /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[47,43] package net.sourceforge.cilib.entity.visitor does not exist /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[257,22] cannot find symbol symbol : class TopologyVisitor location: class net.sourceforge.cilib.pso.PSO /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[33,43] package net.sourceforge.cilib.entity.visitor does not exist /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[34,43] package net.sourceforge.cilib.entity.visitor does not exist /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[271,5] cannot find symbol symbol : class DiameterVisitor location: class net.sourceforge.cilib.pso.PSO /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[271,35] cannot find symbol symbol : class DiameterVisitor location: class net.sourceforge.cilib.pso.PSO /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[285,5] cannot find symbol symbol : class RadiusVisitor location: class net.sourceforge.cilib.pso.PSO /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/pso/PSO.java:[285,33] cannot find symbol symbol : class RadiusVisitor location: class net.sourceforge.cilib.pso.PSO /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[89,5] cannot find symbol symbol : class DiameterVisitor location: class net.sourceforge.cilib.measurement.single.Diameter /home/willie/subversion/cilib/trunk/src/main/java/net/sourceforge/cilib/measurement/single/Diameter.java:[89,35] cannot find symbol symbol : class DiameterVisitor location: class net.sourceforge.cilib.measurement.single.Diameter [INFO] ------------------------------------------------------------------------ [INFO] For more information, run Maven with the -e switch [INFO] ------------------------------------------------------------------------ [INFO] Total time: 4 seconds [INFO] Finished at: Tue Apr 03 04:15:55 GMT 2007 [INFO] Final Memory: 11M/27M [INFO] ------------------------------------------------------------------------ Cheers, Willie van Zyl -- ---------------------------------------------------------------------------------------------------------------------------------- A nerd is someone whose life revolves around computers and technology. A geek is someone whose life revolves around computers and technology, and likes it! ---------------------------------------------------------------------------------------------------------------------------------- "Yeah, that went well." -- Malcolm Reynolds, Captain of Serenity. ---------------------------------------------------------------------------------------------------------------------------------- |
From: Gary P. <gpa...@cs...> - 2007-03-02 07:42:15
|
Hi, Please provide me with some more details with regard to this. What platform / simulator etc? What is the exact error? Also please post this email on cil...@li... for a more speedy reply :) Thanks, Gary > Hi there... > > When trying to use the simulator included in the latest build of CIlib > I get an error that states the following: > > Could not create the Java virtual machine. > > I've tried to find out why this happens but could not get anything > useful. I've included the jar files necessary in my CLASSPATH and my > JAVA_HOME is also set to the java directory. > > I will greatly appreciate it if anyone can help me in this regard as > soon as possible...it's kind of urgent. > > Tnx > > > This message and attachments are subject to a disclaimer. Please refer > to www.it.up.ac.za/documentation/governance/disclaimer/ for full > details. / Hierdie boodskap en aanhangsels is aan 'n vrywaringsklousule > onderhewig. Volledige besonderhede is by > www.it.up.ac.za/documentation/governance/disclaimer/ beskikbaar. > > > _______________________________________________ > Cirgr mailing list > Ci...@cs... > http://lists.cs.up.ac.za/mailman/listinfo/cirgr > |
From: Lleulu L. <cic...@pa...> - 2007-01-31 17:48:36
|
Hi, Purchase your medication from our site because it costs less. http://www.vodrx*.com - Remove "*" to make the link working! -- as though he had done a slow-motion somersault, suddenly landing flat on his feet, in what seemed like the dazzling light of Dumbledores sunlit office. The stone basin was shimmering in the cabinet in front of him, |
From: Gary P. <gpa...@cs...> - 2007-01-03 06:23:24
|
Hello Soren, Thanks for the kind comments :) As far as I know there are no applications that use CILib within their code base, although I cannot see why not as CILib has been designed to be used in that way or simply via the simulator for tests etc. The Simulator(IOC) was written to show the expressive power of CILib and is not intended as the manner in which all applications of the library are to be done. It works well for experimental work, however, if you would like to integrate CILib into a project then I would advise using the library directly. This however is completely up to you. JNI would indeed be a valid option, a MSc student by the name of Marais Neethling is using CILib in conjunction with JNI for BioInformatics research applications, using the Vienna package as the fitness function evaluator for PSO. If you need any explanation about the various aspects, please let us know. We are currently revamping the documentation and correcting some minor errors with it as well. Keep an eye out for some updates that are to come. Regards, Gary > Hello list, > > I am thrilled to find such a comprehensive open source library for dealing > with computational intelligence, specifically particle swarm optimization > problems. I have been reading over the documentation and the wiki > information which has been posited online which have been very helpful. > Ultimately, I would like to use JNI to call and pass datasets into cilib > for > optimization and send the data back to the native code. Would JNI be the > best way to accomplish this? I was wondering if anyone has some example > Java > programs that use cilib part from the simulator and xml files included in > the build? Thanks again for this great library! > > Best Regards, > Soren > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > opinions on IT & business topics through brief surveys - and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV_______________________________________________ > Cilib-users mailing list > Cil...@li... > https://lists.sourceforge.net/lists/listinfo/cilib-users > |
From: Soren M. <so...@do...> - 2006-12-16 17:56:30
|
Hello list, I am thrilled to find such a comprehensive open source library for dealing with computational intelligence, specifically particle swarm optimization problems. I have been reading over the documentation and the wiki information which has been posited online which have been very helpful. Ultimately, I would like to use JNI to call and pass datasets into cilib for optimization and send the data back to the native code. Would JNI be the best way to accomplish this? I was wondering if anyone has some example Java programs that use cilib part from the simulator and xml files included in the build? Thanks again for this great library! Best Regards, Soren |
From: Eduardo C. <ad...@pa...> - 2006-11-30 17:40:23
|
Hi, =20 V / A G R A C / A L l S V A L / U M =20 Extra Low P R / C E S! =20 web address http://www.baserunjingendwwerunjindas.com =20 _____ =20 Indeed I do. I was studying it, so am therefore quite familiar with |