1. February 2005jES Open Foundation1 cover How to Use jES Open Foundation Program (a demo presentation) (February 2005, Pietro Terna) (related to jesopenfoundation-0.1.60.tar.gz, How to v. 0.0.21) pietro.terna@unito.it

2. February 2005jES Open Foundation2 _jESjES O F _______________________________________ jES jES O F _______________________________________

3. February 2005jES Open Foundation3 From jES … jVE jES java Enterprise Simulator … to jES Open Foundation to simulate multi-model frameworks of system of units or agents http://www.flightgear.org/

4. February 2005jES Open Foundation4 _jES basics _______________________________________ jES basics _______________________________________

5. February 2005jES Open Foundation5 WD, DW, WDW WD side or formalism: What to Do DW side or formalism: which is Doing What WDW formalism: When Doing What Three formalisms

6. February 2005jES Open Foundation6 dictionary unit= a productive structure; a unit is able to perform one of the steps required to accomplish an order order= the object representing a good to be produced; an order contains technical information (the recipe describing the production steps) recipe=a sequence of steps to be executed to produce a good A dictionary

7. February 2005jES Open Foundation7 _A flexible scheme _______________________________________ A flexible scheme in jES Open Foundation _______________________________________

8. February 2005jES Open Foundation8 DW: a flexible scheme Units … DW … on a toroidal space (left and right borders and top and bottom ones are close together) 2 13 2 1 4 5 3 1 Each unit is able to do a specific step …

9. February 2005jES Open Foundation9 WD: recipes WD with the recipes of the orders (what to do) expressed as sequences of numbers; orders with recipes are randomly generated with different lengths and structures 1 3 2 4 5 3 4 3 5 1 1 … … of a recipe

10. February 2005jES Open Foundation10 moving recipes DW and WD 2 13 2 1 4 5 3 1 1 3 2 4 moving around among units 1 3 2 4 ? lack of visibility how to choose Visibility is a metaphorical representation of trustiness and cooperation in a social network; when global visibility increases, we have more social capital

11. February 2005jES Open Foundation11 visibility and … visibility changes new units appear randomly (enterprise creation) with strategic relationships … … or alone some units are dropped out Visibility increases with the time (initial visibility is randomly chosen)

12. February 2005jES Open Foundation12 … bars The left (blue) bar of each unit reports the number of waiting orders (do be done) The down (grey) bar of each unit reports the number of consecutive clock ticks in which the unit has been idle If > maxInactivity the unit is dropped out and all unsent products are lost The right (red) bar of each unit reports the number of unsent products, due to the fact that a unit able to do the required step does not exist or is not visible If > maxUnsentProducts the unit is dropped out and all unsent and waiting products are lost

13. February 2005jES Open Foundation13 jES Open Foundation recipe generator or distiller recipes each unit owns a public matrix recipe generator or distiller recipes each unit owns a public matrix recipe generator or distiller recipes each unit owns a public matrix recipe generator or distiller recipes each unit owns a public matrix many levels built in a parametric way by the Observer The system uses only simple recipes containing computational steps applied to unit matrixes and to general matrixs jES Open Foundation

14. February 2005jES Open Foundation14 Visibility Visibility between two units Unit a areaUnit b area Unit a Unit b a cannot see b; b can see a

15. February 2005jES Open Foundation15 memory matrixes Memory matrixes data are reported in a text file (unitData/memoryMatrixes.txt) number(from_0_ordered)_rows_cols 02 3 13 5 24 1 33 1 Mandatory first line

