diff --git a/eo/tutorial/html/eoLesson1.html b/eo/tutorial/html/eoLesson1.html index e7bf1589e..20b2941b5 100644 --- a/eo/tutorial/html/eoLesson1.html +++ b/eo/tutorial/html/eoLesson1.html @@ -86,13 +86,13 @@ below, or go directly to the exercises. General includes:Like all C-like code, the file starts with include directives (Bit - Real). Apart from standard includes, -the spedific file to include is eo: +the specific file to include is eo: this is a file that contains the list of the most important EO files.
 
  • Representation: -you then have to delclare the type of individuals you will be handling. +you then have to declare the type of individuals you will be handling. All evolution-related objects you will need are templatized w.r.t. the type of individuals.
    • @@ -147,7 +147,7 @@ Random Number Generator is called seed, which is set here (Bit - Real): -everytime you run the algorithm with the same +every time you run the algorithm with the same seed, you will get the same result. Hence, to test the robustness of your algorithm, you should run it with different seeds. This is rather time @@ -245,7 +245,7 @@ is the standard arithmetic crossover for real-value vectors, that chooses a point randomly on the segment between both parents (also termed BLX-0). eoUniformMutation is the uniform mutation for real-valued vectors -that choses a new value for each variable uniformly on an interval centered +that chooses a new value for each variable uniformly on an interval centered on the parent value. The width of the interval is an internal parameter of the object, here called EPSILON. diff --git a/eo/tutorial/html/eoLesson2.html b/eo/tutorial/html/eoLesson2.html index 4bf3e37ec..fe224e5d0 100644 --- a/eo/tutorial/html/eoLesson2.html +++ b/eo/tutorial/html/eoLesson2.html @@ -70,7 +70,7 @@ object that is a sub-class of the corresponding STL vector class.

    Note: Also, a non-templatized fitness can be compiled separately (not done here) into an object -file once and forall (remember +file once and for all (remember that templates forbid that).
     

  • @@ -134,12 +134,12 @@ sum up to 1, all rates are scaled anyway.

    Note: The operators have to be encapsulated into an eoTransform object (Bit - Real) -to be passed to the eoEasyEA algorihtm. +to be passed to the eoEasyEA algorithm. The eoSGATransform is a simple eoTransform that does exactly the same thing than eoSGA: each pair from the selected parents undergoes the crossover -operator with given probablity, and all individuals (after crossover +operator with given probability, and all individuals (after crossover eventually) undergo mutation with given probability. The arguments to the eoSGATransform are an eoQuadOp with its probability @@ -182,7 +182,7 @@ a population (his operator()  returns a population). This was done internally in the  constructor of eoSGA  - see lesson1. -

    Exercice +
    Exercise 1: minimizing
    Modify the algorithm so that it minimizes the fitness. @@ -201,16 +201,16 @@ the file real_value.h so that it returns the sum of squares instead of its inverse. And again there is something else to modify...
    • -Exercice +Exercise 2: initialization
    Use different initializers: for instance, on the real-valued sphere function minimization, try to initialize half of the population in [-2,-1] and the other half in [1,2], with and without the segment and arithmetic crossovers (and for large values of VEC_SIZE, the size of the vectors). Amazing, isn't it! Explain that result. -

    Exercice +

    Exercise 3:  replacement -
    You can now twidle the number of offspring that +
    You can now twiddle the number of offspring that will be generated from the parents. But of course you need to adjust the replacement to keep a constant population size.

      diff --git a/eo/tutorial/html/eoLesson3.html b/eo/tutorial/html/eoLesson3.html index a7b08a2bc..04b41467b 100644 --- a/eo/tutorial/html/eoLesson3.html +++ b/eo/tutorial/html/eoLesson3.html @@ -28,7 +28,7 @@ file
    • save the population to disk, together with every part -of the algrithm you could think of - so you can decide to reload +of the algorithm you could think of - so you can decide to reload everything later to continue the same run, eventually with different parameters.
    • @@ -79,7 +79,7 @@ after the encapsulation of our binary_functioneoEvalFunc object, which again encapsulate the eoEvalFunc into an eoEvalFuncCounter. -As its name says, thisobject will, in addition to computing the fitness, +As its name says, this object will, in addition to computing the fitness, count the actual number of evaluations: the fitness of non-modified individuals is of course not recomputed - and this is taken care of by this object. Moreover, it @@ -129,11 +129,11 @@ for volunteers to create a Graphical User Interface :-)
    • The eoValueParam class, templatized by the type of the variable -you want to handle (i.e. integer, double, +you want to handle (i.e. iinteger, double, yourPrivateClass, ...). In this lesson, we will not go into details: e.g. we will not tell you that the eoValueParam -is actually a templatized sub-class of abstract class eoParam (oups, I +is actually a templatized sub-class of abstract class eoParam (oops, I said it!), nor will we deal with parameters outside their use from an eoParser. See the parameter section of the Bottom-up tutorial, or wait until lesson 4).
      • @@ -153,7 +153,7 @@ are read, by order of priority from a text file
    • -from the environement
      • +from the environment
    • from default values
      • @@ -186,7 +186,7 @@ in But you can now type in
                           SecondBitEA --vecSize=100 -
      and see the output of the optimization of OneMax on 100-bit bitstings. +
      and see the output of the optimization of OneMax on 100-bit bitstrings.
       
    • Take a look at all available parameters by typing in
      • @@ -271,7 +271,7 @@ mechanism offers you better ways to do that - and it's so easy ....

      eoCheckpoint: every generation I'd like to ... -
      The checkpointing mechanism is a very powerfull +
      The checkpointing mechanism is a very powerful construct to perform some systematic actions every generation - like saving things (using eoState objects described above), computing statistics @@ -330,14 +330,14 @@ whatever this is).
    • eoAverageStat and eoSecondMomentStat -respectiveley return the average (type double, assumes that FitnessType +respectively return the average (type double, assumes that FitnessType is castable to a double) and a pair made of the average and the standard deviation (type pair<double>) of the fitnesses in the populations.
    • eoDiversityStat returns the -diversity in the population: asssuming that there is a distance function +diversity in the population: assuming that there is a distance function defined among individuals, it returns the average inter-individuals distance. See also Exercise 2.
    @@ -346,8 +346,8 @@ within your algorithm, simply declareadd them to the eoCheckpoint you use in the algorithm. -

    Note: actually, there are 2 disctinct -classes that compute and gove access to statistics: eoStat +

    Note: actually, there are 2 distinct +classes that compute and give access to statistics: eoStat and eoSortedStat. As its name indicate, the latter is used whenever computing the statistics require a sorted population: not only this avoids to sort the population many times, @@ -368,8 +368,8 @@ are available in th eEO distribution: eoStdoutMonitor displays its parameters in text format on the screen. The (optional) boolean value in the constructor modifies the output: when true -(the default), vebose output is used, with one line per parameter. When -false, parcimonious output displays one line for all parameters. +(the default), verbose output is used, with one line per parameter. When +false, parsimonious output displays one line for all parameters.

  • eoStdoutMonitor writes its @@ -414,7 +414,7 @@ are available in the EO distribution: eoIncrementor A simple updater which maintains a counter (an eoValueParam that needs to be created beforehand, and passed in the constructor). It -is incremented everytime the operator() +is incremented every time the operator() method is called (every generation at the moment). You can of course also give an increment in the constructor (1 by default).
    • @@ -442,7 +442,7 @@ the state to some state-saver - and don't forget to eoCheckpoint    .
    -
    Exercice 1: +
    Exercise 1:     -
    Exercice 2: +
    Exercise 2:
    Write the eoDiversityStat stat computation and test it. Thanks to send us the code!
    -
    Exercice 3: +
    Exercise 3:
    Write the code for an eoGnuplot1DwithErrorbarsMonitor that would take into account the standard deviations and display them as -errorbars. +error-bars.
    Again, send us the code afterwards, thanks :-)
    diff --git a/eo/tutorial/html/eoProgramming.html b/eo/tutorial/html/eoProgramming.html index 7bae8b387..d3fa1f796 100644 --- a/eo/tutorial/html/eoProgramming.html +++ b/eo/tutorial/html/eoProgramming.html @@ -57,7 +57,7 @@ are that functors are functions with private data
  • -you can have different funtors objects of the same class, i.e. you can +you can have different functors objects of the same class, i.e. you can use the same functionality with different parameters
  • @@ -165,15 +165,15 @@ function.

    Drawbacks
    The main drawback I see in using STL is that it makes it almost impossible -to use a debugger normally: whereas acess to data is made simple -to the progammer, data structures are actually so complex, and debuggers -so willing to display everything that you get lines of template instanciation +to use a debugger     normally: whereas access to data is made simple +to the programmer, data structures are actually so complex, and debuggers +so willing to display everything that you get lines of template instantiation when asking your debugger what is inside some container! For instance I could never visualize some v[i] with gbd, v being an STL vector! -
    But there nonehteless are so many advantages !!! +
    But there nonetheless are so many advantages !!!


    Random @@ -183,7 +183,7 @@ numbers are simulated in computers by using pseudo-random< number generators (RNGs for short), i.e. functions that return series of numbers who look random (w.r.t. some statistical criteria).

    To make sure the random number generator is as good as possible, and -to ensure reproducibility of the results across diffrerent platforms, EO +to ensure reproducibility of the results across different platforms, EO has its own RNG, the ``Mersenne Twister'' random number generator MT19937 (thanks to Takuji Nishimura, see eoRNG.h @@ -205,12 +205,12 @@ use the RNG seeding procedure, see e.g. in Less

  • to simulate "true" random runs, you can just seed the RNG with a machine-clock -realted number, e.g. calling time(0), as done for isntance in Lesson3 +related number, e.g. calling time(0), as done for instance in Lesson3 (and after).
    • As RNGs only produce (by definition) numbers that are uniformly distributed integers between 0 and some maximal number, EO provides you with random -numbers follwing different probability distribution +numbers following different probability distribution (e.g. floating point following normal distribution).

    EO also provides random_generators @@ -225,14 +225,14 @@ and naming style EO:

    • -The name of local varoiables shoudl start with a lower case letter
      • +The name of local variables should start with a lower case letter
    • -The name of the parameters to a function shoudl start with an underscore +The name of the parameters to a function should start with an underscore (_)

      • The initialization parameters of constructors, for instance,  -shoudl be named from the names of the variables they are used to initialize. +should be named from the names of the variables they are used to initialize.
    • The names of classes should start with eo + an Uppercase letter
      • diff --git a/eo/tutorial/html/eoTopDown.html b/eo/tutorial/html/eoTopDown.html index 1e8470f3c..cfa8e5d3c 100644 --- a/eo/tutorial/html/eoTopDown.html +++ b/eo/tutorial/html/eoTopDown.html @@ -48,7 +48,7 @@ populations, ...).


      Current version (Nov. 29, 2000) stops here, but here are the plans -(sujected to many changes, of course!) +(subjected to many changes, of course!)
       

    • Lesson 4 - More about checkpointing: write your first adaptive @@ -69,7 +69,7 @@ Lesson 7 - ...
    Of course, in each lesson, you have links to the Bottom-Up page of the corresponding component of an EA you are modifying. -
    ( ... Well, to tell you the truth, as of today, november 28, this is +
    ( ... Well, to tell you the truth, as of today, November 28, this is not true :-)
    diff --git a/eo/tutorial/html/eoTutorial.html b/eo/tutorial/html/eoTutorial.html index 7f9d20942..31c4cbb2b 100644 --- a/eo/tutorial/html/eoTutorial.html +++ b/eo/tutorial/html/eoTutorial.html @@ -25,7 +25,7 @@ EAs :-) This tutorial can be used in 2 different ways: top-down and bottom-up.
    • -Top-down means you start from a very +Top-down means you start from a very simple, ready-to-run algorithm, and gradually modify it, making it both more powerful and more complex.
      • @@ -63,7 +63,7 @@ brief introduction).


      Colors and navigation:

      You will see this diagram in quite many places, as for instance at the -top of all examples - usually it will be clicable and will help you navigate +top of all examples - usually it will be clickable and will help you navigate among the different parts of an EO program. See the brief introduction to Evolutionary Computation for a detailed explanation.

      @@ -108,8 +108,8 @@ any of the above, i.e. random number generator, or basic C++/STL syntax .
    • -Note that pink will be used to desctibe the -syntax of compile orders (i.e. at the oepratoring system level, see e.g. +Note that pink will be used to describe the +syntax of compile orders (i.e. at the operating system level, see e.g. below).
    • @@ -120,10 +120,10 @@ will use the Helvetica typeface, like this line you are now reading.
      • an interface that would allow you to build your Evolutionary Programs by -a few clics; such a thing does exist, is called EASEA, +a few clicks; such a thing does exist, is called EASEA, and is complementary to this tutorial as it helps the user to build some simple EO programs from simple description. But there are things that EASEA -cannot do, and you will have to do it yourself and will need to imcrease +cannot do, and you will have to do it yourself and will need to increase your knowledge about EO for that.