782 resultados para rappresentazioni lavoro, social network analysis, mobilità professionale, lavoro, istat


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The study is part of a research project of 269 psychiatric patients with major depression, Vantaa Depression Study, in the Department of Mental Health and Alcohol Research of the National Public Health Institute and the Department of Psychiatry of the Peijas Medical Care District. The aim was to study at the onset of MDE psychosocial differences in subgroups of patients and clustering of events into time before depression and its prodromal phase, to study whether more severe life events and less social support predict poorer outcome in all patients, but most among those currently in partial remission, whether social support declines as a consequence of time spent in MDE, is sensitive to improvement, and whether social support is influenced by neuroticism and extraversion. After screening, a semistructured interview (SCAN, version 2.0) was used for the presence of DSM-IV MDE, and other psychiatric diagnoses. Life events and social support were studied with semistructured methods (IRLE, Paykel 1983; IMSR, Brugha et al. 1987), perceived social support and neuroticism/extraversion with questionnaires (PSSS-R, Blumenthal et al. 1987; EPI, Eysenck and Eysenck 1964) at baseline, 6 and 18 months. At the onset of depression life events were common. No major differences between subgroups of patients were found; the younger had more events, whereas those with comorbid alcoholism and personality disorders perceived less support. Although events were distributed evenly between the time before depression, the prodromal phase and the index MDE, two thirds of the patients attributed their depression to some life event. Adversities and poor perceived support influenced the outcome of all psychiatric patients, most in the subgroup of full remission. In the partial remission group, the impact of severe events and in the MDE, perceived support was important. Low objective and subjective support were predicted by longer time spent in MDE. Along with improvement subjective support improved. Neuroticism and extraversion were associated with the size of social network and perceived support and predicted change of perceived support. In conclusion, adversities were common in all phases of depression. They may thus have many roles; before depression they may precipitate it, in the prodromal phase worsen symptoms, and during the MDE, the outcome of depression. Patients often attributed their depression to a life event. Psychosocial subgroup differences were quite small. Perceived support predicted the outcome of depression, and time spent in MDE objective and subjective support. Neuroticism and extraversion may modify the level and change particularly in perceived support, thereby indirectly effecting vulnerability to depression.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Social support offers various benefits for health and behaviour change. However, previous work has shown that individuals are typically reluctant to ask for support on social network sites, unless they can present a changed, healthier identity. To examine the relationship between stage of change and social support we conducted a thematic analysis of messages posted in a public Facebook support group for people trying to quit smoking. Our findings show that the kind of support exchanged online is related to participants' stage of change. Contrary to our expectations, supportive responses and leadership in the support group came mainly from users who just started their change process rather than people who had already changed. We discuss contributions to theories of online participation and impression management as well as implications for practitioners who seek to establish support groups.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

- Background and Purpose Given the turbulent and highly contested environment in which professional coaches work, a prime concern to coach developers is how coaches learn their craft. Understanding the learning and development of senior coaches (SCs) and assistant coaches (ACs) in the Australian Football League (AFL – the peak organisation for Australian Rules Football) is important to better develop the next generation of performance coaches. Hence the focus of this research was to examine the learning of SC and AC in the AFL. Fundamental to this research was an understanding that the AFL and each club within the league be regarded as learning organisations and workplaces with their own learning cultures where learning takes place. The purpose of this paper was to examine the learning culture for AFL coaches. - Method Five SCs, 6 ACs, and 5 administrators (4 of whom were former coaches) at 11 of the 16 AFL clubs were recruited for the research project. First, demographic data were collected for each participant (e.g. age, playing and coaching experience, development and coach development activities). Second, all participants were involved in one semi-structured interview of between 45 and 90 minutes duration. An interpretative (hierarchical content) analysis of the interview data was conducted to identify key emergent themes. - Results Learning was central to AFL coaches becoming a SC. Nevertheless, coaches reported a sense of isolation and a lack of support in developing their craft within their particular learning culture. These coaches developed a unique dynamic social network (DSN) that involved episodic contact with a number of respected confidantes often from diverse fields (used here in the Bourdieuian sense) in developing their coaching craft. Although there were some opportunities in their workplace, much of their learning was unmediated by others, underscoring the importance of their agentic engagement in limited workplace affordances. - Conclusion The variety of people accessed for the purposes of learning (often beyond the immediate workplace) and the long time taken to establish networks of supporters meant that a new way of describing the social networks of AFL coaches was needed; DSN. However, despite the acknowledged utility of learning from others, all coaches reported some sense of isolation in their learning. The sense of isolation brought about by professional volatility in high-performance Australian Football offers an alternative view on Hodkinson, Biesta and James' attempt in overcoming dualisms in learning.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Do enterprise social network platforms in an organization make the company more innovative? In theory, through communication, collaboration, and knowledge exchange, innovation ideas can easily be expressed, shared, and discussed with many partners in the organization. Yet, whether this guarantees innovation success remains to be seen. The authors studied how innovation ideas moved--or not--from an enterprise social network platform to regular innovation processes at a large Australian retailer. They found that the success of innovation ideas depends on how easily understandable the idea is on the platform, how long it has been discussed, and how powerful the social network participants are in the organization. These findings inform management strategies for the governance of enterprise social network use and the organizational innovation process.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We study a fixed-point formalization of the well-known analysis of Bianchi. We provide a significant simplification and generalization of the analysis. In this more general framework, the fixed-point solution and performance measures resulting from it are studied. Uniqueness of the fixed point is established. Simple and general throughput formulas are provided. It is shown that the throughput of any flow will be bounded by the one with the smallest transmission rate. The aggregate throughput is bounded by the reciprocal of the harmonic mean of the transmission rates. In an asymptotic regime with a large number of nodes, explicit formulas for the collision probability, the aggregate attempt rate, and the aggregate throughput are provided. The results from the analysis are compared with ns2 simulations and also with an exact Markov model of the backoff process. It is shown how the saturated network analysis can be used to obtain TCP transfer throughputs in some cases.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

