Imperial College Computing Student Workshop最新文献

{"title":"Comparison of Platforms for Recommender Algorithm on Large Datasets","authors":"Christina Diedhiou, Bryan Carpenter, Ramazan Esmeli","doi":"10.4230/OASIcs.ICCSW.2018.4","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2018.4","url":null,"abstract":"One of the challenges our society faces is the ever increasing amount of data. Among existing platforms that address the system requirements, Hadoop is a framework widely used to store and analyze “big data”. On the human side, one of the aids to finding the things people really want is recommendation systems. This paper evaluates highly scalable parallel algorithms for recommendation systems with application to very large data sets. A particular goal is to evaluate an open source Java message passing library for parallel computing called MPJ Express, which has been integrated with Hadoop. As a demonstration we use MPJ Express to implement collaborative filtering on various data sets using the algorithm ALSWR (Alternating-Least-Squares with Weighted-λ-Regularization). We benchmark the performance and demonstrate parallel speedup on Movielens and Yahoo Music data sets, comparing our results with two other frameworks: Mahout and Spark. Our results indicate that MPJ Express implementation of ALSWR has very competitive performance and scalability in comparison with the two other frameworks. 2012 ACM Subject Classification Information systems→ Database management system engines","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124545609","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":"Towards Context-Aware Syntax Parsing and Tagging","authors":"Alaa Mohasseb, M. Bader-El-Den, Ella Haig","doi":"10.4230/OASIcs.ICCSW.2018.5","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2018.5","url":null,"abstract":"Information retrieval (IR) has become one of the most popular Natural Language Processing (NLP) applications. Part of speech (PoS) parsing and tagging plays an important role in IR systems. A broad range of PoS parsers and taggers tools have been proposed with the aim of helping to find a solution for the information retrieval problems, but most of these are tools based on generic NLP tags which do not capture domain-related information. In this research, we present a domain-specific parsing and tagging approach that uses not only generic PoS tags but also domain-specific PoS tags, grammatical rules, and domain knowledge. Experimental results show that our approach has a good level of accuracy when applying it to different domains.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115282220","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":"The iBUG Eye Segmentation Dataset","authors":"Bingnan Luo, Jie Shen, Yujiang Wang, M. Pantic","doi":"10.4230/OASIcs.ICCSW.2018.7","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2018.7","url":null,"abstract":"This paper presents the first dataset for eye segmentation in low resolution images. Although eye segmentation has long been a vital preprocessing step in biometric applications, this work is the first to focus on low resolutions image that can be expected from a consumer-grade camera under conventional human-computer interaction and / or video-chat scenarios. Existing eye datasets have multiple limitations, including: (a) datasets only contain high resolution images; (b) datasets did not include enough pose variations; (c) a utility landmark ground truth did not be provided; (d) high accurate pixel-level ground truths had not be given. Our dataset meets all the above conditions and requirements for different segmentation methods. Besides, a baseline experiment has been performed on our dataset to evaluate the performances of landmark models (Active Appearance Model, Ensemble Regression Tree and Supervised Descent Method) and deep semantic segmentation models (Atrous convolutional neural network with conditional random field). Since the novelty of our dataset is to segment the iris and the sclera areas, we evaluate above models on sclera and iris only respectively in order to indicate the feasibility on eye-partial segmentation tasks. In conclusion, based on our dataset, deep segmentation methods performed better in terms of IOU-based ROC curves and it showed potential abilities on low-resolution eye segmentation task.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130439248","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":"Data-Driven Chinese Walls","authors":"Gulsum Akkuzu, B. Aziz","doi":"10.4230/OASIcs.ICCSW.2018.3","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2018.3","url":null,"abstract":"Security policy and access control models are often based on qualitative attributes, e.g. security labels, cryptographic credentials. In this paper, we enrich one such model, namely the Chinese Walls model, with quantitative attributes derived from data. Therefore, we advocate a datadriven approach that considers a quantitative definition of access we term, working relations.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114827610","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":"Speeding Up BigClam Implementation on SNAP","authors":"C. H. B. Liu, B. Chamberlain","doi":"10.4230/OASIcs.ICCSW.2018.1","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2018.1","url":null,"abstract":"We perform a detailed analysis of the C++ implementation of the Cluster Affiliation Model for Big Networks (BigClam) on the Stanford Network Analysis Project (SNAP). BigClam is a popular graph mining algorithm that is capable of finding overlapping communities in networks containing millions of nodes. Our analysis shows a key stage of the algorithm - determining if a node belongs to a community - dominates the runtime of the implementation, yet the computation is not parallelized. We show that by parallelizing computations across multiple threads using OpenMP we can speed up the algorithm by 5.3 times when solving large networks for communities, while preserving the integrity of the program and the result.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123048633","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":"Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data","authors":"Kjell Winblad","doi":"10.4230/OASIcs.ICCSW.2017.7","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2017.7","url":null,"abstract":"The need for scalable concurrent ordered set data structures with linearizable range query support is increasing due to the rise of multicore computers, data processing platforms and in-memory databases. This paper presents a new concurrent ordered set with linearizable range query support. The new data structure is based on the contention adapting search tree and an immutable data structure. Experimental results show that the new data structure is as much as three times faster compared to related data structures. The data structure scales well due to its ability to adapt the sizes of its immutable parts to the contention level and the sizes of the range queries.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126209236","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":"Affective Computing to Enhance E-Learning in Segregated Societies","authors":"Khaled El-Abbasy, A. Angelopoulou, T. Towell","doi":"10.4230/OASIcs.ICCSW.2015.13","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2015.13","url":null,"abstract":"According to UN Women, to build stronger economies, it is essential to empower women to participate fully in economic life across all sectors. Increasing women and girls’ education enhances their chances to participate in the labor market. In certain cultures, like in Saudi Arabia, women contribution to the public economy growth is very limited. According to the World Bank, less than 20 percent of the female population participate in the labor force. This low participation rate has many reasons. One of them, is the educational level and educational quality for females. Although Saudi Arabia has about thirty three universities, opportunities are still limited for women because of the restrictions of access put upon them. A mixture of local norms, traditions, social beliefs, and principles preventing women from receiving full benefits from the educational system. Gender segregation is one of the challenges that limits the women access for education. It causes a problem due to the shortage of female faculty throughout the country. To overcome this problem, male faculty are allowed to teach female students under certain regulations and following a certain method of education delivery and interaction. However, most of these methods lack face-to-face communication between the teacher and students, which lowers the interactivity level and, accordingly, the students' engagement, and increases the need for other alternatives. The e-learning model is one of high benefit for female students in such societies. Recognizing the students' engagement is not straightforward in the e-learning model. To measure the level of engagement, the learner's mood or emotions should be taken into consideration to help understanding and judging the level of engagement. This paper is to investigate the relationship between emotions and engagement in the e-learning environment, and how recognizing the learner's emotions and change the content delivery accordingly can affect the efficiency of the e-learning process. The proposed experiment alluded to herein should help to find ways to increase the engagement of the learners, hence, enhance the efficiency of the learning process and the quality of learning, which will increase the chances and opportunities for women in such societies to participate more effectively in the labor market.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505569","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":"Representing Temporal Patterns in Computer-Interpretable Clinical Guidelines","authors":"António Silva, Tiago Oliveira, P. Novais, J. Neves","doi":"10.4230/OASIcs.ICCSW.2015.62","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2015.62","url":null,"abstract":"Computer-Interpretable Guidelines (CIGs) as machine-readable versions of clinical protocols have to provide appropriate constructs for the representation of different aspects of medical knowledge, namely administrative information, workflows of procedures, clinical constraints and temporal constraints. This work focuses on the latter, by aiming to develop a comprehensive representation of temporal constraints for machine readable formats of clinical protocols and provide a proper execution engine that deals with different time patterns and constraints placed on them. A model for the representation of time is presented for the CompGuide ontology in Ontology Web language (OWL) along with a comparison with the available formalisms in this field.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124061768","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":"Computing Argumentation with Matrices","authors":"Evgenios Hadjisoteriou","doi":"10.4230/OASIcs.ICCSW.2015.29","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2015.29","url":null,"abstract":"Abstract argumentation frameworks with finitely many arguments can be presented in matrix form. For this reason, the strengths and weaknesses of matrix operations are migrated from a mathematical representation to a computer science interpretation. We present matrix operation algorithms that can answer whether a given set of arguments is part of an argumentation extension.","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134019626","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 survey of modelling and simulation software frameworks using Discrete Event System Specification","authors":"Romain Franceschini, P. Bisgambiglia, Luc Touraille, P. Bisgambiglia, D. Hill","doi":"10.4230/OASIcs.ICCSW.2014.40","DOIUrl":"https://doi.org/10.4230/OASIcs.ICCSW.2014.40","url":null,"abstract":"Discrete Event System Specification is an extension of the Moore machine formalism which is used for modelling and analyzing general systems. This hierarchical and modular formalism is time event based and is able to represent any continuous, discrete or combined discrete and continuous systems. Since its introduction by B.P. Zeigler at the beginning of the eighties, most general modelling formalisms able to represent dynamic systems have been subsumed by DEVS. Meanwhile, the modelling and simulation (M&S) community has introduced various software frameworks supporting DEVS-based simulation analysis capability. DEVS has been used in many application domains and this paper will present a technical survey of the major DEVS implementations and software frameworks. We introduce a set of criteria in order to highlight the main features of each software tool, then we propose a table and discussion enabling a fast comparison of the presented frameworks. 1998 ACM Subject Classification I.6 Simulation and modeling","PeriodicalId":188697,"journal":{"name":"Imperial College Computing Student Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126089420","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}