Movimentos sociais como produtores de conhecimento: a Soberania Alimentar no Movimento de Pequenos Agricultores (MPA).

A presente tese adota uma perspectiva cognitiva e epistêmica para o estudo dos movimentos sociais, tendo como objeto de estudo a Soberania Alimentar no Movimento dos Pequenos Agricultores: MPA. Defendemos a ideia que, através de sua atuação prática e discursiva, os movimentos sociais estão travando uma luta que, além de política e cultural, é também cognitiva e epistêmica e que essa dinâmica social é geradora de novas formas de conhecimento, como a Soberania Alimentar. Neste trabalho, a Soberania Alimentar é entendida como um programa social de conhecimento que vem sendo desenvolvido pela rede transnacional de movimentos sociais Via Campesina e as suas organizações constituintes (dentre as quais o MPA), articulados com entidades parceiras em redes de solidariedade transnacionais e transculturais e em oposição aos seus adversários, em relação a distintos contextos e escalas de ação. Apoiados nessa ideia e na perspectiva adotada, pretendemos revelar aspectos da multidimensionalidade e da multiespacialidade da dinâmica constitutiva da Soberania Alimentar, a partir do estudo das correlações entre o local e o global, o particular e o geral e as dimensões prática e intelectual da produção de conhecimento por movimentos sociais.

同事关系质量及其作用机制

Although the research into coworker relationship quality has been recognized one of key factors related to organization performance, and has been thought a new trend in organization behavior research with the flatting of organization structure and complication of task assignment, there is relatively little empirical research on the mechanism between coworkers’ interaction, contraring to the fruitful results on member exchange research based on social network theory, say nothing of the influence of cultural differences such as GUANXI. This research developed the scale for the assessment of Coworker Relationship Quality by literature review, deep interview, and questionnaires, compared the predictable ability of Coworker Relationship Quality (CRQ) scale and Coworker Exchange (CWX) scale on employees’ work attitudes and behaviors. Finally, the mediating effect of Coworker Relationship Quality between employees’ similarities on personality and their work attitudes and behaviors was investigated. Following are main results. Firstly, we found that the interpersonal communication, trust, and mutual support are the key factors of coworker relationship quality, which is similar to the result getting from western samples. But Chinese people are more GUANXI ORIENTATION, means they want to build longtime relationship with others, not only when they are coworkers, but also when one of them left the organization. Secondly, though the core meaning of CRQ and CWX are same, their predictable ability on organization outcomes is different. CRQ is more powerful than CWX, especially on turnover intention. The result showed that after controlling the effect of demographic variables and CRQ, CWX cannot predict turnover intention significantly, but CRQ can still predict turnover intention significantly after controlling demographic variables and CWX. Thirdly, the partial mediating effect of CRQ between positive affectivity similarity and organizational citizenship behavior, coworker satisfaction, organizational commitment and turnover intention are validated, but we did not find the mediating effect of CRQ between demographic variable similarity and workers’ attitudes and behaviors. The Similarity Attraction Paradigm, Social Identity Theory, and Self Category Theory were supported.

Using Social Media Content for Screening in Recruitment and Selection: Pros and Cons.

The article considers the arguments that have been made in defence of social media screening as well as issues that arise and may effectively erode the reliability and utility of such data for employers. First, the authors consider existing legal frameworks and guidelines that exist in the UK and the USA, as well as the subsequent ethical concerns that arise when employers access and use social networking content for employment purposes. Second, several arguments in favour of the use of social networking content are made, each of which is considered from several angles, including concerns about impression management, bias and discrimination, data protection and security. Ultimately, the current state of knowledge does not provide a definite answer as to whether information from social networks is helpful in recruitment and selection.

Exploring the relationship between impulsivity and decision-making on mobile devices.

Mobile devices offer a common platform for both leisure and work-related tasks but this has resulted in a blurred boundary between home and work. In this paper we explore the security implications of this blurred boundary, both for the worker and the employer. Mobile workers may not always make optimum security-related choices when ‘on the go’ and more impulsive individuals may be particularly affected as they are considered more vulnerable to distraction. In this study we used a task scenario, in which 104 users were asked to choose a wireless network when responding to work demands while out of the office. Eye-tracking data was obtained from a subsample of 40 of these participants in order to explore the effects of impulsivity on attention. Our results suggest that impulsive people are more frequent users of public devices and networks in their day-to-day interactions and are more likely to access their social networks on a regular basis. However they are also likely to make risky decisions when working on-the-go, processing fewer features before making those decisions. These results suggest that those with high impulsivity may make more use of the mobile Internet options for both work and private purposes but they also show attentional behavior patterns that suggest they make less considered security-sensitive decisions. The findings are discussed in terms of designs that might support enhanced deliberation, both in the moment and also in relation to longer term behaviors that would contribute to a better work-life balance.

