A new evaluation model for e-learning programs
|
|
|
- Philip Gardner
- 10 years ago
- Views:
Transcription
1 A new evaluation model for e-learning programs Uranchimeg Tudevdagva 1, Wolfram Hardt 2 Abstract This paper deals with a measure theoretical model for evaluation of e-learning programs. Based on methods of general measure theory an evaluation model is developed which can be used for assessment of complex target structures in context of e-learning programs. With the presented rating function target structures can be evaluated by a scoring value which indicates how the targets in sense of a given logical target structure has been reached. A procedure is developed for the estimation of scoring values for target structures based on adapted assessment checklists. 3 Keywords e-learning, e-courses, evaluation, scoring, target structure, e-learning quality, assessment checklist, evaluation model, ELQ. 1 Introduction Quality of e-learning programs is a very intensive and controversy discussed topic of recent time. Background is the worldwide challenge for the development of methods and tools for lifelong learning that becomes more and more realistic by the fast progress on all areas of e-tools and especially of Internet. In this context the call for adapted education standards, a corresponding quality evaluation and process management of e-learning tools becomes always louder. However no approach for evaluation of e-learning programs could reach a general acceptance until now. For a corresponding overview we refer to the report [1] of Swedish National Agency for Higher Education. This report contains an excellent survey on the European view on e-learning and quality assessment. A concise further overview on quality research in e-learning is given by [3]. Fore some additional or special aspects we refer to [5], [6], [7] and [9], for instance. The quantitative models for assessment of e-learning quality considered usually are as a rule additive models. That means, depending on the considered aspects, which are measured based on a defined scale, a linear function containing corresponding weight factors is used like, e.g., Q = r α i x i. Here denote α i, α i > 0, given weight factors for the obtained measure values x i, i = 1,..., r, for the considered aspects. The advantage of this formula is, it is very easy. The disadvantage is, that the choice of proper weight factors is subective. Moreover, positive evaluation values can be obtained even in such cases if the targets of certain quality aspects has been failed. A possible logical inner structure of target structures remains out of consideration. In contrast to these linear approaches we develop here a measure theoretical model for the 1 Mongolian University of Science and Technology, Ulaanbaatar, Mongolia, [email protected]. 2 Chemnitz University of Technology, Chemnitz, Germany, [email protected]. 3 This study has been supported by a grant of Schlumberger Foundation 1
2 assessment of a e-learning program. We consider an e-learning program whose quality is determinated by k, k 1, several aspects or characteristics M 1,..., M k. We assume that the quality of the single aspects can be measured by means of a given scale where the corresponding observation variables are ordinal or metrical ordered variables. Our aim is to develop an evaluation model for e-learning programs whose quality is characterised as above by k several aspects M 1,..., M k. For it we will construct a corresponding measure in sense of general measure theory. This requires in the context considered here two steps. First we will construct k corresponding efficiency measure spaces for description of quality of single aspects M 1,..., M k. After that we will combine these spaces to a corresponding product space. This space will describe the considered aspect structure as a whole. The via the obtained product space defined product measure will be then our quality measure for evaluation of an e-learning program. For the implementation and application of our assessment approach the paper is rounded off by a procedure for the estimation of scoring values for target structures based on adapted assessment checklist. The advantage of the model considered here in comparison with linear models is that by the multidimensional consideration via the product measure the logical structure of a target structure is evaluated as a whole. 2 The model 2.1 Measure spaces for the single aspects For description of quality of a single aspect M i, i = 1,..., k, we consider a measure space (Ω i, A i, Q i. A measure space consists of three obects Ω i, A i and Q i which can be defined here as follows: 1. Let Ω i = {ω i1, ω i2 } be a two-element set - the set of elementary targets. In this sense the element ω i1 is standing for: the target in sense of aspect M i has been reached (is reached, the element ω i2 is standing for: the target in sense of M i has not been reached (is not reached. The set Ω i is denoted as target space with respect to the aspect M i. 2. Let A i be the set of all subsets of Ω i. Then we have A i = {φ, A i1, A i2, Ω i }, where A i1 and A i2 are defined by A i1 = {ω i1 } and A i2 = {ω i2 } = A i1, for instance. The elements of set system A i can be interpreted as target structures as follows: A i1 - target in sense of aspect M i has been reached, A i1 - target in sense of aspect M i has been not reached, Ω i - any target in sense of aspect M i has been reached, φ - nothing has been reached. The set A i is in sense of measure theory a σ-algebra. We denote the elements of A i as target structures and the set A i itself as target algebra. In this context we say: the target in sense of a target structure A A i has been reached (is reached if an ω A has been observed (is observed. The structure of a target algebra A i is very simple and posses more a formal 2
3 meaning here. The target algebras are needed if we will go over to the corresponding product space for a common description of all aspects M 1,..., M k. 3. Let Q i : A i [0, 1] be an additive function from our target algebra into the interval [0, 1] where to any given real number q i, 0 q i 1, Q i (A i1 = q i, Q i (A i1 = 1 q i and Q i (Ω i = 1 holds. The values of numbers q i and 1 q i are or can be interpreted as evaluation values for the target structures A i1 and A i1. In this sense the values q i and 1 q i are an evaluation distribution over the target algebra A i. The function Q i is a normalised measure on (Ω i, A i. We denote Q i (A i1 as score that the target in sense of aspect M i has been reached (is reached, analogously Q i (A i1 is the corresponding score that the target in sense of M i has not been reached (is not reached. The triples (Ω i, A i, Q i, i = 1,..., k, are elementary measure spaces. We now will combine the so obtained spaces for the aspects M 1,..., M k to a product space. By this product space an evaluation of more complex target structures with respect to the aspects M 1,..., M k becomes possible. For the measure theoretical background used in this paper we refer to [2], for instance. 2.2 A product space for the aspects Describing more complex target structures we now consider the product space over the measure spaces (Ω i, A i, Q i for i = 1,..., k. This space consists of three elements Ω, A and Q again which are defined as follows. 1. Let Ω = Ω 1... Ω k be the cross product over the target spaces Ω 1,..., Ω k. The elements of Ω are ω = {ω 1,..., ω k } with ω i Ω i for i = 1,..., k. We denote these elements as k- dimensional elementary targets and Ω is then the k-dimensional target space. 2. Let A be the set of all subsets of k-dimensional target space Ω. This set of subsets forms again a σ-algebra over the target space Ω.The elements of σ-algebra A are denoted as k-dimensional target structures. The σ-algebra A is then k-dimensional target algebra. Some examples of target structures: A = {{ω 11, ω 21,..., ω k1 }} - all single targets A 11,..., A k1 in sense of aspects M 1,..., M k have been reached (are reachable, B = {{ω 11,..., ω k 11, ω k1 }, {ω 11,..., ω k 11, ω k2 }} - the single targets A 11,..., A k 11 have been reached (are reachable, C = {{ω 11, ω 21,..., ω k 11, ω k2 }} - the targets A 11,..., A k 11 have been reached, but not the target A k1, D = {{ω 11, ω 22,..., ω k2 }} - only the single target A 11 has been reached (is reached, E = {{ω 11, ω 2i2,...ω kik }, i 2,..., i k {1, 2}} - the single target A 11 A i has been reached. It holds E = A 11 Ω 2... Ω k, A 11 = {ω 11 } Ω 1. The last target structure E is a special target structure which is directed only to the single 3
4 target or aspect M 1. Our target algebra A contains of k such single target structures which are given by A 1 = A 11 Ω 2... Ω k, A 11 = {ω 11 } A 1, (1 A 2 = Ω 1 A Ω k, A 21 = {ω 21 } A 2,... A k = Ω 1 Ω 2... A k1, A k1 = {ω k1 } A k. We denote these target structures as simple target structures or simple targets. Beside of the single target structures a further class of special target structures is of interest. This is the class of composed target structures. A target structure B is said to be a composed target structure if a subset of simple target structures {A i1,..., A i } A, 1 i 1, < i 2 <... < i k, 2 k, exists such that B = r=1 holds. Composed target structures are directed to subsets of targets in sense of the given target or aspect set M 1,..., M k. Our target algebra A contains 2 k 1 different composed target structures. These are A 1,..., A k, A 1 A 2,..., A k 1 A k, A 1 A 2 A 3,..., k A i = Ω. Because of the set system A as the set of all subsets of Ω is a σ-algebra it holds: A ir r (i A 1,..., A r A A i A, (ii A A A A. This implies moreover A 1,..., A r A r A i A. So beside the union of target structures and the complement of a target structure also the intersection of target structures is again a target structures. That means, the target algebra A is logical closed or consistent with respect to application of set theoretical operations to target structures. 3. Let Q : A [0, 1] be a map from the target algebra A into the interval [0, 1] with the following property. For any A = A 1 A k with A i A i, i = 1,..., k, it holds Q(A = k Q i (A i. (2 Then, in sense of measure theory, Q is the so-called product measure of measures Q i, i = 1,..., k. This is according to the Hahn-Kolmogorov-Theorem of general measure theory a unique defined measure on measurable space (Ω, A. Hence by the product measure Q a measure value Q(A is defined for each target structure A A. The value Q(A can be interpreted then as an evaluation number for it how the 4
5 targets in sense of target structure A have been reached (can be reached. In this sense big values Q(A 1 are a hint that the targets in sense of target structure A have been reached essentially, whereas a value Q(A 0 is a signal that targets in sense of target structure A has been failed essentially. In this sense we will denote Q(A as score for it that the targets of target structure A have been reached (can be reached or, more short, simply as the score of target structure A. Collecting this together, the triple (Ω, A, Q forms a corresponding product space which allows an evaluation of all target structures of target algebra A by means of a score measure Q defined by ( Calculation rules for scores We will consider now some calculation rules for the computation of scores of target structures. The score Q defined by (2 is a normalised measure on (Ω, A. Each normalised measure posses the following basic properties. 1. Additivity: According to the addition axiom of measure theory the following rule holds. Let A 1,..., A n A be pairwise disoint target structures such that A i A = φ for i and i, = 1,..., n holds then we have ( n Q A i = n Q(A i. 2. Normalisation rule: It holds Q(Ω = 1. Basing on these two properties further calculation rules can be obtained. The most important rules are the following. These are standard properties of each normalised measure. They hold correspondingly for the score measure Q considered here. We give a short survey. 3. Complement rule: Let A A be an arbitrary target structure. Then it holds Q(A = 1 Q(A. Proof. This is a standard property of any normalised measure. 4. General addition rule: Let A 1,..., A r A be arbitrary target structures. Then it holds as well as r Q( = r Q(A i Q(A 1 A 2 = Q(A 1 + Q(A 2 Q(A 1 A 2 r Q(A i A + i, i< r i,,k=1 i<<k Q(A i A A k... + ( 1 n+1 Q(A 1.. A r Proof. This rule corresponds the general addition rule of measure theory. 5
6 Now we will consider some calculation rules which are of special interest in context of evaluation of target structure. 5. Product rule for simple target structures: Let A 1,..., A r A be simple target structures in sense of relation (1 with Q(A i = q i, 0 q i 1, for i = 1,..., r, r k. Then we have Q( A i = q i. Proof. Without of any loss of generality we suppose that the simple target structures A 1,..., A r A are directed to the first r aspects M 1,..., M r. Then we have A i = A 11 A r1 Ω r+1 Ω k with A i1 A i, i = 1,..., r. By (2 we get then Q( A i = Q 1 (A 11 Q r (A r1 Q r+1 (Ω r+1 Q k (Ω k. (3 For simple target structures it holds Q(A i = Q i (A i1. With Q(A i = q i for i = 1,..., r and Q i (Ω i = 1 for i = r + 1,..., k. This implies Q( A i = Q i (A 11 = Q(A i = q i. 6. Addition rule for simple target structures: Let A 1,..., A r A be simple target structures where A i is only directed to aspect M i with Q(A i = q i, i = 1,..., r. Then it holds ( r Q A i = 1 (1 q i. (4 Proof. By means of the complement rule and de Morgan s rule we obtain ( r ( r r ( Q A i = Q = 1 Q A i = 1 Q A i. A i With product measure property of Q and again by the complement rule we get ( Q A i = Q(A i = (1 Q(A i = (1 q i. Collecting this together we get relation (4. A special case is the case r = 2. Then we have Q (A 1 A 2 = 1 (1 q 1 (1 q 2 = q 1 + q 2 q 1 q 2. 6
7 7. Product rule for composed target structures: Let B 1,..., B r A be r, 1 r k, composed target structures with B i = n i A i, (5 generated by n i disoint simple target structures A i A with Q(A i = q i for i = 1,..., r, = 1,..., n i, r n i = n. Let C A be a target structure defined by C = B i = n i A i. (6 Then it holds ( ( Q(C = Q B i = Q n i A i = ( ni Q A i = ( n i 1 (1 q i. (7 Proof. For each composed target structure B i = n i A i, i = 1,..., r, we consider the corresponding product measure space (Ω (i, A (i, Q (i generated by the measure spaces (Ω i, A i, Q i, for the aspects M i, = 1,..., n i. As above, the product measures Q (i are defined by Q (i (A i1 A ini = Q i (A i1 Q ini (A ini, A i A i, = 1,..., n i. Let A (i 1,..., A (i n i A (i be simple target structures of target algebra A (i directed to the aspects M i1,..., M ini with Q (i (A (i = q i, = 1,..., n i. Then for a composed target structure B i = n i A(i A (i according the addition rule for simple target structures holds n i Q (i (B i = Q (i ( A (i ni = 1 (1 q i. (8 If we now consider the product of measure spaces (Ω (1, A (1, Q (1,..., (Ω (r, A (r, Q (r then we obtain again the measure space (Ω, A, Q. The corresponding product measure Q is then defined as follows. For any target structure C = B 1 B r A, B i A (i, i = 1,..., r, we have Q(C = Q(B 1 B r = Q (1 (B 1 Q (r (B r. This, together with (8 completes the proof. Of course the product rule (7 holds too if we consider r, 2 r k, disoint composed target structures where the included simple target structures form only a subset of all simple target structures of target algebra A. Hence it is possible to evaluate by formula (7 also target structures in sense of (5 which refer itself only to a subset of all possible simple target structures. 7
8 A 11 A 31 A 12 A 21 A 32 A 13 B 1 B 2 B 3 Figure 1. structures. Visualisation of target structures in sense of product rule for composed target 2.4 Graphical representation of target structures Target structures in sense of product rule for composed target structures can be visualised by means of logical diagrams as they are used in reliability theory, for instance. Let C be a target structure given by with C = B 1 B 2 B 3 B 1 = A 11 A 12 A 13, B 2 = A 21 and B 3 = A 31 A 32 where A 11, A 12, A 13, A 21, A 31 and A 32 are disoint simple target structures. Then the targets in sense of target structure C are reached if at least one of simple targets A 11,..., A 13 and the target A 21 and at least one of the targets A 31 or A 32 are reached. Figure 1 shows the associated target diagram. The composed target structures are described by a parallel circuit, the intersection of the composed target structures is visualised by a series circuit. By repeated application of the addition rule for simple target structures and the product rule for composed target structures very complex target structures can be evaluated. The logical background of these target structures can be visualised by corresponding target diagrams. 3 Estimation of scores for target structures In the previous section it has been shown how scores can be calculated for complex target structures. By the calculation rules considered there the scores can be reduced to the scores q 1,..., q k of the simple target structures of target algebra A. Unfortunately, as a rule these scores are not given a-priori and we need corresponding estimation methods for these scores as well as for the scores of composed target structures. We assume that aspects M 1,..., M k can be observed indirectly by means of ordinal or metrical ordered observation variables X 1,..., X k. Let X i = [x (0 i, x (1 i ] be the domain of i-th observation variable X i for i = 1,..., k. Big values of X i in the neighbourhood of x (1 i are an indication 8
9 of that the target in sense of aspect M i has been reached, essentially. Small values in the neighbourhood of x (0 i a corresponding signal that the target has been failed, essentially. The observation values X i = x (1 i or X i = x (0 i indicate that the target in sense of aspect M i has been completely reached or failed, respectively. The scales which are used for observing the variables X i can be continuous or discrete, must be ordered and can be, for instance, rank places too. We now consider a sample of size n of our observation vector X = (X 1,..., X k. Such a sample can be obtained, e.g., by a corresponding interrogation of participants of an e-learning program via an assessment checklist after the course is finished. This would be an a-posterioriinterrogation. Or, one could interrogate experts which evaluate the course based on the course materials before the course is held. This would be an a-priori-interrogation. Let X i = (X i1,..., X ik be the i-th element of our sample X = ( X 1,..., X n. Then at first we have to normalise our sample values X i1,..., X ik by transforming of these values to the interval [0, 1], the domain for our scores q 1,..., q k. This can be reached by the following transformation. For i = 1,..., n and = 1,..., k let q (i be defined by Then q (i = X i x (0. (9 x (1 x (0 q (i is an estimation for the score q based on the observation X i. That means, each observation vector X i = (X i1,..., X ik, i = 1,..., n, is transformed first by the normalisation rule (9 into a score vector q (i = (q (i 1,..., q (i k. By means of these transformed or normalised sampling values the score of composed target structures can be estimated as follows. We consider a composed target structure C in sense of relation (6 with a score according (7. For each sample element q (i = (q (i 1,..., q (i k, i = 1,..., n, of our normalised sample q = ( q (1,..., q (n we obtain an estimation Q (i (C for Q(C if we substitute in formula (7 the scores q i by the estimations q (i i. We get ( n Q (i (C = 1 (1 q (i (10 for i = 1,..., n. The vector (Q (1 (C,..., Q (n (C is then a sample of size n for Q(C. By means of the method of moments we obtain via the arithmetic mean Q (C = 1 n l=1 n Q (i (C finally an estimation function for the score Q(C by ( Q (C = 1 n Q (i (C = 1 n n 1 (1 q (i l. (11 n n 9 l l=1
10 This is the main formula for estimating of the score of a composed target structure based on a sample of size n in context of an interrogation. Special cases are again the composed and simple target structures. For single composed target structures B = r A we get according the addition rule for simple target structures as estimation function Q (B = Q ( r A = 1 n n (1 (1 q (i. (12 For simple target structures A 1,..., A r A we get by the product rule for simple target structures as estimation for the score of B = r A Q (B = Q ( A = 1 n n q (i. (13 The score q = Q(A of a single simple target structure A A can be estimated by Q (A = 1 n n q (i. (14 In case of missing values in the sample the missing values for q (i l can be substituted then by the estimation values Q (A l which are obtained based on the incomplete sample. This corresponds a neutral evaluation of missing values in the sample. References [1] E-learning quality, Aspects and criteria for evaluation of e-learning in higher education. Högskoleverket, Swedish National Agency for Higher Education, Report 2008:11 R. [2] Bauer, H. (2001: Measure and Integration Theory. Gruyter - de Gruyter Studies in Mathematics, Berlin. [3] Ehlers, U.-D., Pawlowski, J.M. (2006: Handbook of Quality and Standardisation in E- Learning. Springer Heidelberg. [4] Grif, M., Uranchimeg, T., Tsoi, E.B. (2004: Man Machine Systems Design Methods, KORUS 2004, Proceedings, pp [5] Khan, B.K.(2005: Managing e-learning: Design, delivery, implementation and evaluation. Hershey, PA: Information Science Publishing. [6] Kirkpatrick, D. L. (1998: Evaluating Training Programs. The Four Levels. San Francisco. [7] Stufflebeam, D.L. (2002: The CIPP Model for Evaluation. In: Stufflebeam, D.L., Madaus, G.F., Kellaghan, T.: Evaluation Models. Viewpoints on Educational and Human Services Evaluation. Second Edition, e-book, New York, pp
11 [8] Uranchimeg, T., Batshagai, B. (2010: Research and usage of virtual laboratory in teaching. Proceedings of International Conference of 50th Anniversary of Power Engineering School of MUST, Ulaanbaatar, pp [9] Zaharias, P., Poulymenakou, A. (2009: Developing a usability evaluation method for e-learning applications: beyond functional usability. International Journal of Human- Computer Interaction, Vol. 25 (1, pp
Recall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Elements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION
IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION 1 WHAT IS STATISTICS? Statistics is a science of collecting data, organizing and describing it and drawing conclusions from it. That is, statistics
CITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
Section 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
Similarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
Two classes of ternary codes and their weight distributions
Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight
Section 13.5 Equations of Lines and Planes
Section 13.5 Equations of Lines and Planes Generalizing Linear Equations One of the main aspects of single variable calculus was approximating graphs of functions by lines - specifically, tangent lines.
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
STANDARDISATION OF DATA SET UNDER DIFFERENT MEASUREMENT SCALES. 1 The measurement scales of variables
STANDARDISATION OF DATA SET UNDER DIFFERENT MEASUREMENT SCALES Krzysztof Jajuga 1, Marek Walesiak 1 1 Wroc law University of Economics, Komandorska 118/120, 53-345 Wroc law, Poland Abstract: Standardisation
Solution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
Genetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction
Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since
Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
E3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
α = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
The Advantages and Disadvantages of Online Linear Optimization
LINEAR PROGRAMMING WITH ONLINE LEARNING TATSIANA LEVINA, YURI LEVIN, JEFF MCGILL, AND MIKHAIL NEDIAK SCHOOL OF BUSINESS, QUEEN S UNIVERSITY, 143 UNION ST., KINGSTON, ON, K7L 3N6, CANADA E-MAIL:{TLEVIN,YLEVIN,JMCGILL,MNEDIAK}@BUSINESS.QUEENSU.CA
Practice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
Fuzzy Probability Distributions in Bayesian Analysis
Fuzzy Probability Distributions in Bayesian Analysis Reinhard Viertl and Owat Sunanta Department of Statistics and Probability Theory Vienna University of Technology, Vienna, Austria Corresponding author:
Useful Mathematical Symbols
32 Useful Mathematical Symbols Symbol What it is How it is read How it is used Sample expression + * ddition sign OR Multiplication sign ND plus or times and x Multiplication sign times Sum of a few disjunction
Fixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students
Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent
1.3. DOT PRODUCT 19. 6. If θ is the angle (between 0 and π) between two non-zero vectors u and v,
1.3. DOT PRODUCT 19 1.3 Dot Product 1.3.1 Definitions and Properties The dot product is the first way to multiply two vectors. The definition we will give below may appear arbitrary. But it is not. It
1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
COMBINING THE METHODS OF FORECASTING AND DECISION-MAKING TO OPTIMISE THE FINANCIAL PERFORMANCE OF SMALL ENTERPRISES
COMBINING THE METHODS OF FORECASTING AND DECISION-MAKING TO OPTIMISE THE FINANCIAL PERFORMANCE OF SMALL ENTERPRISES JULIA IGOREVNA LARIONOVA 1 ANNA NIKOLAEVNA TIKHOMIROVA 2 1, 2 The National Nuclear Research
Modeling and Verification of Sampled-Data Hybrid Systems
Modeling and Verification of Sampled-Data Hybrid Systems Abstract B. Izaias Silva and Bruce H. Krogh Dept. of Electrical and Computer Engineering, Carnegie Mellon University (Izaias /krogh)@cmu.edu We
THREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
Statistics in Geophysics: Introduction and Probability Theory
Statistics in Geophysics: Introduction and Steffen Unkel Department of Statistics Ludwig-Maximilians-University Munich, Germany Winter Term 2013/14 1/32 What is Statistics? Introduction Statistics is the
Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
Sample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
Unified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
Note on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
Data Quality Mining: Employing Classifiers for Assuring consistent Datasets
Data Quality Mining: Employing Classifiers for Assuring consistent Datasets Fabian Grüning Carl von Ossietzky Universität Oldenburg, Germany, [email protected] Abstract: Independent
SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
WHEN DOES A CROSS PRODUCT ON R n EXIST?
WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what
4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market
Max-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
About the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
Integer Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 [email protected] March 16, 2011 Abstract We give
3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes
Solving Polynomial Equations 3.3 Introduction Linear and quadratic equations, dealt within Sections 3.1 and 3.2, are members of a class of equations, called polynomial equations. These have the general
Math 215 HW #6 Solutions
Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
TOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
Factoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
Mathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
Lecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
Vilnius University. Faculty of Mathematics and Informatics. Gintautas Bareikis
Vilnius University Faculty of Mathematics and Informatics Gintautas Bareikis CONTENT Chapter 1. SIMPLE AND COMPOUND INTEREST 1.1 Simple interest......................................................................
Core Curriculum to the Course:
Core Curriculum to the Course: Environmental Science Law Economy for Engineering Accounting for Engineering Production System Planning and Analysis Electric Circuits Logic Circuits Methods for Electric
Analysis of Multilayer Neural Networks with Direct and Cross-Forward Connection
Analysis of Multilayer Neural Networks with Direct and Cross-Forward Connection Stanis law P laczek and Bijaya Adhikari Vistula University, Warsaw, Poland [email protected],[email protected]
Lecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
Optimization of Fuzzy Inventory Models under Fuzzy Demand and Fuzzy Lead Time
Tamsui Oxford Journal of Management Sciences, Vol. 0, No. (-6) Optimization of Fuzzy Inventory Models under Fuzzy Demand and Fuzzy Lead Time Chih-Hsun Hsieh (Received September 9, 00; Revised October,
A FUZZY LOGIC APPROACH FOR SALES FORECASTING
A FUZZY LOGIC APPROACH FOR SALES FORECASTING ABSTRACT Sales forecasting proved to be very important in marketing where managers need to learn from historical data. Many methods have become available for
LINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
Minimizing the Number of Machines in a Unit-Time Scheduling Problem
Minimizing the Number of Machines in a Unit-Time Scheduling Problem Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus [email protected] Frank
Single Level Drill Down Interactive Visualization Technique for Descriptive Data Mining Results
, pp.33-40 http://dx.doi.org/10.14257/ijgdc.2014.7.4.04 Single Level Drill Down Interactive Visualization Technique for Descriptive Data Mining Results Muzammil Khan, Fida Hussain and Imran Khan Department
v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.
3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional
Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):
Decision-making with the AHP: Why is the principal eigenvector necessary
European Journal of Operational Research 145 (2003) 85 91 Decision Aiding Decision-making with the AHP: Why is the principal eigenvector necessary Thomas L. Saaty * University of Pittsburgh, Pittsburgh,
How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
Lebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
Math 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
Section 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
Course Syllabus. MATH 1350-Mathematics for Teachers I. Revision Date: 8/15/2016
Course Syllabus MATH 1350-Mathematics for Teachers I Revision Date: 8/15/2016 Catalog Description: This course is intended to build or reinforce a foundation in fundamental mathematics concepts and skills.
Numerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
Analysis of a Production/Inventory System with Multiple Retailers
Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University
1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
SOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
Wavelet analysis. Wavelet requirements. Example signals. Stationary signal 2 Hz + 10 Hz + 20Hz. Zero mean, oscillatory (wave) Fast decay (let)
Wavelet analysis In the case of Fourier series, the orthonormal basis is generated by integral dilation of a single function e jx Every 2π-periodic square-integrable function is generated by a superposition
Graph Classification and Easy Reliability Polynomials
Mathematical Assoc. of America American Mathematical Monthly 121:1 November 18, 2014 1:11 a.m. AMM.tex page 1 Graph Classification and Easy Reliability Polynomials Pablo Romero and Gerardo Rubino Abstract.
NOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
A Novel Binary Particle Swarm Optimization
Proceedings of the 5th Mediterranean Conference on T33- A Novel Binary Particle Swarm Optimization Motaba Ahmadieh Khanesar, Member, IEEE, Mohammad Teshnehlab and Mahdi Aliyari Shoorehdeli K. N. Toosi
1 The Concept of a Mapping
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing
A Little Set Theory (Never Hurt Anybody)
A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra
Lecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
Forecasting methods applied to engineering management
Forecasting methods applied to engineering management Áron Szász-Gábor Abstract. This paper presents arguments for the usefulness of a simple forecasting application package for sustaining operational
CONDITIONAL, PARTIAL AND RANK CORRELATION FOR THE ELLIPTICAL COPULA; DEPENDENCE MODELLING IN UNCERTAINTY ANALYSIS
CONDITIONAL, PARTIAL AND RANK CORRELATION FOR THE ELLIPTICAL COPULA; DEPENDENCE MODELLING IN UNCERTAINTY ANALYSIS D. Kurowicka, R.M. Cooke Delft University of Technology, Mekelweg 4, 68CD Delft, Netherlands
CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
Knowledge Discovery and Data Mining. Structured vs. Non-Structured Data
Knowledge Discovery and Data Mining Unit # 2 1 Structured vs. Non-Structured Data Most business databases contain structured data consisting of well-defined fields with numeric or alphanumeric values.
Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
