BlueFriends: measuring, analyzing and preventing social exclusion between elementary school students

Social exclusion is a relatively recent term, whose creation is attributed to René Lenoir(Lenoir, 1974). Its concept covers a remarkably wide range of social and economic problems, and can be triggered for various reasons: mentally and physically handicapped, abused children, delinquents, multi-problem households, asocial people, and other social “misfits” (Silver, 1995, pp. 63; Foucault, 1992). With an increasingly multi-cultural population, cultural and social inequalities rapidly ascend, bringing with them the need for educational restructuring. We are living in an evermore diverse world, and children need to be educated to be receptive to the different types of people around them, especially considering social and cultural aspects. It is with these goals that inclusive education has seen an increased trend in today’s academic environment, reminding us that even though children may be taught under the same roof, discriminatory practices might still happen. There are, however, a number of developed tools to assess the various dimensions of social networks. These are mostly based on questionnaires and interviews, which tend to be fastidious and don’t allow for longitudinal, large scale measurement. This thesis introduces BlueFriends, a Bluetooth-based measurement tool for social inclusion/exclusion on elementary school classes. The main goals behind the development of this tool were a) understanding how exclusion manifests in students’ behaviors, and b) motivating pro-social behaviors on children through the use of a persuasive technology. BlueFriends is a distributed application, comprised by an application running on several smartphones, a web-hosted database and a computer providing a visual representation of the data collected on a TV screen, attempting to influence children behaviors. The application makes use of the Bluetooth device present on each phone to continuously sample the RSSI (Received Signal Strength Indication) from other phones, storing the data locally on each phone. All of the stored data is collected, processed and then inserted into the database at the end of each day. At the beginning of each recess, children are reminded of how their behaviors affect others with the help of a visual display, which consists of interactions between dogs. This display illustrates every child’s best friends, as well as which colleagues they don’t interact with as much. Several tips encouraging social interaction and inclusiveness are displayed, inspiring children to change their behaviors towards the colleagues they spend less time with. This thesis documents the process of designing, deploying and analyzing the results of two field studies. On the first study, we assess how the current developed tools are inferior to our measuring tool by deploying a measurement only study, aimed at perceiving how much information can be obtained by the BlueFriends application and attempting to understand how exclusion manifests itself in the school environment. On the second study, we pile on the previous to try and motivate pro-social behaviors on students, with the use of visual cues and recommendations. Ultimately, we confirm that our measurement tool’s results were satisfying towards measuring and changing children’s behaviors, and conclude with our thoughts on possible future work, suggesting a number of possible extensions and improvements.

A social network approach to trust management in VANETs

In the past few years, vehicular ad hoc networks(VANETs) was studied extensively by researchers. VANETs is a type of P2P network, though it has some distinct characters (fast moving, short lived connection etc.). In this paper, we present several limitations of current trust management schemes in VANETs and propose ways to counter them. We first review several trust management techniques in VANETs and argue that the ephemeral nature of VANETs render them useless in practical situations. We identify that the problem of information cascading and oversampling, which commonly arise in social networks, also adversely affects trust management schemes in VANETs. To the best of our knowledge, we are the first to introduce information cascading and oversampling to VANETs. We show that simple voting for decision making leads to oversampling and gives incorrect results in VANETs. To overcome this problem, we propose a novel voting scheme. In our scheme, each vehicle has different voting weight according to its distance from the event. The vehicle which is more closer to the event possesses higher weight. Simulations show that our proposed algorithm performs better than simple voting, increasing the correctness of voting. © 2012 Springer Science + Business Media, LLC.

Análisis organizacional del Partido de la Democracia Social Brasileña en el Estado de San Pablo (1988-2006)

The article represents a theoretical and methodological approach to the analysis of organizational dynamics of political parties today, based on a study of the Party of Brazilian Social Democracy (PSDB) in the State of Sao Pãulo (period between 1988 to 2006). It is hypothesized that the structure and the institutional rules of a particular party, or even their election results, are insufficient to explain the inner workings, such as the role of party organization in the electoral system. An approach that articulates the relationship patterns, election results and posts held in the party, identified the factors that explain the political capital that circulated within the party and ensured its organizational dynamics over the period analyzed.