16. February 2005jES Open Foundation16 computational steps 1/3 Recipes with computations (recipes are reported in external and intermediate format) External format (remember: step, time specification, time) : 1 s 1 c 1999 3 0 1 3 2 s 2 3 s 2 1 s 1 c 1998 1 0 5 s 2 1 s 1 c 1998 1 1 6 s 2 1 s 1 c 1998 1 3 7 s 2 time specification: seconds time in seconds step in recipe Intermediate format (remember: each step is repeated for each unit of time) : 1 2 2 -1999 3 0 1 4 1000000002 3 3 1 5 5 -1998 1 0 1000000005 1 6 6 -1998 1 1 1000000006 1 7 7 -1998 1 3 1000000007 a step with computation: step 2, requiring 2 seconds, involves computation 1999 with 3 matrixes (those numbered 0, 1, 3 in the previous Figure) after automatic translation, the intermediate format reports the computational processes with a trick (which can be modified, adopting an other translation in OrderDistiller ): we imagine here that the computations require the time reported in their steps; so they are placed at the end of the time, followed by a 0 time step (at the intermediate format level, 0 time step are reported as 1000000000+step a step with computation: step 7, requiring 2 seconds, involves computation 1998 with 1 matrix (that numbered 3 in the previous Figure) Computational steps

17. February 2005jES Open Foundation17 computational steps 2/3 The Java Swarm code used by the recipes with the example code c 1998 /** computational operations with code -1998 (a code for the checking * phase of the program * * this computational code place a number in position 0,0 of the * unique received matrix and set the status to done */ public void c1998(){ mm0=(MemoryMatrix) pendingComputationalSpecificationSet. getMemoryMatrixAddress(0); layer=pendingComputationalSpecificationSet. getOrderLayer(); mm0.setValue(layer,0,0,1.0); mm0.print(); done=true; } // end c1998 Computational steps, Java code

18. February 2005jES Open Foundation18 computational steps 3/3 The Java Swarm code used by the recipes with the example code c 1999 /** computational operations with code -1999 (a code for the checking * phase of the program * * this computational code verifies position 0,0 of the three * received matrixes; only if these positions are all not empty * the code empties them and set the status to done */ public void c1999(){ mm0=(MemoryMatrix) pendingComputationalSpecificationSet. getMemoryMatrixAddress(0); mm1=(MemoryMatrix) pendingComputationalSpecificationSet. getMemoryMatrixAddress(1); mm2=(MemoryMatrix) pendingComputationalSpecificationSet. getMemoryMatrixAddress(2); layer=pendingComputationalSpecificationSet. getOrderLayer(); if(! (mm0.getEmpty(layer,0,0) || mm1.getEmpty(layer,0,0) || mm2.getEmpty(layer,0,0) ) ) { mm0.setEmpty(layer,0,0); mm1.setEmpty(layer,0,0); mm2.setEmpty(layer,0,0); done=true; } } // end c1999 Computational steps, Java code

19. February 2005jES Open Foundation19 _ preys-predators _______________________________________ preys-predators _______________________________________

20. February 2005jES Open Foundation20 #Recipes; grassGeneration1c12012001s0; utility100c110030121s0; #Recipes; preysEating11001s0c12022111s0; timeStep23c12992111001s0; preysReproducing4c12062111001s0; #Recipes; predatorsEating12001s0c12022221001s0; timeStep23c12992222001s0; predatorsReproducing4c12062222001s0; simple spreadsheets recipes

21. February 2005jES Open Foundation21 #sequence 11*50; #sequence 11*10023*14*100; #sequence 11*3323*14*33; simple spreadsheets sequences

22. February 2005jES Open Foundation22 units unit_#___prod.phase_# 1001 1 2001 text files

23. February 2005jES Open Foundation23 preys-predators 1/5 Tutorial, step3b / time 278, look at the complex codetermination of grass, preys and predators

24. February 2005jES Open Foundation24 preys-predators 2/5 Tutorial, step3b / time 744, another codetermined configuration

25. February 2005jES Open Foundation25 preys-predators 3/5 Tutorial, step3b / time 1056, another codetermined configuration

26. February 2005jES Open Foundation26 preys-predators 4/5 Tutorial, step3b / time 1648, another codetermined configuration

27. February 2005jES Open Foundation27 preys-predators 5/5 Tutorial, step3b / time 3448, predators disappeared at 2132, now we have a simplified two stage model

28. February 2005jES Open Foundation28 _ workers-skills-firms _______________________________________ workers-skills-firms _______________________________________

29. February 2005jES Open Foundation29 Version 0, no links between firms and workers

30. February 2005jES Open Foundation30 Version 1, new workers with skills equal to that of their neighbors

31. February 2005jES Open Foundation31 Version 2, new workers with skills randomly distributed in the stratum space

32. February 2005jES Open Foundation32 Version 3, new workers with skills equal to that of their neighbors, but arising in unequal quantities

33. February 2005jES Open Foundation33 Version 4, new workers with skills randomly distributed in the stratum space, but arising in unequal quantities