Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur"

Transcription

1 Module LOSSLESS IMAGE COMPRESSION SYSTEMS

2 Lesson 3 Lossless Compresson: Huffman Codng

3 Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy.. State Shannon s Codng theorem for noseless channels. 3. Measure the codng effcency of an encodng scheme. 4. State the basc prncples of Huffman codng. 5. Assgn Huffman codes to a set of symbols of known probabltes. 6. Encode a strng of symbols nto a Huffman coded bt stream. 7. Decode a Huffman coded bt stream. 3.0 Introducton In lesson-, we have learnt the basc dfference between lossless and lossy mage compresson schemes. There are some applcatons, such as satellte mage analyss, medcal and busness document archval, medcal mages for dagnoss etc, where loss may not be tolerable and lossless compresson technques are to be used. Some of the popular lossless mage compresson technques beng used are (a) Huffman codng, (b) Arthmetc codng, (c) Zv- Lempel codng, (d) Bt-plane codng, (e) Run-length codng etc. In ths lesson, we frst begn wth the nformaton-theoretc bass of lossless codng, see how to measure the nformaton content of a set of source symbols based on the probabltes of the symbols. We shall thereafter present Shannon s thorem whch provdes the theoretcal lower bound of bt-rate achevable through lossless compresson technques. The rest of the lesson s devoted to the detaled treatment of Huffman codng, whch s one of the most popular lossless compresson technques adopted n multmeda standards. 3. Source entropy- a measure of nformaton content Generaton of nformaton s generally modeled as a random process that has probablty assocated wth t. If P(E) s the probablty of an event, ts nformaton content I(E), also known as self nformaton s measured as I ( E) = log..(3.) P ( E) If P(E)=, that s, the event always occurs (lke sayng The sun rses n the east ), then we obtan from above that I(E)=0, whch means that there s no nformaton assocated wth t. The base of the logarthm expresses the unt of nformaton and f the base s, the unt s bts. For other values m of the base,

4 the nformaton s expressed as m-ary unts. Unless otherwse mentoned, we shall be usng the base- system to measure nformaton content. a =,,..., n havng Now, suppose that we have an alphabet of n symbols { } probabltes of occurrences P ( a ) P( a ),..., P( ), a n. If k s the number of source outputs generated, whch s consdered to be suffcently large, then the average number of occurrences of symbol a s kp ( a ) and the average self-nformaton obtaned from k outputs s gven by k n = P ( a ) log P( a ) and the average nformaton per source output for the source z s gven by H n ( z ) = P( a ) log P( a ) = (3.) The above quantty s defned as the entropy of the source and measures the uncertanty of the source. The relatonshp between uncertanty and entropy can be llustrated by a smple example of two symbols a and a, havng probabltes and P respectvely. Snce, the summaton of probabltes s equal to, P ( a ) ( a ) P ( a ) P( a = ) and usng equaton (3.), we obtan H ( z ) = P( a ) log P( a ) ( P( a )) log( P( a )) (3.3) If we plot H(z) versus P( a ), we obtan the graph shown n Fg.3..

5 It s nterestng to note that the entropy s equal to zero for P(a )=0 and P(a )=. These correspond to the cases where at least one of the two symbols s certan to be present. H(z) assumes maxmum value of -bt for P(a )=/. Ths corresponds to the most uncertan case, where both the symbols are equally probable. 3.. Example: Measurement of source entropy If the probabltes of the source symbols are known, the source entropy can be measured usng equaton (3.). Say, we have fve symbols a, a,..., a5 havng the followng probabltes: P ( a ) = 0., P( a ) = 0., P( a3 ) = 0.05, P( a4 ) = 0.6, P( a5 ) = Usng equaton (3.), the source entropy s gven by H ( z) = 0.log 0. 0.log log log log bts =.67 bts 3. Shannon s Codng Theorem for noseless channels We are now gong to present a very mportant theorem by Shannon, whch expresses the lower lmt of the average code word length of a source n terms of ts entropy. Stated formally, the theorem states that n any codng scheme, the average code word length of a source of symbols can at best be equal to the source entropy and can never be less than t. The above theorem assumes the codng to be lossless and the channel to be noseless.

