‫‪www.IrPDF.

com‬‬
‫ﺻﻔﺤﻪ ﺑﻌﺪ‬ ‫ﻓﻬﺮﺳﺖ‬ ‫ﺟﻠﺪ‬ ‫ﺻﻔﺤﻪ ﻗﺒﻞ‬ ‫‪Zoom out Zoom in‬‬

‫ﻧﺮ ﻓﺰ‬

‫‪$‬ﺷﻨﺎﻳﻰ ﺑﺎ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ‬

‫ﻳﻤﺎ‪ C‬ﺷﻜﺎ‪9‬ﻧﺪ‬

‫ﺳﺎ ﺷﺸﻢ‪ ،‬ﺷﻤﺎ ‪ ،16‬ﺑﻬﺎ ‪86‬‬

‫‪38‬‬
‫ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ )‪ (Genetic Algorithm- GA‬ﺗﻜﻨﻴﻚ ﺟﺴﺘﺠﻮﻳﻰ  ﻋﻠﻢ ﻳﺎﻧﻪ ﺑﺮ ﻳﺎﻓﺘﻦ ﺣﻞ‬
‫ﺗﻘﺮﻳﺒﻰ ﺑﺮ ﺑﻬﻴﻨﻪﺳﺎ‪ 9 ,‬ﻣﺴﺎﺋﻞ ﺟﺴﺘﺠﻮ ﺳﺖ‪ .‬ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﻧﻮ‪ 4‬ﺧﺎﺻﻰ ‪ ,‬ﻟﮕﻮﻳﺘﻤﻬﺎ ﺗﻜﺎﻣﻞ ﺳﺖ ﻛﻪ ‪,‬‬
‫ﺗﻜﻨﻴﻜﻬﺎ ‪,‬ﻳﺴﺖﺷﻨﺎﺳﻰ ﻓﺮﮔﺸﺘﻰ ﻣﺎﻧﻨﺪ ‪9‬ﺛﺖ ‪ 9‬ﺟﻬﺶ ﺳﺘﻔﺎ ﻣﻰﻛﻨﺪ‪.‬‬
‫ﻟﮕﻮﻳﺘﻤﻬﺎ ژﻧﺘﻴﻚ ﻣﻌﻤﻮﻻً ﺑﻪ ﻋﻨﻮ‪ C‬ﻳﻚ ﺷﺒﻴﻪﺳﺎ‪ ,‬ﻛﺎﻣﭙﻴﻮﺗﺮ ﻛﻪ  ‪ CD‬ﺟﻤﻌﻴﺖ ﻳﻚ ﻧﻤﻮﻧﻪ ﻧﺘﺰﻋﻰ )ﻛﺮ‪9‬ﻣﻮ‪9,‬ﻣﻬﺎ(‬
‫‪ ,‬ﻧﺎﻣﺰﻫﺎ ﺣﻞ ﻳﻚ ﻣﺴﺄﻟﻪ ﺑﻬﻴﻨﻪﺳﺎ‪ ,‬ﻛﻪ ﺑﻪ  ﺣﻞ ﺑﻬﺘﺮ ﻣﻨﺠﺮ ﺷﻮ‪ ،‬ﭘﻴﺎﺳﺎ‪ ,‬ﻣﻰﺷﻮﻧﺪ‪ .‬ﺑﻪ ﻃﻮ ﺳﻨﺘﻰ‬
‫ﺣﻠﻬﺎ ﺑﻪ ﺷﻜﻞ ﺷﺘﻪﻫﺎﻳﻰ ‪ 1 9 0 ,‬ﺑﻮﻧﺪ‪ ،‬ﻣﺎ ﻣﺮ‪ ,9‬ﺑﻪ ﮔﻮﻧﻪﻫﺎ ﻳﮕﺮ ﻫﻢ ﭘﻴﺎﺳﺎ‪ ,‬ﺷﺪﻧﺪ‪ .‬ﻓﺮﺿﻴﻪ ﺑﺎ‬
‫ﻼ ﺗﺼﺎﻓﻰ ﻣﻨﺤﺼﺮ ﺑﻔﺮ ‪D‬ﻏﺎ‪ ,‬ﻣﻰﺷﻮ ‪  9‬ﻧﺴﻠﻬﺎ ﻣﻪ ﻣﻰﻳﺎﺑﺪ‪  .‬ﻫﺮ ﻧﺴﻞ ﮔﻨﺠﺎﻳﺶ ﺗﻤﺎ‪ N‬ﺟﻤﻌﻴﺖ‬ ‫ﺟﻤﻌﻴﺘﻰ ﻛﺎﻣ ً‬
‫‪,‬ﻳﺎﺑﻰ ﻣﻰﺷﻮ‪ ،‬ﭼﻨﺪﻳﻦ ﻓﺮ ﻣﻨﺤﺼﺮ  ﻓﺮﻳﻨﺪ ﺗﺼﺎﻓﻰ ‪ ,‬ﻧﺴﻞ ﺟﺎ ﻧﺘﺨﺎ‪ T‬ﻣﻰﺷﻮﻧﺪ )ﺑﺮ ﺳﺎ‪ S‬ﺷﺎﻳﺴﺘﮕﻴﻬﺎ(‬
‫‪ 9‬ﺑﺮ ﺷﻜﻞ ‪ C‬ﻧﺴﻞ ﺟﺪﻳﺪ‪ ،‬ﺻﻼ‪ X‬ﻣﻰﺷﻮﻧﺪ )ﻛﺴﺮ ﻳﺎ ‪9‬ﺑﺎ ﺗﺮﻛﻴﺐ ﻣﻰﺷﻮﻧﺪ( ‪  9‬ﺗﻜﺮ ﺑﻌﺪ ﻟﮕﻮﻳﺘﻢ ﺑﻪ‬
‫ﻧﺴﻞ ﺟﺎ ﺗﺒﺪﻳﻞ ﻣﻰﺷﻮ‪.‬‬

‫ﺑﻨﺪ‪ ( encapsulate ) Q‬ﺗﻌﺪ‪ $ Q‬ﻓﺘﺎﻫﺎ‪Q‬‬ ‫ﺷﺒﻜﻪ ﻫﺎ‪ Q‬ﻋﺼﺒﻰ ‪ $‬ﻃﺮ‪ P‬ﻳﮕﺮ ﺑﻪ ﻧﻈﺮ ﻣﻰ‬
‫‪ -1‬ﻣﻘﺪﻣﻪ‬
‫ﻣﻄﻠﻮ‪ J‬ﺳﺘﻔﺎ ﻣﻰ ﺷﻮ ‪ .‬ﺑﻪ ﻋﺒﺎ‪ V‬ﻳﮕﺮ ﻳﻚ‬ ‫ﺳﺪ  ﻣﻜﺎﻧﻴﺰﻣﻬﺎ ﻛﻨﺘﺮﻟﻲ ﺑﺮ ﮔﺎﻧﻴﺰ‪ K‬ﻫﺎ‬
‫ﺑﺎ ﻳﮕﺮ ‪$‬ﻧﻬﺎ‪ Q‬ﺧﻮ‪ J‬ﭘﻴﺪ ﻣﻰ ﺷﻮﻧﺪ ‪.‬‬ ‫ﻣﻔﻴﺪ ﻫﺴﺘﻨﺪ )ﻳﻚ ﮔﺎﻧﻴﺰ‪ K‬ﺑﺎﻳﺪ ‪ $‬ﺧﻄﺮ ‬ ‫ﺧﻴﺮ ً ‪  ،‬ﺗﻜﻨﻴﻚ ﺟﺴﺘﺠﻮ ﻫﻴﻮﺳﺘﻴﻚ ﻛﻪ ‬
‫ﺷﺒﻜﻪ ﻋﺼﺒﻰ ﻣﻰ ﺗﻮﻧﺪ ﺑﻪ ﺳﻴﻠﻪ ﺧﻮ' ﻣﻮ‬ ‫ﻛﻨﺪ  ﺟﺴﺘﺠﻮ ﻛﻨﺪ ﺑﻬﺘﺮ ( ‪.‬ﻳﻦ  ' ﺑﻪ ﻃﻮ‬ ‫ﻫﻮ' ﻣﺼﻨﻮﻋﻲ ‪# $‬ﻧﻬﺎ ﺳﺘﻔﺎ ﻣﻲ ﺷﻮ ﺑﻪ ﺟﻮ‬
‫ﺳﺘﻔﺎ ﻗﺮ ﮔﻴﺮ ﺗﺎ ﻓﺘﺎ‪ Q‬ﻣﻄﻠﻮﺑﻰ  ‪ $‬ﺧﻮ ﻧﺸﺎ‪B‬‬ ‫ﻃﺒﻴﻌﻲ ﻳﻚ ﺗﻔﺎ‪  V‬ﻣﻘﻴﺎ‪  U‬ﻣﻨﻌﻜﺲ ﻣﻲ ﻛﻨﻨﺪ‬ ‫‪#‬ﻣﺪ ﺳﺖ ﻛﻪ ﺷﺎﻣﻞ ‪ -1 :‬ﻟﮕﻮﻳﺘﻢ ﻫﺎ ژﻧﺘﻴﻚ‬
‫ﻫﺪ‪ $ .‬ﻳﻚ ﻣﺠﻤﻮﻋﻪ ‪$ $‬ﻧﻬﺎ‪ Q‬ﺧﻮ‪# J‬ﻧﻬﺎﻳﻲ ﻛﻪ ﺑﻪ‬ ‫‪  .‬ﺣﺎﻟﻴﻜﻪ ﺷﺒﻜﻪ ﻋﺼﺒﻲ ﻣﻲ ﺗﻮﻧﺪ  ﻛﻨﺘﺮ‪ 7‬ﻳﻚ‬ ‫)‪ -2 (GAs‬ﺷﺒﻜﻪ ﻫﺎ ﻋﺼﺒﻲ)‪ (NNs‬ﻣﻲ ﺑﺎﺷﻨﺪ‬
‫ﭘﻴﺸﺮ‪ ) Q‬ﺣﺮﻛﺖ ﺑﻪ ﺟﻠﻮ ( ‪#‬ﺷﻨﺎ ﻧﻴﺴﺘﻨﺪ ﺑﺎﻳﺪ ﺗﻌﻠﻴﻢ‬ ‫ﮔﺎﻧﻴﺰ‪ K‬ﻣﺨﺼﻮ‪ W‬ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺳﺘﻔﺎ ﺷﻮ‪.‬‬ ‫‪ .‬ﻫﺮ  ﺗﻜﻨﻴﻚ ‪ NNs  GAs‬ﻣﺘﻜﻲ ﺑﺮ ﻣﺪ‪ 7‬ﻫﺎﻳﻲ‬
‫ﺑﺒﻴﻨﻨﺪ ‪ .‬ﺑﻪ ﺟﺎ‪ Q‬ﻟﮕﻮﻳﺘﻤﻬﺎ‪ Q‬ﺗﻌﻠﻴﻢ ﻗﺪﻳﻤﻰ ﺷﺒﻜﻪ‬ ‫ ﺳﺘﻨﺘﺎ‪ F‬ﻳﻚ ﺟﻤﻌﻴﺖ ‪ $‬ﮔﺎﻧﻴﺰ‪ K‬ﻫﺎ ‪ ,‬ﻟﮕﻮﻳﺘﻢ‬ ‫‪ $‬ﻃﺒﻴﻌﺖ ﻫﺴﺘﻨﺪ‪ .‬ﻳﻚ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺑﺮ ﻣﺒﻨﺎ‬
‫ﻋﺼﺒﻰ ‪ $ De Garis,‬ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺑﺮ‪ Q‬ﺗﻌﻠﻴﻢ‬ ‫ژﻧﺘﻴﻚ  ﻳﻚ ﻣﺤﻴﻂ ﻣﻌﻠﻮ‪ ) K‬ﻣﻌﻴﻦ ( ﺧﻮ‪ J‬ﺟﺮ ﻣﻰ‬ ‫ﻋﻠﻢ ژﻧﺘﻴﻚ  ﻓﺮﺿﻴﻪ ﻳﻦ ﻣﺪ‪ 7‬ﺷﺪ ﺳﺖ ‬
‫ﻳﻚ ﻣﺠﻤﻮﻋﻪ ‪$ $‬ﻧﻬﺎ‪ Q‬ﺧﻮ‪ J‬ﺳﺘﻔﺎ ﻛﺮ‪ .‬ﺗﻌﻠﻴﻢ ﺑﻪ‬ ‫ﺷﻮ ﮔﺮ  ﻳﻚ ﺷﺒﻜﻪ ﻋﺼﺒﻰ ﻛﻪ  ﺑﺴﺘﻪ ﺑﻨﺪ‪) Q‬‬ ‫ﺣﺎﻟﻴﻜﻪ ﻳﻚ ﺷﺒﻜﻪ ﻋﺼﺒﻲ ﻣﺘﻜﻲ ﺑﺮ ﻣﺪ‪ 7‬ﻫﺎﻳﻲ ‪$‬‬
‫ﺳﻴﻠﻪ ﺧﻮ ﺷﺒﻜﻪ ﻋﺼﺒﻰ ﻧﺠﺎ‪ K‬ﻧﻤﻰ ﺷﻮ‪ .‬ﻳﻦ '‬ ‫‪ ( encapsulate‬ﻳﻚ ﻓﺘﺎ ﻣﺨﺼﻮ‪ W‬ﺳﺘﻔﺎ ﺷﺪ‬ ‫ﺷﻨﺎﺧﺖ ﻧﺴﺎ‪ B‬ﻣﻲ ﺑﺎﺷﺪ‪.‬‬
‫‪ Genetic programming‬ﻧﺎﻣﻴﺪ ﻣﻰ ﺷﻮ‪.‬‬ ‫ﺳﺖ ﻣﻰ ﺗﻮﻧﺪ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺳﺘﻔﺎ ﺷﻮ ﺗﺎ‬ ‫ﻳﻚ ﻛﺎﺑﺮ ﻣﻌﻤﻮﻟﻲ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺳﺘﻔﺎ‬
‫ﻫﻤﺎﻧﻄﻮ ﻛﻪ ]ﻛﺮ ﺷﺪ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﻳﻚ‬ ‫‪ B#‬ﻓﺘﺎ  ‪,‬ﺑﻮﺳﻴﻠﻪ ﺳﺘﻨﺘﺎ‪ F‬ﻳﻚ ﺟﻤﻌﻴﺖ ‪ $‬ﺷﺒﻜﻪ‬ ‫ﺑﻪ ﻋﻨﻮ‪ B‬ﺗﺎﺑﻊ ﺑﻬﻴﻨﻪ ﺳﺎ‪ $‬ﻣﻲ ﺑﺎﺷﺪ‪ $ .‬ﻳﮕﺮ ﻛﺎﺑﺮ‬
‫ﺟﻤﻌﻴﺖ ‪ $‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ  ﺑﺮ ﻃﺒﻖ ﻓﺮﻳﻨﺪ ﻧﺘﺨﺎ‪J‬‬ ‫ﻫﺎ ﻋﺼﺒﻲ ﺳﺘﻨﺘﺎ‪ F‬ﻛﻨﺪ ‪.‬‬ ‫ﻫﺎ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﻣﻲ ﺗﻮ‪ B‬ﺑﻪ ﺳﺘﻨﺘﺎ‪ F‬ﮔﺎﻧﻴﺴﻢ‬
‫ﻃﺒﻴﻌﻰ ﺳﺘﻨﺘﺎ‪ F‬ﻣﻰ ﻛﻨﺪ ‪  .‬ﻃﻰ ﻳﻦ ﻓﺮﻳﻨﺪ‬ ‫ﻳﻚ ' ﻣﺨﺼﻮ‪ W‬ﺳﺘﻨﺘﺎ‪ F‬ﻓﺘﺎ‪ ،‬ﺑﻮﺳﻴﻠﻪ ‪De‬‬ ‫ﺟﺮ ﺧﻮ‪  J‬ﻣﻮﻓﻖ  ﻳﻚ ﻣﺤﻴﻂ ﻣﻌﻴﻦ ﺷﺎ‬
‫ﭘﺮﺗﻮﻫﺎ‪ Q‬ژﻧﺘﻴﻜﻰ ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ‪ Q‬ﺟﺪﻳﺪ ) ﻓﺮ‪$‬ﻧﺪ‪( B‬‬ ‫‪ Garis‬ﺗﻮﺿﻴﺢ  ﺷﺪ ﺳﺖ‪  .‬ﻳﻦ ' ‪$‬‬ ‫ﻧﻤﻮ ‪ .‬ﻫﺮ ﻛﺪ‪ $ K‬ﻳﻦ ﻛﺎﺑﺮﻫﺎ ‪ GA‬ﻣﺘﻜﻲ ﺑﺮ‬
‫ ﺑﺮ ﺳﺎ‪ U‬ﻛﺎﻳﻲ ﺑﻴﺸﺘﺮ ﻧﺴﻞ ﻗﺒﻞ ) ﻟﺪﻫﺎ ( ﻳﺠﺎ‬ ‫ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺑﺮ‪ Q‬ﺳﺘﻨﺘﺎ‪ F‬ﻳﻚ ﺟﻤﻌﻴﺖ ‪ $‬ﺷﺒﻜﻪ‬ ‫ﺑﻘﺎ ﻓﺮ ﺑﻬﺘﺮ )ﻧﺘﺨﺎ‪ J‬ﻃﺒﻴﻌﻲ( ﺑﺮﻣﺒﻨﺎ ﻧﻈﺮﻳﻪ‬
‫ﻣﻰ ﻛﻨﻨﺪ ‪ .‬ﺗﺮﻛﻴﺐ )  ﻳﻦ ﺟﺎ ﻛﺮ‪ # U‬ﻧﺎﻣﻴﺪ‬ ‫ﻫﺎ‪ Q‬ﻋﺼﺒﻰ ﺳﺘﻔﺎ ﻣﻲ ﺷﻮ ‪ .‬ﻫﺮ ﺷﺒﻜﻪ ﻋﺼﺒﻰ ﻳﻚ‬ ‫ﻳﻦ ﻣﻲ ﺑﺎﺷﺪ‪.‬‬
‫ﻣﻰ ﺷﻮ ( ﻳﻚ ﭘﺮﺗﻮ ژﻧﺘﻴﻜﻰ  ﻳﻚ ﻛﻠﻴﺪ ﻗﺪﺗﻤﻨﺪ‬ ‫ﻣﺠﻤﻮﻋﻪ ‪$ $‬ﻧﻬﺎ‪ Q‬ﻗﺎﺑﻞ ﺗﻨﻈﻴﻢ   ﺑﺮ‪ Q‬ﺑﺴﺘﻪ‬

‫‪www.IrPDF.com‬‬
 ‫‪www.IrPDF.com‬‬
‫‪Zoom out Zoom in‬‬ ‫ﺻﻔﺤﻪ ﺑﻌﺪ‬ ‫ﻓﻬﺮﺳﺖ‬ ‫ﺟﻠﺪ‬ ‫ﺻﻔﺤﻪ ﻗﺒﻞ‬

‫‪Software‬‬
‫ﻧﺮ‪ B‬ﺳﺖ ‪ .‬ﻗﺎﻧﻮ‪ $ activation B‬ﺗﺎﺑﻊ ‪sigmoid‬‬
‫ﺳﺘﻔﺎ ﻣﻰ ﻛﻨﺪ ‪.‬‬
‫ﻫﺮ ‪Genetic programming Neural‬‬
‫‪) Network‬ﻛﻪ ﺑﻪ ﺳﻴﻠﻪ‪De Garis ، Gen Net‬‬
‫ﻧﺎﻣﻴﺪ ﻣﻰ ﺷﻮ( ﻳﻚ ﻣﺠﻤﻮﻋﻪ ‪ $‬ﻧﺮﻧﻬﺎ‪, Q Q‬‬
‫ﺑﻌﺪ ‪ $‬ﺑﻴﺖ ﭘﻨﺠﻢ ﺗﻔﺎ‪ r‬ﻓﺘﺎ ﺑﺎﺷﺪ ‪  ,‬ﻧﺘﻴﺠﻪ ﻫﺮ‬ ‫ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺳﺖ ‪ .‬ﮔﺮ ﭼﻪ ‪ De Garis‬‬
‫ﻓﺮ‪$‬ﻧﺪ ﺟﺪﻳﺪ ﻳﻚ ﻧﻴﻤﻪ ‪ $‬ﺑﻴﺘﻬﺎ‪ Q‬ﻟﺪ'  ﻳﺎﻓﺖ‬ ‫ﻣﻄﺎﻟﻌﺎﺗﺶ ﺑﺎ‪، Genetic programming‬‬
‫ﻣﻰ ﻛﻨﺪ ‪.‬‬ ‫ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ  ﺑﺪ‪ B‬ﻛﺮ‪ # U‬ﺋﻪ ﻛﺮ ‪ ,‬ﻣﺎ‬
‫ﻛﺎﻳﻲ ﺧﺮﺟﻰ ﻳﻚ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺑﻪ ﻛﺮ‪# U‬‬
‫ﺑﺴﺘﻪ ﺳﺖ ‪.‬‬
‫‪Child 1: 1010110000‬‬
‫ﻧﺮﻧﻬﺎ ﺧﺮﺟﻲ  ﻧﺮﻧﻬﺎ ﻣﺨﻔﻲ  ﺷﺎﻣﻞ ﻣﻲ ﺷﻮ‪.‬‬ ‫ﻳﻦ ﻧﺘﺎﻳﺞ ﻣﻮﺟﺐ ﺷﺪ ‪Genetic‬‬
‫‪Child 2: 1000001010‬‬
‫ﻧﺮ‪ B‬ﻫﺎ  ‪ ،‬ﻧﺮ‪ B‬ﻫﺎﻳﻲ ﻫﺴﺘﻨﺪ ﻛﻪ ﻃﻼﻋﺎ‪V‬‬ ‫‪  programming‬ﺑﻪ  ﻟﻴﻞ ‪$#‬ﻣﺎﻳﺶ ﻛﻨﻴﻢ ‪:‬‬
‫ ‪ $‬ﻣﺤﻴﻂ ﻳﺎﻓﺖ ﻣﻲ ﻛﻨﻨﺪ‪ .‬ﻧﺮ‪ B‬ﻫﺎ ﺧﺮﺟﻲ‬ ‫ ‪ , Genetic programming‬ﻳﻚ ‪GA‬‬ ‫‪ $ -7‬ﻧﻘﻄﻪ ﻧﻈﺮ ﺗﺌﻮ ﺟﺴﺘﺠﻮ ﻛﻨﻴﻢ ﻛﻪ ﺑﻔﻬﻴﻢ‬
‫ﻋﻤﺎﻟﻲ  ﻓﺮﻫﻢ ﻣﻲ ﻛﻨﻨﺪ ﻛﻪ ﺑﺮ ﻣﺤﻴﻂ ﺗﺎﺛﻴﺮ ﻣﻲ‬ ‫ﺑﺮ‪ Q‬ﺳﺘﻨﺘﺎ‪ F‬ﻳﻚ ﺟﻤﻌﻴﺖ ﻛﻪ ‪ fit‬ﺷﺒﻜﻪ ﻋﺼﺒﻰ ‬ ‫ﭼﻪ ﻳﺎﻓﺘﻪ ﻫﺎ‪ Q‬ﻏﻴﺮ ﻋﺎ‪ Q‬ﺑﻪ ﺟﻮ ‪#‬ﻣﺪ ﺳﺖ ‪,‬‬
‫ﮔﺬﻧﺪ‪ .‬ﻛﻨﻮ‪ B‬ﺑﻪ ﻣﺎ ﺟﺎ‪ $‬ﻫﻴﺪ ﻛﻪ ﺑﻪ ﺑﺮﺳﻲ ﻳﻚ‬ ‫ﻓﺰﻳﺶ ﻣﻰ ﻫﺪ ﺳﺘﻔﺎ ﻣﻰ ﺷﻮ ‪.‬‬ ‫‪ $ -K‬ﻧﻘﻄﻪ ﻧﻈﺮ ﻛﺎﺑﺮ‪ Q‬ﻛﻪ ﻣﺎﻳﻠﻴﻢ ‪ $‬ﻛﺮ‪# U‬‬
‫ﻣﺜﺎ‪ [1] 7‬ﻛﻪ ﻫﻤﭽﻨﻴﻦ ﺑﺮ ﺗﻮﺿﻴﺢ ‪$#‬ﻣﺎﻳﺶ ﻫﺎ ‬ ‫‪ Fitness‬ﻫﺮ ﺷﺒﻜﻪ ﻋﺼﺒﻰ ﺑﺎ ﭼﮕﻮﻧﮕﻰ ﺧﻮ‪J‬‬ ‫)ﺗﺌﻮ ﭘﻴﺸﻨﻬﺎ‪ ( Q‬ﺑﺮ‪ Q‬ﺻﻼ‪ f‬ﻧﺘﺎﻳﺞ ‪De Garis‬‬
‫ﻳﻦ ﮔﺰ' ﺳﺘﻔﺎ ﺷﺪ ﺳﺖ ﺑﭙﺮ‪$‬ﻳﻢ‪.‬‬ ‫ﻛﺮ‪ B‬ﻳﻚ ﻓﺘﺎ ﻣﻄﻠﻮ‪ J‬ﻛﻪ  ﺣﺎ‪ 7‬ﺟﺮ ﺳﺖ ﻧﺪ‪$‬‬ ‫ﺳﺘﻔﺎ ﻛﻨﻴﻢ ‪,‬ﺟﺎ‪ B $‬ﺑﻪ ﻓﺘﺎ ﺑﻬﺘﺮ ‪ ,‬ﻛﻪ ‬
‫ﻣﺎ ﻣﻲ ﺧﻮﻫﻴﻢ ﺑﻪ ﻣﺜﺎ‪  7‬ﭘﻴﻤﺎ )‪(Walker‬‬ ‫ﮔﻴﺮ‪ Q‬ﻣﻰ ﺷﻮ ‪ .‬ﺑﺮ‪ Q‬ﺳﺘﻔﺎ ‪ GA $‬ﺑﺮ‪ Q‬ﻳﻦ‬ ‫‪$‬ﻣﺎ‪ B‬ﻛﻤﺘﺮ ﺗﻌﻠﻴﻢ ﺑﺒﻴﻨﺪ ‪.‬‬
‫ﺟﻮ‪ u‬ﻛﻨﻴﻢ ‪  .‬ﻳﻦ ﻣﺜﺎ‪ 7‬ﻳﻚ ‪ GenNet‬ﻛﻨﺘﺮ‪7‬‬ ‫ﻫﺪ‪ , P‬ﺋﻪ ﻳﻚ ﺷﺘﻪ ﺑﻴﺘﻰ ‪ $‬ﺷﺒﻜﻪ ﻋﺼﺒﻰ ﻣﻮ‬
‫ﻳﻚ ﻣﺠﻤﻮﻋﻪ ﭘﺎﻳﻪ ﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ  ﺑﺮ ﻋﻬﺪ ‪.‬‬
‫ﺑﻪ ﺳﻴﻠﻪ ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺷﻴﻮ ﺣﺮﻛﺖ ‪#‬ﻣﻮﺧﺘﻪ ﻣﻲ‬
‫ﺷﻮ ﺗﺎ ﺑﺘﻮﻧﻨﺪ  ﻧﺪ ‪ GenNet .‬ﺑﻪ ﺳﻴﻠﻪ ‪De‬‬
‫‪ Garis‬ﻣﻄﺮ‪ f‬ﺷﺪ ﻛﻪ ﺷﺎﻣﻞ ‪ 12‬ﻧﺮ‪ B‬ﻣﻲ ﺑﺎﺷﺪ ﻛﻪ‬
‫ﻧﻴﺎ‪ $‬ﺳﺖ ﻫﻤﭽﻨﻴﻦ ﺑﻪ ﻳﻚ ﺗﺎﺑﻊ ‪ Fitness‬ﻛﻪ ‪B#‬‬
‫ﭼﮕﻮﻧﮕﻰ ﺧﻮ‪ J‬ﺷﺪ‪ B‬ﻳﻚ ﺷﺒﻜﻪ ﻋﺼﺒﻰ  ﻧﺸﺎ‪ B‬ﻣﻰ‬
‫ﻫﺪ ﻧﻴﺰ ﻧﻴﺎ‪ $‬ﺧﻮﻫﺪ ﺑﻮ‪ .‬ﻳﻦ ﻫﺎ ﻣﻮﺿﻮﻋﺎﺗﻰ ﻫﺴﺘﻨﺪ‬
‫ﻛﻪ  ﻗﺴﻤﺖ ﺑﻌﺪ ﺑﻪ ‪#‬ﻧﻬﺎ ﭘﺮﺧﺘﻪ ﻣﻰ ﺷﻮ ‪.‬‬
‫‪ -2‬ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ‬
‫ﻛﺘﺎ‪Adaptation in Natural and " J‬‬
‫‪ " Artificial Systems‬ﻣﺴﺎﺋﻞ ﻣﻬﻢ ﻣﺮﺑﻮ‪i‬‬
‫ﻫﺸﺖ ﻧﺮ‪   B‬ﭼﻬﺎ ﻧﺮ‪ B‬ﺧﺮﺟﻲ ﻣﻲ ﺑﺎﺷﺪ‬ ‫ﺑﻪ ﻟﮕﻮﻳﺘﻤﻬﺎ‪ Q‬ژﻧﺘﻴﻚ  ﻣﻄﺮ‪ f‬ﻣﻰ ﻛﻨﺪ ‪ .‬ﻳﻚ‬
‫‪ .‬ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ ‪  $‬ﭘﺎ ﻛﻪ  ﻣﻔﺼﻞ ‪ B‬ﺑﻪ‬ ‫ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺗﺸﻜﻴﻞ ﺷﺪ ﺳﺖ ‪ $‬ﻳﻚ ﺟﻤﻌﻴﺖ‬
‫ﻫﻢ ﻣﺘﺼﻞ ﺷﺪ ﻧﺪ ﺗﺸﻜﻴﻞ ﻣﻴﺸﻮﻧﺪ ﻫﺮ ﭘﺎ ﺷﺎﻣﻞ ﻳﻚ‬ ‫‪ $‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ‪ Q‬ﻟﻴﻪ ‪ ,‬ﻛﻪ ‪#‬ﻧﻬﺎ ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ‪ Q‬ﺟﺪﻳﺪ‬
‫‪  B‬ﻳﻚ ﻣﺎﻫﻴﭽﻪ ﺳﺎ‪ r‬ﭘﺎ ﺳﺖ ﻛﻪ  ‪$‬ﻧﻮ ﺑﻪ ﻫﻢ‬ ‫) ﺑﻪ ﻫﻤﺮ ﺗﻌﺪ‪ Q‬ﺗﻮﻟﻴﺪ ﻧﺴﻞ (  ﺑﺮ ﻃﺒﻖ ﻛﺎﻳﻰ‬
‫ﻣﺘﺼﻞ ﻣﻲ ﺷﻮﻧﺪ‪.‬‬ ‫ﺷﺎ‪  (fitness ) B‬ﻳﻚ ﻣﺤﻴﻂ ﺗﻮﻟﻴﺪ ﻣﻰ ﻛﻨﻨﺪ‪.‬‬
‫ﻳﻦ ﺑﻪ ﺳﻴﻠﻪ ﭼﻬﺎ ﻗﻄﻌﻪ ﻧﺸﺎ‪  B‬ﺷﺪ ﺳﺖ‪.‬‬ ‫ﻛﺮﻣﻮ‪$‬ﻣﻬﺎﻳﻰ ﻛﻪ  ﺑﻴﺸﺘﺮﻳﻦ ﻛﺎﻳﻲ ﻫﺴﺘﻨﺪ ‪,‬‬
‫)ﻳﻜﻲ ﺑﺮ ﻫﺮ ﻣﺎﻫﻴﭽﻪ ﺳﺎ‪ r‬ﭘﺎ  ‪ (B‬ﭼﻨﺎﻧﭽﻪ ﭘﺎﻫﺎ‬ ‫ﺑﻴﺸﺘﺮﻳﻦ ﺣﺘﻤﺎ‪  7‬ﺑﺮ‪ Q‬ﺑﻘﺎء ﻧﺪ‪ .‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ ‬
‫ﺣﺮﻛﺖ ﻛﻨﻨﺪ ‪ ،‬ﻣﻲ ﺗﻮﻧﻴﻢ ‪$‬ﻳﻪ  ﺳﺮﻋﺖ ‪$‬ﻳﻪ ‬ ‫ﺑﻪ  ﺑﺎ ﻫﻢ ﺗﺮﻛﻴﺐ ﻣﻰ ﺷﻮﻧﺪ  ﻓﺮ‪$‬ﻧﺪ‪  B‬ﻳﺠﺎ ﻣﻰ‬
‫‪39‬‬ ‫ﻫﺮ ﻗﻄﻌﻪ  ﻳﺎﻓﺖ ﻛﻨﻴﻢ‪ .‬ﻳﻦ ﻃﻼﻋﺎ‪ V‬ﺑﻪ ﺳﻴﻠﻪ ‪8‬‬
‫ﻧﺮ‪  B‬ﻳﺎﻓﺖ ﻣﻲ ﺷﻮ ﭼﻬﺎ ﻧﺮ‪ B‬ﺧﺮﺟﻲ‬
‫ﻛﻨﻨﺪ ‪ .‬ﻓﺮ‪$‬ﻧﺪ‪ B‬ﺑﻪ ﺳﻴﻠﻪ ﻋﻤﺎ‪ 7‬ﻧﺪ‪ K‬ﭘﺮﺗﻮﻫﺎ‪Q‬‬
‫ژﻧﺘﻴﻜﻰ ﺑﺮ ‪ Q‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ )ﻟﺪﻫﺎ( ﻳﺠﺎ ﻣﻰ ﺷﻮﻧﺪ‬
‫ﺑﺮ ﻧﻤﺎﻳﺶ ﺷﺘﺎ‪$ J‬ﻳﻪ  ﻛﻪ ﺑﻪ ﻫﺮ ﻗﻄﻌﻪ ﻓﺮﺳﺘﺎ‬ ‫‪ .‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ‪ Q‬ﻳﻚ ﺟﻤﻌﻴﺖ‪  ،‬ﺑﻪ  ﺑﻪ ﻫﻤﺮ‬
‫ﻣﻲ ﺷﻮ ﺑﻪ ﻛﺎ ﻣﻲ ‪).‬ﺷﻜﻞ  ﺑﺒﻴﻨﻴﺪ(‬ ‫ﭘﺮﺗﻮﻫﺎ‪ Q‬ژﻧﺘﻴﻜﻰ ﺗﺮﻛﻴﺐ ﻣﻰ ﺷﻮﻧﺪ ﺗﺎ ﻳﻚ ﻫﺒﺮ‬
‫ﺟﺴﺘﺠﻮ  ﺟﺮ ﻛﻨﻨﺪ ‪ ,‬ﻛﻪ ﻳﻦ ﻫﺒﺮ ﺟﺴﺘﺠﻮ‬
‫ﻓﺮﺿﻴﺎﺗﻰ ﺑﺎ ﻓﻀﺎ‪ Q‬ﺟﺴﺘﺠﻮ  ﻧﻈﺮ ﻣﻰ ﮔﻴﺮ ‬
‫ﻛﺮﻣﻮ‪ K$‬ﻛﺎ‪#‬ﻣﺪﺗﺮ  ﻧﺘﺨﺎ‪ J‬ﻣﻰ ﻛﻨﺪ ‪.‬‬
‫ﻫﺮ ﻛﺮﻣﻮ‪ K$‬ﻳﻚ ﺟﻤﻌﻴﺖ ‪ ,‬ﻳﻚ ﻧﻘﻄﻪ  ﻓﻀﺎ‪Q‬‬
‫ﺟﺴﺘﺠﻮ ﺳﺖ ‪ .‬ﻳﻚ ﻛﺮﻣﻮ‪ GA  K$‬ﺑﺎ ﻳﻚ‬
‫ﺳﺎ ﺷﺸﻢ‪ ،‬ﺷﻤﺎ ‪ ،16‬ﺑﻬﺎ ‪86‬‬

‫ﺷﺘﻪ ﺑﻴﺘﻰ ﺑﻪ ﻃﻮ‪ n 7‬ﻧﻤﺎﻳﺶ  ﻣﻰ ﺷﻮ ‪ .‬‬

‫ﻧﺘﻴﺠﻪ ﻫﺮ ﻛﺮﻣﻮ‪ K$‬ﻧﻤﺎﻳﻨﺪ ﻳﻚ ﻧﻘﻄﻪ  ﻓﻀﺎﻳﻰ‬
‫ﺑﻪ ﻧﺪ‪ n^2 $‬ﺳﺖ ‪.‬ﺑﺮ‪ Q‬ﺋﻪ ﻳﻚ ﺷﺘﻪ ﺑﻴﺘﻲ‬
‫ﻣﻌﻴﻦ ‪ ,‬ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﻧﺴﻞ ﺟﺪﻳﺪ  ﺑﺎ ﺳﺘﻔﺎ ‪$‬‬
‫ﭘﺮﺗﻮﻫﺎ‪ Q‬ژﻧﺘﻴﻜﻰ ﻛﺮ‪) # U‬ﺗﺮﻛﻴﺐ (  ﺟﻬﺶ‬
‫ ﻳﻦ ﻣﺜﺎ‪ 7‬ﻣﻲ ﺗﻮﻧﻴﻢ ‪ $‬ﺷﺒﻜﻪ ﻫﺎ ﺑﻪ ﻋﻨﻮ‪B‬‬
‫ﺗﻮﻟﻴﺪ ﺧﻮﻫﺪ ﻛﺮ ‪.‬‬
‫ﻳﻚ ﻛﻨﺘﺮﮔﺮ ﺑﺮ ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ ﺳﺘﻔﺎ ﻛﻨﻴﻢ‬
‫ﺑﺮ ﻫﺮ ﺣﺎﻟﺖ  ) ﺑﻪ ﻋﺒﺎ‪ V‬ﻳﮕﺮ ‪$‬ﻳﻪ ﻫﺎ ‬ ‫ﭘﺮﺗﻮ ﺟﻬﺶ  ﺳﻄﺢ ﻳﻚ ﺑﻴﺖ ‪ ,‬ﺑﻪ ﻃﻮ ﺗﺼﺎﻓﻰ‬
‫ﺳﺮﻋﺖ ‪$‬ﻳﻪ  ﻫﺎ( ‪ GenNet‬ﻳﻚ ﻣﺠﻤﻮﻋﻪ ﺷﺘﺎ‪J‬‬ ‫ﺑﻴﺘﻬﺎ   ﺧﻞ ﺟﻤﻌﻴﺖ ﺟﺎ‪ Q‬ﻣﻌﻜﻮ‪ U‬ﻣﻰ ﻛﻨﺪ‬
‫‪ -3‬ﺷﺒﻜﻪ ﻋﺼﺒﻲ * ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻲ ژﻧﺘﻴﻜﻲ‬ ‫‪ .‬ﻧﺮ‪ m‬ﺟﻬﺶ ﻛﻢ ﺳﺖ ‪ ,‬ﻣﻌﻤﻮﻻً  ﺣﺪ ﻳﻚ ﻫﺰ‪K‬‬
‫‪$‬ﻳﻪ  ﻛﻪ ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ  ﻛﻨﺘﺮ‪ 7‬ﻣﻲ ﻛﻨﺪ‬
‫ﺗﻮﻟﻴﺪ ﺧﻮﻫﺪ ﻛﺮ ‪ .‬ﻳﻦ ﺷﺘﺎ‪ J‬ﻫﺎ ‪$‬ﻳﻪ ‪$ ،‬ﻳﻪ‬ ‫‪ .‬ﭘﺮﺗﻮ ﻛﺮ‪ Q # U‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ ﻋﻤﻞ ﻣﻰ ﻛﻨﺪ‬
‫ﻛﻼ‪ U‬ﺷﺒﻜﻪ ﻫﺎ‪ Q‬ﻋﺼﺒﻰ )‪ ( NNs‬ﻳﻚ ‪$‬ﻳﺮ‬
‫ﻫﺎ  ﺳﺮﻋﺖ ‪$‬ﻳﻪ  ﻗﻄﻌﺎ‪  V‬ﺗﻐﻴﻴﺮ ﺧﻮﻫﻨﺪ ‬ ‫‪ .‬ﻧﻘﻄﻪ ﻛﺮ‪ # U‬ﺑﻪ ﻃﻮ ﻧﺪ‪ K‬ﻧﺘﺨﺎ‪ J‬ﻣﻰ ﺷﻮ ‪,‬‬
‫ﻛﻼ‪ $ U‬ﻣﺪﻟﻬﺎ‪ Q‬ﭘﺮ‪ '$‬ﺗﻮ‪$‬ﻳﻊ ﺷﺪ ﻣﻮ‪Q$‬‬
‫ﺑﺮ ‪  GenNet‬ﻫﺎ ﺟﺪﻳﺪ  ﻓﺮﻫﻢ ﻣﻲ‬ ‫ﺑﺮ  ﻛﺮﻣﻮ‪$‬ﻣﻰ ) ‪ ( parents‬ﻛﻪ ﺑﻪ ﻃﻮ ﻧﺪ‪K‬‬
‫)‪( PDP‬ﺳﺖ ‪ .‬ﻣﺪﻟﻬﺎ‪ PDP Q‬ﻓﺮ‪ q‬ﻣﻰ ﻛﻨﻨﺪ ﻛﻪ‬
‫ﻛﻨﻨﺪ‪.‬‬ ‫ﻧﺘﺨﺎ‪ J‬ﺷﺪ ﻧﺪ ‪ .‬ﻳﻦ ﻧﻘﻄﻪ ﺑﻴﻦ ﺑﻴﺘﻬﺎ‪ Q‬ﻛﺮﻣﻮ‪$‬ﻣﻬﺎ‬
‫ﻃﻼﻋﺎ‪  V‬ﺣﺎ‪ 7‬ﭘﺮ‪ '$‬ﻳﻚ ﻧﺘﻴﺠﻪ ‪ $‬ﻣﺤﺎ ﺑﻴﻦ‬
‫ﻗﻊ ﺷﺪ ﺳﺖ  ﻫﺮ ﻛﺮﻣﻮ‪  K$‬ﺑﻪ  ﻗﺴﻤﺖ ﺳﻤﺖ‬
‫ﻫﺪ‪ GenNet $ P‬ﺑﻪ ﻋﻨﻮ‪ B‬ﻳﻚ ﺷﺒﻴﻪ ﺳﺎ‪$‬‬ ‫ﻋﻨﺎﺻﺮ ﺳﺎ  ﺣﺎ‪ 7‬ﭘﺮ‪ '$‬ﺳﺖ ‪Genetic  .‬‬
‫ﭼﭗ  ﺳﺖ ﺗﻘﺴﻴﻢ ﻣﻰ ﻛﻨﺪ ‪ ,‬ﻛﺮ‪  # U‬ﻧﻬﺎﻳﺖ‬
‫‪$‬ﻣﺎ‪ B‬ﺟﺪﮔﺎﻧﻪ ﻛﻪ ﻳﻦ ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ  ﺑﺎ‪$‬‬ ‫‪ programming‬ﺗﻌﺪ ﻧﺮﻧﻬﺎ ﻣﺠﻤﻮﻋﻪ ‪ Q‬ﺑﺎ‬
‫ﻗﺴﻤﺖ ﺳﻤﺖ ﭼﭗ ) ﻳﺎ ﺳﺖ (  ﻛﺮﻣﻮ‪  K$‬ﺑﺎ‬
‫‪$‬ﻣﺎﻧﻲ ﻛﻮﺗﺎ ﺣﺮﻛﺖ ﻛﻨﻨﺪ ﺳﺘﻔﺎ ﻣﻲ ﺷﻮ‪ .‬ﻳﻚ‬ ‫ﻛﺎﺑﺮ ﺳﺖ ‪ .‬ﻳﻦ ﺗﻌﺪ ﺑﻪ ﻓﺘﺎ‪ Q‬ﻛﻪ ﻣﻰ ‪#‬ﻣﻮ‪$‬ﻧﺪ‬
‫ﻳﻜﺪﻳﮕﺮ ﺟﺎ ﺑﻪ ﺟﺎ ﻣﻰ ﻛﻨﺪ ‪.‬‬
‫ﺳﺮ ‪$‬ﻧﻬﺎ ﺑﺎ ﻣﻘﺎﻳﺮ ﻣﻌﻴﻦ ﺧﺘﻴﺎ  ‪GenNet‬‬ ‫ﺑﺴﺘﻪ ﻫﺴﺘﻨﺪ ‪.‬‬
‫ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ   ﻣﺪﻟﻬﺎ ﺗﺼﺎﻓﻲ ﺣﺮﻛﺖ‬ ‫ﻳﻚ ﻣﺜﺎ‪  7‬ﺑﻄﻪ ﺑﺎ ﻛﺮ‪  : # U‬ﻛﺮﻣﻮ‪K$‬‬
‫ﺷﺒﻜﻪ ﻛﺎﻣﻼ ﻣﺘﺼﻞ ﺳﺖ ) ﻫﺮ ﻧﺮ‪ B‬ﻳﻚ ﺗﺒﺎ‪i‬‬
‫ﺧﻮﻫﻨﺪ   ﺻﻮﺗﻴﻜﻪ ﺑﺎ ‪ B$‬ﻫﺎ ﻣﻨﺎﺳﺐ ﻳﻦ‬ ‫)‪$ ( parents‬ﻳﺮ   ﻧﻈﺮ ﺑﮕﻴﺮﻳﺪ‬
‫‪ $‬ﺧﻮ' ﺑﻪ ﺗﻤﺎ‪ K‬ﻧﺮﻧﻬﺎ‪ Q‬ﻳﮕﺮ  ﺑﻪ ﻫﻤﺮ ﻣﻘﺪ‬
‫ﻣﻜﺎ‪ B‬ﺑﺮ ‪ GenNet‬ﺟﻮ  ﻛﻪ ﭘﺎﻫﺎ ﺑﻪ‬ ‫ﺧﺎﻟﺺ ‪$‬ﻧﺸﺎ‪  B‬ﻧﺞ ‪ 1,0-‬ﺗﺎ ‪Q .( 1,0‬‬
‫ﻫﻢ ﻣﺘﺼﻞ   ﭼﻨﻴﻦ ﻫﻲ ﺑﻪ ﻋﻨﻮ‪ B‬ﻣﺜﺎ‪ 7‬ﺑﺮ‬ ‫ﺧﺎﻟﺺ ﻫﺮ ﻧﺮ‪ ) B‬ﻗﺎﻧﻮ‪  ( propagation B‬ﻗﻊ‬ ‫‪Parent 1: 1010101010‬‬
‫ﻧﻤﺎﻳﺶ ﻓﺘﺎ  ﻓﺘﻦ ﻛﻨﺘﺮ‪ 7‬ﻛﻨﺪ  ﻗﻊ ﻫﺪ‪، P‬‬ ‫ﻣﺠﻤﻮ‪ u‬ﺣﺎﺻﻠﻀﺮﺑﻬﺎ‪ Q‬ﻳﻬﺎﻳﺶ  ‪$‬ﻧﻬﺎﻳﺶ ﺳﺖ‬ ‫‪Parent 2: 1000010000‬‬
‫ﻳﺎ ﮔﺮﻓﺘﻦ ‪$‬ﻧﻬﺎ ﻣﻨﺎﺳﺐ ﺳﺖ‪.‬‬ ‫‪ .‬ﺧﺮﺟﻰ ﻫﺮ ﻧﺮ‪, B‬ﻓﻌﺎﻟﻴﺖ )‪B# ( activation‬‬
‫ﻓﺮ‪ q‬ﻛﻨﻴﺪ ﻧﻘﻄﻪ ﻛﺮ‪ # U‬ﺑﻪ ﻃﻮ ﺗﺼﺎﻓﻰ‬

‫‪www.IrPDF.com‬‬
 ‫‪www.IrPDF.com‬‬
‫ﺻﻔﺤﻪ ﺑﻌﺪ‬ ‫ﻓﻬﺮﺳﺖ‬ ‫ﺟﻠﺪ‬ ‫ﺻﻔﺤﻪ ﻗﺒﻞ‬ ‫‪Zoom out Zoom in‬‬

‫ﻧﺮ ﻓﺰ‬
‫ﺷﻴﻮ ﺻﺤﻴﺢ  ﻓﺘﻦ  ﻧﺠﺎ‪ K‬ﻣﻲ ﻫﻨﺪ ﺑﻪ ﺳﻴﻠﻪ‬ ‫ ﺗﻌﻴﻴﻦ ﻣﻲ ﻛﻨﺪ  ﻣﻲ ﺗﻮﻧﺪ ﺑﻪ ﻋﻨﻮ‪ B‬ﻳﻚ ﺷﺘﻪ‬ ‫ ﻣﺜﺎ‪ 7‬ﻧﺎﻣﺒﺮ ‪ ،‬ﻟﮕﻮﻳﺘﻢ ژﻧﺘﻴﻚ ﺑﺮ ﻳﺎﮔﻴﺮ‬
‫‪ B#‬ﻓﺮ ﺑﺮﻣﻲ ﮔﺮ‪.‬‬ ‫ﺑﻴﺖ  ﺳﻄﺮﻫﺎ ﺑﺰگ ﻣﻨﻈﻢ ﻧﻤﺎﻳﺶ  ﺷﻮ‪.‬‬ ‫‪ B$‬ﻫﺎ ‪ GenNet‬ﺳﺘﻔﺎ ﺷﺪ ﺳﺖ‪ .‬ﻳﻦ ﺑﻪ‬
‫ﻳﻚ ﺗﺎﺑﻊ ‪ Fitness‬ﺳﺖ ﻣﺴﺎﻓﺖ ﭘﻴﻤﻮ ﺷﺪ ﺑﻪ‬ ‫ﻫﺮ ﻓﺮ ﻣﺘﻌﻠﻖ ﺑﻪ‪  ، GA‬ﻳﻚ ﻣﺎﺗﺮﻳﺲ ‪ B$‬ﻃﻮﻟﻲ‬ ‫ﻳﻚ ﺷﺘﻪ ﺑﻴﺖ ﺑﺮ ﻧﻤﺎﻳﺶ ﺷﺒﻜﻪ ﻫﺎ ﻋﺼﺒﻲ ﻧﻴﺎ‪$‬‬
‫ﺳﻴﻠﻪ ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ  ﻣﺤﺎﺳﺒﻪ ﻣﻲ ﻛﻨﺪ‪ .‬ﻓﺮ‬ ‫ﻧﻤﺎﻳﺶ  ﻣﻲ ﺷﻮ ﮔﺮ‪ n‬ﻧﺮ‪ B‬ﻋﺼﺒﻲ  ﺷﺒﻜﻪ‬ ‫  ﻳﻚ ﺗﺎﺑﻊ ‪ Fitness‬ﻛﻤﻴﺘﻲ ﺳﺖ ﻛﻪ ﺗﻌﻴﻴﻦ‬
‫ﺑﻬﺘﺮ‪ ،‬ﺟﻠﻮﺗﺮ ﺣﺮﻛﺖ ﻣﻲ ﻛﻨﺪ )ﺑﻪ ﻋﺒﺎ‪ V‬ﻳﮕﺮ ﺑﻬﺘﺮ‬ ‫ﺟﻮ ﺷﺘﻪ ﺑﺎﺷﺪ ‪  Bn‬ﺑﻴﺘﻲ ﻫﺴﺘﻨﺪ ﻛﻪ ﺑﺮ‬ ‫ﻣﻲ ﻛﻨﺪ ﭼﮕﻮﻧﻪ ' ﺧﻮﺑﻲ ﺑﺮ  ﻓﺘﻦ ﺑﻪ ﺳﺖ‬
‫ ﻣﻲ (  ﺷﺘﺒﺎﻫﺎ‪ V‬ﻓﺮ  ﺣﺮﻛﺖ  ﺧﻴﻠﻲ‬ ‫ﻫﺮ ﻓﺮ ﻻ‪ K$‬ﺳﺖ‪ .‬ﺑﺮ ﭘﺎﻫﺎ ﺑﻪ ﻫﻢ ﻣﺘﺼﻞ ‪De‬‬ ‫‪#‬ﻳﻢ‪  .‬ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻲ ژﻧﺘﻴﻜﻲ ﻫﺮ ﻣﻘﺪ ﻗﻌﻲ‬
‫ﻛﻢ‪ m ،‬ﻣﻲ ﻫﺪ‪ .‬ﻫﺪ‪ P‬ﭘﻴﺪ ﻛﺮ‪ B‬ﻳﻚ ﻣﺠﻤﻮﻋﻪ ‪$‬‬ ‫‪ Garis‬ﻫﺮ ‪  B$‬ﺑﻪ ﺳﻴﻠﻪ ﻫﻔﺖ ﺑﻴﺖ ﻧﻤﺎﻳﺶ ‬ ‫‪ B$‬ﺑﻪ ﺳﻴﻠﻪ ﻳﻚ ﻣﺠﻤﻮﻋﻪ ﻋﺪ ‪ $‬ﺑﻴﺘﻬﺎ ﻧﻤﺎﻳﺶ‬
‫‪ B$‬ﻫﺎﻳﻲ ﺳﺖ ﻛﻪ ﺑﻪ ﺳﻴﻠﻪ ‪ Gen Net‬ﻧﺘﻴﺠﻪ ﻣﻲ‬ ‫ﻧﺘﻴﺠﻪ ﻳﻨﻜﻪ  ﻫﺮ ﻓﺮ ﺑﻌﺪ ‪ $‬ﻳﻨﻜﻪ ‪ 12‬ﻧﺮ‪ B‬‬ ‫ ﻣﻲ ﺷﻮﻧﺪ ‪ $ .‬ﻳﻦ  ﻫﺮ ﻧﺮ‪ B‬ﺑﺎ ﺑﻘﻴﻪ ) ‪ $‬ﺟﻤﻠﻪ‬
‫ﺷﻮ  ﺷﻴﻮ ﺻﺤﻴﺢ  ﻓﺘﻦ  ﺗﻮﻟﻴﺪ ﺧﻮﻫﺪ ﻛﺮ‪.‬‬ ‫ﺷﺒﻜﻪ ﺟﻮ ﺷﺘﻪ ﺑﺎﺷﺪ ‪ 1008 ،‬ﺑﻴﺖ ﺟﻮ ‪.‬‬ ‫ﺧﻮ' ( ﺗﺒﺎ‪ i‬ﺑﺮﻗﺮ ﻣﻲ ﻛﻨﺪ‪$ .‬ﻧﻬﺎ ‪ n‬ﻧﺮ‪B‬‬
‫ﻗﺴﻤﺘﻲ ‪ $‬ﻃﺮ‪ f‬ﻛﻠﻲ ﻛﻪ ﻳﻚ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻲ ژﻧﺘﻴﻜﻲ‬ ‫ﺗﺎﺑﻊ ‪ Fitness‬ﻛﻪ ﺑﺮ ‪$‬ﻳﺎﺑﻲ ﻣﺸﺨﺼﺎ‪ V‬ﺑﺮﺗﺮ‬ ‫ﺷﺒﻜﻪ ﻣﻲ ﺗﻮﻧﺪ  ﻳﻚ ﻣﺎﺗﺮﻳﺲ ‪ n‬ﺗﺎﻳﻲ ]ﺧﻴﺮ ﺷﻮ‪.‬‬
‫ﺧﻮ‪  J‬ﺳﻴﺪ‪ B‬ﺑﻪ ﻳﻦ ﻫﺪ‪ P‬ﻣﻮﻓﻖ ﮔﺮﻳﺪ ﺳﺖ‬ ‫ﻓﺮ ﺳﺘﻔﺎ ﻣﻲ ﺷﻮ ﺑﺎﻳﺪ ﺑﻪ ﺳﻴﻠﻪ ﻫﺮ ﻓﺮ ‪$‬‬ ‫ﻫﺮ ﻋﻨﺼﺮ ﻣﺎﺗﺮﻳﺲ ‪ B$‬ﻳﻜﻲ ‪ $‬ﺗﺒﺎ‪ i‬ﻫﺎ  ]ﺧﻴﺮ‬
‫ ﻧﺒﺎ‪ 7‬ﻧﻤﺎﻳﻴﺪ‪.‬‬ ‫ﺟﻤﻌﻴﺖ ﭘﺬﻳﺮﻓﺘﻪ ﺷﻮ  ﺑﻌﻀﻲ ﻛﻤﻴﺖ ﻫﺎﻳﻲ ﻛﻪ‬ ‫ﻣﻲ ﻛﻨﺪ‪ .‬ﻫﺮ ﻣﺎﺗﺮﻳﺲ ﻳﻚ ‪ GenNet‬ﻣﻨﺤﺼﺮ ﺑﻪ ﻓﺮ‬

