Personal epistemology

Personal epistemology is a complex and contested area (Schraw 2001) with a number of approaches (i.e. as beliefs, development models, resources). However, regardless of the various approaches, personal epistemology appears to consist of specific dimensions that comprise individual understanding of knowledge and knowing and which influence comprehension, cognitive processing, and conceptual change learning (Hofer 2004). Students’ personal epistemology could be an important factor in their ability to engage with certain pedagogies in higher education (e.g. problem based learning, reflective learning) and their required levels of knowledge handling and production. There is evidence to suggest that epistemological views should be addressed in helping students cope with higher education (Kember 2001). The workshop will consider the idea that personal epistemology can be: ‘…a lens to use in understanding students’ ideas and behaviour, in assessing students’ abilities and needs, and in adapting their plans and strategies for instruction.’ (Hammer and Elby 2002, p169) However, the danger of pigeon-holing students is ever present! The workshop will therefore critically explore current thinking on personal epistemology and relate it to specific contexts and subject domains. We will look at how views on knowledge and knowing might impact on learning, and reflect on how increased understanding might allow improved methods of preparing and developing learners to deal with the constructed and complex nature of learning

Addressivity and Sociability in “Celtic Men”

This paper is part of a larger project which examines the sociable dimensions of computer-mediated communication in local newsgroups on the Internet. This paper, however, takes as its primary data a complete thread of eighty five messages posted to RumCom’s largest ISP specific newsgroup,\ud rumcom.local. The messages share the subject header “Celtic Men” and play off contributors ideas about regional aspects of masculinity and male sexuality. As a whole they provide a good example of both a specific culturally located example of developing communication and a more general example of newsgroup CMC. Using this case as our exemplar we shall hold up for examination three matters: how the technology and software supplied by RumCom influence the form of interaction within the newsgroup; how different types of addressivity are used by posters to manage their communication; and how the notion of sociability figures as a useful device to characterise the specific traits of newsgroup interaction

Qualitative exploration of the views of healthy living champions from pharmacies in England.

BACKGROUND: In England, the 'Healthy Living Pharmacy (HLP)' initiative has been trialed; positive outcomes led to national roll-out across England to 20 pathfinder sites. A HLP provides health promotion/prevention services through a structured framework to meet local population need. Non-pharmacist staff receive additional training so that they can provide these services, and are known as Healthy Living Champions (HLCs). OBJECTIVES: To explore HLCs views on their role and to identify any barriers or facilitators in performing the role. METHODS: Fourteen semi-structured face-to-face interviews were conducted during February and March 2013 in NHS Dudley, and analysed using the principles of content analysis. RESULTS: Three themes emerged from the interviews; HLC job role; training; and public awareness. HLC staff showed high levels of motivation, a strong desire to help people and felt a sense of personal reward, resulting in increased levels of job satisfaction. Training had improved their confidence but they still had reservations in offering services such as alcohol intervention and weight management. All believed that public awareness was low despite advertising. CONCLUSION: HLCs were positive toward their new role and derived job satisfaction from helping people to improve their health, although on-going training and support was perceived as important

Service improvement in social work and health. An e-guide for practitioners and managers

This book aims to provide practitioners and managers working within social care and health environments with the knowledge to be able to ask precise questions of a potential service improvement project

Importance of low-angle grain boundaries in YBa2Cu3O7-delta coated conductors

Over the past ten years the perception of grain boundaries in YBa2Cu3O7-δ conductors has changed greatly. They are no longer a problem to be eliminated but an inevitable and potentially favourable part of the material. This change has arisen as a consequence of new manufacturing techniques which result in excellent grain alignment, reducing the spread of grain boundary misorientation angles. At the same time there is considerable recent evidence which indicates that the variation of properties of grain boundaries with mismatch angle is more complex than a simple exponential decrease in critical current. This is due to the fact that low-angle grain boundaries represent a qualitatively different system to high angle boundaries. The time is therefore right for a targetted review of research into low-angle YBa2Cu3O7-δ grain boundaries. This article does not purport to be a comprehensive review of the physics of grain boundaries as found in YBa2Cu3O7-δ in general; for a broader overview we would recommend that the reader consult the comprehensive review of Hilgenkamp and Mannhart (Rev. Mod. Phys., 74, 485, 2002). The purpose of this article is to review the origin and properties of the low-angle grain boundaries found in YBa2Cu3O7-δ coated conductors both individually and as a collective system.EPSR

Geometric Crossing-Minimization - A Scalable Randomized Approach

We consider the minimization of edge-crossings in geometric drawings of graphs G=(V, E), i.e., in drawings where each edge is depicted as a line segment. The respective decision problem is NP-hard [Daniel Bienstock, 1991]. Crossing-minimization, in general, is a popular theoretical research topic; see Vrt\u27o [Imrich Vrt\u27o, 2014]. In contrast to theory and the topological setting, the geometric setting did not receive a lot of attention in practice. Prior work [Marcel Radermacher et al., 2018] is limited to the crossing-minimization in geometric graphs with less than 200 edges. The described heuristics base on the primitive operation of moving a single vertex v to its crossing-minimal position, i.e., the position in R^2 that minimizes the number of crossings on edges incident to v. In this paper, we introduce a technique to speed-up the computation by a factor of 20. This is necessary but not sufficient to cope with graphs with a few thousand edges. In order to handle larger graphs, we drop the condition that each vertex v has to be moved to its crossing-minimal position and compute a position that is only optimal with respect to a small random subset of the edges. In our theoretical contribution, we consider drawings that contain for each edge uv in E and each position p in R^2 for v o(|E|) crossings. In this case, we prove that with a random subset of the edges of size Theta(k log k) the co-crossing number of a degree-k vertex v, i.e., the number of edge pairs uv in E, e in E that do not cross, can be approximated by an arbitrary but fixed factor delta with high probability. In our experimental evaluation, we show that the randomized approach reduces the number of crossings in graphs with up to 13 000 edges considerably. The evaluation suggests that depending on the degree-distribution different strategies result in the fewest number of crossings

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

A greedily routable region (GRR) is a closed subset of $\mathbb R^2$, in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygons with holes. We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles, but can be solved optimally for trees in polynomial time. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.Comment: full version of a paper appearing in ISAAC 201