Fast Shortest Path Distance Estimation in Large Networks

We study the problem of preprocessing a large graph so that point-to-point shortest-path queries can be answered very fast. Computing shortest paths is a well studied problem, but exact algorithms do not scale to huge graphs encountered on the web, social networks, and other applications. In this paper we focus on approximate methods for distance estimation, in particular using landmark-based distance indexing. This approach involves selecting a subset of nodes as landmarks and computing (offline) the distances from each node in the graph to those landmarks. At runtime, when the distance between a pair of nodes is needed, we can estimate it quickly by combining the precomputed distances of the two nodes to the landmarks. We prove that selecting the optimal set of landmarks is an NP-hard problem, and thus heuristic solutions need to be employed. Given a budget of memory for the index, which translates directly into a budget of landmarks, different landmark selection strategies can yield dramatically different results in terms of accuracy. A number of simple methods that scale well to large graphs are therefore developed and experimentally compared. The simplest methods choose central nodes of the graph, while the more elaborate ones select central nodes that are also far away from one another. The efficiency of the suggested techniques is tested experimentally using five different real world graphs with millions of edges; for a given accuracy, they require as much as 250 times less space than the current approach in the literature which considers selecting landmarks at random. Finally, we study applications of our method in two problems arising naturally in large-scale networks, namely, social search and community detection.

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.

NETEMBED: A Network Resource Mapping Service for Distributed Applications

Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory constraints) and network conditions (e.g., link delay, bandwidth, loss rate, and jitter) whose characteristics are both complex and time-varying. At the same time, distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on resources they wish to utilize. Examples include selecting nodes and links to schedule an overlay multicast file transfer across the Grid, or embedding a network experiment with specific resource constraints in a distributed testbed such as PlanetLab. Thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of "mapping" application-level requirements onto the network in such a manner that the requirements of the application are realized, assuming that the underlying characteristics of the network are known. We refer to this problem as the network embedding problem. In this paper, we propose a new approach to tackle this combinatorially-hard problem. Thanks to a number of heuristics, our approach greatly improves performance and scalability over previously existing techniques. It does so by pruning large portions of the search space without overlooking any valid embedding. We present a construction that allows a compact representation of candidate embeddings, which is maintained by carefully controlling the order via which candidate mappings are inserted and invalid mappings are removed. We present an implementation of our proposed technique, which we call NETEMBED – a service that identify feasible mappings of a virtual network configuration (the query network) to an existing real infrastructure or testbed (the hosting network). We present results of extensive performance evaluation experiments of NETEMBED using several combinations of real and synthetic network topologies. Our results show that our NETEMBED service is quite effective in identifying one (or all) possible embeddings for quite sizable queries and hosting networks – much larger than what any of the existing techniques or services are able to handle.

Cortical Dynamics of Visual Motion Perception: Short-Range and Long-Range Apparent Motion

This article describes further evidence for a new neural network theory of biological motion perception. The theory clarifies why parallel streams Vl --> V2, Vl --> MT, and Vl --> V2 --> MT exist for static form and motion form processing among the areas Vl, V2, and MT of visual cortex. The theory suggests that the static form system (Static BCS) generates emergent boundary segmentations whose outputs are insensitive to direction-ofcontrast and insensitive to direction-of-motion, whereas the motion form system (Motion BCS) generates emergent boundary segmentations whose outputs are insensitive to directionof-contrast but sensitive to direction-of-motion. The theory is used to explain classical and recent data about short-range and long-range apparent motion percepts that have not yet been explained by alternative models. These data include beta motion; split motion; gamma motion and reverse-contrast gamma motion; delta motion; visual inertia; the transition from group motion to element motion in response to a Ternus display as the interstimulus interval (ISI) decreases; group motion in response to a reverse-contrast Ternus display even at short ISIs; speed-up of motion velocity as interflash distance increases or flash duration decreases; dependence of the transition from element motion to group motion on stimulus duration and size; various classical dependencies between flash duration, spatial separation, ISI, and motion threshold known as Korte's Laws; dependence of motion strength on stimulus orientation and spatial frequency; short-range and long-range form-color interactions; and binocular interactions of flashes to different eyes.

3-D Vision and Figure-Ground Separation by Visual Cortex

