ICARIS 2008 (International Conference on Artificial Immune Systems), Phuket, Thailand

1. Applied AIS : A Roadmap of AIS Research in Brazil and Sample Applications Leandro Nunes de Castro [email_address] ; [email_address] Mackenzie University NatComp – From Nature to Business

3. Application Areas Which and When

6. Where to Find Information http://www.artificial-immune-systems.org/

9. A Roadmap of AIS Research in Brazil Main Research Groups and Their Focus

10. Geographic Distribution UFMG UNIFEI UNICAMP MACKENZIE & NATCOMP UTFPR

12. Some LBiC Contributions aiNet opt-aiNet copt-aiNet dopt-aiNet dcopt-aiNet ARIA ABNET RABNET SABNET SaiNet omni-aiNet

16. Sample Applications from the Brazilian Groups From Text Mining to Grain Classification

17. BIC-aiNet: An AIS for Text Clustering Pablo de Castro et al., Natural Computing journal, in press. A Group from Unicamp

24. The BIC-aiNet Algorithm Mutation : insertion/deletion of rows and columns Suppression : eliminates similar biclusters

26. BIC-aiNet Performance

28. IA-AIS: An AIS To Detect Spam Thiago S. Guzella et al., BioSystems 92(2008), pp. 215-225 A Group from UFMG

31. IA-AIS: Innate and Adaptive AIS

32. IA-AIS: Innate and Adaptive AIS

33. IA-AIS: Innate and Adaptive AIS

34. IA-AIS: Parameters and Configurations

35. IA-AIS: Experimental Results

37. CGbAIS: A Cluster Gradient-Based AIS to Optimal Power Flow Leonardo M. Honorio et al., IEEE Trans. on Power Systems, in press.

39. The Cluster Gradient-Based AIS (CGbAIS)

41. Combinatorial Optimization with CGbAIS

45. CGbAIS: Experimental Results Results without clustering Results with clustering

47. A Grain Classification Machine NatComp – From Nature to Business

50. Examples of Grain Defects

52. HW Prototyping

53. HW Prototyping

58. Sample Certificate

60. Operation Planning in a Container Terminal (CONTER) NatComp – From Nature to Business

63. RTGs Movements: Productive (a) (b) (c) (c) (d) (e)

64. RTGs Movements: Unproductive (Set-Up) (a) (b) (c) (d)

65. Cost to Remove Containers where n x , n y and n z is the number of movements in direction X, Y and Z, respectively; V x , V y and V z is the RTG velocity in direction X, Y and Z, respectively; t T is the time spent to lock or unlock the spreader and n T is the number of spreader locking/unlocking.

66. The copt-aiNet Algorithm

67. A Demo on the RTG Scheduling Problem