‫ﺳﺎ ﺷﺸﻢ‪ ،‬ﺷﻤﺎ ‪ ،16‬ﺑﻬﺎ ‪86‬‬

‫‪40‬‬
‫‪$‬ﺷﻨﺎﻳﻰ ﺑﺎ ‪ ActiveX‬ﻫﺎ‬
‫ﻫﻤﺎﻧﻨﺪ ﻫﺮ ﺻﻨﻌﺖ ﻳﮕﺮ‪ ، Q‬ﻛﺎ‪#‬ﻳﻰ ﻳﻜﻰ ‪ $‬ﻏﺪﻏﻪ ﻫﺎ‪ Q‬ﺻﻠﻰ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﺎ‪ B‬ﺳﺖ ﻳﻜﻰ ‪ $‬ﺟﻨﺒﻪ ﻫﺎ‪ Q‬ﻣﻬﻢ ﻛﺎ‪#‬ﻳﻰ ﺟﺘﻨﺎ‪ $ J‬ﺑﺎ ﻛﺎ‪ Q‬ﺳﺖ ‪ .‬ﮔﺮ ﻛﺪ‪Q‬‬
‫ﻧﻮﺷﺘﻪ ﻳﺪ ﻛﻪ ﻛﺎ ﺧﺎﺻﻰ  ﻧﺠﺎ‪ K‬ﻣﻰ ﻫﺪ ‪ ،‬ﭼﺮ ﺑﺎﻳﺪ ﻓﻌﻪ ﺑﻌﺪ ﻫﻤﺎ‪ B‬ﻛﺪ  ﺑﺎ ﺑﻨﻮﻳﺴﻴﺪ؟ ﻟﻴﻦ ﮔﺎ‪   K‬ﺳﺘﻔﺎ ﻣﺠﺪ ‪ $‬ﻛﺪﻫﺎ ‪ ،‬ﻣﻔﻬﻮ‪$ K‬ﻳﺮ ﻣﺠﻤﻮﻋﻪ ﻳﺎ‬
‫‪ Procedure 7‬ﺳﺖ ‪ .‬ﻛﺪ‪  Q‬ﻳﻜﺒﺎ ﻣﻰ ﻧﻮﻳﺴﻴﺪ  ‪ B# $‬ﺑﻪ ﺑﻌﺪ  ﻫﺮ ﺟﺎ‪ Q‬ﺑﺮﻧﺎﻣﻪ ﻛﻪ ﻻ‪ K$‬ﺑﻮ ﻓﻘﻂ ﻛﺎﻓﻰ ﺳﺖ ‪#‬ﻧﺮ ﺣﻀﺎ ‪ Call‬ﻛﻨﻴﺪ ‪ .‬ﻗﺮ ‪ 7 B‬ﻫﺎ‪Q‬‬
‫ﻛﻠﻰ  ﻳﻚ ﻣﺪ‪ 7‬ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻰ ﻗﺪﻣﻰ ﺑﻪ ﭘﻴﺶ ﺑﻮ ‪ .‬ﺑﺎ ﻳﻦ ﺗﻤﻬﻴﺪ ﻣﻰ ﺗﻮ‪ 7 B# $ B‬ﻫﺎ  ﺑﺮﻧﺎﻣﻪ ﻫﺎ‪ Q‬ﻣﺨﺘﻠﻒ ﺳﺘﻔﺎ ﻛﺮ ‪.‬ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻰ ﻣﺪﻻ ﺳﺎﻟﻬﺎ ﺑﺮﻧﺎﻣﻪ‬
‫ﻧﻮﻳﺴﺎ‪  B‬ﺑﻪ ﺧﻮ ﻣﺸﻐﻮ‪ 7‬ﻛﺮ ﺑﻮ   ﻗﻊ ﻳﻜﻰ ‪ $‬ﻣﺤﺮﻛﻬﺎ‪ Q‬ﺻﻠﻰ ﺗﻮﺳﻌﻪ ﺳﻴﺴﺘﻢ ﻋﺎﻣﻞ ﻳﻨﺪ‪ $‬ﻫﻢ ﻫﻤﻴﻦ ﻳﺪ ﻛﺪﻫﺎ‪ Q‬ﻗﺎﺑﻞ ﺷﺘﺮ€  ﻗﺎﺑﻞ ﺳﺘﻔﺎ ﻣﺠﺪ‬
‫ﺑﻮ ﺳﺖ ‪ .‬ﻟﻴﻦ ﮔﺎ‪   K‬ﭘﻴﺎ ﺳﺎ‪ Q$‬ﻋﻨﺎﺻﺮ ﻣﺪﻻ ﺗﻜﻨﻮﻟﻮژ‪ OLE Q‬ﻳﺎ ‪ Object Linking and Embedding‬ﺑﻮ ‪ .‬ﻫﺪ‪ P‬ﻟﻴﻪ ‪ OLE‬ﻳﺠﺎ ﺳﻨﺪﻫﺎ‪Q‬‬
‫ﻣﺮﻛﺐ ‪ Compound Documents‬ﺑﺎ ﺳﺘﻔﺎ ‪ $‬ﺑﺮﻧﺎﻣﻪ ﻫﺎ‪ Q‬ﻣﺨﺘﻠﻒ ﺑﻮ‪ .‬ﺳﻨﺪ‪ Q‬ﻛﻪ ﻣﻘﺪ‪ Q‬ﻣﺘﻦ  ﻣﻘﺪ‪ Q‬ﻧﻤﻮ  ‪  ،‬ﻫﺮ ﻛﺪ‪# K‬ﻧﻬﺎ ﺑﺎ ﻧﺮ‪ K‬ﻓﺰ ﺧﺎ‪W‬‬
‫ﺧﻮ ﻳﺠﺎ ﺷﺪ ﻧﺪ ‪ ،‬ﻧﻤﻮﻧﻪ ‪ $ Q‬ﻳﻚ ﺳﻨﺪ ﻣﺮﻛﺐ ﺳﺖ ‪ .‬ﻗﺘﻰ ﺑﺎ ﻣﺘﻦ ﻛﺎ ﻣﻰ ﻛﻨﻴﺪ ﻧﺮ‪ K‬ﻓﺰ ژ ﭘﺮ‪ $‬ﻛﻨﺘﺮ‪  7‬ﺑﺪﺳﺖ ﻣﻰ ﮔﻴﺮ  ﻗﺘﻰ ﺑﺎ ﻧﻤﻮﻫﺎ ﻛﺎ ﻣﻰ‬
‫ﻛﻨﻴﺪ ﻧﺮ‪ K‬ﻓﺰ ﺗﺮﺳﻴﻤﻰ ﻣﺴﺌﻮﻟﻴﺖ  ﺑﻪ ﻋﻬﺪ ﻣﻰ ﮔﻴﺮ‪ OLE .‬ﺑﺎ ﺟﻮ ﻛﻨﺪ‪  Q‬ﻣﺸﻜﻼ‪ V‬ﻳﮕﺮ ﻣﺴﻠﻤﺎً ﻗﺪﻣﻰ ﺑﻪ ﭘﻴﺶ ﺑﻮ‪.‬‬
‫ﺗﻜﻨﻮﻟﻮژ‪ OLE Q‬ﺧﻮ ﺑﺮ ﻳﻚ ﺳﺘﺎﻧﺪ ﻛﻠﻰ ﺗﺮ ﺑﻨﺎ‪ COMK‬ﻳﺎ ‪ Component Object Model‬ﺳﺘﻮ ﺳﺖ ‪ .‬ﺑﺰ‪ $ COM Q‬ﺳﻨﺪﻫﺎ‪ Q‬ﻣﺮﻛﺐ ﻓﺮﺗﺮ ﻓﺖ‬
‫ ‪  OLE‬ﻫﻢ ﺑﺪﻧﺒﺎ‪ 7‬ﺧﻮ ﻛﺸﺎﻧﺪ  ‪ B# $‬ﺑﻪ ﺑﻌﺪ ‪ OLE‬ﺻﻄﻼﺣﻰ ﺷﺪ ﺑﺮ‪ Q‬ﻫﺮ ﭼﻴﺰ‪ Q‬ﻛﻪ ‪ $‬ﺗﻜﻨﻮﻟﻮژ‪ COM Q‬ﺳﺘﻔﺎ ﻣﻰ ﻛﺮ ‪.‬ﺳﺎﻟﻬﺎ ﺑﻌﺪ ﻛﻪ ﻣﻴﻜﺮﺳﺎﻓﺖ ﺑﻄﻮ‬
‫ﺟﺪ‪ Q‬ﮔﻴﺮ ﻳﻨﺘﺮﻧﺖ ﺷﺪ‪  ،‬ﺻﻄﻼ‪ Activex f‬ﻫﻢ  ﺑﻴﺎ‪ V‬ﻛﺎﻣﭙﻴﻮﺗﺮ‪ Q‬ﺷﺪ ‪.‬ﺑﺘﺪ ﻳﻦ ﺻﻄﻼ‪ f‬ﻓﻘﻂ  ﺑﻄﻪ ﺑﺎ ﻳﻨﺘﺮﻧﺖ  ‪ J‬ﺑﻮ ﻣﺎ ﺿﺎ‪ u‬ﺑﺪﻳﻦ ﻣﻨﻮ‪ 7‬ﺑﺎﻗﻰ‬
‫ﻧﻤﺎﻧﺪ  ﻛﻨﻮ‪ Activex B‬ﺑﻪ ‪ B#‬ﺑﺨﺶ ‪ $‬ﺗﻜﻨﻮﻟﻮژﻳﻬﺎﻳﻰ ‪ COM‬ﮔﻔﺘﻪ ﻣﻰ ﺷﻮ ﻛﻪ  ‪#‬ﻧﻬﺎ ﻳﻚ ﻗﻄﻌﻪ ﻧﺮ‪ K‬ﻓﺰ‪ Q‬ﻣﻜﺎﻧﺎ‪ V‬ﺧﻮ   ﺧﺘﻴﺎ ﺑﺮﻧﺎﻣﻪ ﻫﺎ‪ Q‬ﻳﮕﺮ ﻣﻰ‬
‫ﮔﺬ ‪ .‬ﻳﻜﻰ ‪ $‬ﻋﺎﻫﺎ‪ ( Activex Q‬ﻛﻪ ﺑﻮﻳﮋ ﺑﻪ ﻳﻨﺘﺮﻧﺖ ﻣﺮﺑﻮ‪ i‬ﻣﻰ ﺷﻮ( ﭘﺸﺘﻴﺒﺎﻧﻰ ‪ $‬ﻧﺮ‪ K‬ﻓﺰﻫﺎ‪ Q‬ﺗﻮ‪$‬ﻳﻊ ﺷﺪ ‪ Distributed‬ﺳﺖ ‪  ،‬ﻳﻦ ﻳﻌﻨﻰ ‪ ،‬ﻛﻨﺘﺮ‪7‬‬
‫ﻫﺎ‪ Activex Q‬ﺑﻪ ﺷﻤﺎ ﺳﺮﻳﺲ ﺧﻮﻫﻨﺪ  ‪ (،‬ﺣﺘﻰ ﮔﺮ  ﻛﺎﻣﭙﻴﻮﺗﺮ‪ Q‬ﻳﮕﺮ )  ﻫﺰ‪ B‬ﻛﻴﻠﻮﻣﺘﺮ ﺗﺮ ﺑﺎﺷﻨﺪ ﻣﺎ ﭼﻪ ﺑﺮ ﺳﺮ ‪# OLE‬ﻣﺪ ؟ ﻳﻦ ﺗﻜﻨﻮﻟﻮژ‪ Q‬ﺑﺎ‬
‫ﺑﻪ ﺿﻌﻴﺖ ﻟﻴﻪ ' ﺑﺮﮔﺸﺖ  ﻛﻨﻮ‪ B‬ﻓﻘﻂ ﺑﺎ ﺳﻨﺪﻫﺎ‪ Q‬ﻣﺮﻛﺐ ﺳﺮﻛﺎ ‪.‬‬
‫ﻧﻘﺎ‪ 5‬ﺿﻌﻒ * ﻗﻮ‪Activex :/‬‬
‫ﺗﻜﻨﻮﻟﻮژ‪ Activex Q‬ﺑﻬﺘﺮﻳﻦ ﺳﻴﻠﻪ ﺑﺮ‪ Q‬ﻳﺠﺎ ﻣﺤﺘﻮﻳﺎ‪ V‬ﻓﻌﺎ‪ J  7‬ﺳﺖ ‪ .‬ﻟﺒﺘﻪ ﺑﺮﺧﻰ ﺑﺎ ﻳﻦ ﻋﻘﻴﺪ ﻣﺨﺎﻟﻔﻨﺪ  ﺑﺎﻳﺪ ﮔﻔﺖ ﻛﻪ ﻳﻦ ﺗﻜﻨﻮﻟﻮژ‪ Q‬ﻣﺴﻠﻤﺎ ﺗﻨﻬﺎ ﺑﺰ‬
‫ﻣﺤﺘﻮﻳﺎ‪ V‬ﻓﻌﺎ‪ J 7‬ﻧﻴﺴﺖ ‪ .‬ﭘﺲ ﺟﺎ‪ $‬ﻫﻴﺪ ﻧﮕﺎﻫﻰ ﺑﻪ ﺟﻨﺒﻪ ﻫﺎ‪ Q‬ﻣﺜﺒﺖ  ﻣﻨﻔﻰ ﻳﻦ ﺗﻜﻨﻮﻟﻮژﻳﺒﻴﻨﺪ‪$‬ﻳﻢ‪.‬‬
‫ﻧﻘﺎ\ ﻗﻮ‪: Z‬‬
‫ﻳﻜﻰ ‪ $‬ﻣﻬﻤﺘﺮﻳﻦ ﻧﻘﺎ‪ i‬ﻗﻮ‪ Activex V‬ﻗﺪ‪ B# V‬ﺳﺖ ‪ .‬ﻳﻚ ﻛﻨﺘﺮ‪ Activex 7‬ﺗﻘﺮﻳﺒﺎً ‪ $‬ﻋﻬﺪ ﻫﺮ ﻛﺎ‪ Q‬ﻛﻪ ﻳﻚ ﺑﺮﻧﺎﻣﻪ ﻣﻌﻤﻮﻟﻰ ﺑﺘﻮﻧﺪ ﻧﺠﺎ‪ K‬ﻫﺪ ‪ ،‬ﺑﺮﻣﻰ ‪#‬ﻳﺪ‬
‫‪ $ .‬ﻳﺪﮔﺎ ﻳﻚ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺲ ‪ J‬ﻳﻦ ﺑﻬﺘﺮﻳﻦ ﺟﻨﺒﻪ ﻳﻚ ﺑﺰ ﺧﻠﻖ ﻣﺤﺘﻮﻳﺎ‪ V‬ﻳﻨﺎﻣﻴﻚ ﺳﺖ ‪ .‬ﻳﮕﺮ ﺑﺰﻫﺎ‪ Q‬ﻣﺤﺘﻮﻳﺎ‪ V‬ﻓﻌﺎ‪ ، 7‬ﻣﺎﻧﻨﺪ ﺟﺎ  ‪  CGI‬ﻳﻦ ‪$‬ﻣﻴﻨﻪ‬
‫ﺑﺴﻴﺎ ﻣﺤﺪﺗﺮ ‪ Activex $‬ﻫﺴﺘﻨﺪ ‪ .‬ﻧﻜﺘﻪ ﻣﺜﺒﺖ ﻳﮕﺮ ‪ ،‬ﺣﺪﻗﻞ ﺑﺮ‪ Q‬ﺑﺴﻴﺎ‪ $ Q‬ﻓﺮ ‪ ،‬ﻣﻜﺎ‪ B‬ﺳﺘﻔﺎ ‪ $‬ﻣﻬﺎﺗﻬﺎ‪ Q‬ﻋﺎ‪ Q‬ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻰ  ﺧﻠﻖ ﻛﻨﺘﺮ‪ 7‬ﻫﺎ‪Q‬‬
‫‪ Activex‬ﺳﺖ ‪ ' .‬ﻧﺠﺎ‪ K‬ﺑﺎﮔﻴﺮ‪ Q‬ﻫﺎ‪ J Q‬ﻫﻢ ﻳﻜﻰ ‪ $‬ﻣﺰﻳﺎ ‪ Activex‬ﺳﺖ ‪.‬‬
‫ﻧﻘﺎ\ ﺿﻌﻒ – ﻫﻴﭻ ﭼﻴﺰ ﻛﺎﻣﻞ ﻧﻴﺴﺖ !‬
‫ﺷﺎﻳﺪ ﻣﻬﻤﺘﺮﻳﻦ ﺟﻨﺒﻪ ﻣﻨﻔﻰ ‪ Activex‬ﺿﻌﻒ ﻣﻨﻴﺘﻰ ‪ B#‬ﺑﺎﺷﺪ ‪ .‬ﻳﻦ ﺿﻌﻒ ﻇﺎﻫﺮ ﻳﻜﻰ ‪ $‬ﺗﺒﻌﺎ‪ V‬ﺟﺘﻨﺎ‪ J‬ﻧﺎﭘﺬﻳﺮ ﻗﺪ‪  V‬ﻧﻌﻄﺎ‪ P‬ﺗﻜﻨﻮﻟﻮژ‪ Activex Q‬ﺳﺖ ‪.‬‬
‫ﻳﻚ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺲ ﺷﺮ ﻣﻰ ﺗﻮﻧﺪ ﺑﺮﺣﺘﻰ ﺑﺎ ﻳﻦ ﺗﻜﻨﻮﻟﻮژ‪ Q‬ﻧﺮ‪ K‬ﻓﺰ‪ Q‬ﺑﺴﺎ‪ $‬ﻛﻪ ﺑﻪ ﻛﺎﻣﭙﻴﻮﺗﺮ ﻳﮕﺮ‪ B‬ﺻﺪﻣﻪ ﺑﺰﻧﺪ‪ .‬ﻳﻜﻰ ﻳﮕﺮ ‪ $‬ﻧﻘﺎ‪ i‬ﺿﻌﻒ ﺗﻜﻨﻮﻟﻮژ‪B# Activex Q‬‬
‫ﺳﺖ ﻛﻪ ﻓﻘﻂ ﺑﺮﺧﻰ ‪ $‬ﻛﺎﺷﮕﺮﻫﺎ‪ Q‬ﻣﺮ‪ B# $ Q$‬ﭘﺸﺘﻴﺒﺎﻧﻰ ﻣﻰ ﻛﻨﻨﺪ ‪ .‬ﮔﺮ  ﻳﻚ ﺻﻔﺤﻪ ‪ J‬ﻧﺮ‪ K‬ﻓﺰﻫﺎ‪ Activex Q‬ﺟﻮ ﺷﺘﻪ ﺑﺎﺷﺪ  ﻓﺮ‪ Q‬ﺑﺎ ﻳﻚ ﻛﺎﺷﮕﺮ‬
‫ﻛﻪ ‪ Activex $‬ﭘﺸﺘﻴﺒﺎﻧﻰ ﻧﻤﻰ ﻛﻨﺪ ﻳﻦ ﺻﻔﺤﻪ  ﺑﺎ‪ $‬ﻛﻨﺪ ﻗﺎ ﺑﻪ ﺳﺘﻔﺎ ‪ $‬ﻣﺰﻳﺎ‪ B# Q‬ﻧﺨﻮﻫﺪ ﺑﻮ ‪.‬‬

‫‪www.IrPDF.com‬‬