http://hdl.handle.net/10379/5414 2017-10-30T00:00:15Z 2017-10-30T00:00:15Z Aumayr, Erik Hayes, Conor http://hdl.handle.net/10379/6920 2017-10-21T01:02:34Z 2017-08-23T00:00:00Z

The path to success: A study of user behaviour and success criteria in online communities Aumayr, Erik; Hayes, Conor Maintaining online communities is vital in order to increase and retain their economic and social value. That is why community managers look to gauge the success of their communities by measuring a variety of user behaviour, such as member activity, turnover and interaction. However, such communities vary widely in their purpose, implementation and user demographics, and although many success indicators have been proposed in the literature, we will show that there is no one- ts-all approach to community success: Different success criteria depend on different user behaviour. To demonstrate this, we put together a set of user behaviour features, including many that have been used in the literature as indicators of success, and then we define and predict community success in three different types of online communities: Questions & Answers (Q&A), Healthcare and Emotional Support (Life & Health), and Encyclopaedic Knowledge Creation. The results show that it is feasible to relate community success to specific user behaviour with an accuracy of 0.67–0.93 F1 score and 0.77–1.0 AUC.

2017-08-23T00:00:00Z Wood, Ian http://hdl.handle.net/10379/6907 2017-10-12T01:01:51Z 2015-01-01T00:00:00Z

A case study of collecting dynamic social data: The pro-ana twitter community Wood, Ian The study of social processes in on-line social media content is a relatively new and rapidly growing endeavour. Many social media platforms provide a public API (Application Programming Interface) which can be used for the targeted collection of data from perceived communities, however existing software for this purpose focusses on a â snapshotâ of the community and its communications, and ignores im- portant aspects of its dynamics. We present a data collection system designed to capture tweets and the dynamics of Twitter user profile and friend/follower lists, and an approach to identify a set of tags or keywords that define an on-line community. This approach and system were used to collect a data set spanning 2 years and 7 months (including 3 Christmas periods) from the â pro-anaâ (pro-anorexia) and eating disorder Twitter community.

2015-01-01T00:00:00Z Yadav, Piyush Hasan, Souleiman Ojo, Adegboyega Curry, Edward http://hdl.handle.net/10379/6896 2017-10-10T01:02:20Z 2017-06-05T00:00:00Z

The role of open data in driving sustainable mobility in nine smart cities Yadav, Piyush; Hasan, Souleiman; Ojo, Adegboyega; Curry, Edward In today’s era of globalization, sustainable mobility is considered as a key factor in the economic growth of any country. With the emergence of open data initiatives, there is tremendous potential to improve mobility. This paper presents findings of a detailed analysis of mobility open data initiatives in nine smart cities – Amsterdam, Barcelona, Chicago, Dublin, Helsinki, London, Manchester, New York and San Francisco. The paper discusses the study of various sustainable indicators in the mobility domain and its convergence with present open datasets. Specifically, it throws light on open data ecosystems in terms of their production and consumption. It gives a comprehensive view of the nature of mobility open data with respect to their formats, interactivity, and availability. The paper details the open datasets in terms of their alignment with different mobility indicators, publishing platforms, applications and API’s available. The paper discusses how these open datasets have shown signs of fostering organic innovation and sustainable growth in smart cities with impact on mobility trends. The results of the work can be used to inform the design of data driven sustainable mobility in smart cities to maximize the utilization of available open data resources.

2017-06-05T00:00:00Z Aslam, Asra Ansari, Mohd. Samar Varshney, Shikha http://hdl.handle.net/10379/6894 2017-10-10T01:01:11Z 2016-03-04T00:00:00Z

Non-partitioning merge-sort: Performance enhancement by elimination of division in divide-and-conquer algorithm Aslam, Asra; Ansari, Mohd. Samar; Varshney, Shikha The importance of a high performance sorting algorithm with low time complexity cannot be over stated. Several benchmark algorithms viz. Bubble Sort, Insertion Sort, Quick Sort, and Merge Sort, etc. have tried to achieve these goals, but with limited success in some scenarios. Newer algorithms like Shell Sort, Bucket Sort, Counting Sort, etc. have their own limitations in terms of category/nature of elements which they can process. The present paper is an attempt to enhance performance of the standard Merge-Sort algorithm by eliminating the partitioning complexity component, thereby resulting in smaller computation times. Both subjective and numerical comparisons are drawn with existing algorithms in terms of time complexity and data sizes, which show the superiority of the proposed algorithm.

2016-03-04T00:00:00Z