Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412389
S. Tanbeer, C. Leung, Juan J. Cameron
Social networks, which are made of social entities (e.g., individual users) linked by some specific types of interdependencies such as friendship, have become popular to facilitate collaboration and knowledge sharing among users. Such interactions or interdependencies can be dependent on or influenced by user characteristics such as connectivity, centrality, weight, importance, and activity in the networks. As such, some users in the social networks can be considered as highly influential to others. In this paper, we propose a computational model that integrates data mining with social computing to help users to discover influential friends from the social networks.
{"title":"DIFSoN: Discovering influential friends from social networks","authors":"S. Tanbeer, C. Leung, Juan J. Cameron","doi":"10.1109/CASoN.2012.6412389","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412389","url":null,"abstract":"Social networks, which are made of social entities (e.g., individual users) linked by some specific types of interdependencies such as friendship, have become popular to facilitate collaboration and knowledge sharing among users. Such interactions or interdependencies can be dependent on or influenced by user characteristics such as connectivity, centrality, weight, importance, and activity in the networks. As such, some users in the social networks can be considered as highly influential to others. In this paper, we propose a computational model that integrates data mining with social computing to help users to discover influential friends from the social networks.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"30 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":"122795223","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.6412394
D. Zaupa, C. Costa, Jessica Silva, J. Barbosa, A. Yamin
Social networks provide a new way of communication that still preserves our human social interaction. Due to the widespread use of mobile devices, people tend to use their smartphone or tablet as the main way to make that interaction. Furthermore, applications developed to these devices are fostering the use of contextual information, such as the location of the user. In this way, this article proposes Mingle, a model for a spontaneous social network targeted at mobile devices. In our proposal, the social network is spontaneous, i.e. involves only people that are physically present in a specific location. Besides presenting the model, we show a developed prototype using Android-based devices. We evaluated Mingle employing two strategies, a usage case and a performance evaluation. The results were encouraging and show the potential of deploying Mingle in real situations.
{"title":"Mingle spontaneous social network","authors":"D. Zaupa, C. Costa, Jessica Silva, J. Barbosa, A. Yamin","doi":"10.1109/CASoN.2012.6412394","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412394","url":null,"abstract":"Social networks provide a new way of communication that still preserves our human social interaction. Due to the widespread use of mobile devices, people tend to use their smartphone or tablet as the main way to make that interaction. Furthermore, applications developed to these devices are fostering the use of contextual information, such as the location of the user. In this way, this article proposes Mingle, a model for a spontaneous social network targeted at mobile devices. In our proposal, the social network is spontaneous, i.e. involves only people that are physically present in a specific location. Besides presenting the model, we show a developed prototype using Android-based devices. We evaluated Mingle employing two strategies, a usage case and a performance evaluation. The results were encouraging and show the potential of deploying Mingle in real situations.","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-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123359257","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.6412427
M. Janáková
The paper presents and discusses the quality of service and process control in selected information technology (IT) products with links to their efficiency. The advantage is a wider analysis this problem over operating and database systems, Business Intelligence (BI) and Customer Relationship Management (CRM) products with respect to the complexity of the implementation. A good starting point is an analysis of selected products based on Petri Nets with support simulation and further analysis. Th is analysis produces re sults in order to find a way of improving adopted services for web applications. The Jaspersoft Suite (BI) and Sugar CRM products offer minimal information and methods to control processes via a scheduler for reports and meetings. Effective control of processes needs an elaborate solution. An inspirational way is complex solution in the Oracle database system with chains for a better overview about process relations and contexts. Difficult orientation within the Oracle website is compensated by a user-friendly interface that is absent in the OpenSolaris operating system with otherwise comprehensive environment for process control.
本文介绍并讨论了选定的信息技术(IT)产品的服务质量和过程控制及其效率的联系。其优点是，相对于操作系统和数据库系统、商业智能(BI)和客户关系管理(CRM)产品，在实现的复杂性方面可以对该问题进行更广泛的分析。一个很好的起点是基于Petri网对选定产品进行分析，并进行支持仿真和进一步分析。该分析产生的结果是为了找到一种改进web应用程序所采用的服务的方法。Jaspersoft Suite (BI)和Sugar CRM产品提供了最少的信息和方法，通过报告和会议的调度程序来控制过程。过程的有效控制需要精心的解决方案。一个鼓舞人心的方法是在Oracle数据库系统中使用链的复杂解决方案，以便更好地概述进程关系和上下文。OpenSolaris操作系统中缺少的用户友好界面弥补了Oracle网站中难以定位的问题，而OpenSolaris操作系统具有全面的进程控制环境。
{"title":"Quality of service & process control: What is their efficiency in available IT products?","authors":"M. Janáková","doi":"10.1109/CASoN.2012.6412427","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412427","url":null,"abstract":"The paper presents and discusses the quality of service and process control in selected information technology (IT) products with links to their efficiency. The advantage is a wider analysis this problem over operating and database systems, Business Intelligence (BI) and Customer Relationship Management (CRM) products with respect to the complexity of the implementation. A good starting point is an analysis of selected products based on Petri Nets with support simulation and further analysis. Th is analysis produces re sults in order to find a way of improving adopted services for web applications. The Jaspersoft Suite (BI) and Sugar CRM products offer minimal information and methods to control processes via a scheduler for reports and meetings. Effective control of processes needs an elaborate solution. An inspirational way is complex solution in the Oracle database system with chains for a better overview about process relations and contexts. Difficult orientation within the Oracle website is compensated by a user-friendly interface that is absent in the OpenSolaris operating system with otherwise comprehensive environment for process control.","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":"124336344","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.6412401
L. Liccardo, M. Rak, G. Modica, O. Tomarchio
The Cloud Computing paradigm attracts many customers because of the potentialities it promises. Despite of many benefits, a widespread adoption is limited by many issues that potential customers still have to face. Security in the cloud is one of the main concern for the customer. The Cloud Service Provider (CSP) is responsible of providing security to customers and assuring that their data and application are properly secured. In this context, the concept of Service Level Agreement (SLA) assumes a great importance. It can be used as a means to formalize and establish in a contract what must effectively be granted in terms of security levels. There is actually Semantic Gap between how security guarantees are intended respectively by customers and providers. A customer is inclined to express security in terms of high-level requirements, while a CSP expresses guarantees through a technical, low-level language. To address this gap, the key is to find a common language for both the customer and the CSP. The goal of this paper is to offer an Ontology-based Negotiation Service allowing a customer to negotiate the interested security level among different CSPs, with the possibility to choose the best security offering; a Security Ontology was developed as a basis for a common semantic language that customers and providers will have to use to express security features and requirements.
{"title":"Ontology-based Negotiation of security requirements in cloud","authors":"L. Liccardo, M. Rak, G. Modica, O. Tomarchio","doi":"10.1109/CASoN.2012.6412401","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412401","url":null,"abstract":"The Cloud Computing paradigm attracts many customers because of the potentialities it promises. Despite of many benefits, a widespread adoption is limited by many issues that potential customers still have to face. Security in the cloud is one of the main concern for the customer. The Cloud Service Provider (CSP) is responsible of providing security to customers and assuring that their data and application are properly secured. In this context, the concept of Service Level Agreement (SLA) assumes a great importance. It can be used as a means to formalize and establish in a contract what must effectively be granted in terms of security levels. There is actually Semantic Gap between how security guarantees are intended respectively by customers and providers. A customer is inclined to express security in terms of high-level requirements, while a CSP expresses guarantees through a technical, low-level language. To address this gap, the key is to find a common language for both the customer and the CSP. The goal of this paper is to offer an Ontology-based Negotiation Service allowing a customer to negotiate the interested security level among different CSPs, with the possibility to choose the best security offering; a Security Ontology was developed as a basis for a common semantic language that customers and providers will have to use to express security features and requirements.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"168 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":"116639660","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.6412390
B. Tripathy, A. Mitra
The development of several popular social networks in recent days and publication of social network data has led to the danger of disclosure of sensitive information of individuals. This necessitated the preservation of privacy before the publication of such data. There are several algorithms developed to preserve privacy in micro data. But these algorithms cannot be applied directly as in social networks the nodes have structural properties along with their labels. k-anonymity and l-diversity are efficient tools to anonymise micro data. So efforts have been made to find out similar algorithms to handle social network anonymisation. In this paper we propose an algorithm which can be used to achieve k-anonymity and l-diversity in social network anonymisation. This algorithm is based upon some existing algorithms developed in this direction.
{"title":"An algorithm to achieve k-anonymity and l-diversity anonymisation in social networks","authors":"B. Tripathy, A. Mitra","doi":"10.1109/CASoN.2012.6412390","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412390","url":null,"abstract":"The development of several popular social networks in recent days and publication of social network data has led to the danger of disclosure of sensitive information of individuals. This necessitated the preservation of privacy before the publication of such data. There are several algorithms developed to preserve privacy in micro data. But these algorithms cannot be applied directly as in social networks the nodes have structural properties along with their labels. k-anonymity and l-diversity are efficient tools to anonymise micro data. So efforts have been made to find out similar algorithms to handle social network anonymisation. In this paper we propose an algorithm which can be used to achieve k-anonymity and l-diversity in social network anonymisation. This algorithm is based upon some existing algorithms developed in this direction.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"18 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":"126589555","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
扫码关注我们
求助内容：
应助结果提醒方式：