Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412388
Mohammad Soleimani-Pouri, Alireza Rezvanian, M. Meybodi
The maximum clique of a given graph G is the subgraph C of G such that two vertices in C are adjacent in G with maximum cardinality. Finding the maximum clique in an arbitrary graph is an NP-Hard problem, motivated by the social networks analysis. In the real world applications, the nature of interaction between nodes is stochastic and the probability distribution function of the vertex weight is unknown. In this paper a learning automata-based algorithm is proposed for solving maximum clique problem in the stochastic graph. The simulation results on stochastic graph demonstrate that the proposed algorithm outperforms standard sampling method in terms of the number of samplings taken by algorithm.
{"title":"Solving maximum clique problem in stochastic graphs using learning automata","authors":"Mohammad Soleimani-Pouri, Alireza Rezvanian, M. Meybodi","doi":"10.1109/CASoN.2012.6412388","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412388","url":null,"abstract":"The maximum clique of a given graph G is the subgraph C of G such that two vertices in C are adjacent in G with maximum cardinality. Finding the maximum clique in an arbitrary graph is an NP-Hard problem, motivated by the social networks analysis. In the real world applications, the nature of interaction between nodes is stochastic and the probability distribution function of the vertex weight is unknown. In this paper a learning automata-based algorithm is proposed for solving maximum clique problem in the stochastic graph. The simulation results on stochastic graph demonstrate that the proposed algorithm outperforms standard sampling method in terms of the number of samplings taken by algorithm.","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":"133518060","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.6412407
S. Jajodia, W. Litwin, T. Schwarz
Passwords form the Achilles heel of most uses of modern cryptography. Key recovery is necessary to provide continuous access to documents and other electronic assets in spite of possible loss of a password. Key escrow services provide key recovery for the owner, but need to be trusted. Additionally, a user might want to divulge passwords in case of his/her death or incapacitation, but not before. We present here a scheme that uses dispersion to provide trusted escrow services. Our scheme uses secret sharing to disperse password recovery information over several escrow services that authenticate based on a weak password. To protect against dictionary attacks, each authentication attempt takes a noticeable, but tolerable time (e.g. minutes). We achieve this by having the share of the secret be the solution of a puzzle that is solved by brute force in time depending on the number of processors employed. This additionally prevents escrow agencies from optimizing their part in recovering a password by pre-computing and storing their share in a more accessible and hence vulnerable format.
{"title":"Securing password recovery through dispersion","authors":"S. Jajodia, W. Litwin, T. Schwarz","doi":"10.1109/CASoN.2012.6412407","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412407","url":null,"abstract":"Passwords form the Achilles heel of most uses of modern cryptography. Key recovery is necessary to provide continuous access to documents and other electronic assets in spite of possible loss of a password. Key escrow services provide key recovery for the owner, but need to be trusted. Additionally, a user might want to divulge passwords in case of his/her death or incapacitation, but not before. We present here a scheme that uses dispersion to provide trusted escrow services. Our scheme uses secret sharing to disperse password recovery information over several escrow services that authenticate based on a weak password. To protect against dictionary attacks, each authentication attempt takes a noticeable, but tolerable time (e.g. minutes). We achieve this by having the share of the secret be the solution of a puzzle that is solved by brute force in time depending on the number of processors employed. This additionally prevents escrow agencies from optimizing their part in recovering a password by pre-computing and storing their share in a more accessible and hence vulnerable format.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"98 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133652237","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.6412377
A. C. E. S. Lima, L. Castro
Twitter® is a microblogging service usually used as an instant communication platform. The capacity to provide information in real time has stimulated many companies to use this service to understand their consumers. In this direction, TV stations have adopted Twitter for shortening the distance between them and their viewers, and use such information as a feedback mechanism for their shows. The sentiment analysis task can be used as one such feedback mechanism. This task corresponds to classifying a text according to the sentiment that the writer intended to transmit. A classifier usually requires a pre-classifled data sample to determine the class of new data. Typically, the sample is pre-classified manually, making the process time consuming and reducing its real time applicability for big data. This paper proposes an automatic sentiment classifier for Twitter messages, and uses TV shows from Brazilian stations for benchmarking. The automatic sentiment analysis reduces human intervention and, thus, the complexity and cost of the whole process. To assess the performance of the proposed system tweets related to a Brazilian TV show were captured in a 24h interval and fed into the system. The proposed technique achieved an average accuracy of 90%.
{"title":"Automatic sentiment analysis of Twitter messages","authors":"A. C. E. S. Lima, L. Castro","doi":"10.1109/CASoN.2012.6412377","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412377","url":null,"abstract":"Twitter® is a microblogging service usually used as an instant communication platform. The capacity to provide information in real time has stimulated many companies to use this service to understand their consumers. In this direction, TV stations have adopted Twitter for shortening the distance between them and their viewers, and use such information as a feedback mechanism for their shows. The sentiment analysis task can be used as one such feedback mechanism. This task corresponds to classifying a text according to the sentiment that the writer intended to transmit. A classifier usually requires a pre-classifled data sample to determine the class of new data. Typically, the sample is pre-classified manually, making the process time consuming and reducing its real time applicability for big data. This paper proposes an automatic sentiment classifier for Twitter messages, and uses TV shows from Brazilian stations for benchmarking. The automatic sentiment analysis reduces human intervention and, thus, the complexity and cost of the whole process. To assess the performance of the proposed system tweets related to a Brazilian TV show were captured in a 24h interval and fed into the system. The proposed technique achieved an average accuracy of 90%.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"72 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":"115343497","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.6412404
Ruben Jonathan Garcia Vargas, Eleazar Aguirre Anaya, Ramon Galeana Huerta, Alba Felix Moreno Hernandez
The use of Smartphones in business has grown in the recent years bringing new ways to create and share information. Among the operating systems used by smartphones, Android has the most growing usage rate. Most recent Android versions have some security controls; however, there is a lack in the use of strong security controls for Android 2.3 (Gingerbread), which is the most spread version of this operating system. This leaves vulnerable company and user information stored in such devices. This work presents how to improve Android's security by adding more security controls to devices using the version 2.3 and by this way meet the security levels needed for the business and secure users environments. The security polices where added to Android's source code and to the data space.
{"title":"Security controls for Android","authors":"Ruben Jonathan Garcia Vargas, Eleazar Aguirre Anaya, Ramon Galeana Huerta, Alba Felix Moreno Hernandez","doi":"10.1109/CASoN.2012.6412404","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412404","url":null,"abstract":"The use of Smartphones in business has grown in the recent years bringing new ways to create and share information. Among the operating systems used by smartphones, Android has the most growing usage rate. Most recent Android versions have some security controls; however, there is a lack in the use of strong security controls for Android 2.3 (Gingerbread), which is the most spread version of this operating system. This leaves vulnerable company and user information stored in such devices. This work presents how to improve Android's security by adding more security controls to devices using the version 2.3 and by this way meet the security levels needed for the business and secure users environments. The security polices where added to Android's source code and to the data space.","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":"123270890","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.6412395
S. Zehnalova, M. Kudelka, M. Kudelka, V. Snás̃el
One of the most obvious features of social networks is their community structure. Several types of methods were developed for discovering communities in the networks, either from the global perspective or based on local information only. Local methods are appropriate when working with large and dynamic networks or when real-time results are expected. In this paper we explore two such methods and compare the results obtained on the sample of a co-authorship network. We study how much may detected communities vary according to the method used for computation.
{"title":"Comparing two local methods for community detection in social networks","authors":"S. Zehnalova, M. Kudelka, M. Kudelka, V. Snás̃el","doi":"10.1109/CASoN.2012.6412395","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412395","url":null,"abstract":"One of the most obvious features of social networks is their community structure. Several types of methods were developed for discovering communities in the networks, either from the global perspective or based on local information only. Local methods are appropriate when working with large and dynamic networks or when real-time results are expected. In this paper we explore two such methods and compare the results obtained on the sample of a co-authorship network. We study how much may detected communities vary according to the method used for computation.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"65 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":"121783689","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.6412381
Nils Murrugarra-Llerena, Lilian Berton, A. Lopes
Ensemble techniques combine several individual classifiers to obtain a composite classifier that outperforms each of them alone. Despite of these techniques have been successfully applied to many domains, their applications on networked data still need investigation. There are not many known strategies for sampling with replacement from interconnected relational data. To contribute in this direction, we propose a cross-validated committee ensemble procedure applied to graph-based classifiers. The proposed ensemble either maintains or significantly improves the accuracy of the tested relational graph-based classifiers. We also investigate the role played by diversity among the several individual classifiers, i.e., how much they agree in their predictions, to explain the technique success or failure.
{"title":"Graph-based cross-validated committees ensembles","authors":"Nils Murrugarra-Llerena, Lilian Berton, A. Lopes","doi":"10.1109/CASoN.2012.6412381","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412381","url":null,"abstract":"Ensemble techniques combine several individual classifiers to obtain a composite classifier that outperforms each of them alone. Despite of these techniques have been successfully applied to many domains, their applications on networked data still need investigation. There are not many known strategies for sampling with replacement from interconnected relational data. To contribute in this direction, we propose a cross-validated committee ensemble procedure applied to graph-based classifiers. The proposed ensemble either maintains or significantly improves the accuracy of the tested relational graph-based classifiers. We also investigate the role played by diversity among the several individual classifiers, i.e., how much they agree in their predictions, to explain the technique success or failure.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"32 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":"114853755","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.6412400
D. Nabil, K. Benatchba, M. Koudil, A. Bouridane
Several biometric threats systems models have been proposed to facilitate the design, implementation and validation techniques for securing these systems. Some models classify threats by type of attacks, others by specific attacks and other by using vulnerabilities and threat agent. Each model proposes a vision and a different approach to identify these threats. For example, to design security techniques for wireless biometric card, one should identify all threats facing this kind of device. In this paper, a comparative study and synthesis to help choose the most fitting model, depending on the security problems addressed, is given.
{"title":"Threats models on biometri systems: A comparative study","authors":"D. Nabil, K. Benatchba, M. Koudil, A. Bouridane","doi":"10.1109/CASoN.2012.6412400","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412400","url":null,"abstract":"Several biometric threats systems models have been proposed to facilitate the design, implementation and validation techniques for securing these systems. Some models classify threats by type of attacks, others by specific attacks and other by using vulnerabilities and threat agent. Each model proposes a vision and a different approach to identify these threats. For example, to design security techniques for wireless biometric card, one should identify all threats facing this kind of device. In this paper, a comparative study and synthesis to help choose the most fitting model, depending on the security problems addressed, is given.","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":"130687411","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.6412434
H. Filho, L. Azevedo
Service-Oriented Architecture (SOA) is a paradigm used by organizations to reduce costs and foster agility through reuse of assets and an increase of alignment between business and IT. To achieve these benefits, a governance model is vital to ensure that technical actions and decisions of IT departments are aligned to organizations' business goals and requirements. There are several proposals of SOA governance models in academia and industry. However, there are important differences between them concerning process, elements and definitions they propose. This work analyzes the main current SOA governance models proposed by literature, and presents a consolidate approach aiming to create a governance model that addresses the most important issues for organizations.
{"title":"CommonGOV: A consolidate approach for governance of service-oriented architecture","authors":"H. Filho, L. Azevedo","doi":"10.1109/CASoN.2012.6412434","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412434","url":null,"abstract":"Service-Oriented Architecture (SOA) is a paradigm used by organizations to reduce costs and foster agility through reuse of assets and an increase of alignment between business and IT. To achieve these benefits, a governance model is vital to ensure that technical actions and decisions of IT departments are aligned to organizations' business goals and requirements. There are several proposals of SOA governance models in academia and industry. However, there are important differences between them concerning process, elements and definitions they propose. This work analyzes the main current SOA governance models proposed by literature, and presents a consolidate approach aiming to create a governance model that addresses the most important issues for organizations.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"3 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":"129760235","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.6412431
G. Markou, I. Refanidis
This paper describes work in progress towards the implementation of an online Web Service Composition system. The system adheres to the reusable nature of web Services by utilizing existing open source projects as sub-elements and is based on the most prevalent web service standards. It will treat non-determinism as an inherent characteristic of the problem and tackle it through the use of contingency planning. To the best of our knowledge, the final system will be the first online application of its kind able to support various stages of Web Service Composition. In this paper we focus on the evaluation framework for the proposed system, based on an existing test collection and three detailed use case scenarios, and a manual composition module than can produce workflows corresponding to them.
{"title":"Towards an automatic non-deterministic web Service Composition platform","authors":"G. Markou, I. Refanidis","doi":"10.1109/CASoN.2012.6412431","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412431","url":null,"abstract":"This paper describes work in progress towards the implementation of an online Web Service Composition system. The system adheres to the reusable nature of web Services by utilizing existing open source projects as sub-elements and is based on the most prevalent web service standards. It will treat non-determinism as an inherent characteristic of the problem and tackle it through the use of contingency planning. To the best of our knowledge, the final system will be the first online application of its kind able to support various stages of Web Service Composition. In this paper we focus on the evaluation framework for the proposed system, based on an existing test collection and three detailed use case scenarios, and a manual composition module than can produce workflows corresponding to them.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"9 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":"127864473","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.6412408
M. Khan, S. Kumari, M. Gupta
In 2008, Khan et al. proposed a remote user authentication scheme on mobile device, using hash-function and fingerprint biometric. In 2010, Chen et al. discussed some security weaknesses of Khan et al.'s scheme and subsequently proposed an improved scheme. Recently, Truong et al. have demonstrated that in Chen et al.'s scheme, an adversary can successfully replay an intercepted login request. They also showed how an adversary can cheat both the legal participants, by taking advantage of the fact that the scheme does not provide anonymity to the user. In this paper, we show that Chen et al.'s scheme suffers from some additional drawbacks which were not presented by Truong et al. in its analysis.
{"title":"Further cryptanalysis of ‘A remote authentication scheme using mobile device’","authors":"M. Khan, S. Kumari, M. Gupta","doi":"10.1109/CASoN.2012.6412408","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412408","url":null,"abstract":"In 2008, Khan et al. proposed a remote user authentication scheme on mobile device, using hash-function and fingerprint biometric. In 2010, Chen et al. discussed some security weaknesses of Khan et al.'s scheme and subsequently proposed an improved scheme. Recently, Truong et al. have demonstrated that in Chen et al.'s scheme, an adversary can successfully replay an intercepted login request. They also showed how an adversary can cheat both the legal participants, by taking advantage of the fact that the scheme does not provide anonymity to the user. In this paper, we show that Chen et al.'s scheme suffers from some additional drawbacks which were not presented by Truong et al. in its analysis.","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":"130182321","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
扫码关注我们
求助内容：
应助结果提醒方式：