Accuracy Assessments of Geographical Line Data Sets, the Case of the Digital Chart of the World *

Size: px
Start display at page:

Download "Accuracy Assessments of Geographical Line Data Sets, the Case of the Digital Chart of the World *"

Transcription

1 Accuracy Assessments of Geographcal Lne Data Sets, the Case of the Dgtal Chart of the World * Håvard Tvete Department of Surveyng Agrcultural Unversty of Norway, P.O.Box 5034, 1432 Ås, Norway fax: phone: emal: lanht@nlh.no Sndre Langaas UNEP/GRID-Arendal c/o Dept. of Systems Ecology, Stockholm Unversty, S Stockholm, Sweden fax: phone: emal: langaas@grda.no Abstract To be able to utlse geographcal data for analyss, one should know somethng about the qualty of the data. In present geographcal data standardsaton proposals (SDTS, CEN TC287), several aspects of geographcal data qualty have been descrbed, such as lneage (data collecton and processng hstory), spatal accuracy, attrbute accuracy, completeness, logcal consstency and currency. Methods for quanttatve assessments of dfferent aspects of spatal accuracy for data sets of lnear geographcal features, such as shape fdelty and postonal accuracy are descrbed. For these assessments, ndependent data sets of better (and preferrably known) accuracy wll have to be used. In order to be able to do automatc assessments, data set completeness must be taken nto consderaton. The method has been appled for assessng the spatal accuracy for some themes of the Dgtal Chart of the World (DCW) (scale of orgnal maps (ONCs): 1: ), usng the Norwegan mappng authorty s natonal N250 map seres (scale 1:250000) ** as a reference data set. Key words: Accuracy, geographcal, dgtal, data, lne, buffer, overlay, DCW 1 Introducton The avalablty of qualty nformaton s a prerequste for the utlsaton of geographcal data sets. * Ths work has been partally funded by the Norwegan Research Councl under the Geographcal Informaton Technology programme. ** Many thanks to the Norwegan mappng authorty for gvng us access to excerpts of the dgtal N250-data set for these purposes.

2 Tradtonal geographcal maps have conveyed qualty nformaton ndrectly through the qualty constrants and mappng rules that apples to the relevant map seres and mplctly through the (presentaton) scale of the maps. The professonal map users have hopefully been aware of the many aspects of tradtonal map qualty, whle most casual map users probably have used the scale of the map as the only qualty ndcator. Wth the advent of dgtal geographcal nformaton, presentaton scale as such s no longer a useful measure of geographcal data qualty snce dgtal geographcal nformaton n theory can be presented at any scale. The avalablty of dgtal geographcal data and geographcal nformaton systems (GIS) also gves new opportuntes for easy combnaton of geographcal data sets of any scale. The results of analyss on combnatons of data sets depend on the qualty of all the partcpatng data sets. In order to be able to determne the qualty of the results of geographcal data analyss, t s mperatve that qualty measures are avalable for all the nvolved data sets. The ncluson of qualty measures for dgtal geographcal data sets has been mpeded by the lack of standards. There has been some research actvty on spatal data qualty, and some sgnfcant contrbutons nclude: Chrsman 1984, Goodchld and Gopal 1991 (book of artcles), SDTS 1990 (US spatal data transfer standard). The research presented n ths artcle s a part of the ongong project * «Issues of Error, Qualty, and Integrty of Dgtal Geographcal Data: The Case of the Dgtal Chart of the World (DCW)» (Langaas and Tvete 1994). Untl now, we have been nvestgatng methods for qualty assessments, and are now startng to apply the methods on our data sets (DCW and N250). The rest of the paper s structured as follows. In chapter 2, lnear geographcal phenomena are dscussed. In chapter 3, dfferent ways of measurng geographcal lne qualty are presented, and our method for quanttatve assessment of geographcal lne qualty on the bass of data of hgher geometrc accuracy s ntroduced. Chapter 4 rounds t all up wth conclusons and an outlne of future work. 2 Lnear geographcal phenomena The geometrc lne abstracton can be used to represent many geographcal phenomena. Some examples: Roads and ralways Admnstratve (state, muncpalty) and economcal (property) borders Utlty lnes (powerlnes, telephone lnes, water and sewage tubes) Rvers and streams Natural boundares (e.g. vegetaton, sol) Shorelnes * The project presently has a WWW page: URL:

