Finnish Preclinical and Clinical Medical Students as Strategic L2 English Learners: Language Learning Strategies and Communicating with Patients

This thesis focused on medical students’ language learning strategies for patient encounters. The research questions concerned the types of learning strategies that medical students use and the differences between the preclinical students and the clinical students, two groups who have had varying amounts of experience with patients. Additionally, strategy use was examined through activity systems to gain information on the context of language learning strategy use in order to learn language for patient encounters. In total, 130 first-year medical students (preclinical) and 39 fifth-year medical students (clinical) participated in the study by filling in a questionnaire on language learning strategies. In addition, two students were interviewed in order to create activity systems for the medical students at different stages of their studies. The study utilised both quantitative and qualitative research methods; the analysis of the results relies on Oxford’s Strategic Self-Regulation Model in the quantitative part and on activity theory in the qualitative part. The theoretical sections of the study introduced earlier research and theories regarding English for specific purposes, language learning strategies and activity theory. The results indicated that the medical students use affective, sociocultural-interactive and metasociocultural-interactive strategies often and avoid using negative strategies, which hinder language learning or cease communication altogether. Slight differences between the preclinical and clinical students were found, as clinical students appear to use affective and metasociocultural-interactive strategies more frequently compared to the preclinical students. The activity systems of the two students interviewed were rather similar. The students were at different stages of their studies, but their opinions were very similar. Both reported the object of learning to be mutual understanding between the patient and the doctor, which in part explains the preference for strategies that support communication and interaction. The results indicate that the nature of patient encounters affects the strategy use of the medical students at least to some extent.

'Explicit Learning: an Effort towards Human Scheduling Algorithms'

Abstract Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy. Mimicking the natural evolutionary process of the survival of the fittest, Genetic Algorithms (GAs) have attracted much attention in solving difficult scheduling problems in recent years. Some obstacles exist when using GAs: there is no canonical mechanism to deal with constraints, which are commonly met in most real-world scheduling problems, and small changes to a solution are difficult. To overcome both difficulties, indirect approaches have been presented (in [1] and [2]) for nurse scheduling and driver scheduling, where GAs are used by mapping the solution space, and separate decoding routines then build solutions to the original problem. In our previous indirect GAs, learning is implicit and is restricted to the efficient adjustment of weights for a set of rules that are used to construct schedules. The major limitation of those approaches is that they learn in a non-human way: like most existing construction algorithms, once the best weight combination is found, the rules used in the construction process are fixed at each iteration. However, normally a long sequence of moves is needed to construct a schedule and using fixed rules at each move is thus unreasonable and not coherent with human learning processes. When a human scheduler is working, he normally builds a schedule step by step following a set of rules. After much practice, the scheduler gradually masters the knowledge of which solution parts go well with others. He can identify good parts and is aware of the solution quality even if the scheduling process is not completed yet, thus having the ability to finish a schedule by using flexible, rather than fixed, rules. In this research we intend to design more human-like scheduling algorithms, by using ideas derived from Bayesian Optimization Algorithms (BOA) and Learning Classifier Systems (LCS) to implement explicit learning from past solutions. BOA can be applied to learn to identify good partial solutions and to complete them by building a Bayesian network of the joint distribution of solutions [3]. A Bayesian network is a directed acyclic graph with each node corresponding to one variable, and each variable corresponding to individual rule by which a schedule will be constructed step by step. The conditional probabilities are computed according to an initial set of promising solutions. Subsequently, each new instance for each node is generated by using the corresponding conditional probabilities, until values for all nodes have been generated. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the Bayesian network is updated again using the current set of good rule strings. The algorithm thereby tries to explicitly identify and mix promising building blocks. It should be noted that for most scheduling problems the structure of the network model is known and all the variables are fully observed. In this case, the goal of learning is to find the rule values that maximize the likelihood of the training data. Thus learning can amount to 'counting' in the case of multinomial distributions. In the LCS approach, each rule has its strength showing its current usefulness in the system, and this strength is constantly assessed [4]. To implement sophisticated learning based on previous solutions, an improved LCS-based algorithm is designed, which consists of the following three steps. The initialization step is to assign each rule at each stage a constant initial strength. Then rules are selected by using the Roulette Wheel strategy. The next step is to reinforce the strengths of the rules used in the previous solution, keeping the strength of unused rules unchanged. The selection step is to select fitter rules for the next generation. It is envisaged that the LCS part of the algorithm will be used as a hill climber to the BOA algorithm. This is exciting and ambitious research, which might provide the stepping-stone for a new class of scheduling algorithms. Data sets from nurse scheduling and mall problems will be used as test-beds. It is envisaged that once the concept has been proven successful, it will be implemented into general scheduling algorithms. It is also hoped that this research will give some preliminary answers about how to include human-like learning into scheduling algorithms and may therefore be of interest to researchers and practitioners in areas of scheduling and evolutionary computation. References 1. Aickelin, U. and Dowsland, K. (2003) 'Indirect Genetic Algorithm for a Nurse Scheduling Problem', Computer & Operational Research (in print). 2. Li, J. and Kwan, R.S.K. (2003), 'Fuzzy Genetic Algorithm for Driver Scheduling', European Journal of Operational Research 147(2): 334-344. 3. Pelikan, M., Goldberg, D. and Cantu-Paz, E. (1999) 'BOA: The Bayesian Optimization Algorithm', IlliGAL Report No 99003, University of Illinois. 4. Wilson, S. (1994) 'ZCS: A Zeroth-level Classifier System', Evolutionary Computation 2(1), pp 1-18.

