Acculturation processes and intergroup relations of adolescents in multicultural societies: the role of family, peer, and school contexts

Acculturation processes and intergroup relations lie at the heart of developing more inclusive social attitudes. Notably, these endeavors are embedded in primary socialization contexts of adolescents, as indicated by developmental and socio-psychological theoretical models reviewed in Chapter 1. Hence, this dissertation investigated how adolescents' acculturation processes and intergroup contact are embedded in family, peer, and school contexts. Accordingly, Chapter 2 indicated the combined effects of the perceived parents' acculturation orientations and classmates' acculturation preferences on adolescents' own acculturation orientations in Italy and Turkey. Chapter 3 showed that adolescents could be classified into one of four latent growth trajectory classes (i.e., ethnic-oriented, national-oriented, dual, and marginalized identities), which could be predicted by social identification with family and classmates. Chapter 4 highlighted that adolescents' cross-ethnic friendships mediated the positive associations of parents' cross-ethnic friendships with adolescents' psychological and social adjustment beyond the positive relationships between parents' and adolescents' friendships. Multiple studies conducted in Chapter 5 confirmed that a newly developed questionnaire (i.e., ICIS-Short Version) is a reliable tool to measure positive and negative contact among ethnic minority and majority adolescents. Chapter 6 revealed that teachers' equal treatment increased positive and decreased negative contact among ethnic minority and majority adolescents. Moreover, Chapter 7 indicated that adolescents’ positive and negative contact in the school context were related over time to higher corresponding positive and negative contact in out-of-school contexts and vice versa, while their positive contact in the school context was linked over time to lower levels of negative contact in the out-of-school contexts. Eventually, Chapter 8 strived to summarize and discuss these findings in light of social inclusivity. Overall, this dissertation tapped into the paramount importance of family, peer, and school contexts to provide a unique resource for adolescents to cope with acculturative challenges that go beyond the normative developmental tasks of adolescence.

Evolutionary methods for self-organizing cooperation in peer-to-peer networks

The Peer-to-Peer network paradigm is drawing the attention of both final users and researchers for its features. P2P networks shift from the classic client-server approach to a high level of decentralization where there is no central control and all the nodes should be able not only to require services, but to provide them to other peers as well. While on one hand such high level of decentralization might lead to interesting properties like scalability and fault tolerance, on the other hand it implies many new problems to deal with. A key feature of many P2P systems is openness, meaning that everybody is potentially able to join a network with no need for subscription or payment systems. The combination of openness and lack of central control makes it feasible for a user to free-ride, that is to increase its own benefit by using services without allocating resources to satisfy other peers’ requests. One of the main goals when designing a P2P system is therefore to achieve cooperation between users. Given the nature of P2P systems based on simple local interactions of many peers having partial knowledge of the whole system, an interesting way to achieve desired properties on a system scale might consist in obtaining them as emergent properties of the many interactions occurring at local node level. Two methods are typically used to face the problem of cooperation in P2P networks: 1) engineering emergent properties when designing the protocol; 2) study the system as a game and apply Game Theory techniques, especially to find Nash Equilibria in the game and to reach them making the system stable against possible deviant behaviors. In this work we present an evolutionary framework to enforce cooperative behaviour in P2P networks that is alternative to both the methods mentioned above. Our approach is based on an evolutionary algorithm inspired by computational sociology and evolutionary game theory, consisting in having each peer periodically trying to copy another peer which is performing better. The proposed algorithms, called SLAC and SLACER, draw inspiration from tag systems originated in computational sociology, the main idea behind the algorithm consists in having low performance nodes copying high performance ones. The algorithm is run locally by every node and leads to an evolution of the network both from the topology and from the nodes’ strategy point of view. Initial tests with a simple Prisoners’ Dilemma application show how SLAC is able to bring the network to a state of high cooperation independently from the initial network conditions. Interesting results are obtained when studying the effect of cheating nodes on SLAC algorithm. In fact in some cases selfish nodes rationally exploiting the system for their own benefit can actually improve system performance from the cooperation formation point of view. The final step is to apply our results to more realistic scenarios. We put our efforts in studying and improving the BitTorrent protocol. BitTorrent was chosen not only for its popularity but because it has many points in common with SLAC and SLACER algorithms, ranging from the game theoretical inspiration (tit-for-tat-like mechanism) to the swarms topology. We discovered fairness, meant as ratio between uploaded and downloaded data, to be a weakness of the original BitTorrent protocol and we drew inspiration from the knowledge of cooperation formation and maintenance mechanism derived from the development and analysis of SLAC and SLACER, to improve fairness and tackle freeriding and cheating in BitTorrent. We produced an extension of BitTorrent called BitFair that has been evaluated through simulation and has shown the abilities of enforcing fairness and tackling free-riding and cheating nodes.

