A Comparison of RAS and Entropy Methods in Updating IO Tables

Size: px
Start display at page:

Download "A Comparison of RAS and Entropy Methods in Updating IO Tables"

Transcription

1 A Comparson of RAS and Entropy Methods n Updatng IO Tables S. Amer Ahmed 1 and Paul V. Preckel 2 PRELIMINARY VERSION PLEASE DO NOT DISTRIBUTE OR CITE WITHOUT PERMISSION COMMENTS WELCOME Selected Paper prepared for presentaton at the Amercan Agrcultural Economcs Assocaton Annual Meetng Portland, Oregon, July 29-August 1, S. Amer Ahmed (contact author), Ph.D. Canddate, Department of Agrcultural Economcs, Purdue Unversty, 403 W. State St., West Lafayette, IN Emal: saahmed@purdue.edu 2 Paul V. Preckel, Professor, Department of Agrcultural Economcs, Purdue Unversty, 403 W. State St., West Lafayette, IN

2 Abstract Snce the frst half of the 20 th century, the nput-output (IO) table has been the backbone of much emprcal work used to support polcy analyss and develop economywde models. The need for accurate, up-to-date IO tables s thus essental for establshng the valdty of the emprcal work that follows from them. However, the constructon of an IO table for any gven country s an expensve and tme-consumng endeavor. Current and accurate IO tables for many countres are thus often dffcult to obtan on a regular bass. Once an ntal IO table has been constructed, a common workaround s to collect partal nformaton for subsequent perods, such as fnal demands for commodtes wthn the economy, and then employ a Bayesan parameter estmaton technque to determne values for a new IO matrx usng the prevous perod IO table as a pror. Two such technques to acheve ths are RAS and Mnmum Cross Entropy (CE). The lterature has largely gnored the queston of the relatve merts of these two methods. Ths paper uses the actual IO tables for South Korea from two dstnct tme perods to compare the accuracy of the RAS and CE methods. The 1995 IO table for Korea s updated to 2000 usng column and row totals from the true 2000 IO table usng both RAS and CE methods. The estmated IO tables are then compared to the actual 2000 IO table n order to make some observatons on the relatve accuracy of the methods. The sums of squared devatons of the estmates tables from the true tables are used as the man nstrument to measure devatons of the updated matrces from the true year 2000 IO matrx. It s found that the CE approach s more accurate than the RAS approach, based on the lower summed squared devatons of the elements of the CE estmated 2000 matrx from the elements of the true

3 The maxmum absolute dfferences between the true and estmated tables were also calculated. It was found that the maxmum absolute dfference between CEestmated table and the true posteror table was smaller than the dfference between the RAS-estmated table and the true posteror. 3

4 1. Introducton Snce the frst half of the 20 th century, the nput-output (IO) table has been the backbone of much emprcal work used to support polcy analyss and develop economywde models. The need for accurate, up-to-date IO tables s thus essental for establshng the valdty of the emprcal work that follows from them. However, the constructon of an IO table for any gven country s an expensve and tme-consumng endeavor. Current and accurate IO tables for many countres are thus often dffcult to obtan on a regular bass. A common workaround s to collect partal nformaton for subsequent perods, such as fnal demands for commodtes wthn the economy, and then employ a parameter estmaton technque to determne values for a new IO matrx usng the prevous perod IO table as a pror. Two such technques to acheve ths are RAS and Mnmum Cross Entropy (CE). Ths paper wll examne the lterature assocated wth these two parameter estmaton technques wthn the context of updatng IO tables usng partal nformaton. We wll address the theoretcal underpnnngs of each method and then provde an applcaton of each based on real world data. A comparson of an actual IO table from a subsequent tme perod to a table updated from a benchmark dataset would reveal the effcacy of these parameter estmaton technques. Usng the 1995 IO table for Korea and partal nformaton from the 2000 IO table of the same country, RAS and CE wll be used to obtan estmated IO tables for The two estmated tables wll then be compared to the true table for that year n an attempt to provde nsght as to whch method was better suted to ths task. 3 3 GAMS code for ths paper avalable upon request. 4