Fallbasiertes E-Learning durch dynamische Verknüpfung von Fallstudien und Fachinhalten. Neue Diskussionsansätze zu einem vernachlässigten Konzept

Der Einsatz von Fallstudien kann als wichtiges Bindeglied zur Verknüpfung von Theorie und Praxis betrachtet werden. Fallstudien ermöglichen die Anwendung theoretischen Grundlagenwissens und die Entwicklung überfachlicher Kompetenzen. Damit können sie einen wichtigen Beitrag zur beruflichen Handlungskompetenz genau dort leisten, wo praktische Erfahrungen im Rahmen der Aus-und Weiterbildung nicht möglich sind. Der Einsatz von Fallstudien sollte aus diesem Grund nicht nur den „klassischen“ Anwendungsdisziplinen wie den Rechtswissenschaften, der Betriebswirtschaftslehre oder der Psychologie vorbehalten sein. Auch im Bereich der Informatik können sie eine wichtige Ergänzung zu den bisher eingesetzten Methoden darstellen. Das im Kontext des Projekts New Economy1 entwickelte und hier vorgestellte Konzept zur didaktischen und technischen Aufbereitung von Fallstudien am Beispiel der IT-Aus- und Weiterbildung soll diese Diskussion anregen. Mit Hilfe des vorgestellten Ansatzes ist es möglich, unterschiedliche methodische Zugänge zu einer Fallstudie für eine computerbasierte Präsentation automatisch zu generieren und mit fachlichen Inhalten zu verknüpfen. Damit ist ein entscheidender Mehrwert gegenüber den bisherigen statischen und in sich geschlossenen Darstellungen gegeben. Der damit zu erreichende Qualitätssprung im Einsatz von Fallstudien in der universitären und betrieblichen Aus- und Weiterbildung stellt einen wichtigen Beitrag zur praxisorientierten Gestaltung von Blended Learning-Ansätzen dar.(DIPF/Orig.)

Verringerung von trägem Wissen durch E-Learning. Am Beispiel einer Akustik-Lern-CD

