Abstract
The adoption of social media networks by organizations has been increasing, mainly by using more social networks but also by constantly increasing on the number of messages and received comments posted on these channels. Interestingly, this process apparently has not been accompanied by a carefully planned and strategically design process to provide the essential alignment with organizational goals. This study is framed in the tertiary sector, the Higher Education Sector (HES), which despite its peculiarities, is no exception to the above limitations, and is facing an increased competitive environment. In this paper we present a sector benchmarking process, and the respective analysis, to provide insights on the sector's tendency, as well as a threefold classification of the sector's social media strategies being pursued. The analysis builds upon a regulatory communication framework and respective editorial model. We describe the results of our automatic text-mining and categorization information system, specifically developed to address and analyze the seven categories of HES' social media messages. Our results show that social media strategies have been focusing essentially on mediatization and building/maintaining the organizational image/reputation as well as on advertising educational services, but completely neglecting the dialogical dimension intrinsically linked to social media environments. (C) 2015 The Authors. Published by Elsevier B.V.

Abstract
Group work is an essential activity during both graduate and undergraduate formation. Although there is a vast theoretical literature and numerous case studies about group work, we haven’t yet seen much development concerning the assessment of individual group participants. The problem relies on the difficulty to have the perception of each student’s contribution towards the whole work. We propose and describe a novel tool to manage and assess individual group. Using the collected interactions from the tool usage we create a model for predicting ill-conditioned interactions which generate alerts. We also describe a functionality to predict the final activity grading, based on the interaction patterns and on an automatic classification of these interactions. © Springer International Publishing Switzerland 2015.

Abstract
Group work is an essential activity during both graduate and undergraduate formation. During group work Students develop a set of skills, and employ criticism which helps them to better handle future interpersonal situations. Although there is a vast theoretical literature and numerous case studies about group work, we haven't yet seen much development concerning the assessment of individual group participants. The problem relies on the difficulty to have the perception of each student contribution to the whole work. Nevertheless, more than frequently, the assessment of the group is transposed to each group participant, which in turn results in each student having the same final mark. We propose and describe a novel tool to manage and assess individual group work taking into account the amount of work, interaction, quality, and the temporal evolution of each group participant. The module features the possibility to predict the final activity grading, based on the interaction patterns and automatic comparison with former interaction patterns. We describe the conceptual design of our tool and present its two operating modes of the module. We then describe the methodology for the assessment in the two operating modes and how the tool collects data from interactions to predict final grading.

Abstract
The ultimate goal of feature selection is to select the smallest subset of features that yields minimum generalization error from an original set of features. This effectively reduces the feature space, and thus the complexity of classifiers. Though several algorithms have been proposed, no single one outperforms all the other in all scenarios, and the problem is still an actively researched field. This paper proposes a new hybrid parallel approach to perform feature selection. The idea is to use a filter metric to reduce feature space, and then use an innovative wrapper method to search extensively for the best solution. The proposed strategy is implemented on a shared memory parallel environment to speedup the process. We evaluated its parallel performance using up to 32 cores and our results show 30 times gain in speed. To test the performance of feature selection we used five datasets from the well known NIPS challenge and were able to obtain an average score of 95.90% for all solutions.

Abstract
An important dimension of complex networks is embedded in the weights of its edges. Incorporating this source of information on the analysis of a network can greatly enhance our understanding of it. This is the case for gene co-expression networks, which encapsulate information about the strength of correlation between gene expression profiles. Classical un-weighted gene co-expression networks use thresholding for defining connectivity, losing some of the information contained in the different connection strengths. In this paper, we propose a mining method capable of extracting information from weighted gene co-expression networks. We study groups of differently connected nodes and their importance as network motifs. We define a subgraph as a motif if the weights of edges inside the subgraph hold a significantly different distribution than what would be found in a random distribution. We use the Kolmogorov-Smirnov test to calculate the significance score of the subgraph, avoiding the time consuming generation of random networks to determine statistic significance. We apply our approach to gene co-expression networks related to three different types of cancer and also to two healthy datasets. The structure of the networks is compared using weighted motif profiles, and our results show that we are able to clearly distinguish the networks and separate them by type. We also compare the biological relevance of our weighted approach to a more classical binary motif profile, where edges are unweighted. We use shared Gene Ontology annotations on biological processes, cellular components and molecular functions. The results of gene enrichment analysis show that weighted motifs are biologically more significant than the binary motifs.

Abstract
Nodes in complex networks inherently represent different kinds of functional or organizational roles. In the dynamic process of an information cascade, users play different roles in spreading the information: some act as seeds to initiate the process, some limit the propagation and others are in-between. Understanding the roles of users is crucial in modeling the cascades. Previous research mainly focuses on modeling users behavior based upon the dynamic exchange of information with neighbors. We argue however that the structural patterns in the neighborhood of nodes may already contain enough information to infer users' roles, independently from the information flow in itself. To approach this possibility, we examine how network characteristics of users affect their actions in the cascade. We also advocate that temporal information is very important. With this in mind, we propose an unsupervised methodology based on ensemble clustering to classify users into their social roles in a network, using not only their current topological positions, but also considering their history over time. Our experiments on two social networks, Flickr and Digg, show that topological metrics indeed possess discriminatory power and that different structural patterns correspond to different parts in the process. We observe that user commitment in the neighborhood affects considerably the influence score of users. In addition, we discover that the cohesion of neighborhood is important in the blocking behavior of users. With this we can construct topological fingerprints that can help us in identifying social roles, based solely on structural social ties, and independently from nodes activity and how information flows.