Identification of steel bars immersed in reinforced concrete based on experimental results of eddy current testing and artificial neural network analysis

This paper presents an experimental research on the use of eddy current testing (ECT) and artificial neural networks (ANNs) in order to identify the gauge and position of steel bars immersed in concrete structures. The paper presents details of the ECT probe and concrete specimens constructed for the tests, and a study about the influence of the concrete on the values of measured voltages. After this, new measurements were done with a greater number of specimens, simulating a field condition and the results were used to generate training and validation vectors for multilayer perceptron ANNs. The results show a high percentage of correct identification with respect to both, the gauge of the bar and of the thickness of the concrete cover. © 2013 Copyright Taylor and Francis Group, LLC.

Análisis organizacional del partido de la democracia social brasileña en el estado de San Pablo (1988-2006)

The article represents a theoretical and methodological approach to the analysis of organizational dynamics of political parties today, based on a study of the Party of Brazilian Social Democracy (PSDB) in the State of Sao Pãulo (period between 1988 to 2006). It is hypothesized that the structure and the institutional rules of a particular party, or even their election results, are insufficient to explain the inner workings, such as the role of party organization in the electoral system. An approach that articulates the relationship patterns, election results and posts held in the party, identified the factors that explain the political capital that circulated within the party and ensured its organizational dynamics over the period analyzed.

Social cliques in male northern muriquis Brachyteles hypoxanthus

Analyses of spatial relationships and social interactions provide insights into the social structure of animal societies and the ways in which social preferences among and between dyads affect higher order social relationships. In this paper we describe the patterns of spatial associations and social interactions among adult male northern muriquis in order to evaluate the dynamics of their social networks above the dyadic levels. Systematic observations were made on the 17 adult males present in a multi-male/multi-female group from April 2004 through February 2005, and in July 2005. Analyses of their spatial relationships identified two distinct male cliques; some adult males (called "N" males) were more connected to the females and immatures than other adult males ("MU" males), which were more connected to one another. Affiliative interactions were significantly higher among dyads belonging to the same clique than to different cliques. Although frequencies of dyadic agonistic interactions were similarly low among individuals within and between cliques, MU males appeared to be subordinate to N males. Nonetheless, there were no significant differences in the copulation rates estimated for MU males and N males. Mutual benefits of cooperation between MU and N cliques in intergroup encounters might explain their ongoing associations in the same mixed-sex group [Current Zoology 58 (2): 342-352, 2012].

Essays on Bayesian Inference for Social Networks

This thesis presents Bayesian solutions to inference problems for three types of social network data structures: a single observation of a social network, repeated observations on the same social network, and repeated observations on a social network developing through time. A social network is conceived as being a structure consisting of actors and their social interaction with each other. A common conceptualisation of social networks is to let the actors be represented by nodes in a graph with edges between pairs of nodes that are relationally tied to each other according to some definition. Statistical analysis of social networks is to a large extent concerned with modelling of these relational ties, which lends itself to empirical evaluation. The first paper deals with a family of statistical models for social networks called exponential random graphs that takes various structural features of the network into account. In general, the likelihood functions of exponential random graphs are only known up to a constant of proportionality. A procedure for performing Bayesian inference using Markov chain Monte Carlo (MCMC) methods is presented. The algorithm consists of two basic steps, one in which an ordinary Metropolis-Hastings up-dating step is used, and another in which an importance sampling scheme is used to calculate the acceptance probability of the Metropolis-Hastings step. In paper number two a method for modelling reports given by actors (or other informants) on their social interaction with others is investigated in a Bayesian framework. The model contains two basic ingredients: the unknown network structure and functions that link this unknown network structure to the reports given by the actors. These functions take the form of probit link functions. An intrinsic problem is that the model is not identified, meaning that there are combinations of values on the unknown structure and the parameters in the probit link functions that are observationally equivalent. Instead of using restrictions for achieving identification, it is proposed that the different observationally equivalent combinations of parameters and unknown structure be investigated a posteriori. Estimation of parameters is carried out using Gibbs sampling with a switching devise that enables transitions between posterior modal regions. The main goal of the procedures is to provide tools for comparisons of different model specifications. Papers 3 and 4, propose Bayesian methods for longitudinal social networks. The premise of the models investigated is that overall change in social networks occurs as a consequence of sequences of incremental changes. Models for the evolution of social networks using continuos-time Markov chains are meant to capture these dynamics. Paper 3 presents an MCMC algorithm for exploring the posteriors of parameters for such Markov chains. More specifically, the unobserved evolution of the network in-between observations is explicitly modelled thereby avoiding the need to deal with explicit formulas for the transition probabilities. This enables likelihood based parameter inference in a wider class of network evolution models than has been available before. Paper 4 builds on the proposed inference procedure of Paper 3 and demonstrates how to perform model selection for a class of network evolution models.

