Mean activity method

The present study investigates teachers‘ perceptions of the values of the CEFR, the perceived readiness and necessity of its application, and the work involved in its application process. Also, it explores teachers‘ responses to the use of the CEFR to renew the general English curriculum, reflected in how they changed their teaching activities, adapted the assigned textbooks and modified their assessment practice. The study was a case study applying the mixed method sequential explanatory model (Creswell & Clark, 2007).

201p nguathienthan12 23-05-2021 34 3   Download

The aim of the research presented in this paper is to give a detailed overview of what active learning is. The presented information about forms, models and methods of active learning are supposed to raise the reader’s interest and awareness for the importance of students’ active participation in their learning process. Various methods, ideas and researches are discussed in order to acquire information about the meaning of active learning and its background.

60p trinhthamhodang10 16-03-2021 41 8   Download

The present article discusses the application of linear regression, scaling factors (SF) and the so-called “mean activity method” to estimate the activity of DTM nuclides on metallic waste produced at the European Organization for Nuclear Research (CERN).

11p christabelhuynh 30-05-2020 10 1   Download

A combinatorial bijection between k-edge colored trees and colored Pr¨ufer codes for labelled trees is established. This bijection gives a simple combinatorial proof for the number k(n − 2)!nk−n n−2
of k-edge colored trees with n vertices.A k-edge colored tree is a labelled tree whose edges are colored from a set of k colors such that any two edges with a common vertex have different colors

7p thulanh5 12-09-2011 84 7   Download

It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at least 2pd − 1 cos(  2k ). A similar result has been proved by Friedman using more sophisticated tools.More generally, Serre has shown (see [3], [4] ) that for any fixed r and for any infinite family of d-regular graphs Gi, lim inf r(Gi) 2pd − 1. The same result has been proved by Friedman already in [5].

4p thulanh5 12-09-2011 97 6   Download