Die Entwicklung der Akustik-Lern-CD hatte das Ziel, den Anwendungsbezug von theoretischem Wissen bei Regelverstärkern zu fördern. Die Studenten konnten nach dem theoretischen Unterricht zwar Hüllkurven zeichnen und Kompressionsraten berechnen, hatten aber Probleme, in konkreten Situationen wie z.B. beim Übersteuern von Instrumenten den korrekten Regelverstärker auszuwählen. Um einen besseren Wissenstransfer zu erreichen, werden bei der Lern-CD dem Lerner Situationen angeboten, in denen eigene Konstruktionsleistungen möglich sind und in denen kontextgebunden, interaktiv gelernt werden kann.(DIPF/Orig.)

M-Learning im Notebook-Seminar

Das Notebook-Seminar stellte ein M-Learning-Szenario dar, welches durch die Integration des Notebooks in die Lehre eine Verbesserung derselben erwirken soll. Methodischer Schwerpunkt ist das projektorientierte Lernen, welches neben der Vermittlung von Fachinhalten zum Ziel hat, auch fachübergreifende Kompetenzen zu vermitteln. Auf Basis einer ein Semester umfassenden Projektaufgabe werden bestimmte Lernhandlungen von den Studierenden absolviert. Diese Lernhandlungen fassen bestimmte Lernziele, die in Fach-, Methoden und Sozialkompetenz aufgeteilt sind. Das Paper beleuchtet Aspekte des M-Learnings und konzipiert vor diesem Hintergrund das Notebook-Seminar. Danach wird das in die Praxis umgesetzte Konzept vorgestellt und die gemachten Erfahrungen, sowie die Ergebnisse der Evaluation diskutiert.(DIPF/Orig.)

Modelling the development of an online learning resource by health care professionals

The aim of this study was to model the process of development for an Online Learning Resource (OLR) by Health Care Professionals (HCPs) to meet lymphoedema-related educational needs, within an asset-based management context. Previous research has shown that HCPs have unmet educational needs in relation to lymphoedema but details on their specific nature or context were lacking. Against this background, the study was conducted in two distinct but complementary phases. In Phase 1, a national survey was conducted of HCPs predominantly in community, oncology and palliative care services, followed by focus group discussions with a sample of respondents. In Phase 2, lymphoedema specialists (LSs) used an action research approach to design and implement an OLR to meet the needs identified in Phase 1. Study findings were analysed using descriptive statistics (Phase 1), and framework, thematic and dialectic analysis to explore their potential to inform future service development and education theory. Unmet educational need was found to be specific to health care setting and professional group. These resulted in HCPs feeling poorly-equipped to diagnose and manage lymphoedema. Of concern, when identified, lymphoedema was sometimes buried for fear of overwhelming stretched services. An OLR was identified as a means of addressing the unmet educational needs. This was successfully developed and implemented with minimal additional resources. The process model created has the potential to inform contemporary leadership theory in asset-based management contexts. This doctoral research makes a timely contribution to leadership theory since the resource constraints underpinning much of the contribution has salience to current public services. The process model created has the potential to inform contemporary leadership theory in asset-based management contexts. Further study of a leadership style which incorporates cognisance of Cognitive Load Theory and Self-Determination Theory is suggested. In addition, the detailed reporting of process and how this facilitated learning for participants contributes to workplace education theory

Pädagogische Metadaten im E-Learning. Allgemeine Problemfelder und exemplarische Fragestellungenam Beispiel der Virtuellen Fachhochschule

