77 resultados para Learned Helplessness


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Purpose: Changes to health care systems andworking hours have fragmentedresidents’ clinical experiences withpotentially negative effects ontheir development as professionals.Investigation of off-site supervision,which has been implemented in isolatedrural practice, could reveal importantbut less overt components of residencyeducation. 

Method: Insights from sociocultural learningtheory and work-based learning provideda theoretical framework. In 2011–2012,16 family physicians in Australia andCanada were asked in-depth how theyremotely supervised residents’ workand learning, and for their reflectionson this experience. The verbatiminterview transcripts and researchers’memos formed the data set. Templateanalysis produced a description andinterpretation of remote supervision. 

Results: Thirteen Australian family physiciansfrom five states and one territory, andthree Canadians from one province,participated. The main themes werehow remoteness changed the dynamicsof care and supervision; the importanceof ongoing, holistic, nonhierarchical,supportive supervisory relationships; andthat residents learned “clinical courage”through responsibility for patients’ careover time. Distance required supervisorsto articulate and pass on their expertiseto residents but made monitoringdifficult. Supervisory continuityencouraged residents to build on pastexperiences and confront deficiencies. 

Conclusions: Remote supervision enabled residents todevelop as clinicians and professionals.This questions the supremacy of co-locationas an organizing principle forresidency education. Future specialists maybenefit from programs that give themongoing and increasing responsibilityfor a group of patients and supportive.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs) with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI) approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs). Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.