Pub Date : 2012-12-01DOI: 10.1109/CASoN.2012.6412399
K. Costa, C. R. Pereira, R. Nakamura, Luís A. M. Pereira, J. Papa
In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks.
{"title":"Boosting Optimum-Path Forest clustering through harmony Search and its applications for intrusion detection in computer networks","authors":"K. Costa, C. R. Pereira, R. Nakamura, Luís A. M. Pereira, J. Papa","doi":"10.1109/CASoN.2012.6412399","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412399","url":null,"abstract":"In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116744019","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412410
M. Ficco, M. Rak, B. D. Martino
Cloud Computing is the emerging paradigm in distributed environment. It is an opportunity for users to reduce costs and increase efficiency. Cloud Computing represents both a technology for using computing infrastructures in a more efficient way, and a business model for selling computing services and resources. In this context, cyber attacks represent a serious danger, which can compromise the quality of service delivered to the customers. In this paper, a mOSAIC-based framework for providing distributed intrusion detection in Cloud Computing is proposed. It is an architectural framework that collects information at different Cloud architectural levels, using multiple distributed security components, which can be used to perform complex event correlation analysis to identify intrusions in the Cloud system that involve Service Level Agreement violations.
{"title":"An intrusion detection framework for supporting SLA assessment in Cloud Computing","authors":"M. Ficco, M. Rak, B. D. Martino","doi":"10.1109/CASoN.2012.6412410","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412410","url":null,"abstract":"Cloud Computing is the emerging paradigm in distributed environment. It is an opportunity for users to reduce costs and increase efficiency. Cloud Computing represents both a technology for using computing infrastructures in a more efficient way, and a business model for selling computing services and resources. In this context, cyber attacks represent a serious danger, which can compromise the quality of service delivered to the customers. In this paper, a mOSAIC-based framework for providing distributed intrusion detection in Cloud Computing is proposed. It is an architectural framework that collects information at different Cloud architectural levels, using multiple distributed security components, which can be used to perform complex event correlation analysis to identify intrusions in the Cloud system that involve Service Level Agreement violations.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123542521","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412419
Bernd Zwattendorfer, Ivo Sumelong, H. Leitold
Many European states have issued electronic identities (eID) to its citizens since the early 2000s. Several have reached full coverage and usually high assurance credentials, such as smartcards, USB crypto tokens, or mobile phone eIDs are used. This lead to an impressive security infrastructure to authenticate at online services that, however, evolved as national silos - interoperability was no priority for a while. To overcome this, 18 European states have joined forces in the large scale pilot STORK. A SAML-based technical solution for cross-border eID federation between states has been designed, implemented, and finally piloted in a number of production services. In this paper we present the STORK middleware architecture that has been developed by Austria and Germany. Its main characteristic is a decentralized deployment that gives some end-to-end security and privacy advantages, but also needs particular attention to meet scalability challenges. This is compared to the STORK proxy model, an alternative centralized deployment approach that was chosen by other states. Federation between the two architectures is described, with particular attention to security and privacy aspects.
{"title":"Middleware architecture for cross-border eID","authors":"Bernd Zwattendorfer, Ivo Sumelong, H. Leitold","doi":"10.1109/CASoN.2012.6412419","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412419","url":null,"abstract":"Many European states have issued electronic identities (eID) to its citizens since the early 2000s. Several have reached full coverage and usually high assurance credentials, such as smartcards, USB crypto tokens, or mobile phone eIDs are used. This lead to an impressive security infrastructure to authenticate at online services that, however, evolved as national silos - interoperability was no priority for a while. To overcome this, 18 European states have joined forces in the large scale pilot STORK. A SAML-based technical solution for cross-border eID federation between states has been designed, implemented, and finally piloted in a number of production services. In this paper we present the STORK middleware architecture that has been developed by Austria and Germany. Its main characteristic is a decentralized deployment that gives some end-to-end security and privacy advantages, but also needs particular attention to meet scalability challenges. This is compared to the STORK proxy model, an alternative centralized deployment approach that was chosen by other states. Federation between the two architectures is described, with particular attention to security and privacy aspects.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123559314","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412380
Radosław Michalski, Piotr Bródka, Przemyslaw Kazienko, K. Juszczyszyn
The dynamic character of most social networks requires to model evolution of networks in order to enable complex analysis of theirs dynamics. The following paper focuses on the definition of differences between network snapshots by means of Graph Differential Tuple. These differences enable to calculate the diverse distance measures as well as to investigate the speed of changes. Four separate measures are suggested in the paper with experimental study on real social network data.
{"title":"Quantifying social network dynamics","authors":"Radosław Michalski, Piotr Bródka, Przemyslaw Kazienko, K. Juszczyszyn","doi":"10.1109/CASoN.2012.6412380","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412380","url":null,"abstract":"The dynamic character of most social networks requires to model evolution of networks in order to enable complex analysis of theirs dynamics. The following paper focuses on the definition of differences between network snapshots by means of Graph Differential Tuple. These differences enable to calculate the diverse distance measures as well as to investigate the speed of changes. Four separate measures are suggested in the paper with experimental study on real social network data.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123766303","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412413
Michal Prilepok, T. Ježowicz, J. Platoš, V. Snás̃el
The problem of spam emails is still growing. Therefore, developing of algorithms which are able to solve this problem is also very active area. This paper presents two different algorithms for spam detection. The first algorithm is based on Bayesian filter, but it is improved using data compression algorithms in case that the Bayesian filter cannot decide. The second algorithm is based on document classification algorithm using Particle Swarm Optimization. Results of presented algorithms are promising.
{"title":"Spam detection using compression and PSO","authors":"Michal Prilepok, T. Ježowicz, J. Platoš, V. Snás̃el","doi":"10.1109/CASoN.2012.6412413","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412413","url":null,"abstract":"The problem of spam emails is still growing. Therefore, developing of algorithms which are able to solve this problem is also very active area. This paper presents two different algorithms for spam detection. The first algorithm is based on Bayesian filter, but it is improved using data compression algorithms in case that the Bayesian filter cannot decide. The second algorithm is based on document classification algorithm using Particle Swarm Optimization. Results of presented algorithms are promising.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122138620","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412406
A. Ikuomola, A. Sodiya
The goal of co st-sensitive response system is to ensure that response cost does not outweigh the intrusion cost. In order to ensure this, some cost-sensitive response models have been developed. Some of these models do not consider the effectiveness of previous actions and lack standard approach for estimating associated cost. In this work, we present a model for assessing cost of responses based on three factors, the cost of damage caused by the intrusion, the cost of automatic response to an intrusion and the operational cost. The proposed approach provides consistent basis for response assessment across different systems and environment. In addition, the performance analysis indicates that automated responses systems using this cost metric COSIRS, when deployed can responds quickly enough to thwart active attacks in real time using optimal responses. The results of evaluation show that the design has better performance over existing ones.
{"title":"A credible cost-sensitive model for intrusion response selection","authors":"A. Ikuomola, A. Sodiya","doi":"10.1109/CASoN.2012.6412406","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412406","url":null,"abstract":"The goal of co st-sensitive response system is to ensure that response cost does not outweigh the intrusion cost. In order to ensure this, some cost-sensitive response models have been developed. Some of these models do not consider the effectiveness of previous actions and lack standard approach for estimating associated cost. In this work, we present a model for assessing cost of responses based on three factors, the cost of damage caused by the intrusion, the cost of automatic response to an intrusion and the operational cost. The proposed approach provides consistent basis for response assessment across different systems and environment. In addition, the performance analysis indicates that automated responses systems using this cost metric COSIRS, when deployed can responds quickly enough to thwart active attacks in real time using optimal responses. The results of evaluation show that the design has better performance over existing ones.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412535","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412416
A. Sodiya, D. O. Aborisade, A. Ikuomola
In this paper, we proposed a survivability model for object-oriented software system for solving the problem of software degradation commonly caused by increasing growth in classes and methods. This is achieved through threshold scheme and software rejuvenation technique. Threshold value (TV) is set as the degradation point for the software system with consideration given to the critical region values (CV) as defined standard metrics like McCabeCyclomatic Complexity (CC) risk thresholds and NASA SATC WMC risk thresholds metrics. A mechanism is also integrated into the model to monitor and determine the continuous growth of methods and classes such that when threshold value (TV) <;= critical value (CV) set within the critical region, the software codes are refreshed and re-initiated. The model is tested using two software programs developed to implement a treemap algorithm using nine (9) attributes. It is observed that software programs with this proposed model embedded into it would prevent code degradation.
{"title":"A survivability model for object-oriented software systems","authors":"A. Sodiya, D. O. Aborisade, A. Ikuomola","doi":"10.1109/CASoN.2012.6412416","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412416","url":null,"abstract":"In this paper, we proposed a survivability model for object-oriented software system for solving the problem of software degradation commonly caused by increasing growth in classes and methods. This is achieved through threshold scheme and software rejuvenation technique. Threshold value (TV) is set as the degradation point for the software system with consideration given to the critical region values (CV) as defined standard metrics like McCabeCyclomatic Complexity (CC) risk thresholds and NASA SATC WMC risk thresholds metrics. A mechanism is also integrated into the model to monitor and determine the continuous growth of methods and classes such that when threshold value (TV) <;= critical value (CV) set within the critical region, the software codes are refreshed and re-initiated. The model is tested using two software programs developed to implement a treemap algorithm using nine (9) attributes. It is observed that software programs with this proposed model embedded into it would prevent code degradation.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129452773","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412386
Fatih Şen, R. Wigand, Nitin Agarwal, Debanjan Mahata, Halil Bisgin
Identifying authoritative individuals is a well-known approach in extracting actionable knowledge, known as “Knowledge Representation”, in a social network. Previous researches suggest measures to identify influential individuals, however, such individuals might not represent the appropriate context (relationships, interactions, etc.). For example, it is nearly an impossible task for a single individual to organize a mass protest of the scale of Occupy Wall Street. Similarly, other events such as the Arab Spring, coordinating crisis responses for natural disasters (e.g., the Haiti earthquake), or even organizing flash mobs would require a key set of individuals rather than a single or the most authoritative one. These events demonstrate the need and importance of examining influential structures rather than single individuals in social networks. A new methodology is proposed to identify such influential structures and recognizing their importance. The proposed methodology is evaluated empirically with real-world data from NIST's Tweets2011 corpus. We also introduce a novel and objective evaluation strategy to ascertain the efficacy of the focal patterns. Challenges with future research directions are outlined.
{"title":"Identifying focal patterns in social networks","authors":"Fatih Şen, R. Wigand, Nitin Agarwal, Debanjan Mahata, Halil Bisgin","doi":"10.1109/CASoN.2012.6412386","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412386","url":null,"abstract":"Identifying authoritative individuals is a well-known approach in extracting actionable knowledge, known as “Knowledge Representation”, in a social network. Previous researches suggest measures to identify influential individuals, however, such individuals might not represent the appropriate context (relationships, interactions, etc.). For example, it is nearly an impossible task for a single individual to organize a mass protest of the scale of Occupy Wall Street. Similarly, other events such as the Arab Spring, coordinating crisis responses for natural disasters (e.g., the Haiti earthquake), or even organizing flash mobs would require a key set of individuals rather than a single or the most authoritative one. These events demonstrate the need and importance of examining influential structures rather than single individuals in social networks. A new methodology is proposed to identify such influential structures and recognizing their importance. The proposed methodology is evaluated empirically with real-world data from NIST's Tweets2011 corpus. We also introduce a novel and objective evaluation strategy to ascertain the efficacy of the focal patterns. Challenges with future research directions are outlined.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116368895","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412422
Hmood Al-Dossari
Consumer protection is an issue of great importance to Saudi Arabia, leading to the formation of a consumer protection agency as part of the Ministry of Commerce and Industry. However, studies have shown that this agency has not ensured adequate protection for consumers. This paper investigates whether better consumer protection may be achieved in Saudi Arabia through the design and implementation of an “independent” quality monitoring system. That is, we propose to develop a system that collects consumers' ratings on the services delivered to them, either physically or electronically, and to then aggregate these ratings over time to establish a useable measure of the reputations of service providers. While certain techniques have been proposed in the literature to calculate reputation, these tend to concentrate on the manipulation of ratings, and do not consider the context within which a rating may be given by a consumer. In other words, these proposed techniques neither consider the subjectivity of consumers' ratings nor the dynamic behaviour of service providers, potentially leading to the allocation of biased or unfair reputation calculations. In order to address this problem, the expectations of consumers have been collected alongside their ratings and then manipulated to distinguish between subjective and unfair ratings to produce a more robust reputation calculations. The proposed approach has been demonstrated using a simple example.
{"title":"A reputation-based approach for consumer protection in Saudi Arabia","authors":"Hmood Al-Dossari","doi":"10.1109/CASoN.2012.6412422","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412422","url":null,"abstract":"Consumer protection is an issue of great importance to Saudi Arabia, leading to the formation of a consumer protection agency as part of the Ministry of Commerce and Industry. However, studies have shown that this agency has not ensured adequate protection for consumers. This paper investigates whether better consumer protection may be achieved in Saudi Arabia through the design and implementation of an “independent” quality monitoring system. That is, we propose to develop a system that collects consumers' ratings on the services delivered to them, either physically or electronically, and to then aggregate these ratings over time to establish a useable measure of the reputations of service providers. While certain techniques have been proposed in the literature to calculate reputation, these tend to concentrate on the manipulation of ratings, and do not consider the context within which a rating may be given by a consumer. In other words, these proposed techniques neither consider the subjectivity of consumers' ratings nor the dynamic behaviour of service providers, potentially leading to the allocation of biased or unfair reputation calculations. In order to address this problem, the expectations of consumers have been collected alongside their ratings and then manipulated to distinguish between subjective and unfair ratings to produce a more robust reputation calculations. The proposed approach has been demonstrated using a simple example.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124413284","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}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412433
J. Platoš, P. Krömer, V. Snás̃el, A. Abraham
Searching of similar pictures was in the past based mainly on searching of similar picture names. We try to find an effective method how to search pictures by searching of similar information in the picture (histograms, shapes, blocks,). There already are some methods but still not effective enough. In this paper we describe a method where we combine vector quantization (VQ) and fuzzy S-trees. Work contains testing of our approach and you can see results in a final chapter of this paper. The benefit of this work is not the final solution but we put a key-stone for further research and for optimizations. First tests show up the efficiency and usefulness of our approach, which is under laid by executed tests.
{"title":"Searching similar images — Vector quantization with S-tree","authors":"J. Platoš, P. Krömer, V. Snás̃el, A. Abraham","doi":"10.1109/CASoN.2012.6412433","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412433","url":null,"abstract":"Searching of similar pictures was in the past based mainly on searching of similar picture names. We try to find an effective method how to search pictures by searching of similar information in the picture (histograms, shapes, blocks,). There already are some methods but still not effective enough. In this paper we describe a method where we combine vector quantization (VQ) and fuzzy S-trees. Work contains testing of our approach and you can see results in a final chapter of this paper. The benefit of this work is not the final solution but we put a key-stone for further research and for optimizations. First tests show up the efficiency and usefulness of our approach, which is under laid by executed tests.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121593080","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：