My doctoral dissertation in sociology and Russian studies, Social Networks and Everyday Practices in Russia, employs a "micro" or "grassroots" perspective on the transition. The study is a collection of articles detailing social networks in five different contexts. The first article examines Russian birthdays from a network perspective. The second takes a look at health care to see whether networks have become obsolete in a sector that is still overwhelmingly public, but increasingly being monetarised. The third article investigates neighbourhood relations. The fourth details relationships at work, particularly from the vantage point of internal migration. The fifth explores housing and the role of networks and money both in the Soviet and post-Soviet era. The study is based on qualitative social network and interview data gathered among three groups, teachers, doctors and factory workers, in St. Petersburg during 1993-2000. Methodologically it builds on a qualitative social network approach. The study adds a critical element to the discussion on networks in post-socialism. A considerable consensus exists that social networks were vital in state socialist societies and were used to bypass various difficulties caused by endemic shortages and bureaucratic rigidities, but a more debated issue has been their role in post-socialism. Some scholars have argued that the importance of networks has been dramatically reduced in the new market economy, whereas others have stressed their continuing importance. If a common denominator in both has been a focus on networks in relation to the past, a more overlooked aspect has been the question of inequality. To what extent is access to networks unequally distributed? What are the limits and consequences of networks, for those who have access, those outside networks or society at large? My study provides some evidence about inequalities. It shows that some groups are privileged over others, for instance, middle-class people in informal access to health care. Moreover, analysing the formation of networks sheds additional light on inequalities, as it highlights the importance of migration as a mechanism of inequality, for example. The five articles focus on how networks are actually used in everyday life. The article on health care, for instance, shows that personal connections are still important and popular in post-Soviet Russia, despite the growing importance of money and the emergence of "fee for service" medicine. Fifteen of twenty teachers were involved in informal medical exchange during a two-week study period, so that they used their networks to bypass the formal market mechanisms or official procedures. Medicines were obtained through personal connections because some were unavailable at local pharmacies or because these connections could provide medicines for a cheaper price or even for free. The article on neighbours shows that "mutual help" was the central feature of neighbouring, so that the exchange of goods, services and information covered almost half the contacts with neighbours reported. Neighbours did not provide merely small-scale help but were often exchange partners because they possessed important professional qualities, had access to workplace resources, or knew somebody useful. The article on the Russian work collective details workplace-related relationships in a tractor factory and shows that interaction with and assistance from one's co-workers remains important. The most interesting finding was that co-workers were even more important to those who had migrated to the city than to those who were born there, which is explained by the specifics of Soviet migration. As a result, the workplace heavily influenced or absorbed contexts for the worker migrants to establish relationships whereas many meeting-places commonly available in Western countries were largely absent or at least did not function as trusted public meeting places to initiate relationships. More results are to be found from my dissertation: Anna-Maria Salmi: Social Networks and Everyday Practices in Russia, Kikimora Publications, 2006, see www.kikimora-publications.com.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A new method of network analysis, a generalization in several different senses of existing methods and applicable to all networks for which a branch-admittance (or impedance) matrix can be formed, is presented. The treatment of network determinants is very general and essentially four terminal rather than three terminal, and leads to simple expressions based on trees of a simple graph associated with the network and matrix, and involving products of low-order, usually(2 times 2)determinants of tree-branch admittances, in addition to tree-branch products as in existing methods. By comparison with existing methods, the total number of trees and of tree pairs is usually considerably reduced, and this fact, together with an easy method of tree-pair sign determination which is also presented, makes the new method simpler in general. The method can be very easily adapted, by the use of infinite parameters, to accommodate ideal transformers, operational amplifiers, and other forms of network constraint; in fact, is thought to be applicable to all linear networks.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Convergence of the vast sequence space of proteins into a highly restricted fold/conformational space suggests a simple yet unique underlying mechanism of protein folding that has been the subject of much debate in the last several decades. One of the major challenges related to the understanding of protein folding or in silico protein structure prediction is the discrimination of non-native structures/decoys from the native structure. Applications of knowledge-based potentials to attain this goal have been extensively reported in the literature. Also, scoring functions based on accessible surface area and amino acid neighbourhood considerations were used in discriminating the decoys from native structures. In this article, we have explored the potential of protein structure network (PSN) parameters to validate the native proteins against a large number of decoy structures generated by diverse methods. We are guided by two principles: (a) the PSNs capture the local properties from a global perspective and (b) inclusion of non-covalent interactions, at all-atom level, including the side-chain atoms, in the network construction accommodates the sequence dependent features. Several network parameters such as the size of the largest cluster, community size, clustering coefficient are evaluated and scored on the basis of the rank of the native structures and the Z-scores. The network analysis of decoy structures highlights the importance of the global properties contributing to the uniqueness of native structures. The analysis also exhibits that the network parameters can be used as metrics to identify the native structures and filter out non-native structures/decoys in a large number of data-sets; thus also has a potential to be used in the protein `structure prediction' problem.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We investigate the problem of influence limitation in the presence of competing campaigns in a social network. Given a negative campaign which starts propagating from a specified source and a positive/counter campaign that is initiated, after a certain time delay, to limit the the influence or spread of misinformation by the negative campaign, we are interested in finding the top k influential nodes at which the positive campaign may be triggered. This problem has numerous applications in situations such as limiting the propagation of rumor, arresting the spread of virus through inoculation, initiating a counter-campaign against malicious propaganda, etc. The influence function for the generic influence limitation problem is non-submodular. Restricted versions of the influence limitation problem, reported in the literature, assume submodularity of the influence function and do not capture the problem in a realistic setting. In this paper, we propose a novel computational approach for the influence limitation problem based on Shapley value, a solution concept in cooperative game theory. Our approach works equally effectively for both submodular and non-submodular influence functions. Experiments on standard real world social network datasets reveal that the proposed approach outperforms existing heuristics in the literature. As a non-trivial extension, we also address the problem of influence limitation in the presence of multiple competing campaigns.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The rapid development of communication and networking has lessened geographical boundaries among actors in social networks. In social networks, actors often want to access databases depending upon their access rights, privacy, context, privileges, etc. Managing and handling knowledge based access of actors is complex and hard for which broad range of technologies need to be called. Access based on dynamic access rights and circumstances of actors impose major tasks on access systems. In this paper, we present an Access Mechanism for Social Networks (AMSN) to render access to actors over databases taking privacy and status of actors into consideration. The designed AMSN model is tested over an Agriculture Social Network (ASN) which utilises distinct access rights and privileges of actors related to the agriculture occupation, and provides access to actors over databases.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In social choice theory, preference aggregation refers to computing an aggregate preference over a set of alternatives given individual preferences of all the agents. In real-world scenarios, it may not be feasible to gather preferences from all the agents. Moreover, determining the aggregate preference is computationally intensive. In this paper, we show that the aggregate preference of the agents in a social network can be computed efficiently and with sufficient accuracy using preferences elicited from a small subset of critical nodes in the network. Our methodology uses a model developed based on real-world data obtained using a survey on human subjects, and exploits network structure and homophily of relationships. Our approach guarantees good performance for aggregation rules that satisfy a property which we call expected weak insensitivity. We demonstrate empirically that many practically relevant aggregation rules satisfy this property. We also show that two natural objective functions in this context satisfy certain properties, which makes our methodology attractive for scalable preference aggregation over large scale social networks. We conclude that our approach is superior to random polling while aggregating preferences related to individualistic metrics, whereas random polling is acceptable in the case of social metrics.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone-efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user-friendly, standalone program package named PSN-Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X-ray structures. The novelty in network construction lies in the explicit consideration of side-chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long-range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross-correlation/interaction energy in PSN-Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN-Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin-conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN-Ensemble for single-static structures of active/inactive states of 2-adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN-Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN-Ensemble/psn_index.html.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate objective function for two-phase influence maximization under the independent cascade model, investigate its properties, and propose algorithms for determining the seed nodes in the two phases. We also study the problem of determining an optimal budget-split and delay between the two phases.