5 2. The Structure of the IO Table Ths secton brefly descrbes the generalzed IO table. An understandng of the structure of the IO table wll be relevant for the dscusson of the Korean data to be used n Secton 4. The precursor to the modern IO table was Franços Quesnay s tableau économque 4 (Pressman, 1994). Ths economc table used a matrx framework to provde nformaton on the sale-purchase relatonshps between dfferent producers prmarly n agrculture wthn an economy. The key underlyng assumpton to ths framework was that nputs used by a gven ndustry were related to the output by a lnear and fxed coeffcent producton functon. Ths bascally means that the nput-output relatonshps descrbed by the rows and columns of the table are representatve of a producton technque (UN Handbook, 1999). The ndustres ndcated by the rows are thus producng a commodty (output) that s the nput n an ndustry ndcated by the columns. The row totals thus sgnfy total sales of ndustres, whle the column totals are the total costs. So, IO tables can be thought of as n x n matrces, wth n beng the number of ndustres n the economy. They are often represented as 2n x n, wth there beng twce the number of ndustres provdng nputs. The frst n rows are often for domestc nputs, whle the second n are for mports. In addton to the 2n rows and n columns, there are addtonal columns (to ndcate fnal demand) and rows (to ndcate value added and taxes). The column totals together wth the value added must always equal the sum of the row totals and fnal demand n order for the IO table to balance. 4 Quesnay s Tableau économque was frst publshed n 1758 and s now publshed n facsmle by the Brtsh Economc Assocaton, London. 5

6 3. Theoretcal Foundatons 3.1 Updatng wth RAS The RAS method s an teratve method of bproportonal adustment of rows and columns that has been ndependently developed by varous researchers, such as Kruthoff and Shelekhovsk n the 1930s. In 1961, Stone adapted the technque for use n updatng IO tables from the work of Demng and Stephan (UN Handbook, 1999). RAS s bascally an teratve scalng method whereby a non-negatve matrx, M, of dmenson x s adusted untl ts column sums and row sums equal gven vectors u * and v * (Schneder and Zenos, 1990). Ths adustment s acheved by multplyng each row by a postve constant so that the row total equals the target row total. Ths operaton would alter the column totals. The columns would then be multpled by constants to make ther totals correspond to the target column totals. Ths sequence of row and column multplcaton would contnue untl both the column and row totals converge to the target vectors. To llustrate, let us consder the matrx M, where M, s the vector of column totals. From ths matrx we can obtan ts matrx of coeffcents 5, A 0, as seen below. A 0 = M / M EQ (1) By pre and post multplyng ths matrx by the vectors r and s, the new matrx of coeffcents A 1 s obtaned. These two vectors are the vectors of target row and column totals. Ths matrx of coeffcents s now ready to undergo a sequence of teratve multplcatons, whch can be seen from equatons (2) through (4f). The multplcaton of 5 To avod confuson, matrx of coeffcents wll refer to a matrx wth elements dvded by column totals n ths paper, whle nput-output table wll refer to the table of nput-output value flows. 6

7 the ntal coeffcent matrx by the row and column multplers gves ths method ts name. A 1 = r A s EQ (2) 0 The teratve process s as follows, and can be seen below. The orgnal matrx of coeffcents s multpled by the row of target column totals, M * to obtan the matrx F. F 0 * = A M EQ (3) The row totals of ths matrx are represented n the vector u. The rato of u * to u s the multpler r. Multplyng r and F, we obtan a new F. Row vector v of column totals s obtaned and used to calculate the multpler s. F and s are then multpled. The entre sequence of operatons can be seen n equatons (4a-f) u = F EQ (4a) * r = u / u EQ (4b) F = r F EQ (4c) v = F EQ (4d) * s = v / v EQ (4e) F = s F EQ (4f) The teratve process n equatons (4a-f) then contnues untl the condtons u = u * and v = v * are met. At that pont, the matrx F s assumed to be the best estmate of the true posteror matrx M *. 3.2 Updatng wth Mnmum Cross Entropy The CE technque based on nformaton theory due to Shannon (1948) descrbes the entropy of a probablty dstrbuton as the measure H, where p k s the probablty of an event k occurrng (Equaton (5)): 7

