{"title":"Towards Adaptive Peer Assessment for MOOCs","authors":"N. Capuano, S. Caballé","doi":"10.1109/3PGCIC.2015.7","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.7","url":null,"abstract":"The increase in popularity of Massive Open Online Courses (MOOCs) requires the resolution of new issues related to the huge number of participants to such courses. Among the main challenges is the difficulty in students' assessment, especially for complex assignments, such as essays or open-ended exercises, which is limited by the ability of teachers to evaluate and provide feedback at large scale. A feasible approach to tackle this problem is peer assessment, in which students also play the role of assessor for assignments submitted by others. Unfortunately, as students may have different expertise, peer assessment often does not deliver accurate results compared to human experts. In this paper, we describe and compare different methods aimed at mitigating this issue by adaptively combining peer grades on the basis of the detected expertise of the assessors. The possibility to improve these results through optimized techniques for assessors' assignment is also discussed. Experimental results with synthetic data are presented and show better performances compared to standard aggregation operators (i.e. median or mean) as well as to similar existing approaches.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115027836","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":"A Non-genuine Message Detection Method Based on Unstructured Datasets","authors":"M. Trovati, Richard Hill, N. Bessis","doi":"10.1109/3PGCIC.2015.108","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.108","url":null,"abstract":"The identification of non-genuine or malicious messages poses a variety of challenges due to the continuous changes in the techniques utilised by cyber-criminals. In this article, we discuss a further evaluation of the text spam recognition method introduced in [1], which is based on semantic properties of documents to assess the level of maliciousness. Further experimental results show the accuracy and potential of our approach.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115353405","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":"Hierarchical Real-Time Multi-core Scheduling through Virtualization: A Survey","authors":"Yorick De Bock, J. Broeckhove, P. Hellinckx","doi":"10.1109/3PGCIC.2015.32","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.32","url":null,"abstract":"In recent years mechatronic systems have evolved towards a new generation of cyber-physical systems. Technology has shifted from mechanical control systems towards electronic control systems, which introduces a fast growing complexity. The use of multi-core processors and virtualization techniques on embedded systems tackles this complexity by decoupling software from hardware. Virtualization introduces a hierarchical scheduling structure, where hard real-time behavior must be guaranteed within the level of guest operating system scheduler and at the level of the hypervisor scheduler. This paper gives the current state of the art of schedulability analysis methodologies for hierarchical scheduling techniques and its application in real-time hypervisors.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116033436","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}
Jie Qin, H. Tian, Yongfeng Huang, Jin Liu, Yonghong Chen, Tian Wang, Yiqiao Cai, Xu An Wang
{"title":"An Efficient VoIP Steganography Based on Random Binary Matrix","authors":"Jie Qin, H. Tian, Yongfeng Huang, Jin Liu, Yonghong Chen, Tian Wang, Yiqiao Cai, Xu An Wang","doi":"10.1109/3PGCIC.2015.65","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.65","url":null,"abstract":"To reduce the distortion while maintaining relatively large embedding capacity, a steganographic scheme based on random binary matrix is presented in this paper. We first design a 3×4 covering code, which can hide 3 bits of secret messages into 4 bits of cover messages with not more than 2-bit changed. Further, we construct a random binary matrix with cover bits at diagonal lines for steganography, and conceal secret messages into each four cover bits encrypted with the other binary bits of their rows or columns using the above 3×4 covering code. The proposed scheme is evaluated with a large number of G.711 encode speech samples. The experimental results show that our scheme can provide good performance on both steganographic transparency and embedding capacity.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125849612","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":"Dynamic Modification of Continuous Queries by Using RDF Metadata of Information Sources","authors":"Yousuke Watanabe, H. Yokota","doi":"10.1109/3PGCIC.2015.105","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.105","url":null,"abstract":"Continuous queries over data streams have been used in many applications. They incrementally produce their query results according to data arrival and time progress. However, existing continuous query languages strongly assume that all information sources to be accessed by queries are explicitly specified and permanently fixed. There are more sophisticated requirements such as changing information sources and rewriting filter conditions during query execution. This paper proposes a dynamic query modification scheme for continuous queries. Our continuous query language treats not only stream data from information sources, but also metadata of the information sources and queries themselves. Internally, a continuous query is represented as a dataflow, which is an RDF graph of operators. Thus, modifying a continuous query can be regarded as rewriting the corresponding RDF graph. Searching information sources which satisfy the conditions can be also regarded as searching RDF graphs descripting metadata of information sources. Our scheme achieves both continuous searching information sources and rewriting dataflows.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126891088","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}
C. Chilipirea, Andreea-Cristina Petre, C. Dobre, M. Steen
{"title":"Proximity Graphs for Crowd Movement Sensors","authors":"C. Chilipirea, Andreea-Cristina Petre, C. Dobre, M. Steen","doi":"10.1109/3PGCIC.2015.147","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.147","url":null,"abstract":"Sensors are now common, they span over different applications, different purposes and some over large geospatial areas. Most data produced by these sensors needs to be linked to the physical location of the sensor itself. By using the location of a sensor we can construct (mathematically) proximity graphs that have the sensors as nodes. These graphs have a wide variety of applications including visualization, packet routing, and spatial data analysis. We consider a sensor network that measures detections of WiFi packets transmitted by devices, such as smartphones. One important feature of sensors is given by the range in which they can gather data. Algorithms that build proximity graphs do not take this radius into account. We present an approach to building proximity graph that takes sensor position and radius as input. Our goal is to construct a graph that contains edges between pairs of sensors that are correlated to crowd movements, reflecting paths that individuals are likely to take. Because we are considering crowd movement, it gives us the unique opportunity to construct graphs that show the connections between sensors using consecutive detections of the same device. We show that our approach is better than ones that are based on the positioning of sensors only.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114536533","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":"Efficient Cryptology-Specific Instructions Generation with Algebra Primitives","authors":"Lei Liu, Guijie Han, Zixin Zhou, Sikun Li","doi":"10.1109/3PGCIC.2015.132","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.132","url":null,"abstract":"This paper presents a novel approach for cryptology-specific instructions generation on a reconfigurable architecture which is named ASRA. The ASRA tightly integrates a customized reconfigurable core with a very-long instruction word basic core. Both cores in ASRA can work in parallel. The methodology for cryptology-specific instruction generation can directly deploy algebraic operations as primitives for ASRA's custom function units (CFUs), and is able to eliminate a large portion of design space exploration difficulty from conventional data-flow graph methods. Cryptology-specific instructions for block cipher and hash algorithms which are kernel data processing tasks in security applications are exploited. Then an accelerator prototype of the ASRA is built on a Xilinx Kintex-7 FPGA chip. Experiment results show that our work achieves a high performance improvement and a good flexibility.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114627829","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":"Introducing Auto Generated Certificates to Rank Wireless Home Network Security","authors":"M. Gaj, N. Bessis, Lu Liu","doi":"10.1109/3PGCIC.2015.17","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.17","url":null,"abstract":"Periodically research focusing on the level of security in home wireless networks, would reveal a considerable percentage of insecure networks. Labeling them as such, could come from either failing to utilise appropriate security standards or by using the obsolete ones. Relevant data specifying the security standards used was collected by performing an act of wardriving. The essential part of it would be to use the wireless network card's ability to work in a monitoring mode, and passively collect required information such as network name, encryption type and Service set identification (SSID). In this article a system is proposed that uses this data as the basis for a certification mechanism that has a purpose of alerting users by providing them with the insight of the level of their home security wireless network. Four important parts of this mechanism are presented with a flow based algorithm and implemented using Bash scripting language. Finally, a test case scenario and expected results are provided.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126655205","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 a MapReduce Hadoop-Based Implementation for Processing Large Virtual Campus Log Files","authors":"F. Xhafa, Daniel Garcia, D. Ramirez, S. Caballé","doi":"10.1109/3PGCIC.2015.42","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.42","url":null,"abstract":"Cloud computing technologies are bringing new scales of computational processing power and storage capacity to meet very demanding requirements of today's applications. One such family of applications is the one of analytics based on processing big data. More specifically, there is a large family of analytics applications from processing log data files. Indeed, log data files are commonplace in many Internet-based systems and applications, comprising system logs, server logs, application logs, databases logs, user activity logs, etc. These applications are analytics oriented applications based on processing the various types of log files. While log data file processing has been recently an issue of investigation by many researchers and developers, the new feature is that of scale: Cloud based systems can enable processing unlimited amount of data either off-line or online in streaming mode. In this work we evaluate the performance of a MapReduce Hadoop-based implementation for processing large log data files of a Virtual Campus. The study aims to reveal the potential of using such implementations as a basis for learning analytics for use by a variety of users in a Virtual Campus.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117197065","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":"Machine Cognition and the Integration of Emotional Response in the Monitoring of Mental Disorders","authors":"P. Moore, H. Pham, Bin Hu, Hong Liu, T. Qassem","doi":"10.1109/3PGCIC.2015.38","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.38","url":null,"abstract":"Computer science relies heavily on computational modeling and while the value of such an approach is generally recognized the methodological account of computational explanation is not up-to-date. In this paper we explore machine cognition with the creation of effective cognitive modeling and consider the elemental components that combine to create an effective cognitive model. The creation of such a model will enable the processing of information in intelligent context-aware systems while integrating emotion (more accurately stated as emotive response). We present a brief review of related research addressing cognitive science and machine cognition in which we identify the concept of self. Modeling is introduced with an overview of conceptual models and semiotics followed by consideration of implementation using a proposed approach based on fuzzy sets. We introduce depression as a use-case to illustrate the proposed approach and a general discussion where future directions for research and open research questions are considered. The paper closes with concluding observations. We posit that creating an effective cognitive model offers the potential to integrate emotive response and thereby improve context-aware systems in a broad and diverse range of domains and systems along with improvements in the levels of computational intelligence.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132301058","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}