Artificial Intelligence. 8. Inductive Logic Programming
|
|
- Αἴσωπος Βιτάλης
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Artificial Intelligence Artificial Intelligence 8. Inductive Logic Programming Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute of Economics and Information Systems & Institute of Computer Science University of Hildesheim Course on Artificial Intelligence, summer term /11 Artificial Intelligence 1. Inductive Logic Programming 2. FOIL 3. Inverse Resolution Course on Artificial Intelligence, summer term /11
2 Artificial Intelligence / 1. Inductive Logic Programming Inductive Logic Programming (ILP) Given some positive examples for a target predicate P, say daughter(mary, ann) daughter(eve, tom) and some negative examples daughter(tom, ann) daughter(eve, ann) as well as some descriptive predicates Q of the entities envolved female(ann) female(eve) parent(ann, mary) parent(tom, eve) find a hypothesis definition / rule of P in terms of Q that 1. covers all the positive examples, 2. does not cover any negative example, and 3. is sufficient general. Course on Artificial Intelligence, summer term /11 Artificial Intelligence / 1. Inductive Logic Programming Trivial Solutions daughter(x, Y ) covers all positive examples, but unfortunately also all negative examples. false covers no negative example, but unfortunately also no positive example. (X = mary Y = ann) (X = eve Y = tom) daughter(x, Y ) covers all positive examples, covers no negative example, but unfortunately does not generalize (new examples will fail). Course on Artificial Intelligence, summer term /11
3 Artificial Intelligence / 1. Inductive Logic Programming Two principal approaches: top-down: generalization of decision trees (FOIL). inverse deduction (inverse resolution). Course on Artificial Intelligence, summer term /11 Artificial Intelligence 1. Inductive Logic Programming 2. FOIL 3. Inverse Resolution Course on Artificial Intelligence, summer term /11
4 FOIL First Order Inductive Learner (FOIL; Quinlan 1990). Idea: iteratively build rules that cover some positive examples, % U U «ŒŽ ƒ ˆ<S Œ@ kœ< 4 s b tš < IR} t kœžœ@ k Š ¹ŝ < Ž i ±Ÿ ŒsŸ O ŒŽ kœ ŒŽ s ŒŽ Lˆ@ k Š,H ŒŽ ±Ÿ ~% Œ> ª ŝ k, Hƒ ŝ k qŝ Œ/ ˆ-,HŒ)ŝ Œ/ ŒŽ ŒŽ k /Œ,H k R qŝ E ªiöŝ k, t k,9 ŒŽ < %MŸ'&Ÿ'&Ÿ4} g Ž k g s b kœžœ ƒ ŝ k Ë ŒŽ Ž kœ R k ŽŒŽ k k s O ŝ Œ0/ ˆ-,H ŒŽ Ž b J s ŒŽ k H Ž kš < ŝ R J s ŒŽ k O J R k ŽŒŽ k k Ÿ ŒŽ ˆ «Œ)Œ0/ ˆ-,H ŒŽ.ŝ kœ) s ŒŽ ŽŒŽ k ŝ k «ŒŽ > ª Ÿ'~% Œ<, ˆq ƒjœg ŒŽ ŒŽ ˆ ŒŽ ) A kœ R k ŽŒŽ k k ƒ ŝ kœž ) A Œg Ž kœž IR} U k /ŝ k kš,h M \Ÿ O J s ŒŽ k L Ž kš < ) $> ª ƒ ŝ k qŝ Œ ˆ-,HŒ4ŝ O Œ ƾºs¼<Á,»³ ; s 2L k, %MŸ'&ŸË R k ŽŒŽ k k A s ' Œ@ Š ŽŒŽ J s ŒŽ k g ˆ t?,t s ' kœž Š ŽŒŽ ŒŽ k k kš σ k Œ 8,HŒŽ ŒŽ ŒŽ < %MŸ'&Ÿ'& ŝ ŒŽ k Ž k ƒjœž / A k,hœ,h kœ> Œ< Æŝ \ ) ŒŽ < BMŸ % ŝ BMŸ ž Ÿ ~% Œ/ ƾºs¼<Á,»³ ) s Œ > ª ŝ k, 2L k, ž Ÿ š ŝ k kš,hœž but no negative ones. Once a rule has been found, remove the positive examples covered and proceed. to build a rule: add literals to the body until no negative example is covered if literals introduce new variables, extend example tuples by all possible constants. Course on Artificial Intelligence, summer term /11 Œ> «ŒŽ kœ R k ŽŒŽ k kœž U kœ< % s Ï ŝ Œ0/ ˆ-,H ŒŽ U Œ> ŝ Š ŝ Œƒ ŝ s i tš < IR} t kœžœ> k ˆ-, Ž ŝš kœž Ž M ŒŒ0/ ŒŽ k ŝ \ƒ ŝ Æ k Š / O R ŒŽ Œ L iŝ L UŒŽ Eŝ L ŒË kœqŝ k Æ FOIL / Algorithm ŒŽŠ k Ž ŝ ; Œ@ ŒŽŠ k Ž LŠ kœž (1/2) ŝ > Œ Ž k ŒŽ k ˆMŸ 7#9 J"= : H J 8 I 9 7#9 J"= `, K `,.0/12/34 >( * `!, ) &% 24.% &24 4 $SV 7Q N( `, Z R? <(;? =A?U b N@, 7 7 N N@ - N X b `, 56#$E= =M;: #$! 6(;E=? 7W 'D? # N@, N ` 240 ( ` `, YZIV4 B\[?- 6=< Ä 7), ^ Y_4E1Y_4ba F, [Lavrac/Dzeroski 1994] Course on Artificial Intelligence, summer term /11
5 U S FOIL / Algorithm (2/2) % U U 7#9 J"= P4 H J 8F;@ I #7: # 7#9 J"= M <( `, M(*?? 6( * `, `, G B\[ /?!"# $&% c 7 " 6?U (' 7 7Q N "<7N'!*) 78(;?U* (; S `!*) ',?U# N X <( S 6 N 6';:< b' > *! 6 Ä - Ä ` S-, (;? #$, /<I % G B\[ / ^ Y_4E1Y_4 *, Ž «ŒŽ k ; Œ kœ< Š ŒŽ }Ÿ ~% Œ ŒŽ )ŒŽ ŒŽ ;ŝ ˆ, s Œ t?, G l l l4g > k@>+ 4ŸA,HŒ s U Œ «sŝ k R ŝƒ G l l l4g 4ƒJŒŽ A Œ m«sŝ k ŝƒ ŒŽ gŝ kœqŝ M Ž ŽŠ k k / 3} 5/.cSG l l l4g-.10(2 34 O Œ% k,hœoŝ kœ Œ< 1/4cSG l l l4g-415 #6 ±Ÿ ŒsŸ IR k Š ŽŒŽ ƒ Œ ŒŽ ŝ ŸE~% Œ kœ< 1 s m Š ŒŽ SE Ž «ŒŽ kœž ƒ H Ž ŝš kœ.3 S O Œ4 kœ< > s k Š.&h : 496 R} Š ŒŽ Æŝ ˆ % s D7.cSG l l l4g.10(2 3 G84cSG l l l4g-415 #6dI FOIL g t 4 O Æ Œ ƒj M / Example SGbU+G l l l4g SG% kš ŒsŸ/ k Š Ž )ˆ/ Œ< G ŝ / kœ< Sgŝ ˈ/ kœ< Ë s 1Œ0/ ŒŽ k Ë s 1 Œ Š ŒŽ ˆ R ˆ» qŝ 4ƒJŒbŒ0/M kœž k kœž g Œ' kœž ˆ ŝ ŝ ŒŽƒ ˆ1 ŒŽ R,H s ƒ ˆ SU U Œ ˆ Š ŝ k s % U Ï O. Œg kœž U ˆ Ž k kœž k H ŒŽ ŝ }Ÿ 1N$NO6!L3h ~Rŝƒ Œž Ÿ šg Š ˆ ŒŽ U Œ> ca+6&3 S1 E:* 580[M 6 N ª G k JŒŽ Ž ŝ ˆ ŝ k, A Œ ¹ˆ-, R ; kœž!s =? N!G c ˆ g k ƒ Œ,T t k, ŒŽ < š Ÿ ž Ÿ.~% ŒH kœqŝ k Æ Æŝ g O S C& 3 S šhl ** Ž ŝš kœ 3 S :* 580[M 6 B6HG >'= 6 N G 7ŸL~% Œ@ ŝ \ qŝ Ï ŝ H kœ<!so Ž Æŝ >ŝ S C& ŝ Œ0/ ˆ-,H ŒŽ Ž >'=WG c U s m O Æ S c6 =?*h ŝ kœo J k «Œ 6 S C& Eŝ U 4 ŒŽ ˆ «Œ S 6 B6HG c &,Ÿ 2U k A ŒŽ ŝ 47 S S c6 =?*h *Ml Bsž 6 > «ŒŽ g k kœë Œ@ Œ< G R C& qŝ \ kœ< 1N$NO6!L3h ca+6&3u E:* 580[M 0U s R Š ŒŽ O Ž «ŒŽ kœž ;ƒ?3u O Æ/ Ž Æŝ % 6 N G c6 =?*h 6 U J k «Œ 0U U =? N!G c & Lŝ Œ@ ŒŽ ˆ «ŒË Š Œ U š,ÿ U 2L. Œ@ kœž Ž C& 3Ü *Ml'/-B ŒŽ ŝ bu ga1 NO6! 6 B6HG >'= 2G %. ŒËƒJ M ) s b Ž ŝš kœ 3U k Š ŽŒŽ Ž U š ŝš kœ 3 > O ˆ qŝ ŝ kœ< 6 B6HG c 1 Ž Æŝ J k «ŒO Š ŒŽ ŽŸ ~%Š Ž ˆ Ž k ŒŽ bu a1 NO6! 2G 47 bu šhl š+1 C& 1N$NO6!L3h ca+6&3 E:* 580[M 6 N G c6 =?*h 6 G7a1 NO6! 2G =? N!G c C& 3 *Ml ** 6 B6HG >'= [Lavrac/Dzeroski 1994] Course on Artificial Intelligence, summer term /11 * ~Rŝƒ Œgž Ÿ š > ª ŝ ŽŒ t 1 Œ ¹ˆ-,H H kœž ˆ k ƒ Œ,/Ÿ Ž ŝš kœ#3 O Æ/ Ž «ŒŽ k H ŒŽ ˆ «Œ> Š ŒŽ 1 % ŒŽ ŒŽ ˆ ŒŽ \Ÿ } ˆ/ J k «ŒH ŒŽ ŝ E O Œ< Œ0/M ŒŽ ŝ OŠ ŝ S ŒŽ «sŝ k ŝƒ ŒŽ g ŝ ŒŽ / Œ.ƒJ M s % Œ Ž ŝš kœs E Œ k Œ ŝ k g s 1 Œ Š ŒŽ 4 Œ [Lavrac/Dzeroski 1994] Course on Artificial Intelligence, summer term /11
6 Ÿ S ž ž FOIL / Example % U U 1N$NO6!L3h ca+6&3 S1 E:* 580[M 6 N G!S =? N!G c S & 6 B6HG >'= S & >'=WG c S ]a1 NO6! 2G 6 B6HG c C& 1N$NO6!L3h ca+6&3u E:* 580[M 6 N G a1 NO6! 2G 0U =? N!G cegt=? N U =? N!G ceg >'= 6 B6HG >'=WG6 B6 6 B6HG >'=WG 4< >'=WG cegt=? N U >'=WG ceg >'= 6 B6HG cegt=? N 6 B6HG ceg >'= ~Rŝƒ Œ ž Ÿ'& ~% ŒAŒ Š ŒŽ O > ª Ÿ ŒŽ < H s Œ< «sŝ k ŝƒ ŒŽ Ë Œ ŽŠ k kœž ŝ ; kœ< s [Lavrac/Dzeroski 1994] ŒŽ S } S ŝ S ŸH UŒ<«ŒŽ Ž R U Œ< «sŝ k ŝƒ ŒŽ ŝ kœ. k Š ŽŒŽ \ Ë qŝ ŝ JŒŽ ˆ S I ŝ &) & S I Ÿ } s > Œ) J k «ŒA Š ŒŽ >ŝ kœ) kœž kœž kœž ŒŽ ƒ Œ).,H kœa ŠIR ŒŽ A S, L Œ M t?, Literal ˆ ŝ ŒŽ Selection ƒ kœž ŒŽ < ŒŽ ŝ 4ˆ-,H Š 47 3 SG3 3 3 S,Ÿ ~% Œ/ ŒŽ ŝ O Œ/ ŒŽ H ŝ kœž ŒŽ < ŒŽ ˆ HŒqŝ Æ ŒŽ \Ÿ 3 SG3 Ë Æŝ t ' UŒŽ ŒŽ M t?, ŝ \ ±Ÿ ŒsŸ ŒË»³ "q¾á,ãhâs ¹ ±¾³ Âs»³ 3 3 S!U¼< Ç ¼ ƒ. Œ ¹ŝ < \ ŒbŒ0/ ˆ-,H Œs Š ˆ ŒŽ > g~rŝƒ Œbž Ÿ š! 3 S h >+8OU U U U šhl **M 3Ü h >+8OU U U S *Ml'/-BM mŝ 3 h >+8OU U U *Ml **MŸ 2L ` S n U & \ UŒ ˆq«Œ 47 S & 3 S i I(c i ) := log 3Ü & *Ml ž& *Ml Bsž ŝ / k P,H ŝ k 47 bu & *Ml'/-B 2 nšhl š+1mÿ i + n i ~% Œ. ŒŽŠ k.ŝ O g t 4Œ('H Ž kš R O Æ kœž k J k ƒ ŒH t Œ/Œ('H Ž ŒŽ < s > ª ŸbªÏŒ< LƒJŒ/ˆ J k «Œ ŒŽ ŝ U O S,Ÿ, ˆq Ž Æŝ Œ< «sŝ k ŝƒ ŒŽ ŝ kœ R ŝ ŽŒ,HŒŽ O «sŝ k ŝƒ ŒŽ > qŝ Œ<«ŒŽ Ž kœqŝ kœ Ÿ / kœž «ŒŽ Ž kš Æ kœž ŝ ŽŒ,HŒŽ qŝ ˆ ƒjœž k Š ŽŒ  kœ< S> Ž Æŝ A Š ŒŽ Ž Course on Artificial Intelligence, summer term /11 Let n i be the number of positive examples in step i, n i be the number of negative examples in step i. information: If the new literal does not introduce new variables, n i+1 n i and n i+1 n i. But if new variables are introduced, this may not hold anymore. Denote by n i at least one tuple in E i+1. weighted information gain: the number of positive tuples in E i represented by WIG(L i, c i ) := WIG(c i+1, c i ) := n i (I(c i ) I(c i+1 )) Select the literal with the highest weighted information gain. Course on Artificial Intelligence, summer term /11
7 Artificial Intelligence 1. Inductive Logic Programming 2. FOIL 3. Inverse Resolution Course on Artificial Intelligence, summer term /11 Artificial Intelligence / 3. Inverse Resolution Resolution: Given clauses C 1 and C 2, infer resolvent C. C 1 := C 1 {R}, C 2 := C 2 { R }, Rθ = R θ C := C 1θ C 2θ Inverse resolution: Given resolvent C and clause C 1, infer clause C 2. C 1 := {R} C 2 := { R } C, R θ = Rθ, C θ = Cθ Parent(x,z) > Parent(z,y) > Grandparent(x,y) Parent(George,Elizabeth) {x/george, z/elizabeth} Parent(Elizabeth,y) > Grandparent(George,y) Parent(Elizabeth,Anne) {y/anne} Grandparent(George,Anne) Grandparent(George,Anne) Course on Artificial Intelligence, summer term /11
8 Artificial Intelligence / 3. Inverse Resolution Inverse resolution is a search, as there may be many pairs of clauses leading to resolvent C: Parent(Elizabeth, Anne) Grandparent(George, Anne) Parent(z, Anne) Grandparent(George, Anne) Parent(z, y) Grandparent(George, y)... Many techniques available for narrowing search space: eliminate redundancies, e.g., by generating only the most specific hypothesis. restrict proof strategy, e.g., to linear proofs. restrict representation language, e.g., to Horn clauses. use different inference method, e.g., model checking or ground propositional clauses. Course on Artificial Intelligence, summer term /11
Z L L L N b d g 5 * " # $ % $ ' $ % % % ) * + *, - %. / / + 3 / / / / + * 4 / / 1 " 5 % / 6, 7 # * $ 8 2. / / % 1 9 ; < ; = ; ; >? 8 3 " #
Z L L L N b d g 5 * " # $ % $ ' $ % % % ) * + *, - %. / 0 1 2 / + 3 / / 1 2 3 / / + * 4 / / 1 " 5 % / 6, 7 # * $ 8 2. / / % 1 9 ; < ; = ; ; >? 8 3 " # $ % $ ' $ % ) * % @ + * 1 A B C D E D F 9 O O D H
Διαβάστε περισσότερα! " # $ % & $ % & $ & # " ' $ ( $ ) * ) * +, -. / # $ $ ( $ " $ $ $ % $ $ ' ƒ " " ' %. " 0 1 2 3 4 5 6 7 8 9 : ; ; < = : ; > : 0? @ 8? 4 A 1 4 B 3 C 8? D C B? E F 4 5 8 3 G @ H I@ A 1 4 D G 8 5 1 @ J C
Διαβάστε περισσότερα) * +, -. + / - 0 1 2 3 4 5 6 7 8 9 6 : ; < 8 = 8 9 >? @ A 4 5 6 7 8 9 6 ; = B? @ : C B B D 9 E : F 9 C 6 < G 8 B A F A > < C 6 < B H 8 9 I 8 9 E ) * +, -. + / J - 0 1 2 3 J K 3 L M N L O / 1 L 3 O 2,
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότερα2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.
EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραLes gouttes enrobées
Les gouttes enrobées Pascale Aussillous To cite this version: Pascale Aussillous. Les gouttes enrobées. Fluid Dynamics. Université Pierre et Marie Curie - Paris VI,. French. HAL Id: tel-363 https://tel.archives-ouvertes.fr/tel-363
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ. ΕΠΛ342: Βάσεις Δεδομένων. Χειμερινό Εξάμηνο Φροντιστήριο 10 ΛΥΣΕΙΣ. Επερωτήσεις SQL
ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ ΕΠΛ342: Βάσεις Δεδομένων Χειμερινό Εξάμηνο 2013 Φροντιστήριο 10 ΛΥΣΕΙΣ Επερωτήσεις SQL Άσκηση 1 Για το ακόλουθο σχήμα Suppliers(sid, sname, address) Parts(pid, pname,
Διαβάστε περισσότεραNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Διαβάστε περισσότεραMain source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραÓ³ Ÿ , º 2(214).. 171Ä176. Š Œ œ ƒˆˆ ˆ ˆŠ
Ó³ Ÿ. 218.. 15, º 2(214).. 171Ä176 Š Œ œ ƒˆˆ ˆ ˆŠ ˆ ˆ ˆ Š Š Œ Œ Ÿ ˆ Š ˆ Š ˆ ˆŠ Œ œ ˆ.. Š Ö,, 1,.. ˆ μ,,.. μ³ μ,.. ÉÓÖ μ,,.š. ʳÖ,, Í μ ²Ó Ò ² μ É ²Ó ± Ö Ò Ê É É Œˆ ˆ, Œμ ± Ñ Ò É ÉÊÉ Ö ÒÌ ² μ, Ê μ ± Ê É
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραÓ³ Ÿ , º 4Ä5(174Ä175).. 682Ä688 ˆ ˆŠ ˆ ˆŠ Š ˆ
Ó³ Ÿ. 2012.. 9, º 4Ä5(174Ä175).. 682Ä688 ˆ ˆŠ ˆ ˆŠ Š ˆ ˆ œ ˆŸ FlexCtrl SCADA Ÿ Œ ˆ ˆˆ Š ˆ.. ± Ëμ μ 1,.. ² ±μ, Š.. ÒÎß, ˆ.. μ,.. ʱ Ï ±μ Ñ Ò É ÉÊÉ Ö ÒÌ ² μ, Ê É ÉÓ μ Ò É Ö μ ³³ Ö Î ÉÓ Éμ³ É Í Ê ±μ É ² ²
Διαβάστε περισσότεραDémographie spatiale/spatial Demography
ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΙΑΣ Démographie spatiale/spatial Demography Session 1: Introduction to spatial demography Basic concepts Michail Agorastakis Department of Planning & Regional Development Άδειες Χρήσης
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραP ƒ.. Š ³ÒÏ,.. Š ³ÒÏ,.. ± ˆ ŒˆŠˆ Š ˆŠ
P9-2008-53 ƒ.. Š ³ÒÏ,.. Š ³ÒÏ,.. ± ˆ ŒˆŠˆ Š ˆŠ ˆ Œ MATLAB Š ³ÒÏ ƒ.., Š ³ÒÏ.., ±.. P9-2008-53 Î ÉÒ ³ ± Êα Í ±²μÉ μ Ì É ³ MATLAB É ÉÓ μ± μ ³μ μ ÉÓ ³ Ö Œ LAB ²Ö ÊÎ ÒÌ Î - Éμ Ë ± Ê ±μ É ², Î É μ É ²Ö μ Ö
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότεραEditorís Talk. Advisor. Editorial team. Thank
1 Editorís Talk ❶ ⓿ ⓿ ❹ 2 ⓿ ❶ ❶ ⓿ ⓿ ❶ ⓿ ⓿ ❶ ❹ ⓿ ⓿ ⓿ ❶ ⓿ ⓿ ❹ ⓿ ⓿ ⓿ ❽ ❾ & & ❽ ❾ ❽ ❾ ❼ Advisor Editorial team & & & Thank & & ⓿ ❶ ❶ ❶ ❶ ❶ ⓿ ⓿ ❶ ❶ ⓿ ❹ ❶ ❶ ⓿ ❶ ⓿ ❶ ⓿ ⓿ ❶ ❶ ⓿ ⓿ ❶ ⓿ ⓿ ❶ ❶ ⓿ ⓿ ❶ ⓿ ⓿ ⓿ ❶ ⓿ ❶ ❶
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραΑλγόριθμοι και πολυπλοκότητα NP-Completeness (2)
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραtel , version 1-21 Mar 2013
! "#! $"%" &'()* +*,-./-01/ 2 3 45 467 68 9:; 6?87 @ 6 =
Διαβάστε περισσότεραω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Διαβάστε περισσότεραBayesian statistics. DS GA 1002 Probability and Statistics for Data Science.
Bayesian statistics DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Frequentist vs Bayesian statistics In frequentist
Διαβάστε περισσότεραΣυστήματα Διαχείρισης Βάσεων Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 9: Transactions - part 1 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on Undo, Redo and Undo/Redo
Διαβάστε περισσότεραΠανεπιστήμιο Δυτικής Μακεδονίας. Τμήμα Μηχανικών Πληροφορικής & Τηλεπικοινωνιών. Ηλεκτρονική Υγεία
Τμήμα Μηχανικών Πληροφορικής & Τηλεπικοινωνιών Ηλεκτρονική Υγεία Ενότητα: Use Case - an example of ereferral workflow Αν. καθηγητής Αγγελίδης Παντελής e-mail: paggelidis@uowm.gr Τμήμα Μηχανικών Πληροφορικής
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραΠρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής
Πρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής Να γραφεί πρόγραμμα το οποίο δέχεται ως είσοδο μια ακολουθία S από n (n 40) ακέραιους αριθμούς και επιστρέφει ως έξοδο δύο ακολουθίες από θετικούς ακέραιους
Διαβάστε περισσότεραZZ (*) 4l. H γ γ. Covered by LEP GeV
: 33 9! " 5< 687 235 # #) " " &( $ # $!" K I K T S R N \ N \ ] N ^ K V 63 7 "" ` 2 9 a C C E D # C B A @ " "? > H N OQP N M Y WX U V H O ( N O_P b i h i h h 63 7 "" ` C C E D # C B A @ " "? > b d e f f
Διαβάστε περισσότεραIf we restrict the domain of y = sin x to [ π, π ], the restrict function. y = sin x, π 2 x π 2
Chapter 3. Analytic Trigonometry 3.1 The inverse sine, cosine, and tangent functions 1. Review: Inverse function (1) f 1 (f(x)) = x for every x in the domain of f and f(f 1 (x)) = x for every x in the
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραGalatia SIL Keyboard Information
Galatia SIL Keyboard Information Keyboard ssignments The main purpose of the keyboards is to provide a wide range of keying options, so many characters can be entered in multiple ways. If you are typing
Διαβάστε περισσότεραProving with Computer Assistance Lecture 2. Herman Geuvers
Proving with Computer Assistance Lecture 2 Herman Geuvers 1 Typed λ calculus as the basis for a Proof Assistant (e.g. Coq) λ-term program proof type specification formula Integrated system for proving
Διαβάστε περισσότεραIf we restrict the domain of y = sin x to [ π 2, π 2
Chapter 3. Analytic Trigonometry 3.1 The inverse sine, cosine, and tangent functions 1. Review: Inverse function (1) f 1 (f(x)) = x for every x in the domain of f and f(f 1 (x)) = x for every x in the
Διαβάστε περισσότεραElements of Information Theory
Elements of Information Theory Model of Digital Communications System A Logarithmic Measure for Information Mutual Information Units of Information Self-Information News... Example Information Measure
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραFrom the finite to the transfinite: Λµ-terms and streams
From the finite to the transfinite: Λµ-terms and streams WIR 2014 Fanny He f.he@bath.ac.uk Alexis Saurin alexis.saurin@pps.univ-paris-diderot.fr 12 July 2014 The Λµ-calculus Syntax of Λµ t ::= x λx.t (t)u
Διαβάστε περισσότερα( y) Partial Differential Equations
Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate
Διαβάστε περισσότεραTMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Διαβάστε περισσότεραΑΛΓΟΡΙΘΜΟΙ Άνοιξη I. ΜΗΛΗΣ
ΑΛΓΟΡΙΘΜΟΙ http://eclass.aueb.gr/courses/inf6/ Άνοιξη 06 - I. ΜΗΛΗΣ P NP και NP-complete προβλήματα (Κλάσεις Πολυπλοκότητας) ΑΛΓΟΡΙΘΜΟΙ - ΑΝΟΙΞΗ 06 - Ι. ΜΗΛΗΣ 5 NP-COMPLETENESS I Γιατί για πολλά προβλήματα
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραΟδηγίες Αγοράς Ηλεκτρονικού Βιβλίου Instructions for Buying an ebook
Οδηγίες Αγοράς Ηλεκτρονικού Βιβλίου Instructions for Buying an ebook Βήμα 1: Step 1: Βρείτε το βιβλίο που θα θέλατε να αγοράσετε και πατήστε Add to Cart, για να το προσθέσετε στο καλάθι σας. Αυτόματα θα
Διαβάστε περισσότεραRight Rear Door. Let's now finish the door hinge saga with the right rear door
Right Rear Door Let's now finish the door hinge saga with the right rear door You may have been already guessed my steps, so there is not much to describe in detail. Old upper one file:///c /Documents
Διαβάστε περισσότερα"!$#&%('*),+.- /,0 +/.1),032 #4)5/ /.0 )80/ 9,: A B C <ED<8;=F >.<,G H I JD<8KA C B <=L&F8>.< >.: M <8G H I
"!$#&%('*),+.- /,0 +/.1),032 #4)5/.-076 4/.0 )80/ 9,: ;=@?4: A B C
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραChapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραSequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008
Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical
Διαβάστε περισσότεραES440/ES911: CFD. Chapter 5. Solution of Linear Equation Systems
ES440/ES911: CFD Chapter 5. Solution of Linear Equation Systems Dr Yongmann M. Chung http://www.eng.warwick.ac.uk/staff/ymc/es440.html Y.M.Chung@warwick.ac.uk School of Engineering & Centre for Scientific
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max
Διαβάστε περισσότεραPilloras, Panagiotis. Neapolis University. þÿ À¹ÃÄ ¼Î½, ±½µÀ¹ÃÄ ¼¹ µ À»¹Â Æ Å
Neapolis University HEPHAESTUS Repository School of Law and Social Sciences http://hephaestus.nup.ac.cy Master Degree Thesis 2015 þÿ ± µã¼¹º ÌÁ³±½± Ä Â ÅÁÉÀ± Pilloras, Panagiotis þÿ Á̳Á±¼¼± ¹µ ½  º±¹
Διαβάστε περισσότεραP Ò±,. Ï ± ˆ ˆŒˆ Š ƒ ˆŸ. Œ ƒ Œ ˆˆ γ-š Œˆ ƒ ƒˆ 23 ŒÔ. ² μ Ê ². Í μ ²Ó Ò Í É Ö ÒÌ ² μ, É μí±, μ²óï
P15-2012-75.. Ò±,. Ï ± ˆ Œ ˆŸ ˆ, š Œ ˆ ˆŒˆ Š ƒ ˆŸ ˆ ˆ, Œ ƒ Œ ˆˆ γ-š Œˆ ƒ ƒˆ 23 ŒÔ ² μ Ê ² Í μ ²Ó Ò Í É Ö ÒÌ ² μ, É μí±, μ²óï Ò±.., Ï ±. P15-2012-75 ˆ ³ Ö μ Ì μ É, μ Ñ ³ ÒÌ μ É Ì ³ Î ±μ μ μ É μ Íμ Ö ÕÐ
Διαβάστε περισσότεραP Œ ²μ, Œ.. ƒê Éμ,. ƒ. ²μ,.. μ. ˆ ˆŸ Œˆ ˆŸ ˆ Š Œ ˆŸ Ÿ - ˆ ˆ ŠˆŒˆ Œ Œˆ ˆ œ ˆ Œ ˆ ŒˆŠ Œ -25
P6-2011-64.. Œ ²μ, Œ.. ƒê Éμ,. ƒ. ²μ,.. μ ˆ ˆŸ Œˆ ˆŸ ˆ Š Œ ˆŸ Ÿ - ˆ ˆ ŠˆŒˆ Œ Œˆ ˆ œ ˆ Œ ˆ ŒˆŠ Œ -25 Œ ²μ... P6-2011-64 ² μ Ö ²Õ³ Ö ± ³ Ö μ Í Ì μ Ò Ö μ-ë Î ± ³ ³ Éμ ³ μ²ó μ ³ ³ ± μé μ Œ -25 μ³μðóõ Ö μ-ë
Διαβάστε περισσότεραAbout these lecture notes. Simply Typed λ-calculus. Types
About these lecture notes Simply Typed λ-calculus Akim Demaille akim@lrde.epita.fr EPITA École Pour l Informatique et les Techniques Avancées Many of these slides are largely inspired from Andrew D. Ker
Διαβάστε περισσότεραAbstract Storage Devices
Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD
Διαβάστε περισσότεραˆ Œ ˆŸ Š ˆˆ ƒ Šˆ ƒ ƒ ˆ Šˆ ˆ ˆ Œ ˆ
Ó³ Ÿ. 2007.. 4, º 5(141).. 719Ä730 ˆ ˆ ƒˆÿ, Š ƒˆÿ ˆ Ÿ Ÿ Œ ˆ ˆ ˆ Œ ˆŸ Š ˆˆ ƒ Šˆ ƒ ƒ ˆ Šˆ ˆ ˆ Œ ˆ Š Œ Œ ˆ.. Š Öαμ,. ˆ. ÕÉÕ ±μ,.. ²Ö Ñ Ò É ÉÊÉ Ö ÒÌ ² μ, Ê μ ÖÉ Ö Ê²ÓÉ ÉÒ μéò μ ³ Õ ±μ Í É Í CO 2 O 2 ϲ μì
Διαβάστε περισσότεραAn Inventory of Continuous Distributions
Appendi A An Inventory of Continuous Distributions A.1 Introduction The incomplete gamma function is given by Also, define Γ(α; ) = 1 with = G(α; ) = Z 0 Z 0 Z t α 1 e t dt, α > 0, >0 t α 1 e t dt, α >
Διαβάστε περισσότερα1) Formulation of the Problem as a Linear Programming Model
1) Formulation of the Problem as a Linear Programming Model Let xi = the amount of money invested in each of the potential investments in, where (i=1,2, ) x1 = the amount of money invested in Savings Account
Διαβάστε περισσότεραˆ ˆŠ Œ ˆ ˆ Œ ƒ Ÿ Ä Œμ Ìμ. ±É- É Ê ± μ Ê É Ò Ê É É, ±É- É Ê, μ Ö
ˆ ˆŠ Œ ˆ ˆ Œ ƒ Ÿ 2017.. 48.. 5.. 740Ä744 ˆ Œˆ ƒ Š Œ ˆ Œˆ ˆŸ ˆ ˆ ˆŸ ˆˆ ƒ ˆ Šˆ ˆ.. Œμ Ìμ ±É- É Ê ± μ Ê É Ò Ê É É, ±É- É Ê, μ Ö ±μ³ ² ± ÒÌ ³μ ʲÖÌ Ð É Ò³ ² ³ Š² ËËμ Î É μ - ³ μ É Ò Ë ³ μ Ò ³ Ò Å ²μ ÉÉ. Ì
Διαβάστε περισσότεραΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ. Ψηφιακή Οικονομία. Διάλεξη 9η: Basics of Game Theory Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Ψηφιακή Οικονομία Διάλεξη 9η: Basics of Game Theory Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών Course Outline Part II: Mathematical Tools Firms - Basics of Industrial
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότεραƒê,.. ± É,.. Ëμ μ. ˆŸ Œ ƒ ˆ ƒ Ÿ ˆ ˆˆ ˆ ˆ ˆ Šˆ- ˆŒŒ ˆ ƒ Œ ƒ ˆ. ² μ Ê ² ² ±É Î É μ
13-2009-159.. ƒê,.. ± É,.. Ëμ μ Š ˆŒ œ ˆ ˆ ˆŸ Œ ƒ ˆ ƒ Ÿ ˆ ˆˆ ˆ ˆ ˆ Šˆ- ˆŒŒ ˆ ƒ Œ ƒ ˆ ² μ Ê ² ² ±É Î É μ ƒê.., ± É.., Ëμ μ.. 13-2009-159 ± ³ É ²Ó μ ² μ Ê ² Î Ö ³ É μ μ μ²ö Ð Í ² Î ± - ³³ É Î μ μ ³ É μ ³
Διαβάστε περισσότερα