Extended contact effects as a function of closeness of relationship with ingroup contacts

Using survey data from Catholics and Protestants in Northern Ireland (N = 428), the authors examined the effects of extended contact via different types of ingroup contacts (neighbors, work colleagues, friends, and family members) and tested whether closeness to ingroup contacts moderated the effects of extended contact on outgroup trust. Results demonstrated that extended contact effects varied as a function of the relationship to ingroup contacts, and that extended contact interacted with closeness ratings in predicting outgroup trust. Consistent with hypotheses, extended contacts via more intimate ingroup relationships (i.e., friends and family) were overall more strongly related to outgroup trust than extended contacts via less intimate ingroup relations (i.e., neighbors and work colleagues). Moreover, within each level of intimacy extended contact was related to outgroup trust only at high, and not at low, levels of rated closeness to ingroup contacts. The theoretical contributions, limitations and practical implications of these findings are discussed.

Practice-near Research: Exploring Insights from Different Degrees of Closeness

This presentation reports methodological issues from a practice-near study that spans the four nations of the United Kingdom. The TLC project: Social Workers Talking and Listening to Children aims to explore how social workers communicate with children in their everyday practice and how the social workers and children involved in these encounters experience and understand them.

Understanding Corporate Governance Reform in South Africa: Anglo-American Divergence, the King Reports and Hybridization

This article investigates corporate governance reform in South Africa in the context of the country’s international links with Anglo-American corporate governance and domestic pursuit of socioeconomic development. Two key questions are evaluated. (a) How has divergence within the Anglo-American model influenced corporate governance reform in South Africa? (b) Can South Africa’s historical closeness to the Anglo-American model be combined with increasing attention to stakeholder issues to produce a hybrid “African model” of corporate governance? Evaluating these questions, the following issues are explored in turn: the contrast between shareholder and stakeholder models, divergence between U.S. and U.K. approaches to corporate governance as exemplified by Sarbanes-Oxley, locating a South African approach in context of the Anglo-American model, the King reports and an emerging “African” model of corporate governance, and the role of international and domestic factors in shaping South Africa’s ongoing reform process.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

Feature recognition & tool path generation for 5 axis step-nc machining of free form / irregular contoured surfaces

This research paper presents a five step algorithm to generate tool paths for machining Free form / Irregular Contoured Surface(s) (FICS) by adopting STEP-NC (AP-238) format. In the first step, a parametrized CAD model with FICS is created or imported in UG-NX6.0 CAD package. The second step recognizes the features and calculates a Closeness Index (CI) by comparing them with the B-Splines / Bezier surfaces. The third step utilizes the CI and extracts the necessary data to formulate the blending functions for identified features. In the fourth step Z-level 5 axis tool paths are generated by adopting flat and ball end mill cutters. Finally, in the fifth step, tool paths are integrated with STEP-NC format and validated. All these steps are discussed and explained through a validated industrial component.

Integration of cad/ tool path data for 5-axis step-nc machining of free form / irrregular contoured surfaces

This research paper presents the work on feature recognition, tool path data generation and integration with STEP-NC (AP-238 format) for features having Free form / Irregular Contoured Surface(s) (FICS). Initially, the FICS features are modelled / imported in UG CAD package and a closeness index is generated. This is done by comparing the FICS features with basic B-Splines / Bezier curves / surfaces. Then blending functions are caculated by adopting convolution theorem. Based on the blending functions, contour offsett tool paths are generated and simulated for 5 axis milling environment. Finally, the tool path (CL) data is integrated with STEP-NC (AP-238) format. The tool path algorithm and STEP- NC data is tested with various industrial parts through an automated UFUNC plugin.