6 If m(z) s the mnmum of the average code word length obtaned out of dfferent unquely decpherable codng schemes, then as per Shannon s theorem, we can state that ( z) H ( z) m.. (3.4) 3.3 Codng effcency The codng effcency (η) of an encodng scheme s expressed as the rato of the source entropy H(z) to the average code word length L(z) and s gven by η = H L ( z) ( z)..(3.5) ( ) ( ) Snce L z H z H(z) are postve, accordng to Shannon s Codng theorem and both L(z) and 0 η...(3.6) 3.4 Basc prncples of Huffman Codng Huffman codng s a popular lossless Varable Length Codng (VLC) (Secton-.4.3) scheme, based on the followng prncples: (a) Shorter code words are assgned to more probable symbols and longer code words are assgned to less probable symbols. (b) No code word of a symbol s a prefx of another code word. Ths makes Huffman codng unquely decodable. (c) Every source symbol must have a unque code word assgned to t. In mage compresson systems (Secton-.4), Huffman codng s performed on the quantzed symbols. Qute often, Huffman codng s used n conjuncton wth other lossless codng schemes, such as run-length codng, to be dscussed n lesson-4. In terms of Shannon s noseless codng theorem, Huffman codng s optmal for a fxed alphabet sze, subject to the constrant that that the source symbols are coded one at a tme.

7 3.5 Assgnng Bnary Huffman codes to a set of symbols We shall now dscuss how Huffman codes are assgned to a set of source symbols of known probablty. If the probabltes are not known a pror, t should be estmated from a suffcently large set of samples. The code assgnment s based on a seres of source reductons and we shall llustrate ths wth reference to the example shown n Secton-3... The steps are as follows: Step-: Arrange the symbols n the decreasng order of ther probabltes. Symbol Probablty a a 0. a 0. a a Step-: Combne the lowest probablty symbols nto a sngle compound symbol that replaces them n the next source reducton. Symbol Probablty a 4 P(a 4 )=0.6 a P(a )=0. a P(a )= 0. a 3 V a 5 P(a 3 )+P(a 5 )=0. In ths example, a 3 and a 5 are combned nto a compound symbol of probablty 0.. Step-3: Contnue the source reductons of Step-, untl we are left wth only two symbols. Symbol Probablty a 4 P(a 4 )=0.6 a P(a )=0. a V ( a 3 V a 5 ) P(a )+P(a 3 )+P(a 5 )=0. Symbol Probablty a 4 P(a 4 )=0.6 a V ( a V ( a 3 V a 5 )) P(a )+P(a )+P(a 3 )+P(a 5 )=0.4 The second symbol n ths table ndcates a compound symbol of probablty 0.4. We are now n a poston to assgn codes to the symbols.

8 Step-4: Assgn codes 0 and to the last two symbols. Symbol Probablty Assgned Code a a 0. 0 a 0. 0 a 3 V a 5 0. In ths case, 0 s assgned to the symbol a 4 and s assgned to the compound symbol a V ( a V ( a 3 Va 5 )). All the elements wthn ths compound symbol wll therefore have a prefx. Step-5: Work backwards along the table to assgn the codes to the elements of the compound symbols. Contnue tll codes are assgned to all the elementary symbols. Symbol Probablty Assgned Code a a V ( a V( a 3 Va 5 )) 0.4 s therefore gong to be the prefx of a, a 3 and a 5, snce ths s the code assgned to the compound symbol of these three. Ths completes the Huffman code assgnment pertanng to ths example. From ths table, t s evdent that shortest code word (length=) s assgned to the most probable symbol a 4 and the longest code words (length=4) are assgned to the two least probable symbols a 3 and a 5. Also, each symbol has a unque code and no code word s a prefx of code word for another symbol. The codng has therefore fulflled the basc requrements of Huffman codng, stated n Secton Symbol Probablty Assgned Code a a 0. 0 a V( a 3 Va 5 ) 0. For ths example, we can compute the average code word length. If L(a ) s the codeword length of symbol a, then the average codeword length s gven by Symbol Probablty Assgned Code a a 0. 0 a 0. 0 a a