3 Some of these phenomena are nature gven and some are human «constructons» (constraned by nature). There are many ways of provdng qualty measures for lnear features. The choce of a qualty measure depends to some extent on the type of lnear feature we are consderng. 2.1 «Scale» and fractal behavour The «scale» of a lne data set can to a certan extent be determned on the bass of the geometry of the lne alone. Geometrc accuracy s n many cases closely related to «scale». Good ndcatons on scale are: The number of sgnfcant dgts n the representaton of ponts n the data set s the crudest measure of «scale» / spatal accuracy of a data set. Ths s not a useful measure when the orgnal data have been manpulated (e.g. transformed to a new projecton), as most software do not consder accuracy n ther calculatons. Dstance between neghbourng ponts. The ntended scale of the data set can normally be derved from the lowest dstance between neghbourng ponts. Ths s not true f the data set has been manpulated, for nstance by nsertng new ponts on the lnes usng some sort of nterpolaton method. Frequency of curvature change. For curvng phenomena whch change curvature at a hgher frequency than can be captured usng the assumed geometrc accuracy n the data set of nterest, the maxmum rate of curvature change s a good ndcaton of the «scale» of the data set. Such phenomena are phenomena that show fractal behavour (Barnsley 1988) up to larger scales than what can be expected by the data set under consderaton. Most features n nature seem to exhbt fractal behavour over a large spectrum of scales. Examples of such phenomena are: rvers/streams, roads, shorelnes and other natural boundares. The fractal behavour of natural phenomena, and to a certan extent also human-made lnear objects, s often nfluenced by the sol/geology/geomorphology of the area Fractal behavour of nfrastructure When one gets to a large enough scale, nfrastructure wll cease to exhbt fractal behavour. A road wll normally not change curvature more frequently than each 100 meter (1000 meters for a modern motorway, whle perhaps meters for a small older road). The same apples to ralways, powerlnes, telephone lnes and other utltes. When you come to a certan pont, they wll cease to exhbt fractal behavour. The fractal behavour of nfrastructure s, n addton to cultural/hstorcal ssues, also nfluenced by the geomorphology of the area. 3 Methods for assessng the qualty of lnes In the followng sectons, we wll be presentng and dscussng methods for calculatng and quantfyng the geometrc accuracy of lnes.

4 For our assessments, we assume that we have two ndependent data sets, X and Q, coverng the same lne theme and the same area (and collected at about the same pont n tme). One of the data sets, Q, should have a known geometrc accuracy. The geometrc accuracy of Q should be better (preferrably at least an order of magntude) than the expected geometrc accuracy of the data set X. It s also expected that the completeness and consstency of data set Q s sgnfcantly better than that of data set X. Lnes The geometrc accuracy of a lne can be decomposed nto two components: Postonal pont accuracy: Postonal accuracy can easly be gven for well defned ponts on the lne (e.g. the end-ponts). For the rest of the lne, t s dffcult to say anythng about postonal accuracy and to quantfy t. Shape fdelty: To be able to say somethng about the accuracy of a lne, t s useful to talk about ts shape fdelty as compared to another lne. The shape fdelty should ndcate to what extent the curvature of two lnes are smlar. The type of spatal «errors» that can occur for lnear data sets could also be classfed nto categores. E.g.: Scale-dependent errors (generalsaton). These are errors that result from reducng the samplng frequency when collectng data on the lnear phenomena of nterest. Generalsaton/samplng: A lne-representaton that has been generated by samplng a lne of hgh geometrc accuracy represents a specal case. Each pont of the lne s very accurately specfed, but between the represented ponts, there can be large devatons between the nterpolated lne and the orgnal poston of the lnear feature. Ths s closely related to scaledependent errors. Achevable accuracy of fuzzy lnes. The poston of most lnear phenomena get fuzzy as the scale gets larger, and t s generally mpossble to gve them an exact locaton. Rver centrelnes and sol and vegetaton boundares are good examples of fuzzy natural phenomena, but also human constructons can be dffcult to measure wth extremely hgh accuracy (t s dffcult to determne the centrelne of a road wth mllmetre accuracy). «Random» errors. Errors that result from erroneous samplng and data processng. It would be desrable to be able to separate these when descrbng the spatal accuracy of the geometrc representatons of lnear geographcal features. 3.1 Pont measures It s straghtforward to calculate the geometrc accuracy of ponts. For sngle ponts one can measure the devaton vector (e) of the pont representaton (P) as compared to another representaton of the same pont wth better (and known) geometrc accuracy (Q).

