2 resultados para Drittes Reich

em University of Queensland eSpace - Australia


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Improving the public understanding of science is an important challenge for the future professional scientists who are our current undergraduates. In this paper, we present a conceptual model that explores the role of mass media as community gatekeepers of new scientific findings. This model frames the benefits for undergraduate science students to learn about media genres so that they can learn to communicate science more effectively to nonprofessional audiences. Informed by this Media Role model, we then detail a novel writing task for undergraduate physiology students, the Opinion Editorial (Op-Ed), and an accompanying Peer Review. The Op-Ed genre was directly taught to the students by a professional journalist. As an assessment task, students presented a recent, highly technical paper as an Op-Ed. This was assessed by both faculty members and peers using a detailed assessment rubric. Most students were able to replicate the features of Op-Eds and attained high grades on their writing tasks. Survey data from final-year physiology students (n = 230) were collected before and after the implementation of the Op-Ed/Peer Review. These indicated that most students were aware of the importance of scientists to effectively communicate their knowledge to nonprofessional audiences, that the Op-Ed writing task was challenging, and that they believed that their ability to write to nonprofessional audiences was improved after explicit teaching and feedback.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

An edge-colored graph is a graph H together with a function f:E(H) → C where C is a set of colors. Given an edge-colored graph H, the graph induced by the edges of color c C is denoted by H(c). Let G, H, and J be graphs and let μ be a positive integer. A (J, H, G, μ) edge-colored graph decomposition is a set S = {H 1,H 2,...,H t} of edge-colored graphs with color set C = {c 1, c 2,..., c k} such that Hi ≅ H for 1 ≤ i ≤ t; Hi (cj) ≅ G for 1 ≤ i ≤ t and ≤ j ≤ k; and for j = 1, 2,..., k, each edge of J occurs in exactly μ of the graphs H 1(c j ), H 2(c j ),..., H t (c j ). Let Q 3 denote the 3-dimensional cube. In this paper, we find necessary and sufficient conditions on n, μ and G for the existence of a (K n ,Q 3,G, μ) edge-colored graph decomposition. © Birkhäuser Verlag, Basel 2007.