Cell Count Method on a Network with SANET
|
|
- Maude Mabel George
- 5 years ago
- Views:
Transcription
1 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 , Japan *atsu@ua.t.u-tokyo.ac.jp **shno@ua.t.u-tokyo.ac.jp Aug, 2003 Abstract Ths paper frst proposes a cell count method defned on a network, called the network cell count method, as an extenson of the ordnary cell count method defned on a plane. Second, the paper develops a user-frendly tool for the network cell count method n conjuncton wth a general toolbox for spatal analyss on a network, called SANET. Thrd, the paper shows an actual applcaton of the network cell count method to the dstrbuton of retal stores n Shbuya, Tokyo. Key words: cell count method, network, toolbox, software, SANET, GIS 1
2 1. Introducton Ths paper has two objectves. The frst objectve of ths paper s to propose a new cell count method, called the network cell count method, as an extenson of the ordnary cell count method (or the quadrat method). The second objectve s to develop a user-frendly tool for the network cell count method, and ncorporate t nto a toolbox called SANET, a general GIS software package for spatal analyss on a network. The cell count method s one of the most classc methods for pont pattern analyss (Baley and Gatrell, 1995; Cresse, 1993; Upton and Fngleton, 1985). Ths cell count method ordnarly makes the followng assumptons. Assumpton : Geographcal space s represented by a plane. Assumpton : The plane s homogeneous,.e., the probablty of a pont beng placed on a unt area s nvarant regardless of the locaton of the unt area on the plane. There may be some actual cases n whch these assumptons hold or approxmately hold. For example, (Matu, 1932) examned the scattered vllage (houses are scattered) on the Tonam plan, whch appears to be a farly homogeneous plane. However, when we examne the dstrbuton of features n an urbanzed area, the above assumptons are hard to accept. For example, consder the dstrbuton of beauty parlors n Shbuya, one of the sub-centers n Tokyo, whch s shown n Fgure 1. As s seen n ths fgure, the beauty parlors are located along streets, and the dstrbuton of beauty parlors seems to be strongly constraned by the street network. Ths suggests us to replace Assumpton wth the followng assumpton. Assumpton : Geographcal space s represented by a network. As a consequence of ths assumpton, we assume a heterogeneous space n the sense that the space s not sotropc. As a matter of fact, drecton s restrcted along a path of a network. However, we assume a homogeneous space n the followng sense (.e. a network verson of Assumpton ). Assumpton : The network s homogeneous n the sense that the probablty of a pont beng placed on a unt lne segment s nvarant regardless of the locaton of the unt lne segment on the network. 2
3 Obvously ths assumpton s unrealstc to deal wth the dstrbuton of features n an urbanzed area, but ths assumpton s easly relaxed n a network space through the unform network transformaton. Ths transformaton s the topc of the next secton. Fgure 1: Beauty parlors n Shbuya, Tokyo 2. Unform network transformaton A heterogeneous network, N, s represented by a densty functon defned on lnks of the network. To be explct, let D be the densty of the th lnk of the network, and L be the length of the th lnk. Then the heterogeneous network means that D vares from lnk to lnk; the homogeneous network (Assumpton ) s wrtten as D = c for = 1,, n. Note that the locaton of a pont, p, on the th lnk can be dentfed by the path length, t, from an end pont of the th lnk to the pont p along the th lnk. * Let us now consder a new network, N, by replacng the th lnk wth the new th lnk and we correspond a pont p at t on the th lnk to the pont p at s on the new th lnk n such a way that the path length, s, from an end pont of the new th lnk to the pont p along the new th lnk s gven by s = t 0 D dx. 3
4 Note that the ntegraton s done wth respect to x along the th lnk. Ths transformaton mples that the th lnk of length L s replaced wth the new th lnk of length D L. The new network obtaned from the above transformaton has a nce property. Notcng that the total quantty on the th lnk s gven by L 0 D dx = D L, and that the length of the new th lnk s D L, we obtan the densty of the new th lnk s D L /( D L ) = 1. Ths equaton hold for all lnks. Ths means that the transformed network N* s homogeneous as n Assumpton. We refer to the above transformaton as the unform network transformaton (Okabe, 2002). We can easly deal wth a heterogeneous network by transformng t nto a homogeneous network through the unform network transformaton. 3. Cell count method Let us consder a network, L, consstng of lne segments that are connected. We decompose the network L nto a set of sub-networks (called cells) satsfyng that the length of each sub-network s the same, c, and each sub-network s connected. In practce, however, ths decomposton s mpossble except for very specal cases, because the total length dvded by c s not nteger n general. PC Notcng ths fact, we consder two types of cells: proper cells, L { L1,, L n } IC mproper cells, { L L } L n+ 1,, n+ n * =, and =. The former cells are used for cell countng, but the latter cells are perpheral cells not used for cell countng. We suppose that these cells satsfy the followng condtons. () L s connected n the sense that for any par of ponts on L, there exsts a path between these ponts that s ncluded n L ( = 1,, n + n* ). 4
5 () Proper cells L,, L have the same sze,.e. 1 n L = c for = 1,, n, where L denotes the length of L. () The sze of the mproper cells L n+ 1,, L n + n* s smaller than that of the proper cells,.e. L < c for = n + 1,, n + n*. (v) The unon of the proper cells and the mproper cells cover the whole network L,.e. PC IC n n+ n* L = L L = [ L ] [ L ]. = 1 = n+ 1 (v) Cells do not ntersect each other except at boundary ponts,.e. L L = 0 for j,, j = 1,, n + n *. j We make fve remarks on ths decomposton. Frst, ths decomposton s not unque. There are many ways of decomposton satsfyng the above condtons. Second, the shape of cells s not the same, because a gven network L s not regular. Ths contrasts to the planar case where the shape s the same (usually squares) for all cells. Thrd, t s very dffcult to control the shape of cells, but the shape should be as compact as possble. Forth, the length of the mproper cells should be as small as possble. Last, mproper cells should not appear nsde a network. In the planar case, mproper cells appear only on the perphery, but n the network case, mproper cells may appear nsde a network. We call such cells hole cells. It s not easy to avod hole cells n decomposng a network, and we shall dscuss ths problem n Secton 5. The dea of the network cell count method s the same as that of the planar cell count 5
6 PC n method. Suppose that we observe m ponts dstrbuted on the network = L ], L [ = 1 and we want to test the null hypothess that the m ponts are randomly dstrbuted on PC n the network = L ] accordng to the unform dstrbuton, L [ = 1 f 1 L PC ( x) =, x L. PC We can test ths hypothess usng the goodness-of-ft test. To be explct, let observed number of cells that contans exactly j ponts, except for N k. observed number of cells that contan k or more ponts. Let N j be N k s the P j be the probablty that j ponts are placed n a cell under the above null hypothess, whch s gven by the bnomnal dstrbuton or the Posson dstrbuton for a large number of ponts. Thus we can test the null hypothess wth the test statstc k 2 χ = = 1 2 ( np N). np 4. SANET We develop a user-frendly tool for achevng the network cell count method defned above and nclude t n a general toolbox for spatal analyss on a network, called SANET (Okabe, Okunuk and Funamoto, 2002). SANET conssts of two components. The frst component s a software package for computng methods for spatal analyss on a network. We can nterface ths package wth a vewer of GIS through nput and output fles. The computaton n ths software package s ndependent of a vewer of GIS, and so we can use any vewer. The second component s an nterface wth a vewer of GIS, and ths nterface depends on a vewer of GIS. We use ArcVew8.x., and we have developed the nterface that commute data between the network computaton software package and ArcVew8.x. SANET s under development but the frst verson was released n November, The frst verson provdes the followng seven tools: Tool 1: Constructon of dataset for SANET. Tool 2: Access pont assgnment. 6
7 Tool 3: Table calculaton. Tool 4: Generaton of the network Vorono dagram (Okabe, Boots, Sughara and Chu, 2000). Tool5: Generaton of random ponts on a network (for Monte Carlo smulatons). Tool 6: Cross K-functon method (Okabe and Yamada, 2002). Tool 7: K-functon method (Okabe and Yamada, 2002; Yamada and Thll, 2002). SANET s open to non-proft users wthout charge and t can be downloaded from the SANET ste: Ths paper adds the cell count method to SANET as the eghth tool. The cell count method uses Tool 1 for convertng the network data format n the network computaton software package to data format of ArcVew8.x. It also uses Tool 2 for assgnng the representatve ponts of polygon-lke features, such as beauty parlors, to the nearest ponts on a network (whch may be regarded as entrances of the facltes). By ths assgnment, we can use the cell count method that assumes that ponts are dstrbuted over the network. 5. Computatonal method for the cell count method The computatonal method s farly complex and techncal and so we only outlne the algorthm n ths secton. In the frst step, we choose a node of a network around the center of the network. We call the node the root node. In the second step, we construct the extended shortest-path tree rooted at the root node. The extended shortest-path tree s obtaned from the ordnary shortest-path tree n the followng manner. The ordnary shortest-path tree does not cover the whole network. We call the lnks that are not ncluded n the ordnary shortest-path tree collson lnks. On each collson lnk, we can fnd such a pont, c, that the shortest-path dstance from the pont to the root node through one end node of the collson lnk s the same as the shortest-path dstance from the pont c to the root node through the other end node of the collson node. We call the pont c a collson pont. We cut the network at all collson ponts and add nodes on both cut ends. We call the resultng tree the extended shortest-path tree. Once we obtan the shortest-path tree, we can easly obtan the shortest-path from 7
8 any pont on the network to the root node. In the thrd step, we construct a tree rooted at the root node whose total length s a gven dstance. We next construct a tree rooted at each end node of the tree whose total length s a gven dstance. If we cannot construct such a tree, we leave t. We contnue ths procedure untl when we cannot construct trees. Then we obtan a set of trees that are ncluded n the network and the length of each tree s the same. We may use the resultng trees as cells. However, these cells are lkely to produce the holes cells n the network. The last step s to put out these hole cells to the perphery of the network. Ths part s too lengthy to explan, and so t s omt here. 6. An Applcaton Havng establshed the network cell count method and ts software package, let us show an actual example. The study regon s part of Shbuya, one of the sub-centers n Tokyo, and the street network s shown by colored lnes n Fgure 2. Fgure 2: Retal stores assgned to the street network n Shbuya, Tokyo (cells are ndcated by dfferent colors) Frst we decompose the street network nto cells. In Fgure 2, the cells are ndcated 8
9 by dfferent colors. The yellow lnes are mproper cells. Second, we assgn retal stores to the nearest ponts on the network (whch may be regarded as the entrances of the stores). The ponts n Fgure 2 show the assgned retal stores on the street network. Thrd, the tool counts the number of retal stores n each cell and shows the numbers of cells havng ponts as n Fgure 3. Fgure 3: The number of cells havng ponts Last we apply the goodness-of-ft test to the data shown n Fgure 4. The test rejects the null hypothess, mplyng that the retal stores are non-randomly dstrbuted n Shbuya. 7. Concludng remarks In ths paper we have proposed the network cell count method as an extenson of the ordnary cell count method defned on a plane and developed a tool for the network cell count method. Compared wth the ordnary cell count method, the proposed network cell count method has a few advantages. Frst, the network space s more natural to deal wth the dstrbuton of features n an urbanzed area than a homogeneous plane. Second, t s easy to treat heterogenety wth the unform network transformaton. For example, t s 9
10 easy to treat the dstrbuton of stores n relaton to the dstrbuton of populaton. One mght consder that the results obtaned from the ordnary cell count method are not so dfferent from those obtaned from the network cell count method. We compared these results n a few actual examples and found that ths dfference was sgnfcant. We wll further examne ths comparson usng many cases and we wll report the results n another occason. Acknowledgements We express our thanks to Yasush Asam, Yuko Sadahro and Ke-ch Okunuk for ther comments on earler drafts. Ths study was part of the outcomes of the Grant-n-ad project "Spatal Informaton Scence for Human and Socal Scences" supported by the Japanese Mnstry of Educaton and Scence. References Baley, T. and Gatrell, A. (1995) Interactve Spatal Analyss, London: Longman. Cresse, N. (1993) Statstcs for Spatal Data, New York: Wley. Matu, I. (1932) Statstcal study of the dstrbuton of scattered vllages n two regons of the Tonam plan, Toyama prefecture, Japanese Journal of Geology and Geography, 9, Okabe, A. (2002) Unform network transformaton for spatal analyss on a heterogeneous network, CSIS Dscusson Paper #51. Okabe, A., Okunuk, K. and Funamoto, S. (2002) SANET: A Toolbox for Spatal Analyss on a Network, Center for Spatal Informaton Scence, Unversty of Tokyo. Okabe, A., Boots, B., Sughara, K. and Chu, S. N. (2000) Spatal Tessellatons: Concepts and Applcatons of Vorono Dagrams, (2 nd edton), Chchester: John Wley. Okabe, A. and Yamada, I. (2001) The K-functon method on a network and ts computatonal mplementaton, Geographcal Analyss, Vol.33, No.3, pp Upton, G. and Fngleton, B. (1985) Spatal Data Analyss by Example, Chchester: Wley Yamada, I. and Thll, J-C. (2002) An Emprcal Comparson of Planar and Network K-functon Analyses, Abstract, AAG Annual Meetng, Los Angeles, CA. 10
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 informationSteps 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 informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationX- 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 informationParallelism 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 informationSubspace 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 informationTN348: 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 informationAssignment # 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 informationSupport 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 informationTECHNIQUE 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 informationC2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis
C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent
More informationSum 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 informationAPPLICATION 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 informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationSmoothing 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 informationS1 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 informationUC Berkeley Working Papers
UC Berkeley Workng Papers Ttle Dscretzaton and Valdaton of the Contnuum Approxmaton Scheme for Termnal System Desgn Permalnk https://escholarshp.org/uc/tem/9dm7v0cn Authors Ouyang, Yanfeng Daganzo, Carlos
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationFor 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 informationContent 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 informationAn Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane
An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola
More informationA 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 informationComplex 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 informationHermite 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 informationAn 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 informationSynthesizer 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 informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationProblem 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 informationClassifier 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 informationOn 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 informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationHelsinki 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 informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationFEATURE 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 informationEmpirical 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 informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationThe 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 informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationAnalysis of Malaysian Wind Direction Data Using ORIANA
Modern Appled Scence March, 29 Analyss of Malaysan Wnd Drecton Data Usng ORIANA St Fatmah Hassan (Correspondng author) Centre for Foundaton Studes n Scence Unversty of Malaya, 63 Kuala Lumpur, Malaysa
More informationCompiler 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 informationLoad 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 informationSLAM 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 informationMultiblock method for database generation in finite element programs
Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs
More informationSolutions 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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationK-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 informationRange 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 informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationIntra-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 informationOptimization 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 informationTerm 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 informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationLoad-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 informationLine geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.
De Lnengeometre nach den Prnzpen der Grassmanschen Ausdehnungslehre, Monastshefte f. Mathematk u. Physk, II (89), 67-90. Lne geometry, accordng to the prncples of Grassmann s theory of extensons. By E.
More informationOutline. 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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationQuality 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 informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationy 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 informationCS 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 informationMathematics 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 informationAvailable online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc
More informationImprovement 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 informationProgramming 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 informationFeature 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 informationTopology 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 informationUnsupervised 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 informationAn 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 informationLearning-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 informationData structures and algorithms to support interactive spatial analysis using dynamic Voronoi diagrams. Abstract
Data structures and algorthms to support nteractve spatal analyss usng dynamc Vorono dagrams Mark Gahegan *a and Ickja Lee b a Department of Geography, The Pennsylvana State Unversty, Walker Buldng, Unversty
More informationCluster 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 informationUNIT 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 informationIntroduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time
Lesle Laports e, locks & the Orderng of Events n a Dstrbuted Syste Joseph Sprng Departent of oputer Scence Dstrbuted Systes and Securty Overvew Introducton he artal Orderng Logcal locks Orderng the Events
More informationCourse 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 information2x 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 informationLearning 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 informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationLecture #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 informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationHybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationThe 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 informationChapter 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 informationThe 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 informationNUMERICAL 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 informationLecture 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
More informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationUnsupervised 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 informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationMULTISPECTRAL 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 informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationProper 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 informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationUSING 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 informationData 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 informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More information