5 e = P - Q = (P x -Q x, P y -Q y, P z -Q z ) for 3D space The absolute value of ths devaton vector ( e = ex + ey + ez for 3D space) s a useful measure for further (standard) statstcal calculatons. For multple ponts one has to resort to statstcal measures to determne qualty parameters. Standard devaton or varance can be used whenever the pont-errors of the data sets have no bas and can be consdered normally dstrbuted. The mean error vector (spatal bas) s (P and Q are correspondng ponts n the two data sets): mean(e) = mean(p-q) = 1 ( P -Q) N = 1 N In the case of no pont error bas ( mean(e) = 0), the varance and standard devaton of the pont errors ( e ) are: var( e ) = 1 N e 2 ( 1.. N) SD( e ) = + 1 N e 2 ( 1.. N) (= E RMS ) Both of these measures are acceptable quantfcatons of the spatal accuracy of ponts End-ponts Lne end-ponts can be used to provde a smplfed measure of the geometrc accuracy of the lnes. End-ponts could be cross-roads and dead ends n a road network, rver meets and lakes n a rver/watercourse system or jonts and end-ponts n a tube network. If one s able to dentfy correspondng end-ponts n the reference data set and the data set of unknown spatal accuracy, t wll be straghtforward to compute a statstcal measure of the geometrc accuracy of the end-ponts usng the formulas presented above. Prevous work on quanttatve qualty assessment on the DCW was performed usng 40 evenly dstrbuted cross-roads n the road and ralroad network n the area covered by ONC G18 (the south-west coast of USA.), and usng 1: scale topographcal data (US DLG) as reference data sets (1:24000 data were used for testng vertcal accuracy). Ths work s descrbed n a DMA report (DMA 1990) Intermedate ponts As long as ntermedate ponts are not well-defned features, the only way of fndng correspondng ntermedate ponts s to search for the closest pont on the other lne. A method for determnng spatal accuracy of a lne as compared to a lne of better accuracy could then be to traverse the lne, and at regular ntervals (spacng ε) along the lne take out sample ponts, and on the bass of each of these ponts do a search for the

6 closest pont on the reference lne. At each sample pont, the dstance vector, e, to the closest pont on the reference lne s an ndcaton of the spatal accuracy of the lne at that pont, and an overall measure of lne accuracy can be calculated statstcally usng e as n the formulas presented above. Ths method has to be appled for all lnes that have correspondng lnes n the reference data set, arrvng at an overall measure of the postonal accuracy of the lnes n the data set. The choce of spacng ε could be based on the spatal accuracy of the reference data set. Snce the lnes we are nterested n do not exhbt completely random behavour, ths mples that the smaller ε that s chosen, the more strongly wll the e s of neghbourng pont samples be correlated. To get an overall statstcal measure for the data set, ε should therefore be chosen so large that the e s of neghbourng ponts can be consdered not correlated (Cov(e, e +1 ) 0). ε could be chosen to be of a hgher order of magntude than the accuracy of the reference data set. It could also be nterestng to do several calculatons based on dfferent ε s to gve an assessment of the stablty of the calculated spatal accuracy. To determne separate measures for the lne end-ponts and the nteror of the lnes, a transformaton wll have to be performed on each ndvdual lne pror to the traversal of the lne, n such a way that the end-ponts of the correspondng lnes match exactly. 3.2 Calculatng the geometrc accuracy of a lne usng bufferng The method proposed below uses bufferng of lnes and subsequent overlay analyss to gve a quanttatve assessment of the geometrc accuracy of a lne relatve to another lne (of hgher accuracy). The method should be teratve, because t wll not be possble to determne an optmal buffersze n advance (we do not yet know the spatal accuracy of the lne data set under consderaton). The sze of the frst buffer can be determned on the bass of the known spatal accuracy of the reference data (e.g. the standard devaton, SD, f that s avalable). For each teraton, the sze of the buffer could then be ncreased. 4-5 teraton wll probably be suffcent, and the process should be termnated when the results seem to stablse. Before startng the teratve process t s useful to do some statstcal calculatons on the lnes. The nterestng measure at ths pont n the process s the total length of the lnes The teratve process: For each buffersze bs : bs, { 1,2, 3,..., n} (bs s the wdth of the buffer) perform the followng 3 steps: Frst step - lne bufferng Perform a buffer operaton on each of the two lnes, X and Q, usng the buffer sze bs (resultng n a buffer 2 x bs wde). Call the resultng polygons for Xbs and Qbs.

