انجمن کامپیوتر ایران

In this paper we propose several methods for partitioning, the process of grouping members of population to different memeplexes, in a shuffled frog leaping algorithm. These proposed methods divide the population in terms of the value of cost function or the geometric position of members or quite random partitioning. The proposed methods are evaluated on several low and high dimensional benchmark functions. The obtained results on low dimensional functions demonstrate that geometric partitioning methods have the best success rate and the fastest performance. Also on high dimensional functions, however using of the geometric partitioning methods for the partitioning stage of the SFL algorithm lead to a better success rate but these methods are more time consuming than other partitioning methods.

Concept graph is a graph that represents the relationships between language concepts. In this structure the relationship between any two words is demonstrated by a weighted edge such that the value of this weight is interpreted as the degree of the relevance of two words. Having this graph, we can obtain most relevant words to a special term. In this paper, we propose a method for improving the classification of documents from unknown sources by means of concept graph. In our method, initially some features are selected from a training set by a well-known feature selection algorithm. Then, by extracting most relevant words for each class from the concept graph, a more effective feature set is produced. Our experimental results identify an improvement of 1% and 8% in precision and recall measures, respectively.

با افز ايش قيمت ابرکامپ يوترها ا ز طرف ي و ني از به مناب ع محاسباتي با حجم وسيع از طرف ديگر، محقق ين کام پيوتر را بر آن داشته است تا به سراغ استفاده از شبکهاي از منابع محاسبا تي به نا م گريد Grid) روي آورند. گونهاي از گريد به نام گريد محاسباتي Computing Grid مجموعهاي از منابع توزيع شده را براي حل مس ايل با ميزان محاسبات بالا در علوم، مهندس ي و تجارت فراهم آورده اس ت . براي استفاده بهينه از قابليتهاي اين سيستم توزيع شده، الگوريتمه اي زمانبندي کارامدي موردنياز است . در اي ن مقاله الگو ر يتم زمانبن دي جديدي به کمک برنامهسازي ژنتيک و بر مبن اي دو الگور يتم پاي هاي Min-Min و Max-Min طراحي شده است که س ع ي در استفاده از مزاياي اين دو، رفع معايب آنه ا و کوتاه کردن مدت زمانبن د ي نموده است. با مقايسه کارا يي الگو ريتم جدي د با دو الگو ر يتم Min-Min و Max-Min نتايج قابل قبولي بدست آمد.