توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱Intrusion Detection Using a Boosting Ant–Colony–Based Data Miner
اطلاعات انتشار: یازدهمین کنفرانس سالانه انجمن کامپیوتر ایران، سال
تعداد صفحات: ۴
Data security plays an important role in the current networked computer systems. Because of lacking a distinctive boundary definition among normal and abnormal datasets, discriminating the normal and abnormal behaviors seems too much complex. This paper proposes a boosting Ant–colony–Based data miner for recognizing intrusion detection in computer networks. Extraction a classification rule set from a network dataset is the main purpose of the algorithm. These rules are capable of detecting normal and abnormal behaviors. The proposed algorithm is evaluated based on the detection, false alarm, and classification rates. Results show that the proposed boosting algorithm is capable of producing a reliable intrusion detection system.<\div>

۲A More Informative Heuristic Function for Fast Forward Planning
اطلاعات انتشار: یازدهمین کنفرانس سالانه انجمن کامپیوتر ایران، سال
تعداد صفحات: ۵
This paper proposes a new variation of the Fast Forward (FF) planning. This new variation, which we called H–FF, was applied to the FF policies that are used to reach to a relaxed plan. Specifically, FF uses the NOOP first policy, but new policy of H–FF, named HSP policy, uses the hsp_value attribute in order to make a relax plan. FF and H–FF were tested on three domains (i.e., Mprime, Mystery, and Blocksworld–4ops). The experiments were based on the heuristic estimation, planning times and the number of actions in the final plan (i.e. the plan size). Results show that H–FF often finds a superior solution with respect to the planning times and the solution length criteria, but with high values in the heuristic estimation. The results are highlighted in Mprime and Mystery domains. The more efficient answer of H–FF in time and step shows that HSP policy is a more informative heuristic than NOOP first policy. So the FF assumption that the better answer in relaxed plan, leads to a better plan in the real problem is not the case.<\div>
نمایش نتایج ۱ تا ۲ از میان ۲ نتیجه