A neural network theory of :3-D vision, called FACADE Theory, is described. The theory proposes a solution of the classical figure-ground problem for biological vision. It does so by suggesting how boundary representations and surface representations are formed within a Boundary Contour System (BCS) and a Feature Contour System (FCS). The BCS and FCS interact reciprocally to form 3-D boundary and surface representations that arc mutually consistent. Their interactions generate 3-D percepts wherein occluding and occluded object completed, and grouped. The theory clarifies how preattentive processes of 3-D perception and figure-ground separation interact reciprocally with attentive processes of spatial localization, object recognition, and visual search. A new theory of stereopsis is proposed that predicts how cells sensitive to multiple spatial frequencies, disparities, and orientations are combined by context-sensitive filtering, competition, and cooperation to form coherent BCS boundary segmentations. Several factors contribute to figure-ground pop-out, including: boundary contrast between spatially contiguous boundaries, whether due to scenic differences in luminance, color, spatial frequency, or disparity; partially ordered interactions from larger spatial scales and disparities to smaller scales and disparities; and surface filling-in restricted to regions surrounded by a connected boundary. Phenomena such as 3-D pop-out from a 2-D picture, DaVinci stereopsis, a 3-D neon color spreading, completion of partially occluded objects, and figure-ground reversals are analysed. The BCS and FCS sub-systems model aspects of how the two parvocellular cortical processing streams that join the Lateral Geniculate Nucleus to prestriate cortical area V4 interact to generate a multiplexed representation of Form-And-Color-And-Depth, or FACADE, within area V4. Area V4 is suggested to support figure-ground separation and to interact. with cortical mechanisms of spatial attention, attentive objcect learning, and visual search. Adaptive Resonance Theory (ART) mechanisms model aspects of how prestriate visual cortex interacts reciprocally with a visual object recognition system in inferotemporal cortex (IT) for purposes of attentive object learning and categorization. Object attention mechanisms of the What cortical processing stream through IT cortex are distinguished from spatial attention mechanisms of the Where cortical processing stream through parietal cortex. Parvocellular BCS and FCS signals interact with the model What stream. Parvocellular FCS and magnocellular Motion BCS signals interact with the model Where stream. Reciprocal interactions between these visual, What, and Where mechanisms arc used to discuss data about visual search and saccadic eye movements, including fast search of conjunctive targets, search of 3-D surfaces, selective search of like-colored targets, attentive tracking of multi-element groupings, and recursive search of simultaneously presented targets.

Energy-aware dynamic route management for THAWS

In this research we focus on the Tyndall 25mm and 10mm nodes energy-aware topology management to extend sensor network lifespan and optimise node power consumption. The two tiered Tyndall Heterogeneous Automated Wireless Sensors (THAWS) tool is used to quickly create and configure application-specific sensor networks. To this end, we propose to implement a distributed route discovery algorithm and a practical energy-aware reaction model on the 25mm nodes. Triggered by the energy-warning events, the miniaturised Tyndall 10mm data collector nodes adaptively and periodically change their association to 25mm base station nodes, while 25mm nodes also change the inter-connections between themselves, which results in reconfiguration of the 25mm nodes tier topology. The distributed routing protocol uses combined weight functions to balance the sensor network traffic. A system level simulation is used to quantify the benefit of the route management framework when compared to other state of the art approaches in terms of the system power-saving.

Job retention and turnover: a study of child protection and welfare social workers in Ireland

Retaining social workers in child protection and welfare organisations has been identified as a problem in Ireland (McGrath, 2001; Ombudsman for Children, 2006; Houses of the Oireachtas, 2008) and internationally (Ellet et al., 2006; Mor Barak et al., 2006; Tham, 2006). While low levels of retention have been identified, there is no research that examines the factors in Ireland that influence the retention of social workers. In this thesis, data is analysed from qualitative interviews with 45 social workers in the Health Service Executive South about what influences their decisions to stay in or leave child protection and welfare social work. These social workers’ views are examined in relation to quantitative research on the levels of turnover and employment mobility of child protection and welfare social workers employed in the same organisation. Contrary to expectations, the study found that the retention rate of social workers during the period of data collection (March 2005 to December 2006) was high and that the majority of social workers remained positive about this work and their retention. The quality of social workers’ supervision, social supports from colleagues, high levels of autonomy, a commitment to child protection and welfare work, good variety in the work, and a perception that they were making a difference, emerged as important factors in social workers’ decisions to stay. Perceptions of being unsupported by the organisation, which was usually described in terms of high caseloads and demanding workloads, a lack of resources, work with involuntary clients and not being able to make a difference, were the most significant factors in social workers’ decisions to leave and/or to want to leave. Social workers felt particularly professionally unsupported when they received low quality and/or infrequent professional supervision. This thesis critiques the theories of perceived organisational support theory, social exchange theory and job characteristics theory, and uses the concept of ‘professional career’, to help analyse the retention of social workers in child protection and welfare.

Exact colorations of graphs and digraphs