7 Second step - overlay Perform an overlay of the two polygons Xbs and Qbs, the result beng a new polygon data set: XQbs. Thrd step - statstcs Calculate statstcs (total area, number of polygons, total permeter, permeter/area for each polygon) on XQbs for the followng stuatons: areas outsde Xbs and outsde Q bs (A( Xbs Qbs )) areas outsde Xbs and nsde Qbs (A( Xbs areas nsde Xbs but outsde Qbs (A( Xbs Qbs )) Qbs )) areas nsde Xbs and nsde Qbs (A( Xbs Qbs )) Arrvng at a measure for the geometrc accuracy of lnes The statstcs calculated n the above steps can be used to gve measures of devaton of the lne X from the lne Q. Average dsplacement A Xbs DE = bs ( Qbs) AXbs ( ) DE s the lower bound of the average dsplacement of a lne relatve to another lne (of greater accuracy n our case). Oscllaton O = ( Qbs ) # A Xbs ( ) Length X Where #A(...) s the count of areas. O s an ndcaton of the oscllaton of the lnes X and Q relatve to one another. Ths measure s most useful for «randomly» oscllatng phenomena, where t could be used as an ndcaton of bas (there would probably be a bas f the oscllaton, O, s low for randomly oscllatng lnes of dfferent accuracy). Oscllaton could also be found drectly usng X and Q, by countng the number of nodes ntroduced when overlayng the two lne data sets. O s also a measure of relatve scale for «randomly» (that s random appearance at the relevant scales) oscllatng lnear phenomena.

8 3.3 Calculatng the geometrc accuracy of lne data sets The bufferng method for calculatng the geometrc accuracy of lnes can also be appled to lne data sets. To apply the method on the data set level, all lnes must exst n both data sets (the completeness crteron). If there are lnes that only are present n one of the data sets, these wll ntroduce errors n the calculatons. In conjuncton wth spatal accuracy assessments on real lnear data sets, t s therefore mportant that an assessment of the relatve completeness of the data sets s made and used as a correcton n the method Calculatng completeness for lne data sets usng bufferng Usng an approxmate measure of geometrc accuracy of a data set (X), t s possble to make an assessment of the completeness / number of mscodngs of the X data set, as compared to the Q data set. An approxmate measure of the geometrc accuracy can be obtaned by applyng the method presented above on the complete data sets (gnorng the lack of completeness measures). The method outlned below use a combnaton of bufferng, overlay and selecton (and thnnng). Frst step - buffer Perform bufferng on both lne data sets, X and Q, usng a buffer dstance, BD, whch could be about twce as large as the geometrc accuracy measure found for data set X (for the lne-polygon alternatve presented below, a buffersze that s four tmes as large as the geometrc accuracy measure found for data set X should be used to obtan the same statstcal effect). It s necessary to choose the buffer dstance larger than the statstcal measure of the spatal accuracy (could be SD), snce SD s a sort of weghted mean. When choosng a buffer dstance twce as large as the SD for both lne data sets, we capture all errors wthn 4SD s of the reference lne. The result of ths bufferng s the data sets XB and QB. Second step - overlay Do two lne-polygon overlays: Overlay X wth QB and XB wth Q, resultng n the new mxed data sets XQB and XBQ. Thrd step - statstcs Usng XBQ, calculate the sum of the length of the lnes outsde XB and compare t to the total length of lnes n Q: length( XBQ) Completeness(X) = % length( Q) A more «exact» measure can be obtaned by usng the dentty of the lnes that are not n X, and calculate the length of the complete lnes, as opposed to the part of the lnes that do not fall wthn the buffer.

