Jian Wu, Kyle Williams, Madian Khabsa, C. Lee Giles
{"title":"The impact of user corrections on a crawl-based digital library: A CiteSeerX perspective","authors":"Jian Wu, Kyle Williams, Madian Khabsa, C. Lee Giles","doi":"10.4108/icst.collaboratecom.2014.257563","DOIUrl":"https://doi.org/10.4108/icst.collaboratecom.2014.257563","url":null,"abstract":"CiteSeerX is a crawl-based digital library search engine providing free access to more than 4 million academic papers. Since metadata in the digital library is obtained through automatic extraction, it is inevitable that errors will occur. CiteSeerX offers a feature allowing registered users to correct paper metadata including titles, authors, abstracts, publication years, venues, etc. We claim that user corrections, as a form of crowd-collaboration, provide a useful and efficient way to improve metadata quality and the impact of the digital library. As evidence to support this claim, we investigate user corrections from the last 5 years and analyze: the nature of the corrections; the quality of the corrections; and the impact of the corrections on downloads.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129937725","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}
Abderrahmen Mtibaa, M. A. Snober, Antonio Carelli, R. Beraldi, H. Alnuweiri
{"title":"Collaborative mobile-to-mobile computation offloading","authors":"Abderrahmen Mtibaa, M. A. Snober, Antonio Carelli, R. Beraldi, H. Alnuweiri","doi":"10.4108/ICST.COLLABORATECOM.2014.257610","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257610","url":null,"abstract":"It is common practice for mobile devices to offload computationally heavy tasks off to a cloud, which has greater computational resources. In this paper, we consider an environment in which computational offloading is made among collaborative mobile devices.We call such an environment a mobile device cloud (MDC). We highlight the gain in computation time and energy consumption that can be achieved by offloading tasks with given characteristics to nearby devices inside a mobile device cloud. We adopt an experimental approach to measure power consumption in mobile to mobile opportunistic offloading using MDCs. Then, we adopt a data driven approach to evaluate and assess various offloading algorithms in MDCs. We believe that MDCs are not replacing the Cloud, however they present an offloading opportunity for a set of tasks with given characteristics or simply a solution when the cloud is unacceptable or costly. The promise of this approach shown by evaluating these algorithms using real datasets that include contact traces and social information of mobile devices in a conference setting.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133891492","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}
{"title":"Transferring influence: Supervised learning for efficient influence maximization across networks","authors":"Qingbo Hu, Guan Wang, Philip S. Yu","doi":"10.4108/ICST.COLLABORATECOM.2014.257260","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257260","url":null,"abstract":"How to maximize influence through social networks is a key challenge behind many important applications in real life. For instance, marketers are interested in how to use limited resource to promote a new product as widely recognized by consumers. In recent years, researchers have conducted numerous studies to conquer this intriguing problem in single network scenario. In terms of the scale of achieved influence, the best solution is a greedy algorithm based on time-consuming Monte Carlo (MC) simulation. However, it is not scalable to large-scale social networks or the scenario of targeting multiple networks.We propose an innovative Transfer Influence Learning (TIL) method based on the study on three real networks, as well as statistics on network features of results generated by the greedy algorithm. The proposed method uses supervised learning technique to efficiently maximize influence across multiple networks. Once having the result of the greedy algorithm in one network, the TIL algorithm can avoid using MC simulation completely on other networks, which enables the algorithm to run very fast. The experiments show that the proposed TIL algorithm is able to generate a diffusion with closed scale comparing to the result of the greedy algorithm within a much faster time, while outperforms some other state-of-art heuristic algorithms.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610745","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}
{"title":"Performance evaluation of spectrum sensing in Cognitive Radio for conventional discrete-time memoryless MIMO fading channel model","authors":"D. Patil, V. Wadhai","doi":"10.4108/ICST.COLLABORATECOM.2014.257555","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257555","url":null,"abstract":"Spectrum sensing is the crucial task of a cognitive radio. Cognitive Radio (CR) have been advanced as a technology for the opportunistic use of underutilized spectrum where secondary users sense the presence of primary users and use the spectrum if it is empty, without affecting their performance. Spectrum sensing in CR is challenged by a number of uncertainties, which degrade the sensing. The discrete-time memory less multiple inputs multiple output (MIMO) fading channel conventional model is implemented to appraise the performance of different spectrum sensing techniques. The signal detection in CR networks under a non parametric multisensory detection scenario is considered for performance comparison under the presence of impulsive noise. The examination focuses on performance evaluation of five different spectrum sensing mechanisms namely energy detection (ED), Generalized Likelihood Ratio Test (GLRT), Roy's largest Root Test (RLRT), Maximum Eigenvalue detection (MED) and Cyclostationary feature detection (CSFD). The analysis of the result indicates that, the sensing performance is improved in GLRT method for conventional model also it can be concluded that the performance under the conventional model can be too pessimistic in absence of impulsive noise.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124045535","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}
{"title":"Making your programming questions be answered quickly: A content oriented study to technical Q&A forum","authors":"Yi Wang","doi":"10.4108/ICST.COLLABORATECOM.2014.257384","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257384","url":null,"abstract":"Online programming forums enable programming knowledge sharing across organizational boundaries. Understanding how questions are asked and answered in forums will not only help developer to access the knowledge they need fast but bring important design implications. We report a study of Q&A process on MSDN's visual C# general forum. This study is content oriented instead of conventional social factor analysis to Communities of Q&A. We identified eight topic categories through two-round card sorting.We also explored various content feature's influence to Q&A process. A qualitative analysis was performed to identify different life-cycle patterns of questions. These findings highlight the role of content features, and the interaction effects between them. Based on these findings, we make a set of suggestions to information seekers on how to make their questions be answered faster, and derive implications for technical forums design and operation. To verify our findings, we also conducted a small replication to a Java technical forum and compared the results.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126538946","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}
Tao Li, Ling Liu, Xiaolong Zhang, Kai Xu, Chao Yang
{"title":"ProvenanceLens: Service provenance management in the cloud","authors":"Tao Li, Ling Liu, Xiaolong Zhang, Kai Xu, Chao Yang","doi":"10.4108/ICST.COLLABORATECOM.2014.257339","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257339","url":null,"abstract":"Service provenance can be defined as a profile of service execution history. Queries of service provenance data can answer questions such as when and by whom a server is invoked? which services operate on this data? What might be the root cause for the service failure? Most of the organizations today collect and manage their own service provenance in order to trace service execution failures, locate service bottlenecks, guide resource allocation, detect and prevent abnormal behaviors. As services become ubiquitous, there is an increasing demand for proving service provenance management as a service. This paper describes ProvenanceLens, a two-tier service provenance management framework. The top tier is the service provenance capturing and storage subsystem and the next tier provides analysis and inference capabilities of service provenance data, which are value-added functionality for service health diagnosis and remedy. Both tiers are built based on the service provenance data model, an essential and core component of ProvenanceLens, which categorizes all service provenance data into three broad categories: basic provenance, composite provenance and application provenance. In addition, ProvenanceLens provides a suite of basic provenance operations, such as select, trace, aggregate. The basic provenance data is collected through a light-weight service provenance capturing subsystem that monitors service execution workflows, collects service profiling data, encapsulates service invocation dependencies. The composite and application provenance data are aggregated through a selection of provenance operations. We demonstrate the effectiveness of ProvenanceLens using a real world educational service currently in operation for a dozen universities in China.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125254736","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}
M. J. Chaudhry, S. Narayanan, M. Renzo, F. Graziosi, Azhar Ul-Haq
{"title":"A novel and collaborative network channel coded mobile communication architecture","authors":"M. J. Chaudhry, S. Narayanan, M. Renzo, F. Graziosi, Azhar Ul-Haq","doi":"10.4108/ICST.COLLABORATECOM.2014.257718","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257718","url":null,"abstract":"This paper presents a novel algebraic framework of collaborative network channel coding scheme in a network with multiple-access relay channel. The proposed scheme helps reduce the computational complexity while enhancing energy efficiency of the wireless network. The devised scheme is intended for practical scenarios where channels exhibit various fading conditions over all the wireless links. We use network coding at the relay to give diversity boost at the receiver with lesser number of transmitted signals and lesser energy consumption. The setup demonstrates improved performance that is instrumental for the effective use of joint network channel coding (JNCC) for practical wireless networks. We further present a performance metric Energy Efficiency for the better performance evaluation.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127888724","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}
Raúl García, Diana Machado, Hsin-Yu Ha, Yimin Yang, Shu‐Ching Chen, S. Hamid
{"title":"A web-based task-tracking collaboration system for the Florida Public Hurricane Loss Model","authors":"Raúl García, Diana Machado, Hsin-Yu Ha, Yimin Yang, Shu‐Ching Chen, S. Hamid","doi":"10.4108/ICST.COLLABORATECOM.2014.257662","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257662","url":null,"abstract":"The Florida Public Hurricane Loss Model (FPHLM) is a large scale, multidisciplinary project developed to assist the state of Florida with the regulation of residential insurance premiums as they relate to insured losses caused by hurricane winds. The modeling services provided to clients using the FPHLM involve physically distributed personnel with different levels of technical expertise. Bringing together such a team to collaborate on the complex task of operating the FPHLM requires a centralized system to support the effective allocation of human resources, the tracking of the different stages of the data processing, and the exchange of information among team members and between the modeler and the clients. In this paper we present a web-based collaboration system that automates the FPHLM's insurance data processing workflow.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115541321","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}
{"title":"Hybrid approach to detect SQLi attacks and evasion techniques","authors":"Abdelhamid Makiou, Y. Begriche, A. Serhrouchni","doi":"10.4108/ICST.COLLABORATECOM.2014.257568","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257568","url":null,"abstract":"Injections flaws which include SQL injection are the most prevalent security threats affecting Web applications[1]. To mitigate these attacks, Web Application Firewalls (WAFs) apply security rules in order to both inspect HTTP data streams and detect malicious HTTP transactions. Nevertheless, attackers can bypass WAF's rules by using sophisticated SQL injection techniques. In this paper, we introduce a novel approach to dissect the HTTP traffic and inspect complex SQL injection attacks. Our model is a hybrid Injection Prevention System (HIPS) which uses both a machine learning classifier and a pattern matching inspection engine based on reduced sets of security rules.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116929984","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}
{"title":"CATT: A cloud based authorization framework with trust and temporal aspects","authors":"Ehtesham Zahoor, O. Perrin, Ahmed Bouchami","doi":"10.4108/ICST.COLLABORATECOM.2014.257312","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257312","url":null,"abstract":"Collaborative environments have put an enormous challenge to secure the information processing systems being used to manage them. Challenges to provide secure framework are amplified when it comes to the domain of flexible and distributed systems as the trust, temporal and performance related aspects need to be catered for. In this paper, we handle some security challenges among others the sub-mentioned ones by proposing a formal cloud-based authorization framework. We have considered trust to be a dynamic attribute to facilitate authorization decisions and have proposed models to handle different qualitative, quantitative and periodicity based temporal constraints. Further, we have presented an architecture for policies evaluation in the cloud.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816854","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}