Abstract
Social networks can often be considered the main stage of news, so detecting newsworthy information in this media is a relevant subject of study. Labeling automatically messages shared in social networks is an area of study that can be used directly to detect newsworthy information or to serve as training data for other projects. The solution presented in this work is to use the news as the base knowledge for the classification of messages. The results of this application were promising, with an accuracy of over 90% in detecting news related messages in our datasets. © 2017 IEEE.

Abstract
Measuring the return on communication investments on social media has become one of the top key issues for organizations joining social networks. However, this field has been lacking articulation between what is conveyed as social media key performance indicators and the alignment of strategic organizational goals. Therefore, we propose a methodology to measure the performance of each organization on social media, to determine their positioning in the sector and to evaluate which are the content strategies used to boost the highest performing organizations. Thus, we identify how to determine which organizations should be closely monitored within the sector and which type content strategies can foster higher organizational performance on social media. © 2017 Copyright is held by the owner/author(s).

Abstract
Social networks as Facebook and Twitter gained a remarkable attention in the last decade. A huge amount of data is emerging and posted everyday by users that are becoming more interested in and relying on social network for information, news and opinions. Real time posting came to rise and turned easier to report news and events. However, due to its dimensions, in this work we focus on building a system architecture capable of detecting journalistic relevance of posts automatically on this 'haystack' full of data. More specifically, users will have the change to interact with a 'friendly user interface' which will provide several tools to analyze data. © 2017.

Abstract
The structural patterns in the neighborhood of nodes assign unique roles to the nodes. Mining the set of existing roles in a network provides a descriptive profile of the network and draws its general picture. This paper proposes a new method to determine structural roles in a dynamic network based on the current position of nodes and their historic behavior. We develop a temporal ensemble clustering technique to dynamically find groups of nodes, holding similar tempo-structural roles. We compare two weighting functions, based on age and distribution of data, to incorporate temporal behavior of nodes in the role discovery. To evaluate the performance of the proposed method, we assess the results from two points of view: 1) goodness of fit to current structure of the network; 2) consistency with historic data. We conduct the evaluation using different ensemble clustering techniques. The results on real world networks demonstrate that our method can detect tempo-structural roles that simultaneously depict the topology of a network and reflect its dynamics with high accuracy.

Abstract
We address the problem of whether networks of mobile devices such as smart-phones or tablets can be used to perform opportunistic, best-effort, parallel computations. We designed and implemented P3-Mobile, a parallel programming system for edge-clouds of Android devices to test the feasibility of this idea. P3-Mobile comes with a programming model that supports parallel computations over peer-to-peer overlays mapped onto mobile networks. The system performs automatic load-balancing by using the overlay to discover work. We present preliminary performance results for a parallel benchmark, using up to 16 devices, and discuss their implications towards future work. Copyright © 2017 ACM.

Abstract
With recent advances in high-throughput cell biology, the amount of cellular biological data has grown drastically. Such data is often modeled as graphs (also called networks) and studying them can lead to new insights intomolecule-level organization. A possible way to understand their structure is by analyzing the smaller components that constitute them, namely network motifs and graphlets. Graphlets are particularly well suited to compare networks and to assess their level of similarity due to the rich topological information that they offer but are almost always used as small undirected graphs of up to five nodes, thus limiting their applicability in directed networks. However, a large set of interesting biological networks such asmetabolic, cell signaling, or transcriptional regulatory networks are intrinsically directional, and using metrics that ignore edge direction may gravely hinder information extraction. Our main purpose in this work is to extend the applicability of graphlets to directed networks by considering their edge direction, thus providing a powerful basis for the analysis of directed biological networks. We tested our approach on two network sets, one composed of synthetic graphs and another of real directed biological networks, and verified that they were more accurately grouped using directed graphlets than undirected graphlets. It is also evident that directed graphlets offer substantially more topological information than simple graph metrics such as degree distribution or reciprocity. However, enumerating graphlets in large networks is a computationally demanding task. Our implementation addresses this concern by using a state-of-the-art data structure, the g-trie, which is able to greatly reduce the necessary computation. We compared our tool to other state-of-the art methods and verified that it is the fastest general tool for graphlet counting.