9 Usng XQB, calculate the sum of the length of the lnes outsde QB and compare t to the total length of lnes n X. Ths s a measure of the amount of mscodngs n X as compared to Q. Ths can also be done n a more «exact» way usng n the same method as descrbed above Ensurng completeness To prepare for the spatal accuracy assessment to come, all mscoded lnes n X and all lnes n Q that are not n X should be removed from the lne data sets. The lnes to be removed can be found n XBQ and XQB, descrbed above. The resultng data sets should be used n the rest of the process Assessment of the spatal accuracy of lne data sets The process for calculatng geometrc accuracy of lne data sets s exactly the same as for ndvdual lnes. It s useful to start out wth calculatng the total length of the lnes n both coverages. The (teratve) process s exactly as descrbed for sngle lnes above: 1. Lne bufferng 2. Overlay 3. Statstcs Arrvng at a measure for the geometrc accuracy of lne data sets The statstcs calculated n the above steps can be used to gve measures of the devaton between the lnes of the X and the Q data set. A lower bound on average dsplacement for complete lne data sets A Xbs DE = bs ( Qbs) AXbs ( ) DE s a lower bound on the average dsplacement of a qualty lne data set relatve to a lne data set of less accuracy. The choce of reference data set wll nfluence DE. We have chosen to use the data set wth the smallest expected total lne length as reference. If the data sets operated on s the orgnal data sets, as opposed to the completeness adjusted data sets, the results must be corrected usng the completeness measures determned above, gvng an approxmate lower bound on average dsplacement for ncomplete lne data sets. ( ) A( Xbs ) A Xbs Qbs ( 1 Completeness( X)) Qbs DE = bs ( 1 Mscondng( X))

10 3.3.5 Oscllaton O = ( Qbs ) # A Xbs ( ) Length X Where #A(...) s the count of areas. Ths s an ndcaton of the oscllaton of the lnes X and Q relatve to one another. O s most useful for «randomly» oscllatng phenomena, where t could be used as an ndcaton of bas (there would probably be a bas f the oscllaton, O, s low for randomly oscllatng lnes of dfferent accuracy). Oscllaton could also be found drectly usng X and Q, by countng the number of nodes ntroduced when overlayng the two lne data sets. 4 What s next? In ths paper we have outlned a method for quanttatvely assessng the spatal accuracy of the representaton of geographcal lnear features. The method utlses the standard GIS operatons buffer and overlay to arrve at a polygon data set that can be analysed usng smple statstcal measures (e.g. sum and count). At the tme of ths wrtng, we are about to start our accuracy analyss of the DCW data set usng these methods. The results of these practcal exercses wll become avalable to the publc n the project report. References Barnsley, M., 1988, Fractals everywhere (Academc Press). Chrsman, N., 1984, The Role of Qualty Informaton n the Long-Term Functonng of a Geographc Informaton System. Cartographca, vol. 21, no. 2/3, pp DMA, 1990, Dgtal Chart of the World - DCW Error Analyss. Prepared by Envronmental Systems Research Insttute, Inc, USA for Defense Mappng Agency, USA. Goodchld, M., and Gopal, S., 1991, Accuracy of Spatal Databases (Taylor &Francs). Langaas, S. and Tvete, H., 1994, Project Proposal: Issues of Error, Qualty, and Integrty of Dgtal Geographcal Data: The Case of the Dgtal Chart of the World. URL: «fle://lm425.nlh.no/pub/gs/dcw/qualty.ps». SDTS, 1990, Spatal Data Transfer Standard, verson 12/90. USGS.

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

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

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

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

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

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

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

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

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

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

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

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

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

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

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

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

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

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

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

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

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

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

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

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