9 n ( ) L( a ) P( a ) L z = = = =.7 bts The codng effcency s gven by ( z) ( ) = = H η L z Encodng a strng of symbols usng Huffman codes After obtanng the Huffman codes for each symbol, t s easy to construct the encoded bt stream for a strng of symbols. For example, f we have to encode a strng of symbols a 4a3a5a4aa4a, we shall start from the left, takng one symbol at a tme. The code correspondng to the frst symbol a 4 s 0, the second symbol a 3 has a code 0 and so on. Proceedng as above, we obtan the encoded bt stream as In ths example, 6 bts were used to encode the strng of 7 symbols. A straght bnary encodng of 7 symbols, chosen from an alphabet of 5 symbols would have requred bts (3 bts/symbol) and ths encodng scheme therefore demonstrates substantal compresson. 3.7 Decodng a Huffman coded bt stream Snce no codeword s a prefx of another codeword, Huffman codes are unquely decodable. The decodng process s straghtforward and can be summarzed below: Step-: Examne the leftmost bt n the bt stream. If ths corresponds to the codeword of an elementary symbol, add that symbol to the lst of decoded symbols, remove the examned bt from the bt stream and go back to step- untl all the bts n the bt stream are consdered. Else, follow step-. Step-: Append the next bt from the left to the already examned bt(s) and examne f the group of bts correspond to the codeword of an elementary symbol. If yes, add that symbol to the lst of decoded symbols, remove the examned bts from the bt stream and go back to step- untl all the bts n the bt stream are consdered. Else, repeat step- by appendng more bts.

10 In the encoded bt stream example of Secton-3.6, f we receve the bt stream and follow the steps descrbed above, we shall frst decode a 4 ( 0 ), then a 3 ( 0 ), followed by a 5 ( ), a 4 ( 0 ),a ( 0 ), a 4 ( 0 ) and a ( 0 ). Ths s exactly what we had encoded. 3.8 Dscussons and Further Readng In ths lesson, we have dscussed Huffman Codng, whch s one of the very popular lossless Varable Length Codng (VLC) schemes, named after the scentst who proposed t. The detals of the codng scheme can be read from hs orgnal paper, lsted n []. For a better understandng of the codng theory n the lght of Shannon s theorem, the reader s referred to Shannon s orgnal paper, lsted n []. We have dscussed how Huffman codes can be constructed from the probabltes of the symbols. The symbol probabltes can be obtaned by makng a relatve frequency of occurrences of the symbols and these essentally make a frst order estmate of the source entropy. Better source entropy estmates can be obtaned f we examne the relatve frequency of occurrences of a group of symbols, say by consderng two consecutve symbols at a tme. Wth reference to mages, we can form pars of gray level values, consderng two consecutve pxels at a tme and thus form a second order estmate of the source entropy. In ths case, Huffman codes wll be assgned to the par of symbols, nstead of ndvdual symbols. Although thrd, fourth and even hgher order estmates would make better approxmatons of the source entropy, the convergence wll be slow and excessve computatons are nvolved. We have also seen that Huffman codng assgnment s based on successve source reductons. For an n-symbol source, (n-) source reductons must be performed. When n s large, lke n the case of gray level values of the mages for whch n=56, we requre 54 steps of reducton, whch s excessvely hgh. In such cases, Huffman codng s done only for few symbols of hgher probablty and for the remanng, a sutable prefx code, followed by a fxed length code s adopted. Ths scheme s referred to as truncated Huffman codng. It s somewhat less optmal as compared to Huffman Codng, but code assgnment s much easer. There are other varants of Huffman Codng. In one of the varants, the source symbols, arranged n order of decreasng probabltes are dvded nto a few blocks. Specal shft up and/or shft down symbols are used to dentfy each block and symbols wthn the block are assgned Huffman codes. Ths encodng scheme s referred to as Shft Huffman Codng. The shft symbol s the most probable symbol and s assgned the shortest code word. Interested readers may refer to [3] for further dscussons on Huffman Codng varants.

11 Questons NOTE: The students are advsed to thoroughly read ths lesson frst and then answer the followng questons. Only after attemptng all the questons, they should clck to the soluton button and verfy ther answers. PART-A A.. Defne the entropy of a source of symbols. A.. How s entropy related to uncertanty? A.3. State Shannon s codng theorem on noseless channels. A.4. Defne the codng effcency of an encodng scheme. A.5. State the basc prncples of Huffman codng. PART-B: Multple Choce In the followng questons, clck the best out of the four choces. B. The entropy of a source of symbols s dependent upon (A) The number of source outputs generated. (B) The average codeword length. (C) The probabltes of the source symbols. (D) The order n whch the source outputs are generated. B. We have two sources of symbols to compare ther entropes. Source- has three symbols a,a and a 3 wth probabltes P ( a ) = 0.9, P( a ) = P( a3 ) = Source- also has three symbols a,a and a 3, but wth probabltes P a =.4, P a = P a 0. ( ) ( ) ( ) = (A) Entropy of source- s hgher than that of source-. (B) Entropy of source- s lower than that of source-. (C) Entropy of source- and source- are the same. (D) It s not possble to compute the entropes from the gven data.