Peer and group relationships in preschoolers: the role of social and linguistic skills

Being able to positively interact and build relationships with playmates in preschool years is crucial to achieve positive adjustment. An update review and two studies on such topics were provided. Study 1 is observational; it investigates the type of social experience in groups (N = 443) of children (N = 120) at preschool age in child-led vs. teacher-led contexts. The results revealed that in child-led contexts children were more likely to be alone, in dyads, and in small peer groups; groups were mostly characterized by same-gender playmates who engaged in joint interactions, with few social interactions with teachers. In teacher-led contexts, on the other hand, children were more likely to be involved in small, medium and large groups; groups were mostly characterized by other-gender playmates, involved in parallel interactions, with teachers playing a more active role. The purpose of Study 2 was to describe the development of socio-emotional competence, temperamental traits and linguistic skill. It examined the role of children’s reciprocated nominations (=RNs) with peers, assessed via sociometric interview, in relation to socio-emotional competence, temperamental traits and linguistic skill. Finally, the similarity-homophily tendency was investigated. Socio-emotional competence and temperamental traits were assessed via teacher ratings, linguistic skill via test administration. Eighty-four preschool children (M age = 62.53) were recruited within 4 preschool settings. Those children were quite representative of preschool population. The results revealed that children with higher RNs showed higher social competence (tendency), social orientation, positive emotionality, motor activity and linguistic skill. They exhibited lower anxiety-withdrawal. The results also showed that children prefer playmates with similar features: social competence, anger-aggression (tendency), social orientation, positive emotionality, inhibition to innovation, attention, motor activity (tendency) and linguistic skill. Implications for future research were suggested.

Exact Algorithms for Different Classes of Vehicle Routing Problems

We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.

Implicit computational complexity and probabilistic classes

The thesis applies the ICC tecniques to the probabilistic polinomial complexity classes in order to get an implicit characterization of them. The main contribution lays on the implicit characterization of PP (which stands for Probabilistic Polynomial Time) class, showing a syntactical characterisation of PP and a static complexity analyser able to recognise if an imperative program computes in Probabilistic Polynomial Time. The thesis is divided in two parts. The first part focuses on solving the problem by creating a prototype of functional language (a probabilistic variation of lambda calculus with bounded recursion) that is sound and complete respect to Probabilistic Prolynomial Time. The second part, instead, reverses the problem and develops a feasible way to verify if a program, written with a prototype of imperative programming language, is running in Probabilistic polynomial time or not. This thesis would characterise itself as one of the first step for Implicit Computational Complexity over probabilistic classes. There are still open hard problem to investigate and try to solve. There are a lot of theoretical aspects strongly connected with these topics and I expect that in the future there will be wide attention to ICC and probabilistic classes.

Permutation classes, sorting algorithms, and lattice paths

A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomorphic to it. Donald Knuth, in the first volume of his celebrated book "The art of Computer Programming", observed that the permutations that can be computed (or, equivalently, sorted) by some particular data structures can be characterized in terms of pattern avoidance. In more recent years, the topic was reopened several times, while often in terms of sortable permutations rather than computable ones. The idea to sort permutations by using one of Knuth’s devices suggests to look for a deterministic procedure that decides, in linear time, if there exists a sequence of operations which is able to convert a given permutation into the identical one. In this thesis we show that, for the stack and the restricted deques, there exists an unique way to implement such a procedure. Moreover, we use these sorting procedures to create new sorting algorithms, and we prove some unexpected commutation properties between these procedures and the base step of bubblesort. We also show that the permutations that can be sorted by a combination of the base steps of bubblesort and its dual can be expressed, once again, in terms of pattern avoidance. In the final chapter we give an alternative proof of some enumerative results, in particular for the classes of permutations that can be sorted by the two restricted deques. It is well-known that the permutations that can be sorted through a restricted deque are counted by the Schrӧder numbers. In the thesis, we show how the deterministic sorting procedures yield a bijection between sortable permutations and Schrӧder paths.

Indagini forensi in tema di scambio di file pedopornografici mediante software di file sharing a mezzo peer-to-peer

