发布求助
文献互助 智能选刊 最新文献

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010最新文献

筛选
英文 中文
A more efficient MOPSO for optimization 一个更有效的MOPSO优化
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587045
Walid Elloumi, A. Alimi
{"title":"A more efficient MOPSO for optimization","authors":"Walid Elloumi, A. Alimi","doi":"10.1109/AICCSA.2010.5587045","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587045","url":null,"abstract":"Swarm-inspired optimization has become very popular in recent years. The multiple criteria nature of most real world problems has boosted research on multi-objective algorithms that can tackle such problems effectively, with the computational burden and colonies. Particle Swarm Optimization (PSO) and Ant colony Optimization (ACO) have attracted the interest of researchers due to its simplicity, effectiveness and efficiency in solving optimization problems. We use the notion of multi-objective Particle Swarm Optimization (MOPSO) for few methods; and we find in most of the results; more the number of the swarm increases more the accuracy of object is achieved with greater accuracy. Performance of the basic swarm for small problems with moderate dimensions and searching space is satisfactory.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122979784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
The genus of the complete multipartite graph and the complete multi-layered graph 完全多部图和完全多层图的属
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587024
S. Bettayeb, Quan T. Nguyen
{"title":"The genus of the complete multipartite graph and the complete multi-layered graph","authors":"S. Bettayeb, Quan T. Nguyen","doi":"10.1109/AICCSA.2010.5587024","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587024","url":null,"abstract":"The complete multipartite graph and the complete multi-layered graph are both generalizations of the complete bipartite graph. These two kinds of graphs have recursive structure and offer a very flexible choice of network size with respect to a fixed network order. This paper addresses the genus of the complete multipartite graph and the complete multi-layered graph which measures how efficiently we can set up a computer network using these graph layouts.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125185662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Data analyzer based on data mining for Honeypot Router 基于数据挖掘的蜜罐路由器数据分析器
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587041
Abdallah Ghourabi, Tarek Abbes, A. Bouhoula
{"title":"Data analyzer based on data mining for Honeypot Router","authors":"Abdallah Ghourabi, Tarek Abbes, A. Bouhoula","doi":"10.1109/AICCSA.2010.5587041","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587041","url":null,"abstract":"Honeypot is an effective security tool, which is intended to be attacked and compromised to gain more information about the attacker and his attack techniques. To study these attacks, the honeypot must capture and log large amounts of data which are very difficult to process manually. So, the analysis of these logs has become a very difficult and time consuming task. To resolve this problem, several researchers have proposed the use of data mining techniques in order to classify logged traffic and extract useful information. In this paper, we present a data analysis tool for our Honeypot Router. This tool is based on data mining clustering. The main idea is to extract useful features from data captured by the Honeypot Router. These data will be then clustered by using the DBSCAN clustering algorithm in order to classify the captured packets and extract those that are suspicious. Suspicious packets will be then verified by a human expert. This solution is very useful to detect novel routing attacks.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125315047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Towards a multi-agent based architecture to simulate the reality of a stock exchange market 朝着基于多代理的体系结构来模拟证券交易市场的现实
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587011
Sehl Mellouli, F. Bouslama
{"title":"Towards a multi-agent based architecture to simulate the reality of a stock exchange market","authors":"Sehl Mellouli, F. Bouslama","doi":"10.1109/AICCSA.2010.5587011","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587011","url":null,"abstract":"In this paper, the initial steps of the development process of an agent-based architecture used to simulate the reality of a stock exchange market are provided. This architecture includes a representation of all market participants from investors to floor traders. There are five main modules in the proposed architecture: an information retrieval and ontology module which extracts online market news and data, a knowledge base which includes portfolios compositions, a strategy and planning module used as an analysis tool, a learning module based on market historical data where agents learn market behavior and tendencies, and finally a decision making module with which agents make decisions on buying and selling of stocks. The information retrieval and ontology module is then detailed to show the proposed ontology representing the financial news. This architecture can be used to develop simulation platforms for stock markets.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129759610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A voting scheme to improve the secondary structure prediction 一种改进二次结构预测的投票方案
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586931
J. Taheri, Albert Y. Zomaya
{"title":"A voting scheme to improve the secondary structure prediction","authors":"J. Taheri, Albert Y. Zomaya","doi":"10.1109/AICCSA.2010.5586931","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586931","url":null,"abstract":"This paper presents a novel approach, namely SSVS, to improve the secondary structure prediction of proteins. In this work, a Radial Basis Function Neural Network is trained to combine different answers found by different secondary structure prediction techniques to produce superior answers. SSVS is tested with three of the well-known benchmarks in this field. The results demonstrate the superiority of the proposed technique even in the case of formidable sequences.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134285161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A trust communication with SIP protocol 使用SIP协议进行信任通信
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587028
Samer El-Sawda, P. Urien, R. E. Sawda
{"title":"A trust communication with SIP protocol","authors":"Samer El-Sawda, P. Urien, R. E. Sawda","doi":"10.1109/AICCSA.2010.5587028","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587028","url":null,"abstract":"Session Initiation Protocol (SIP) is an application-layer signaling and control protocol for creating, modifying and terminating sessions including Internet telephone calls, multimedia distribution and multimedia conferences. Flexible, extensible and open, SIP has a complete security mechanism that allows security of both media and signaling. SIP RFC recommends the use of TLS or DTLS to provide an adequate level of protection against attacks. However, missing from these protocols is a way to perform non-repudiation service when used in SIP networks to provide a high level of trust between User Agents. In this paper we propose to modify and sign some header fields in the SIP request messages in order to achieve non-repudiation service over TLS/DTLS. To facilitate the implementation, the portability and the test of our proposal, called SIP SIGN, the new messages will be created and treated by a redirect server named “Proxy Signatory” setting between the User Agents and their local proxy servers. This “Proxy Signatory” provides the caller the ability to sign its SIP messages using certificates such as X.509 and the callee to verify and validate the signature and the caller identity.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115280280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
For more understandable UML diagrams 以获得更易于理解的UML图
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586987
Kamel Boukhelfa, F. Belala, Aicha Choutri, Halima Douibi
{"title":"For more understandable UML diagrams","authors":"Kamel Boukhelfa, F. Belala, Aicha Choutri, Halima Douibi","doi":"10.1109/AICCSA.2010.5586987","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586987","url":null,"abstract":"The use of formal methods is an effective means to improve the reliability and the quality of complex systems. The objective of this work is to adapt one of these methods to UML, so that the systems development depending on this notation can benefit from it. We propose a formal semantic framework, based on rewriting logic, for UML. Thus, we lean on the category model to give precise and sufficient semantics to the various UML diagrams used in system specification. A transcription tool of UML abstract model to Maude object-oriented module is developed. It is able to handle class and sequence diagrams of realistic size.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114905419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Event extraction approach for Web 2.0 用于Web 2.0的事件提取方法
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587014
A. Elkhlifi, R. Faiz
{"title":"Event extraction approach for Web 2.0","authors":"A. Elkhlifi, R. Faiz","doi":"10.1109/AICCSA.2010.5587014","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587014","url":null,"abstract":"Event extraction is a significant task in information extraction. This importance increases more and more with the explosion of textual data available on the Web, the appearance of Web 2.0 and the tendency towards the Semantic Web. Thus, we propose a generic approach to extract events from text and to analyze them. We propose an event extraction algorithm with a polynomial complexity O(n5), and a new similarity measurement between events. We use this measurement to gather similar events. We also present a semantic map of events, and we validate the first component of our approach by the development of the “EventEC” system.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114988866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
An optimized filter for finding multiple repeats in DNA sequences 在DNA序列中寻找多个重复的优化过滤器
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587026
Maria Federico, P. Peterlongo, N. Pisanti
{"title":"An optimized filter for finding multiple repeats in DNA sequences","authors":"Maria Federico, P. Peterlongo, N. Pisanti","doi":"10.1109/AICCSA.2010.5587026","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587026","url":null,"abstract":"This paper presents new optimizations designed to improve an algorithm at the state-of-the-art for filtering sequences as a preprocessing step to the task of finding multiple repeats allowing a given pairwise edit distance between pairs of occurrences. The target application is to find possibly long repeats having two or more occurrences, such that each couple of occurrences may show substitutions, insertions or deletions in up to 10 to 15 % of their size. Assimilated to multiple alignment, exact detection of multiple repeats is an NP-hard problem. For increasing computation speed while avoiding the use of heuristics, one may use filters that quickly remove large parts of input that do not contain searched repeats. We describe at theoretical level some optimizations that can be applied to the tool that is currently the state-of-the-art for this filtering task. Finally, we exhibit some experiments in which the optimized tool outperforms its original version.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120968762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Towards a decentralized architecture for information dissemination in Inter-Vehicles Networks 面向车际网络信息传播的分散架构
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587022
K. Dar, M. Bakhouya, J. Gaber, M. Wack
{"title":"Towards a decentralized architecture for information dissemination in Inter-Vehicles Networks","authors":"K. Dar, M. Bakhouya, J. Gaber, M. Wack","doi":"10.1109/AICCSA.2010.5587022","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587022","url":null,"abstract":"Inter-Vehicles Networks (IVNs) have emerged as a new environment for intelligent transportation applications. The implementation of these applications requires dealing with many issues. The design and the implementation of an efficient and scalable architecture for information dissemination constitute one major issue. In this paper, a decentralized architecture inspired by stigmergy and direct communication between Ants is presented. The Ants colony has a set of organizing principles, such as scalability and adaptability that are useful for developing a decentralized architecture in highly dynamic networks. Simulations are conducted using Starlogo simulator and some metrics such as information relevance and drivers' awareness are evaluated. Preliminary results are reported to first show the effectiveness of the proposed information dissemination strategy.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122386826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信