12 B.3 Shannon s codng theorem on noseless channels provdes us wth (A) A lower bound on the average codeword length. (B) An upper bound on the average codeword length (C) A lower bound on the source entropy. (D) An upper bound on the source entropy. B.4 Whch one of the followng s not true for Huffman codng? (A) No codeword of an elementary symbol s a prefx of another elementary symbol. (B) Each symbol has a one-to-one mappng wth ts correspondng codeword. (C) The symbols are encoded as a group, rather than encodng one symbol at a tme. (D) Shorter code words are assgned to more probable symbols. B.5 A source of 4 symbols a, a, a a havng probabltes ( a ) =.5, P( a ) = 0.5, P( a ) = P( a ) = 3, P are encoded by four dfferent encodng schemes and the correspondng codes are shown below. Whch of the followng gves us the best codng effcency? (A) a = 00, a = 0, a3 = 0, a4 = (B) a =, a = 0, a = 0, a = (C) a = 00, a = 00, a3 = 00, a4 = 0 (D) a =, a = 0, a3 = 0, a4 = 0 4 B.6 Whch of the followng must be ensured before assgnng bnary Huffman codes to a set of symbols? (A) The channel s noseless. (B) There must be exactly n symbols to encode. (C) No two symbols should have the same probablty. (D) The probabltes of the symbols should be known a pror.

13 B.7 Refer to the Huffman code words assgned to fve symbols a, a,..., a5 n the example shown n Secton-3.5.The bt stream assgned to the sequence of symbols a a a a a a a a a a s a4 (A) (B) (C) (D) B.8 A 4-symbol alphabet has the followng probabltes P a =., P a = 0.5, P a = 0.5, P a 0. and followng codes are assgned ( ) ( ) ( ) ( ) = a = 0, a = 0, a3 = 0, a4 = to the symbols. The average code word length for ths source s (A).5 (B).5 (C).75 (D).0 B.9 Decode a Huffman encoded bt stream whch follows the codes assgnment of the above problem. The sequence of symbols s (A) (C) a3aa3aa3aaa a (B) a3aaa4a3aaa3a a3aaa3aaa a (D) a3aaa4a3aaa a PART-C: Problems C-. A long sequence of symbols generated from a source s seen to have the followng occurrences Symbol Occurrences a 3003 a 996 a 3 07 a a (a) Assgn Huffman codes to the above symbols, followng a conventon that the group/symbol wth hgher probablty s assgned a 0 and that wth lower probablty s assgned a. (b) Calculate the entropy of the source.

14 (c) Calculate the average code word length obtaned from Huffman codng. (d) Calculate the codng effcency. (e) Why s the codng effcency less than? SOLUTIONS A. The entropy of a source of symbols s defned as the average nformaton per a =,,..., n havng source output. If we have an alphabet z of n symbols { } probabltes of occurrences P ( a ) P( a ),..., P( ) s gven by H n ( z ) = P( a ) log P( a ) =, a n, the entropy of the source H(z) The unt of entropy s dependent upon the base of the logarthm. For a base of, the unt s bts. In general, for a base m, the unt of entropy s m-ary unts. A. Entropy of a source s related to the uncertanty of the symbols assocated wth t. Greater the uncertanty, hgher s the entropy. We can llustrate ths by the two-symbol example dscussed n Secton-3. A.3 Shannon s codng theorem on lossless channels states that n any codng scheme, the average code word length of a source of symbols can at best be equal to the source entropy and can never exceed t. If m(z) s the mnmum of the average code word length obtaned out of dfferent unquely decpherable codng schemes, then Shannon s theorem states that ( z) H ( z) m A.4 Refer to Secton-3.3 A.5 Refer to Secton-3.4 B. (C) B. (B) B.3 (A) B.4 (C) B.5 (B) B.6 (D) B.7 (A) B.8 (C) B.9 (D).C. (a) Snce the symbols are observed for a suffcently long sequence, the probabltes can be estmated from ther relatve frequences of occurrence. P a.3, P a 0., P a 0., P a 0.5, P a 0. ( ) ( ) ( ) ( ) ( ) Based on these probabltes, the source reductons can be done as follows:

15 Symbo Prob Reducton- Reducton- Reducton -3 l. Symbol Pro b Symbol Pro b Symbol Pro b a 0.3 a 0.3 a 4 +a a + a a 3 a a a 0.3 a 4 +a a 3 a 3 0. a 4 +a 0.5 a a a 3 0. a 0. We can now work backwards to assgn Huffman codes to the compound symbols and proceed to the elementary symbols Reducton-3 Reducton- Reducton- Orgnal Symbol Code Symbol Code Symbol Code Symbol Code a + a 5 0 a 00 a 00 a 00 a 4 +a + a 5 0 a 5 0 a 5 0 a 3 a 4 +a + a 3 a 4 +a 0 a 3 a 3 a 4 00 a 0 (b) The source entropy s gven by ( ) P( ) H z n = = a log a = 0.3log log 0. 0.log log log 0.5 =.7 bts/ symbol bts/ symbol (c) The average code word length s gven by n ( ) P( a ) L( a ) L z = = = =.5 bts/ symbol bts/ symbol (d) The codng effcency ( z) ( z) H.7 η = = = L.5

16 (e) The student should thnk of ths reason and check later. References. Huffman, D.A., A Method for the Constructon of Mnmum Redundancy Codes, Proc. IRE, vol.40, no.0, pp.098-0, 95.. Shannon, C.E., A Mathematcal Theory of Communcatons, The Bell Sys. Tech. J., vol. XXVII, no. 3, pp ,

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

1 Approximation Algorithms

1 Approximation Algorithms CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

Adaptive Fractal Image Coding in the Frequency Domain

Adaptive Fractal Image Coding in the Frequency Domain PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 2-22 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Simple Interest Loans (Section 5.1) :

Simple Interest Loans (Section 5.1) : Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Proceedings of the Annual Meeting of the American Statistical Association, August 5-9, 2001

Proceedings of the Annual Meeting of the American Statistical Association, August 5-9, 2001 Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 5-9, 2001 LIST-ASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James

More information

Communication Networks II Contents

Communication Networks II Contents 8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

More information

Study on CET4 Marks in China s Graded English Teaching

Study on CET4 Marks in China s Graded English Teaching Study on CET4 Marks n Chna s Graded Englsh Teachng CHE We College of Foregn Studes, Shandong Insttute of Busness and Technology, P.R.Chna, 264005 Abstract: Ths paper deploys Logt model, and decomposes

More information

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy 4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

More information

Finite Math Chapter 10: Study Guide and Solution to Problems

Finite Math Chapter 10: Study Guide and Solution to Problems Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount

More information

EE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN

EE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN EE201 Crcut Theory I 2015 Sprng Dr. Yılmaz KALKAN 1. Basc Concepts (Chapter 1 of Nlsson - 3 Hrs.) Introducton, Current and Voltage, Power and Energy 2. Basc Laws (Chapter 2&3 of Nlsson - 6 Hrs.) Voltage

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Traffic-light a stress test for life insurance provisions

Traffic-light a stress test for life insurance provisions MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Small pots lump sum payment instruction

Small pots lump sum payment instruction For customers Small pots lump sum payment nstructon Please read these notes before completng ths nstructon About ths nstructon Use ths nstructon f you re an ndvdual wth Aegon Retrement Choces Self Invested

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

7.5. Present Value of an Annuity. Investigate

7.5. Present Value of an Annuity. Investigate 7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on

More information

Basic Image Compression Algorithm and Introduction to JPEG Standard

Basic Image Compression Algorithm and Introduction to JPEG Standard Basc Image Compresson Algorthm and Introducton to JPEG Standard Pao-Yen Ln E-mal: r97942117@ntu.edu.tw Graduate Insttute of Communcaton Engneerng atonal Tawan Unversty, Tape, Tawan, ROC Abstract Because

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

Using Series to Analyze Financial Situations: Present Value

Using Series to Analyze Financial Situations: Present Value 2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

Formula of Total Probability, Bayes Rule, and Applications

Formula of Total Probability, Bayes Rule, and Applications 1 Formula of Total Probablty, Bayes Rule, and Applcatons Recall that for any event A, the par of events A and A has an ntersecton that s empty, whereas the unon A A represents the total populaton of nterest.

More information

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Time Value of Money. Types of Interest. Compounding and Discounting Single Sums. Page 1. Ch. 6 - The Time Value of Money. The Time Value of Money