8 H p) ( p k LNp k EQ (5) = k As reported by Robnson et al. (2001), from the work of Thel (1967), the entropy theory can be appled as follows. Wth cross entropy there s a set of K events wth probabltes q of occurrng. These probabltes form a pror. When confronted wth a new set of nformaton, we may desre to fnd a set of posteror probabltes p that are close to the pror whle satsfyng the restrctons emboded n the new nformaton. Kullback and Lebler (1951) develop one measure of closeness, namely, the crossentropy of the probablty dstrbuton descrbed by p, wth respect to q. Ths measure s denoted by Equaton (7a): I ( p : q) = p LN ( p q ) EQ (7a) Golan et al. (1994) and Golan et al. (1996) apply the Kullback-Lebler CE measure to estmate coeffcents n nput-output tables wth the dea beng to mnmze I subect to data consstency, normalzaton-addtvty, and new nformaton constrants (X and y) n Equatons (7b-c). y = Xp EQ (7b) p 1' = 1 EQ (7c) Ths partcular paper wll follow the above method as used by Robnson et al. (2001) to estmate posteror IO table coeffcents. After dvdng the elements of the pror IO table by ts column totals, a matrx of pror probabltes s obtaned, q. Then, q and p the matrx of posteror probabltes are then used n the Kullback-Lebler CE measure as the obectve functon to be mnmzed (Equaton (8) on the next page). 8

9 MIN : p LN ( p q ) EQ (8) The obectve s mnmzed subect to constrants. One of them s the addtvty constrant that says that all the posteror probabltes column totals sum to one. X and Y are known column and row totals of the posteror IO tables and they form the data consstency constrants. All the constrants can be seen below n Equatons (9a-c). p = 1 EQ (9a) p X = Y EQ (9b) p X = X EQ (9c) Once the problem has been solved, the values of the p X are the values of the estmated posteror IO table. 3.3 RAS versus CE as Parameter Estmaton Technques The lterature has largely gnored the queston of the relatve merts of these two methods. Robnson et al. (2001) addresses ths gap by comparng RAS and CE as parameter estmaton technques n the context of a 1994 SAM for Mozambque. The paper conducts smulatons startng wth the balanced SAM before randomly changng some row and column totals. The SAM s then updated usng both the RAS and the CE methods. From the comparson of these two methods, they found that f the focus s on column coeffcents, then the CE method appears to be superor to RAS. However, f the focus s on SAM flows, then the two methods are very smlar, wth RAS performng slghtly better. As mentoned n ther paper and n McDougall (1999), the RAS and CE are equvalent measures RAS beng entropy theoretc f the CE method uses as an 9

10 obectve a sngle cross-entropy measure nstead of attemptng to use the sum of column cross-entropes. Also, more data can be ncorporated n the CE formulaton, pckng up changes n the flows across the matrx, and thus provdng a more accurate update or estmate. RAS on the other hand s confned to usng ust column and row totals for the estmaton technque, and would not be able to use addtonal nformaton should t be avalable. 4. Comparson of RAS and CE wth Korean IO Tables 4.1 Korea as an Applcaton Whle Robnson et al. (2001) used Monte Carlo smulatons to obtan a perturbed SAM to update, we use the actual IO tables for South Korea from two dstnct tme perods to compare the accuracy of the RAS and CE methods. The 1995 IO table for Korea s updated to 2000 usng column and row totals from the true 2000 IO table usng both RAS and CE methods. The estmated IO tables are then compared to the actual 2000 IO table n order to make some observatons on the relatve accuracy of the methods. The Korean IO tables for 1995 and 2000 are obtaned from the Global Trade Analyss Proect (GTAP). The 1995 IO table was used n the GTAP Database Verson 5, whle the 2000 table was used Verson 6 of the database 6. The IO tables from GTAP have the advantage of beng unform n ther format and structure whch makes t unnecessary to worry about cross-comparablty of the two. Often IO tables used n the fnal GTAP Database must undergo some form of matrx balancng or data constructon n order to provde more complete nformaton n the fnal product (McDougall, 2002). These tables however were obtaned before any of 6 Documentaton on these IO tables can be found at Dmaranan and McDougall (2002) and Dmaranan and McDougall (2006). 10

11 those methods were used. For more nformaton on the format of the GTAP IO tables please refer to Huff et al. (2000) and Walmsley et al. (2002). Two IO matrces for each year are obtaned one wth taxes ncluded, and the other wthout. Through addton and subtracton of column totals between the two matrces, taxes are removed from the matrx core, added together and placed n a separate row. Asde from the rows wth nformaton on value added, there are 2n rows for commodtes, wth one beng for domestc goods and the other for mports. For a partcular column (use ), the domestc and mported quanttes of the commodtes are added together, to collapse the 2n x n core matrx nto an n x n matrx. Once that s done, the total mports for each of the rows was subtracted from the row total. At ths pont, the sum of all costs, value added, and taxes - the column totals s equal to the sum of all the sales and fnal demand mnus mports the row totals. The IO table row and column totals equal each other. Also, n the GTAP-ready IO tables that we use, there s a commodty known as dwellngs (dwe) whch s bascally the mputed rent for resdences. Ths faux-commodty s absent n the 1995 tables, but was ncluded n the 2000 tables. We exclude ths commodty from the 2000 table, to have a far comparson between the tables from the two perods. The focus of ths paper s only on updatng the core IO table,.e. the ffty-sx by ffty-sx table of transactons between ndustres that s left after the fnal demand, value added, taxes, and negatve mports rows and columns are removed. The IO core represents the ntermedate demand and supply relatonshps between ndustres. 11

12 4.2 Data The pror n ths paper s the mport and tax adusted 1995 core IO table. Ths table, as mentoned before s ffty-sx by ffty-sx, for ffty-sx commodtes, wth all values beng reported n mllons of Korean won. About 42.9% of the cells are zeroes. Some of these blocks of zero values can be explaned by ndustral structure. For example there s no ol produced n Korea, and so the entre column for ol s zeroed out. Smlarly, agrcultural products lke food gran are not used by the constructon ndustry. Examnng the empty values n the matrx, we can see that there are three commodtes that are not produced n Korea. The 2000 core IO table the posteror exhbts smlar features. About 40.2% of the cells are empty. Between 1995 and 2000, about 5% of cells n the IO matrx underwent a change from ether a zero to a postve value, or vce versa. Some ndustres thus underwent technology changes such that ther choces of ntermedate nputs changed. 4.3 Formulaton The formulaton for each method s as was descrbed n sectons 3.1 and The pror matrx s taken as gven and the elements of each cell are dvded by the column totals to obtan a matrx of coeffcents. As posteror or target nformaton, the column and row totals of the 2000 IO table are used. After the estmaton methods are used on the coeffcent matrces to update the 1995 IO matrx to be consstent wth 2000 row and column totals, the elements of each cell are multpled by the target column totals to obtan posteror matrces that are the best estmates of the true IO table. 7 A summary of the CE formulaton s avalable n the Appendx. 12

13 4.4 Results The RAS-estmated and CE-estmated matrces are compared to the true 2000 core IO matrx. As was noted before the nputs used n some ndustres can change dramatcally between years, wth some nputs droppng out of some producton processes whle appearng n others. So, the estmated tables may have zero elements where the true IO table has postve values. As a result, when measurng devaton between the estmated tables and the true table, t s possble that we wll get some results that are very naccurate, especally f the true table s values for the correspondng zero cells s very large. Several dfferent metrcs are used for measurement of the methods accuracy, the frst of whch s the sum of squared errors (SSE). For each estmaton method, two SSE values were calculated, comparng the sum of the squared dfferences between the matrx of coeffcents for the true and the estmated matrces of coeffcents. For any gven estmaton method, SSE1 s the comparson of only the cells whch were nonzero n both the pror and the true IO tables. SSE2 measures the devaton for all cells n the pror and true tables. The matrces of coeffcents are compared frst. As wll be recalled, these matrces are bascally the full matrces wth the cells n a column dvded by the column total. By dong ths, we normalze wth respect to the columns to measure the relatve devaton. The values can be seen n Table 1. 13

14 Table 1: Comparson of SSE Values from Matrces of Coeffcents for Each Estmaton Technque 8 SSE1 SSE2 RAS CE Lookng down the column SSE1, t can be seen that the CE approach s superor to the RAS approach. The SSE1 measure for the CE approach s 22% smaller than the SSE1 value for the RAS approach. The results of Table 1 thus support the fndngs of Robnson et al. (2001) n that the CE approach provdes a posteror table much closer to a true table than a posteror estmated wth a RAS technque, when the matrces of coeffcents are beng compared. The more general SSE2 metrc consders all cells n the matrx ncludng those that undergo a change from zero to non-zero or vce versa between the two perods. The CE measure s agan superor to the RAS method. The conclusons to be drawn from Table 1 do not change when we calculate the SSE1 and SSE2 values for not ust the matrces of coeffcents, but rather the true and estmated nput-output tables. Table 2 compares these values and shows that the CE approach s once agan superor to the RAS approach. When the nput-output tables are compared, the SSE measure values for the CE approach are found to be smaller by 34%- 38% than the values obtaned from the RAS method. 8 The SSE between the RAS estmated posteror and the CE estmated posteror s

15 Table 2: Comparson of SSE Values from Input-Output Tables for Each Estmaton Technque SSE1 SSE2 RAS X X CE X X In addton to the SSE1 and SSE2 measures, the maxmum absolute dfferences between the true posteror and the estmated posteror tables were calculated, and can be found n Table 3. As can be seen, the CE approach yelds smaller maxmum absolute dfferences when consderng both the matrces of coeffcents and the estmated nputoutput tables. Table 3: Comparson of Maxmum Absolute Dfferences Between True and Estmated Posteror Tables Matrx of Coeffcents Input-Output Table RAS CE Dscusson on Specfcaton Improvements We mght have expected the varaton between the RAS-estmated and the CEestmated tables to be smaller, snce RAS s an entropy-based technque, and the two methods should provde smlar results (McDougall, 1999). One possble reason that the CE method performed better than the RAS technque s that the RAS method of bproportonal adustment s less able to deal wth the cells that were zero n the pror but postve n the true posteror, and vce versa. A common strategy employed to work around ths problem s to smear the data. 15

16 Ths data smear conssts of takng a small percentage of the value from the nonzero elements of the row, and then redstrbutng the collected value across the cells wth zero values, mantanng row totals. Ths redstrbuton of value s equvalent to a tax on the ndustres usng the nput, and as a subsdy on the ndustres that dd not use pror to the smear, but do so now. Ths paper dd not use any data smearng technque on the data snce the purpose of ths exercse was to examne the power of each estmaton technque gven a real world IO matrx. However, f the zero-value cells had been smeared, then t s possble that both the estmaton methods mght have produced posteror tables would values closer to the true IO matrx. In addton to data-smearng, there are several dfferent ways of specfyng the RAS and CE methods. Ths paper used a very smple teratve specfcaton of the RAS. Most nput-output analysts employ more creatve specfcatons of the bproportonal adustment method. 5. Conclusons RAS and CE are two parameter estmaton technques that have a long hstory n updatng and estmatng IO data. Although they share theoretcal smlartes, they are of varyng accuracy. It s the consensus n the lterature that RAS may be better than CE when flows n updated IO tables are beng compared. Conversely, CE s supposed to appear more accurate than RAS when coeffcent matrces of updated IO tables are consdered. CE also has greater flexblty n ncorporatng more nformaton n the estmaton process. Ths paper compares coeffcent matrces of IO tables updated by both methods to the true posteror IO table, and fnds that CE s more accurate than CE. The SSE values 16

17 of CE-estmated matrx were found to be sgnfcantly smaller than the SSE values of the RAS-estmated matrx. The maxmum absolute dfference between the true nput-output table and the CE-estmated table was also found to be smaller than the maxmum absolute dfference between the true posteror table and the RAS-estmated table. The accuracy of these methods are senstve to creatve strateges used by nputoutput analysts n dealng wth these maor structural shfts n the economy. Changng the cells wth no value n the pror to a very small postve value whle mantanng the row total n a process know as data smearng may have a sgnfcant effect on the accuracy of the technques. Alternatve specfcatons of the estmaton methods may also provde more accurate results, and wll be the focus of future work. 17

18 REFERENCES Dmaranan, B. and R.A McDougall (eds) (2002) Chapter 11E, Global Trade, Assstance, and Producton: The GTAP 5 Database, Center for Global Trade Analyss, Purdue Unversty. Dmaranan, B. and R.A McDougall (eds) (2006) Chapter 11D, Global Trade, Assstance, and Producton: The GTAP 6 Database, Center for Global Trade Analyss, Purdue Unversty. Golan, A., G. Judge, and S. Robnson (1994) Recoverng Informaton from Incomplete or Partal Multsectoral Economc Data. Revew of Economcs and Statstcs, 76, pp Golan, A., G. Judge, and D. Mller (1996) Maxmum Entropy Econometrcs, Robust Estmaton wth Lmted Data. John Wley and Sons. Huff, K., R.A. McDougall, and T. Walmsley (2000) Contrbutng Input-Output Tables to the GTAP Data Base. GTAP Techncal Paper No. 1, Release 4.2. Center for Global Trade Analyss, Purdue Unversty. Kulback, S and R.A. Leber (1951) On nformaton and suffcency. Annals of Mathematcal Statstcs, 4, pp Robnson, S A. Cattaneo, and M. El-Sad. (2001) Updatng and Estmatng a Socal Accountng Matrx Usng Cross-Entropy Methods. Economc Systems Research, Vol 13., No. 1. McDougall, R.A. (1999) Entropy Theory and RAS are Frends. GTAP Workng Paper No. 6. Center for Global Trade Analyss, Purdue Unversty. McDougall, R.A. (2002) V5 Documentaton - Chapter 19: Updatng and Adustng the Regonal Input-Output Tables. Center for Global Trade Analyss, Purdue Unversty. Pressman, S. (1994) Quesnay s Tableau économque : A Crtque and Reassessment. Frst ed., Farfeld, NJ: A.M. Kelley. Schneder, M.H. and S.A. Zenos (1990) A Comparatve Study of Algorthms for Matrx Balancng. Operatons Research, Vol. 38, No.3, pp Shannon, C.E. (1948) A mathematcal theory of nformaton. Bell System Techncal Journal, 27, pp Thel, H. (1967) Economcs and Informaton Theory (Amsterdam, North Holland). 18

19 UN Department of Economcs and Socal Affars. (1999) Handbook of Input-Output Table Complaton and Analyss. Studes n Methods Handbook of Natonal Accountng: Seres F. Unted Natons, NY Walmsley, T. and R. McDougall (2002) V5 Documentaton - Chapter 11.A: Overvew of the Regonal Input-Output Tables. Center for Global Trade Analyss, Purdue Unversty. 19

20 CE Formulaton APPENDIX p matrx of coeffcents of the posteror to be estmated q matrx of coeffcents of the pror X column totals of true posteror Y row totals of true posteror, commodtes p LN( p q ) the Kullback-Leber entropy measure to be mnmzed p = 1 sum of column coeffcents equal one. p X = Y row totals of posteror IO table equal row totals of true table. p X = X column totals of posteror IO table equal column totals of true table. 20

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2 Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Econometrics 2. Panel Data Methods. Advanced Panel Data Methods I

Econometrics 2. Panel Data Methods. Advanced Panel Data Methods I Panel Data Methods Econometrcs 2 Advanced Panel Data Methods I Last tme: Panel data concepts and the two-perod case (13.3-4) Unobserved effects model: Tme-nvarant and dosyncratc effects Omted varables

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Structural Change in Demand for Cereals in Sri Lanka

Structural Change in Demand for Cereals in Sri Lanka Tropcal Agrcultural Research Vol. 16: 292-304 (2004) Structural Change n Demand for Cereals n Sr Lanka I.M. Rathnayake, N. Pryadharshane 1 and J. Weerahewa 1 Postgraduate Insttute of Agrculture Unversty

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech. Ar Transport Demand Ta-Hu Yang Assocate Professor Department of Logstcs Management Natonal Kaohsung Frst Unv. of Sc. & Tech. 1 Ar Transport Demand Demand for ar transport between two ctes or two regons

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Solving Route Planning Using Euler Path Transform

Solving Route Planning Using Euler Path Transform Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n

More information

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber,

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber, Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans

More information

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

More information

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

PMP BASED PRODUCTION MODELS-DEVELOPMENT AND INTEGRATION. Richard E. Howitt University of California, Davis, U.S.A

PMP BASED PRODUCTION MODELS-DEVELOPMENT AND INTEGRATION. Richard E. Howitt University of California, Davis, U.S.A PMP BASED PRODUCTION MODELS-DEVELOPMENT AND INTEGRATION Rchard E. Howtt Unversty of Calforna, Davs, U.S.A howtt@prmal.ucdavs.edu Paper prepared for presentaton at the PMP, Extensons and Alternatve Methods

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers 62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Extraction of Uncorrelated Sparse Sources from Signal Mixtures using a. Clustering Method

Extraction of Uncorrelated Sparse Sources from Signal Mixtures using a. Clustering Method 1 Extracton of Uncorrelated Sparse Sources from Sgnal Mxtures usng a Malcolm Woolfson Clusterng Method Department of Electrcal and Electronc Engneerng, Faculty of Engneerng, Unversty of Nottngham, Nottngham.

More information

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects Clemson Unversty TgerPrnts All Theses Theses 12-2011 A Comparson and Evaluaton of Three Dfferent Pose Estmaton Algorthms In Detectng Low Texture Manufactured Objects Robert Krener Clemson Unversty, rkrene@clemson.edu

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information