La prova informatica richiede l’adozione di precauzioni come in un qualsiasi altro accertamento scientifico. Si fornisce una panoramica sugli aspetti metodologici e applicativi dell’informatica forense alla luce del recente standard ISO/IEC 27037:2012 in tema di trattamento del reperto informatico nelle fasi di identificazione, raccolta, acquisizione e conservazione del dato digitale. Tali metodologie si attengono scrupolosamente alle esigenze di integrità e autenticità richieste dalle norme in materia di informatica forense, in particolare della Legge 48/2008 di ratifica della Convenzione di Budapest sul Cybercrime. In merito al reato di pedopornografia si offre una rassegna della normativa comunitaria e nazionale, ponendo l’enfasi sugli aspetti rilevanti ai fini dell’analisi forense. Rilevato che il file sharing su reti peer-to-peer è il canale sul quale maggiormente si concentra lo scambio di materiale illecito, si fornisce una panoramica dei protocolli e dei sistemi maggiormente diffusi, ponendo enfasi sulla rete eDonkey e il software eMule che trovano ampia diffusione tra gli utenti italiani. Si accenna alle problematiche che si incontrano nelle attività di indagine e di repressione del fenomeno, di competenza delle forze di polizia, per poi concentrarsi e fornire il contributo rilevante in tema di analisi forensi di sistemi informatici sequestrati a soggetti indagati (o imputati) di reato di pedopornografia: la progettazione e l’implementazione di eMuleForensic consente di svolgere in maniera estremamente precisa e rapida le operazioni di analisi degli eventi che si verificano utilizzando il software di file sharing eMule; il software è disponibile sia in rete all’url http://www.emuleforensic.com, sia come tool all’interno della distribuzione forense DEFT. Infine si fornisce una proposta di protocollo operativo per l’analisi forense di sistemi informatici coinvolti in indagini forensi di pedopornografia.

Il trattamento ortodontico nei bambini con particolari necessità sanitarie (SHCN): una valutazione della durata e del risultato clinico utilizzando l'indice PAR (Peer Assessment Rating), la componente DHC (Dental Health Component) e la componente AC (Aesthetic Component) dell'indice IOTN (Orthodontic Treatment Need Index)

Obbiettivo: Valutazione delle eventuali differenze nel trattamento ortodontico di un gruppo di bambini con particolari necessità sanitarie (SHCN) rispetto ad un gruppo di bambini non diagnosticati con SHCN. Materiali e Metodi: Il gruppo campione (SHCN) è costituito da 50 bambini con SHCN. Il gruppo di controllo (NO SHCN) è costituito da 50 bambini non diagnosticati con SHCN pienamente corrispondenti per età, genere e tipo di apparecchio ortodontico utilizzato con i pazienti del gruppo di studio. I dati riguardanti i gruppi SHCN e NO SHCN sono stati analizzati in modo retrospettivo, valutando: - il punteggio pre- e post-trattamento e la riduzione finale dei valori dell'indice PAR (Peer Assessment Rating), della componente DHC (Dental Health Component) e della componente AC (Aesthetic Component) dell'indice IOTN (Orthodontic Treatment Need Index), - il numero di appuntamenti, - il numero di sedute semplici e complesse, - la durata complessiva del trattamento, - l'età all’inizio ed alla fine della terapia. Risultati: Non sono state rilevate differenze statisticamente significative tra i due gruppi per quanto concerne il numero di appuntamenti, la durata complessiva del trattamento, l'età all’inizio ed alla fine della terapia ortodontica (valori del p-value:0.682, 0.458, 0.535, 0.675). Sono state rilevate differenze statisticamente significative tra i due gruppi per quanto riguarda i punteggi dell’indice PAR, delle componenti DHC e AC dello IOTN pre- e post-trattamento, il numero di sedute semplici e complesse (valori del p-value:0.030, 0.000, 0.020, 0.023, 0.000, 0.000, 0.043, 0.037). Per quanto concerne la riduzione finale del valore dell’indice PAR, della componente DHC e di quella AC dello IOTN non sono state riscontrate differenze statisticamente significative tra i due gruppi (valori del p-value:0.060, 0.765, 0.825). Conclusioni: Lo studio incoraggia gli ortodontisti a trattare i bambini con SHCN nell'obiettivo di migliorarne la qualità di vita, pur evidenziando la necessità di un maggior numero di sedute complesse.