Proprietà statistiche delle caratteristiche topologiche del grafo di un "hub" generato da un social network

Questa tesi affronta lo studio delle proprietà statistiche della topologia di un grafo, che rappresenta le relazioni interpersonali in un gruppo di utenti di Facebook. Perché è interessante? Quali informazioni produce? Anzitutto va osservato che dalla nascita di Internet in poi la globalizzazione ha reso le relazioni sociali un fenomeno di massa con numeri sorprendentemente alti di connessioni. Questo e la disponibilità dei dati forniscono una occasione preziosa per analizzarne la struttura.

Applicazioni di marketing per i geo-social network: il caso Foursquare

La geolocalizzazione e i LBS (Location-based services), servizi associati a questi tecnologia stanno trasformando radicalmente il modo in cui i consumatori interagiscono con brand, prodotti e aziende, sia online che nel mondo reale. L 'esplosione nell'utilizzo degli smartphone ha causato un notevole aumento dell'interesse degli utenti per i servizi geolocalizzati, che aprono nuove frontiere sia ai consumatori che ai marketers. Questa tesi di laurea analizza in particolare il fenomeno Foursquare nel mondo e in Italia definendo il modello di business associato a questa tecnologia, servendosi di numerose case history e testimonianze.

L'11 Settembre Telematico Rischi di Sicurezza causati dai Social Network

Lo scopo di questa tesi è quello di progettare e sviluppare un sistema informatico in grado di verificare la possibilità di bypassare le comuni misure di sicurezza al fine di indicare soluzioni e strategie difensive efficaci. Più in dettaglio ci occuperemo di simulare gli atteggiamenti di un hacker, alta- mente invasivi e pericolosi, atti a compromettere l’intero sistema telematico su scala mondiale. Studiando i social network e le informazioni personali, ci si è resi conto, infatti, di come sia facile ed altamente probabile causare gravi danni sia all’intera popolazione del web che all’integrità delle infrastrutture telematiche.

Large-scale Network Analysis on Distributed Architectures

Questa dissertazione esamina le sfide e i limiti che gli algoritmi di analisi di grafi incontrano in architetture distribuite costituite da personal computer. In particolare, analizza il comportamento dell'algoritmo del PageRank così come implementato in una popolare libreria C++ di analisi di grafi distribuiti, la Parallel Boost Graph Library (Parallel BGL). I risultati qui presentati mostrano che il modello di programmazione parallela Bulk Synchronous Parallel è inadatto all'implementazione efficiente del PageRank su cluster costituiti da personal computer. L'implementazione analizzata ha infatti evidenziato una scalabilità negativa, il tempo di esecuzione dell'algoritmo aumenta linearmente in funzione del numero di processori. Questi risultati sono stati ottenuti lanciando l'algoritmo del PageRank della Parallel BGL su un cluster di 43 PC dual-core con 2GB di RAM l'uno, usando diversi grafi scelti in modo da facilitare l'identificazione delle variabili che influenzano la scalabilità. Grafi rappresentanti modelli diversi hanno dato risultati differenti, mostrando che c'è una relazione tra il coefficiente di clustering e l'inclinazione della retta che rappresenta il tempo in funzione del numero di processori. Ad esempio, i grafi Erdős–Rényi, aventi un basso coefficiente di clustering, hanno rappresentato il caso peggiore nei test del PageRank, mentre i grafi Small-World, aventi un alto coefficiente di clustering, hanno rappresentato il caso migliore. Anche le dimensioni del grafo hanno mostrato un'influenza sul tempo di esecuzione particolarmente interessante. Infatti, si è mostrato che la relazione tra il numero di nodi e il numero di archi determina il tempo totale.