Time Value of Money. Types of Interest. Compounding and Discounting Single Sums. Page 1. Ch. 6 - The Time Value of Money. The Time Value of Money Ch. 6 - The Tme Value of Money Tme Value of Money The Interest Rate Smple Interest Compound Interest Amortzng a Loan FIN21- Ahmed Y, Dasht TIME VALUE OF MONEY OR DISCOUNTED CASH FLOW ANALYSIS Very Important

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

Time Value of Money Module

Time Value of Money Module Tme Value of Money Module O BJECTIVES After readng ths Module, you wll be able to: Understand smple nterest and compound nterest. 2 Compute and use the future value of a sngle sum. 3 Compute and use the

More information

Sample Design in TIMSS and PIRLS

Sample Design in TIMSS and PIRLS Sample Desgn n TIMSS and PIRLS Introducton Marc Joncas Perre Foy TIMSS and PIRLS are desgned to provde vald and relable measurement of trends n student achevement n countres around the world, whle keepng

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

Section 5.3 Annuities, Future Value, and Sinking Funds

Section 5.3 Annuities, Future Value, and Sinking Funds Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

Control Charts for Means (Simulation)

Control Charts for Means (Simulation) Chapter 290 Control Charts for Means (Smulaton) Introducton Ths procedure allows you to study the run length dstrbuton of Shewhart (Xbar), Cusum, FIR Cusum, and EWMA process control charts for means usng

More information

Single and multiple stage classifiers implementing logistic discrimination

Single and multiple stage classifiers implementing logistic discrimination Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

1. Measuring association using correlation and regression

1. Measuring association using correlation and regression How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a

More information

New bounds in Balog-Szemerédi-Gowers theorem

New bounds in Balog-Szemerédi-Gowers theorem New bounds n Balog-Szemeréd-Gowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A

More information

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6 PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

Financial Mathemetics

Financial Mathemetics Fnancal Mathemetcs 15 Mathematcs Grade 12 Teacher Gude Fnancal Maths Seres Overvew In ths seres we am to show how Mathematcs can be used to support personal fnancal decsons. In ths seres we jon Tebogo,

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

QUESTIONS, How can quantum computers do the amazing things that they are able to do, such. cryptography quantum computers

QUESTIONS, How can quantum computers do the amazing things that they are able to do, such. cryptography quantum computers 2O cryptography quantum computers cryptography quantum computers QUESTIONS, Quantum Computers, and Cryptography A mathematcal metaphor for the power of quantum algorthms Mark Ettnger How can quantum computers

More information

Statistical Methods to Develop Rating Models

Statistical Methods to Develop Rating Models Statstcal Methods to Develop Ratng Models [Evelyn Hayden and Danel Porath, Österrechsche Natonalbank and Unversty of Appled Scences at Manz] Source: The Basel II Rsk Parameters Estmaton, Valdaton, and

More information

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Demographic and Health Surveys Methodology

Demographic and Health Surveys Methodology samplng and household lstng manual Demographc and Health Surveys Methodology Ths document s part of the Demographc and Health Survey s DHS Toolkt of methodology for the MEASURE DHS Phase III project, mplemented

More information

Joint Resource Allocation and Base-Station. Assignment for the Downlink in CDMA Networks

Joint Resource Allocation and Base-Station. Assignment for the Downlink in CDMA Networks Jont Resource Allocaton and Base-Staton 1 Assgnment for the Downlnk n CDMA Networks Jang Won Lee, Rav R. Mazumdar, and Ness B. Shroff School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,

More information

IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS

IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence 1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

More information

Nonlinear data mapping by neural networks