WEI: Information needs for further analyses

WEI: Information needs for further analyses WEI: Informaton needs for further analyses Annegrete Bruvoll Senor researcher Vsta Analyss AS www.vsta-analyse.no Vsta Analyss - analyses on transport and communcaton sectors: Cost beneft analyses Publc

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

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

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

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Design of Georeference-Based Emission Activity Modeling System (G-BEAMS) for Japanese Emission Inventory Management

Design of Georeference-Based Emission Activity Modeling System (G-BEAMS) for Japanese Emission Inventory Management 1 13 th Internatonal Emsson Inventory Conference June 7-10, 2004 Clearwater, Florda Sesson 7 Data Management Desgn of Georeference-Based Emsson Actvty Modelng System (G-BEAMS) for Japanese Emsson Inventory

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

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

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

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

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

Modeling Local Uncertainty accounting for Uncertainty in the Data

Modeling Local Uncertainty accounting for Uncertainty in the Data Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

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

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Dynamic Camera Assignment and Handoff

Dynamic Camera Assignment and Handoff 12 Dynamc Camera Assgnment and Handoff Br Bhanu and Ymng L 12.1 Introducton...338 12.2 Techncal Approach...339 12.2.1 Motvaton and Problem Formulaton...339 12.2.2 Game Theoretc Framework...339 12.2.2.1

More information

Wireless Temperature Monitoring Overview

Wireless Temperature Monitoring Overview Wreless Temperature Montorng Overvew Wreless Temperature Montorng and Alerts. Your Dashboard gves you advanced montorng, alerts (SMS or Emals), graphng and PDF reports from anywhere n the world. Product

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

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

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

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

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

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

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

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

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Integrating 2D topographic vector data with a Digital Terrain Model a consistent and semantically correct approach

Integrating 2D topographic vector data with a Digital Terrain Model a consistent and semantically correct approach Integratng 2D topographc vector data wth a Dgtal Terran Model a consstent and semantcally correct approach Andreas Koch, Chrstan Hepke Insttut für Photogrammetre und GeoInformaton,Unverstät Hannover, Nenburger

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

A Robust LS-SVM Regression

A Robust LS-SVM Regression PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for

More information

Direct Projection An Efficient Approach for Datum Transformation of Plane Co-ordinates

Direct Projection An Efficient Approach for Datum Transformation of Plane Co-ordinates Drect Projecton An Effcent Approach for Datum Transformaton of Plane Co-ordnates Lars E. ENGBERG and Mkael LILJE, Sweden Key words: datum transformaton, map-grd co-ordnates. SUMMARY Lantmäteret has decded

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

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

Analysis of Non-coherent Fault Trees Using Ternary Decision Diagrams

Analysis of Non-coherent Fault Trees Using Ternary Decision Diagrams Analyss of Non-coherent Fault Trees Usng Ternary Decson Dagrams Rasa Remenyte-Prescott Dep. of Aeronautcal and Automotve Engneerng Loughborough Unversty, Loughborough, LE11 3TU, England R.Remenyte-Prescott@lboro.ac.uk

More information

ANALYSIS OF SRTM DTM METHODOLOGY AND PRACTICAL RESULTS

ANALYSIS OF SRTM DTM METHODOLOGY AND PRACTICAL RESULTS ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matères Authors ndex Index des auteurs Search Recherches Ext Sortr ANALYSIS OF SRTM DTM METHODOLOGY AND PRACTICAL RESULTS A. Koch, C. Hepke, P. Lohmann

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

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

An Accuracy Assessment Method for Geographical Line Data Sets Based on Buffering

An Accuracy Assessment Method for Geographical Line Data Sets Based on Buffering An Accuracy Assessment Method for Geographical Line Data Sets Based on Buffering Håvard Tveite, Department of Mapping Sciences, Agricultural University of Norway, POBox 5034, N-1432 Ås, Norway, email:

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

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

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

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