Mit dem Einsatz der neuen Medien, insbesondere des Internet, im Bereich des Lehrens und Lernens werden – auch nach dem Abklingen der ersten Euphorie – hohe Erwartungen verbunden. Dabei spielen neue, pädagogisch interessante Nutzungsmöglichkeiten, aber auch wirtschaftliche Interessen eine wesentliche Rolle. Die damit verbundenen Fragen (z.B. nach der Sicherung von Qualität und Gewährleistung von Rentabilität) führen zu einem steigenden Interesse an Metadaten zur Beschreibung von telematischen Lehr-/Lernmaterialien (zum Begriff „telematisch“ vgl. Zimmer, 1997, S. 111). Der folgende Beitrag befasst sich mit Erwartungen und Schwierigkeiten bei der Entwicklung und dem Einsatz pädagogischer Metadaten. Im Anschluss an eine kurze allgemeine Darstellung der Funktion von Metadaten wird unter Rückgriff auf Vorschläge verschiedener Gremien zur Bestimmung pädagogischer Metadaten gezeigt, welche Probleme bei deren Findung, Benennung und Implementierung auftreten: So stellen sich z.B. Fragen nach der interkulturellen Übertragbarkeit, nach den unterschiedlichen Perspektiven von Contentanbietern und Lernenden sowie auch die grundsätzliche Frage nach der Möglichkeit der Standardisierung pädagogischer Kategorien. Anhand des Praxisbeispiels der Virtuellen Fachhochschule für Technik, Informatik und Wirtschaft werden projekttypische Entwicklungsstufen von (pädagogischen) Metadaten dargestellt. Vorschläge zur Lösung der beschriebenen Probleme und ein Ausblick mit Forschungsfragen schließen den Beitrag ab.(DIPF/Orig.)

Technical and Didactical Scenarios of Student-centered Teaching and Learning

In this paper we envision didactical concepts for university education based on self-responsible and project-based learning and outline principles of adequate technical support. We use the scenario technique describing how a fictive student named Anna organizes her studies of informatics at a fictive university from the first days of her studies to make a career for herself.(DIPF/Orig.)

VirRAD: A New Paradigm for Technology Enhanced Learning

In most e-learning scenarios, communication and on-line collaboration is seen as an add-on feature to resource based learning. This paper will endeavour to present a pedagogical framework for inverting this view and putting communities of practice as the basic paradigm for e-learning. It will present an approach currently being used in the development of a virtual Radiopharmacy community, called VirRAD, and will discuss how theory can lead to an instructional design approach to support technologically enhanced learning.(DIPF/Orig.)

Spectral Frame Analysis and Learning through Graph Structure