A coloration is an exact regular coloration if whenever two vertices are colored the same they have identically colored neighborhoods. For example, if one of the two vertices that are colored the same is connected to three yellow vertices, two white and red, then the other vertex is as well. Exact regular colorations have been discussed informally in the social network literature. However they have been part of the mathematical literature for some time, though in a different format. We explore this concept in terms of social networks and illustrate some important results taken from the mathematical literature. In addition we show how the concept can be extended to ecological and perfect colorations, and discuss how the CATREGE algorithm can be extended to find the maximal exact regular coloration of a graph.

Models of core/periphery structures

A common but informal notion in social network analysis and other fields is the concept of a core/periphery structure. The intuitive conception entails a dense, cohesive core and a sparse, unconnected periphery. This paper seeks to formalize the intuitive notion of a core/periphery structure and suggests algorithms for detecting this structure, along with statistical tests for testing a priori hypotheses. Different models are presented for different kinds of graphs (directed and undirected, valued and nonvalued). In addition, the close relation of the continuous models developed to certain centrality measures is discussed.

Peripheries of cohesive subsets

Network analysts have developed a number of techniques for identifying cohesive subgroups in networks. In general, however, no consideration is given to actors that do not belong to a given group. In this paper, we explore ways of identifying actors that are not members of a given cohesive subgroup, but who are sufficiently well tied to the group to be considered peripheral members. We then use this information to explore the structure of the network as a whole.

Relational dimensions of corporate governance in translation: networked governance in China and India

The effectiveness of corporate governance mechanisms has been a subject of academic research for many decades. Although the large majority of corporate governance studies prior to mid 1990s were based on data from developed market economies such as the U.S., U.K. and Japan, in recent years researchers have begun examining corporate governance in transition economies. A comparison of China and India offers a unique environment for analyzing the effectiveness of corporate governance. First, both countries state-owned enterprise (SOE) reform strategies hinges on the Modern Enterprise System characterized by the separation of ownership and control. Ownership of an SOE’s assets is distributed among the government, institutional investors, managers, employees, and private investors. Effective control rights are assigned to management, which generally has a very small, or even nonexistent ownership stake. This distinctive shareholding structure creates conflict of interest not only between management (insiders) and outside investors but also between large shareholders and minority investors. Moreover, because both governments desire to retain some control—in part through partial retained ownership of commercialized SOEs, further conflicts arise between politicians and firms. Second, directors in publicly listed firms in both countries are predominantly drawn from institutions with significant non-market objectives: the government and other state enterprises, particularly in China, and extended families, particularly in India. As a result, the effectiveness of internal governance mechanisms, such as the number of independent directors on the board and the number of independent supervisors on the supervisory committee, are likely to be quiet limited, although this has yet to be fully evaluated. Third, because of the political nature of the privatization process itself, typical external governance mechanisms, such as debt (in conjunction with appropriate bankruptcy procedures), takeover threats, legal protection of investors, product market competition, etc., have not been effective. Bank loans have traditionally been viewed as grants from the state designed to bail out failing firms. State-owned banks retain monopoly or quasi-monopoly positions in the banking sector and profit is not their overriding objective. If political favor is deemed appropriate, subsidized loans, rescheduling of overdue debt or even outright transfer of funds can be arranged with SOEs (soft budget constraints). In addition, a market for private, non-bank debt is limited in India and has yet to be established China. There is no active merger or takeover activity in Chinese stock markets to discipline management. Information available in the capital markets is insufficient to keep at arm’s length of the corporate decisions. In light of the above peculiarities, China and India share many of the typical institutional characteristics as a transition economy, including poor legal protection of creditors and investors, the absence of an effective takeover market, an underdeveloped capital market, a relative inefficient banking system and significant interference of politicians in firm management. Su (2005) finds that the extent of political interference, managerial entrenchment and institutional control can help explain corporate dividend policies and post-IPO financing choices in this situation. Allen et al. (2005) demonstrate that standard corporate governance mechanisms are weak and ineffective for publicly listed firms while alternative governance mechanisms based on reputation and relationship have been remarkably effective in the private sector. Because the peculiarities are significant in this context, the differences in the political-economies of the two countries are likely to be evident in such relational terms. In this paper we explore the peculiarities of corporate governance in this transitional environment through a systematic examination of certain aspects of these reputational and relationship dimensions. Utilising the methods of social network analysis we identify the inter-organisational relationships at board level formed by equity holdings and by shared directors. Using data drawn from the Orbis database we map these relations among the 3700 largest firms in India and China respectively and identify the roles played in these relational networks by the particularly characteristic institutions in each case. We find greatly different social network structures in each case with some support in these relational dimensions for their distinctive features of governance. Further, the social network metrics allow us to considerably refine proxies for political interference, managerial entrenchment and institutional control used in earlier econometric analysis.