Nonlinear data mapping by neural networks Nonlnear data mappng by neural networks R.P.W. Dun Delft Unversty of Technology, Netherlands Abstract A revew s gven of the use of neural networks for nonlnear mappng of hgh dmensonal data on lower dmensonal

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression. Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000 Problem Set 5 Solutons 1 MIT s consderng buldng a new car park near Kendall Square. o unversty funds are avalable (overhead rates are under pressure and the new faclty would have to pay for tself from

More information

EXAMPLE PROBLEMS SOLVED USING THE SHARP EL-733A CALCULATOR

EXAMPLE PROBLEMS SOLVED USING THE SHARP EL-733A CALCULATOR EXAMPLE PROBLEMS SOLVED USING THE SHARP EL-733A CALCULATOR 8S CHAPTER 8 EXAMPLES EXAMPLE 8.4A THE INVESTMENT NEEDED TO REACH A PARTICULAR FUTURE VALUE What amount must you nvest now at 4% compoune monthly

More information

Joe Pimbley, unpublished, 2005. Yield Curve Calculations

Joe Pimbley, unpublished, 2005. Yield Curve Calculations Joe Pmbley, unpublshed, 005. Yeld Curve Calculatons Background: Everythng s dscount factors Yeld curve calculatons nclude valuaton of forward rate agreements (FRAs), swaps, nterest rate optons, and forward

More information

Vasicek s Model of Distribution of Losses in a Large, Homogeneous Portfolio

Vasicek s Model of Distribution of Losses in a Large, Homogeneous Portfolio Vascek s Model of Dstrbuton of Losses n a Large, Homogeneous Portfolo Stephen M Schaefer London Busness School Credt Rsk Electve Summer 2012 Vascek s Model Important method for calculatng dstrbuton of

More information

On Mean Squared Error of Hierarchical Estimator

On Mean Squared Error of Hierarchical Estimator S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta

More information

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant

More information

S. Malasri, D.A.Halijan and M.L.Keough Department of Civil Engineering Christian Brothers University Memphis, TN 38104. Abstract

S. Malasri, D.A.Halijan and M.L.Keough Department of Civil Engineering Christian Brothers University Memphis, TN 38104. Abstract S. Malasr, D.A.Haljan and M.L.Keough Department of Cvl Engneerng Chrstan Brothers Unversty Memphs, TN 38104 Abstract Ths paper demonstrates an applcaton of the natural selecton process to the desgn of

More information

1. Math 210 Finite Mathematics

1. Math 210 Finite Mathematics 1. ath 210 Fnte athematcs Chapter 5.2 and 5.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210

More information

An MILP model for planning of batch plants operating in a campaign-mode

An MILP model for planning of batch plants operating in a campaign-mode An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño

More information

Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process

Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

On some special nonlevel annuities and yield rates for annuities

On some special nonlevel annuities and yield rates for annuities On some specal nonlevel annutes and yeld rates for annutes 1 Annutes wth payments n geometrc progresson 2 Annutes wth payments n Arthmetc Progresson 1 Annutes wth payments n geometrc progresson 2 Annutes

More information

Lecture 7 March 20, 2002

Lecture 7 March 20, 2002 MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Testing The Torah Code Hypothesis: The Experimental Protocol

Testing The Torah Code Hypothesis: The Experimental Protocol Testng The Torah Code Hypothess: The Expermental Protocol Robert M. Haralck Computer Scence, Graduate Center Cty Unversty of New York 365 Ffth Avenue New York, NY 10016 Abstract Ths s the second part of

More information

Probabilities and Probabilistic Models

Probabilities and Probabilistic Models Probabltes and Probablstc Models Probablstc models A model means a system that smulates an obect under consderaton. A probablstc model s a model that produces dfferent outcomes wth dfferent probabltes

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Activity Scheduling for Cost-Time Investment Optimization in Project Management

Activity Scheduling for Cost-Time Investment Optimization in Project Management PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

A DATA MINING APPLICATION IN A STUDENT DATABASE JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul

More information

To manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.

To manage leave, meeting institutional requirements and treating individual staff members fairly and consistently. Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

More information

Rapid Estimation Method for Data Capacity and Spectrum Efficiency in Cellular Networks

Rapid Estimation Method for Data Capacity and Spectrum Efficiency in Cellular Networks Rapd Estmaton ethod for Data Capacty and Spectrum Effcency n Cellular Networs C.F. Ball, E. Humburg, K. Ivanov, R. üllner Semens AG, Communcatons oble Networs unch, Germany carsten.ball@semens.com Abstract

More information

How Much to Bet on Video Poker

How Much to Bet on Video Poker How Much to Bet on Vdeo Poker Trstan Barnett A queston that arses whenever a gae s favorable to the player s how uch to wager on each event? Whle conservatve play (or nu bet nzes large fluctuatons, t lacks

More information

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara

More information

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid Feasblty of Usng Dscrmnate Prcng Schemes for Energy Tradng n Smart Grd Wayes Tushar, Chau Yuen, Bo Cha, Davd B. Smth, and H. Vncent Poor Sngapore Unversty of Technology and Desgn, Sngapore 138682. Emal:

More information