This dissertation investigates the connection between spectral analysis and frame theory. When considering the spectral properties of a frame, we present a few novel results relating to the spectral decomposition. We first show that scalable frames have the property that the inner product of the scaling coefficients and the eigenvectors must equal the inverse eigenvalues. From this, we prove a similar result when an approximate scaling is obtained. We then focus on the optimization problems inherent to the scalable frames by first showing that there is an equivalence between scaling a frame and optimization problems with a non-restrictive objective function. Various objective functions are considered, and an analysis of the solution type is presented. For linear objectives, we can encourage sparse scalings, and with barrier objective functions, we force dense solutions. We further consider frames in high dimensions, and derive various solution techniques. From here, we restrict ourselves to various frame classes, to add more specificity to the results. Using frames generated from distributions allows for the placement of probabilistic bounds on scalability. For discrete distributions (Bernoulli and Rademacher), we bound the probability of encountering an ONB, and for continuous symmetric distributions (Uniform and Gaussian), we show that symmetry is retained in the transformed domain. We also prove several hyperplane-separation results. With the theory developed, we discuss graph applications of the scalability framework. We make a connection with graph conditioning, and show the in-feasibility of the problem in the general case. After a modification, we show that any complete graph can be conditioned. We then present a modification of standard PCA (robust PCA) developed by Cand\`es, and give some background into Electron Energy-Loss Spectroscopy (EELS). We design a novel scheme for the processing of EELS through robust PCA and least-squares regression, and test this scheme on biological samples. Finally, we take the idea of robust PCA and apply the technique of kernel PCA to perform robust manifold learning. We derive the problem and present an algorithm for its solution. There is also discussion of the differences with RPCA that make theoretical guarantees difficult.

Different Transitions towards Learning at University: Exploring the Heterogeneity of Motivational Processes

Transitions processes in higher education are characterized by new learning situations which pose challenges to most students. This chapter explores the heterogeneity of reactions to these challenges from a perspective of regulation processes. The Integrated Model of Learning and Action is used to identity different patterns of motivational regulation amongst students at university by using mixed distribution models. Six subpopulations of motivational regulation could be identified: students with self-determined, pragmatic, strategic, negative, anxious and insecure learning motivation. Findings about these patterns can be used to design didactic measures that will support students’ learning processes.

Learning from the lagoon: Research in development in Solomon Islands

A major challenge for international agricultural research is to find ways to improve the nutrition and incomes of people left behind by the Green Revolution. To better address the needs of the most marginal and vulnerable people, the CGIAR Research Program on Aquatic Agricultural Systems (AAS) developed the research-in-development (RinD) approach. In 2012, WorldFish started to implement RinD in Solomon Islands. By building people’s capacity to analyze and address development problems, actively engaging relevant stakeholders, and linking research to these processes, RinD aims to develop an alternative approach to addressing hunger and poverty. This report describes the key principles and implementation process, and assesses the emergent outcomes of this participatory, systems-oriented and transformative research approach in Solomon Islands.

'Explicit Learning: an Effort towards Human Scheduling Algorithms'

Abstract Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy. Mimicking the natural evolutionary process of the survival of the fittest, Genetic Algorithms (GAs) have attracted much attention in solving difficult scheduling problems in recent years. Some obstacles exist when using GAs: there is no canonical mechanism to deal with constraints, which are commonly met in most real-world scheduling problems, and small changes to a solution are difficult. To overcome both difficulties, indirect approaches have been presented (in [1] and [2]) for nurse scheduling and driver scheduling, where GAs are used by mapping the solution space, and separate decoding routines then build solutions to the original problem. In our previous indirect GAs, learning is implicit and is restricted to the efficient adjustment of weights for a set of rules that are used to construct schedules. The major limitation of those approaches is that they learn in a non-human way: like most existing construction algorithms, once the best weight combination is found, the rules used in the construction process are fixed at each iteration. However, normally a long sequence of moves is needed to construct a schedule and using fixed rules at each move is thus unreasonable and not coherent with human learning processes. When a human scheduler is working, he normally builds a schedule step by step following a set of rules. After much practice, the scheduler gradually masters the knowledge of which solution parts go well with others. He can identify good parts and is aware of the solution quality even if the scheduling process is not completed yet, thus having the ability to finish a schedule by using flexible, rather than fixed, rules. In this research we intend to design more human-like scheduling algorithms, by using ideas derived from Bayesian Optimization Algorithms (BOA) and Learning Classifier Systems (LCS) to implement explicit learning from past solutions. BOA can be applied to learn to identify good partial solutions and to complete them by building a Bayesian network of the joint distribution of solutions [3]. A Bayesian network is a directed acyclic graph with each node corresponding to one variable, and each variable corresponding to individual rule by which a schedule will be constructed step by step. The conditional probabilities are computed according to an initial set of promising solutions. Subsequently, each new instance for each node is generated by using the corresponding conditional probabilities, until values for all nodes have been generated. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the Bayesian network is updated again using the current set of good rule strings. The algorithm thereby tries to explicitly identify and mix promising building blocks. It should be noted that for most scheduling problems the structure of the network model is known and all the variables are fully observed. In this case, the goal of learning is to find the rule values that maximize the likelihood of the training data. Thus learning can amount to 'counting' in the case of multinomial distributions. In the LCS approach, each rule has its strength showing its current usefulness in the system, and this strength is constantly assessed [4]. To implement sophisticated learning based on previous solutions, an improved LCS-based algorithm is designed, which consists of the following three steps. The initialization step is to assign each rule at each stage a constant initial strength. Then rules are selected by using the Roulette Wheel strategy. The next step is to reinforce the strengths of the rules used in the previous solution, keeping the strength of unused rules unchanged. The selection step is to select fitter rules for the next generation. It is envisaged that the LCS part of the algorithm will be used as a hill climber to the BOA algorithm. This is exciting and ambitious research, which might provide the stepping-stone for a new class of scheduling algorithms. Data sets from nurse scheduling and mall problems will be used as test-beds. It is envisaged that once the concept has been proven successful, it will be implemented into general scheduling algorithms. It is also hoped that this research will give some preliminary answers about how to include human-like learning into scheduling algorithms and may therefore be of interest to researchers and practitioners in areas of scheduling and evolutionary computation. References 1. Aickelin, U. and Dowsland, K. (2003) 'Indirect Genetic Algorithm for a Nurse Scheduling Problem', Computer & Operational Research (in print). 2. Li, J. and Kwan, R.S.K. (2003), 'Fuzzy Genetic Algorithm for Driver Scheduling', European Journal of Operational Research 147(2): 334-344. 3. Pelikan, M., Goldberg, D. and Cantu-Paz, E. (1999) 'BOA: The Bayesian Optimization Algorithm', IlliGAL Report No 99003, University of Illinois. 4. Wilson, S. (1994) 'ZCS: A Zeroth-level Classifier System', Evolutionary Computation 2(1), pp 1-18.

Guided portfolio writing as a scaffold for reflective learning in in-service contexts: a case study

Language is widely recognized as an inescapable mediating tool for professional learning, and with this text we want to contribute to a better understanding of the particular role that guided writing can play in in-service professional reflective learning. We analysed one pre-school teacher’s written portfolio, the construction of which was guided to scaffold deep thinking about (and the transference of theory into) practice during participation in an in-service program about language education. Our case study shows that the writing process sustained robust learning about professional knowing, doing and learning itself: The teacher elaborated an integrative ethical understanding of the discussed theory, fully experienced newly informed practices and assessed her own learning by using theory to confront her previous knowledge and practices. Throughout the portfolio, the learning stance revealed by her voice varied accordingly. The study illustrates the potential of guided writing to scaffold reflective learning in in-service contexts.

Investigating problem-based learning in Saudi Arabian mathematics education: a TIMSS-related study

The aim of this study is to investigate the effectiveness of problem-based learning (PBL) on students’ mathematical performance. This includes mathematics achievement and students’ attitudes towards mathematics for third and eighth grade students in Saudi Arabia. Mathematics achievement includes, knowing, applying, and reasoning domains, while students’ attitudes towards mathematics covers, ‘Like learning mathematics’, ‘value mathematics’, and ‘a confidence to learn mathematics’. This study goes deeper to examine the interaction of a PBL teaching strategy, with trained face-to-face and self-directed learning teachers, on students’ performance (mathematics achievement and attitudes towards mathematics). It also examines the interaction between different ability levels of students (high and low levels) with a PBL teaching strategy (with trained face-to-face or self-directed learning teachers) on students’ performance. It draws upon findings and techniques of the TIMSS international benchmarking studies. Mixed methods are used to analyse the quasi-experimental study data. One -way ANOVA, Mixed ANOVA, and paired t-tests models are used to analyse quantitative data, while a semi-structured interview with teachers, and author’s observations are used to enrich understanding of PBL and mathematical performance. The findings show that the PBL teaching strategy significantly improves students’ knowledge application, and is better than the traditional teaching methods among third grade students. This improvement, however, occurred only with the trained face-to-face teacher’s group. Furthermore, there is robust evidence that using a PBL teaching strategy could raise significantly students’ liking of learning mathematics, and confidence to learn mathematics, more than traditional teaching methods among third grade students. Howe ver, there was no evidence that PBL could improve students’ performance (mathematics achievement and attitudes towards mathematics), more than traditional teaching methods, among eighth grade students. In 8th grade, the findings for low achieving students show significant improvement compared to high achieving students, whether PBL is applied or not. However, for 3th grade students, no significant difference in mathematical achievement between high and low achieving students was found. The results were not expected for high achieving students and this is also discussed. The implications of these findings for mathematics education in Saudi Arabia are considered.