Structure Formation of Social Network
|
|
- Johnathan Malone
- 5 years ago
- Views:
Transcription
1 Structure Formaton of Socal Network DU Nan 1, FENG Hu 2, HUANG Zgang 3, Sally MAKI 4, WANG Ru(Ruby) 5, and ZHAO Hongxa (Melssa) 6 1 Bejng Unversty of Posts and Telecommuncatons, Chna 2 Fudan Unversty, Chna 3 Lanzhou Unversty, Chna 4 Unversty of Calforna, Berkeley, USA 5 Central Chna Normal Unversty, Chna 6 Insttute of Automaton, Chnese Academy of Scences, Chna Abstract: We consder how ndvdual s behavors affect structure formaton of socal network. A dynamc model s desgned, n whch nodes move and buld nterpersonal relatonshp wth other nodes accordng to ts personalty factor. Agent-Based modelng shows evolutonal structure wth small-world and power-law propertes. Keywords: Socal network; complex networks; Agent-Based modelng 1 Introducton Socal network s the backbone of socal relatonshp, whch s an attractng nterdscplnary research feld wthn socal scence, statstc and mathematcs [1]. The structure of socal networks has dstnct propertes from random networks and regular networks. The well-known sx-degree experment done by Mlgram n 1969 [2] revealed the astonshng short average dstance compare wth the large scale of socal network, whch depcts the small-world network [3], as well as large clusterng coeffcent 1. Besdes small-world property, many natural complex networks present scale-free dstrbuton [4], e.g. socal network, bologcal network, WWW, n whch the degree dstrbuton of network follows power-law. It s also dfferent from the sngle-scale dstrbuton n random networks and regular networks. Although several computatonal models could generate small-world or scale-free networks [3]-[5], these models do not consder detaled backgrounds of dfferent networks ownng smlar propertes. For nstance, statstcal methods have gven some common characterstc of socal network, whle what are the reasons behnd the behnd those characterstc. [6]-[8] use game theory to evaluate the nfluence on network structure by node par s game. In [9], lnks are bult mtatng socal communcaton rules wthn node par selected randomly. However, random parng methods do not consder the contnuous space-tme evoluton procedure n real socal scene. The dfferences of nodes are not consdered, ether. We desgned an evolutonary model to evaluate the nfluence of ndvdual s behavors on formaton of socal network structure, n whch personalty factor s key pont on agents movng and ntercommuncaton. 1 Large clusterng coeffcent means one nodes neghbors are more lke to connect wth each other.
2 2 Evoluton model of socal network 2.1 The weghted graph model of socal network Weghted graph G = (N, L, W) s proper to descrbe nterpersonal relatonshp wth a vew of dfferent socal ntmacy among peoples, n whch N s the set of nodes, L s the set of lnks and W s the set of weghts on lnks. We use N N adjacent matrx to represent the lnk relatonshp between nodes, n whch a j =1 f there s a lnk present between node and j, a j =0 f node and j are not adjacent. There s no self-crcle n our model, n other words, all dagonal elements of A are zero. Smlarly, we use N N weghts matrx W for weghted graph, n whch w j s the weght of the lnk connectng from node to node j. w j = 0 f node and j are not connected, and a postve nteger s assgned to w j f node and j are adjacent. Each node has three propertes: personalty, step-sze and energy. The personalty s a real number n [0, 1], whch represents how extroverted (small personalty factor) or ntroverted (large personalty factor) one acts n socal communcaton. Extroverted nodes prefer to makng new frends, whle ntroverted nodes would lke to stay wth old frends. Nodes move nsde an area wth perodc boundary and would meet other nodes 2. New lnk a j wll be bult f node and j meet each other and no lnk before them. The ntal weght s set to 1. w j wll be added by 1 3 at each tme when node and j meet each other. We gve energy factor E to node, whch wll be consumed by cost j = cost = p p when new lnk between node and j s bult. Each j j node s neghbors wll not be added f resdual energy cannot afford new lnks, then only weghts update all the tme. The cost of new lnk depends on mutual personalty factor. Extroverted people have more frends and less cost of buldng new lnk, whch follows socal common sense. 2.2 Dynamc evoluton rules Dscrete model s sutable for computer smulaton. Nodes are dstrbuted randomly n some area and move around accordng to the state of last epoch. The movng method depends on angle and step sze. new new The movng angle of node ponts to targeted poston ( x, y ) consstng of determnstc part and random part 4 as Equ.(1). The determnstc part s the weghted average poston of nearest neghbors, whch stands for the nfluence from frends. The random part, x random and y random, are the random poston nsde the area, whch expresses the desre for explorng new socal relatonshp. x y new new where = = [ p x + ( 1 p ) xrandom ] [ p y + ( 1 p ) y ] random x = wj x j wj, y = wj y j j N j N, (1) j N j N w j, and N s the set of node s nearest neghbors. The more extroverted a node s, the more randomly t moves and t would lke to make new frends. The step-sze s of node also depends on ts personalty factor p, extroverted nodes behave 2 Two or more nodes meet each other f they locate the same grd n smulaton zone. 3 Smlar count method as n [10] 4 Smlar desgn as lnear Vcsek model [11].
3 actvely n socal communcaton and take more aggressve move, as step ( 1 p ) stepmax =, (2) n whch step max s the preset maxmum step sze. 3 Smulaton of socal network formaton We ddn t gve rgorous dynamcs of the teratve model n Secton 2.2, n that t s too dffcult to deduce n mathematcal way. Instead, we use Agent-Based smulaton method nvented n 1940s, whch dd not become a conventonal method n research on socal network, dstrbuted processng, macro-economcs etc. untl 1990s subject to computaton capablty. Each agent n Agent-Based smulaton follows certan rules and move accordng to local nformaton. By lots of teraton, some statstcal result may emerge. In ths work, we use NetLogo 5, a wdely used Agent-Based tool, to smulate our model, whch can provde frendly vsualzaton. Fgure 1 shows the ntal state of once smulaton. Fgure 1 Intal state of once smulaton of 100 nodes for E =1 and Step max =5 n 30*30 perodc boundary 6 rectangle. The personalty factor p has great effects on network evoluton n our model. To llustrate an ntutve way, we present two smulaton snapshots as Fgure 2, where all p s fxed to ones and zeros. In all ones case, all the nodes prefer to stay wth ther nearest neghbors and don t lke to make new frends, so we can observe many small groups n the snapshot. The all zeros case gves the opposte phenomenon, where each node has random lnks wth others. Snce extreme cases never happen n real world, we use lmted Gaussan dstrbuton 7 nstead n later smulaton. Fgure 2 gves once smulaton snapshot wth Gaussan personalty factor, whch presents topology status between two extreme cases When an object passes through one boundary of the area, t reappears on the opposte boundary wth the same velocty. Perodc boundary condtons are partcularly useful for smulatng a part of a bulk system wth no surfaces present. 7 Ths dstrbuton s derved from a small survey over about 40 students n CSSS2008. Not strctly, of course.
4 (a) (b) Fgure 2 Evoluton snapshots wth fxed personalty factor, the other parameters are same as n Fgure 1. (a) s the snapshot n T=100 wth all p=1; (b) s the snapshot n T=100 wth all p=0. Fgure 3 Smulaton snapshot wth lmted Gaussan personalty between 0.4 and 1, the other parameters are same as n Fgure 1. 4 Results and analyss 4.1 Evaluaton metrcs for weghted graph We use specal metrcs [13][14] for weghted graph to evaluate the network structure, as well as some metrcs [15] for non-weghted graph f necessary. 1) weghted clusterng coeffcent The weghted clusterng coeffcent of node s defned as c = ( wj + wm ) 1 aj a jm am. s (k 1) j,m 2 The weghted clusterng coeffcent of whole graph s the average of all the nodes. (3)
5 C = 1 c (4) N 2) weghted dstance Frst, we defne the length l j between node and j as the recprocal of the weght, l j =1/w j. It s then possble to defne the weghted dstance d j as the smallest sum of the edge lengths throughout all the possble paths n the graph from node to j. The dstance n weghted graph can be calculated usng well-known Djkstra algorthm. 3) Degree dstrbuton The degree k of a node s the number of edges ncdent wth the node, and s defned n terms of the adjacency matrx A as k =, (5) a j j Ν where N s the set of the nearest neghbors of node. The degree dstrbuton P(k) s defned as the fracton of nodes n the graph havng degree k. 4) Strength Dstrbuton In weghted graph, the strength of node s the sum of weghts between node and ts nearest neghbors, defned as s =. (6) w j j Ν The degree dstrbuton P(s) s defned as the fracton of nodes n the graph havng strength s. 5) Weght Dstrbuton The degree dstrbuton P(w) s defned as the fracton of nodes n the graph havng strength w. 4.2 Analyss Fgure 4 shows the average dstance and clusterng coeffcent as functons of smulaton epochs. When topology become steady, we observe typcal small-world propertes wth short dstance and large coeffcent. (a) (b) Fgure 4 Small-world propertes of 500 nodes smulaton results for E =0.5, the other parameters are same as n Fgure 1. (a) Average dstance decreases wth smulaton epochs. The steady shortest path length s rather small. (b) The clusterng coeffcent does not change a lot wth smulaton epochs and remans a rather large number.
6 Fgure 5 shows the power-law dstrbuton of weghts and strength, whch becomes more clearly as ncreasng number of nodes. (a) (b) Fgure 5 Scale-free dstrbuton of (a) weghts and (b) strength when topology becomes steady, where the blue lne s the fttng power law. All the parameters are same as n Fgure 4. 5 Concluson Our work ntends to smulate the nfluence of nterpersonal relatonshp on socal network structure. We observe large clusterng coeffcent, short average dstance, and power-law dstrbuted weghts and strength, whch presents certan regular herarchy and communty structure concdng wth the real world. However, ths model s a toy rather than real research. Some assumpton s too arbtrary to convncng, such as the energy lmtaton, maxmum step sze and so on. And we dd not mplement large-scale smulaton due to the capablty of smulaton tool, so the result s not suffcent n statstcal way. Also we dd not have enough tme to valdate the communty structure and modularty [16] observed on smulaton, nor the jon-and-qut mechansm. 6 Acknowledgements Ths work was done n the Complex System Summer School (CSSS) held by Santa Fe Insttute and Insttute of Theoretcal Physcs, Chnese Academy of Scence n We thank Aaron Clauset for hs project advce. We also thank the organzers and sponsors of ths summer school. References: [1] J. Scott, Socal network analyss: A handbook, Sage, [2] Travers, Jeffrey and Stanley Mlgram. "An Expermental Study of the Small World Problem." Socometry, Vol. 32, No. 4, 1969, pp [3] D.J. Watts and S.H. Strogatz, Collectve dynamcs of `small-world' networks, Nature, vol. 393, Jun. 1998, p [4] A. Barabás and R. Albert, Emergence of Scalng n Random Networks, Scence, vol. 286, 1999, pp [5] M.E.J. Newman and D.J. Watts, Renormalzaton group analyss of the small-world network
7 model, Physcs Letters A, vol. 263, 1999, pp [6] B. Skyrms and R. Pemantle, A dynamc model of socal network formaton, Proceedngs of the Natonal Academy of Scences, vol. 97, 2000, pp [7] M.O. Jackson, A survey of models of network formaton: Stablty and effcency, Group Formaton n Economcs: Networks, Clubs and Coaltons, [8] H. Ohtsuk, C. Hauert, E. Leberman, and M.A. Nowak, A smple rule for the evoluton of cooperaton on graphs and socal networks, Nature, vol. 441, 2006, pp [9] E.M. Jn, M. Grvan, and M.E.J. Newman, Structure of growng socal networks, Physcal Revew E, vol. 64, Oct. 2001, p [10] M. L, D. Wang, Y. Fan, Z. D, and J. Wu, Modellng weghted networks usng connecton count, New Journal of Physcs, vol. 8, 2006, pp [11] A. Jadbabae, J. Ln, and A.S. Morse, Coordnaton of groups of moble autonomous agents usng nearest neghbor rules, IEEE Transactons on Automatc Control, [12] E. Bonabeau, Agent-based modelng: Methods and technques for smulatng human systems, Proceedngs of the Natonal Academy of Scences, [13] M. Barthélemy et al., Characterzaton and modelng of weghted networks, Physca A, vol. 346, Feb. 2005, pp [14] A. Barrat et al., The archtecture of complex weghted networks, Proceedngs of the Natonal Academy of Scences, vol. 101, 2004, pp [15] S. Boccalett, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, Complex networks: Structure and dynamcs, Physcs Reports, vol. 424, Feb. 2006, pp [16] M.E.J. Newman, Modularty and communty structure n networks, Proceedngs of the Natonal Academy of Scences, vol. 103, 2006, pp
Network Topologies: Analysis And Simulations
Networ Topologes: Analyss And Smulatons MARJAN STERJEV and LJUPCO KOCAREV Insttute for Nonlnear Scence Unversty of Calforna San Dego, 95 Glman Drve, La Jolla, CA 993-4 USA Abstract:-In ths paper we present
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
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 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 informationA 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 informationA 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 informationA Growing Network Model with High Hub Connectivity and Tunable Clustering Coefficient
Manuscrpt receved Aug. 23, 2007; revsed ov. 29, 2007 A Growng etwork Model wth Hgh Hub Connectvty and Tunable Clusterng Coeffcent YIHJIA TSAI, PIG-A HSIAO Department of Computer Scence and Informaton Engneerng
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 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 informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
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 informationCOMPARISON OF TWO MODELS FOR HUMAN EVACUATING SIMULATION IN LARGE BUILDING SPACES. University, Beijing , China
COMPARISON OF TWO MODELS FOR HUMAN EVACUATING SIMULATION IN LARGE BUILDING SPACES Bn Zhao 1, 2, He Xao 1, Yue Wang 1, Yuebao Wang 1 1 Department of Buldng Scence and Technology, Tsnghua Unversty, Bejng
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 informationGrowth model for complex networks with hierarchical and modular structures
Growth model for complex networks wth herarchcal and modular structures Q Xuan, Yanjun L,* and Te-Jun Wu Natonal Laboratory of Industral Control Technology, Insttute of Intellgent Systems & Decson Makng,
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 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 informationRelated-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 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 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 informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
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 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 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 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 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 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 informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
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 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 informationAn 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 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 informationFinite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c
Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2512-2520 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Communty detecton model based on ncremental EM clusterng
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 informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
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 informationNAG 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 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 informationFAST AND DETERMINISTIC COMPUTATION OF FIXATION PROBABILITY IN EVOLUTIONARY GRAPHS
FAST AND DETERMINISTIC COMPUTATION OF FIXATION PROBABILITY IN EVOLUTIONARY GRAPHS Paulo Shakaran Network Scence Center and Dept. of Electrcal Engneerng and Computer Scence Unted States Mltary Academy West
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 informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationActive 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 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 informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
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 information6.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 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 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 informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More 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 informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
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 informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationANALYSIS OF THE COMPLEX MATERIAL FLOW NETWORKS IN TYPICAL STEEL ENTERPRISE
ANALYSIS OF THE COMPLEX MATERIAL FLOW NETWORKS IN TYPICAL STEEL ENTERPRISE 1 YEQING ZHAO, 2 GUIHONG BI 1 School of Computer and Informaton Engneerng, Anyang Normal Unversty, Anyang 455002, Henan, Chna
More informationLecture 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 informationAn Overlap Communities Detection Algorithm in Asymmetric Dynamic
An Overlap Communtes Detecton Algorthm n Asymmetrc Dynamc Socal Network 1 Wang Hong-yan, 2 Jang Gan-qng, 3 Lu Yong-shan, 4 Lu Wen-yuan, 5 Chen Z-jun 1 School of Informaton Scence and Engneerng, School
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 informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
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 informationBAYESIAN MULTI-SOURCE DOMAIN ADAPTATION
BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,
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 informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationFitting: 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 informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationProblem 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 informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
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 informationParameter 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 informationApplication of VCG in Replica Placement Strategy of Cloud Storage
Internatonal Journal of Grd and Dstrbuted Computng, pp.27-40 http://dx.do.org/10.14257/jgdc.2016.9.4.03 Applcaton of VCG n Replca Placement Strategy of Cloud Storage Wang Hongxa Computer Department, Bejng
More informationAirport Runway Security Risk Evolution Model Based on Complex Network
Arport Runway Securty Rsk Evoluton Model Based on Complex Network Xanl Zhao School of Management, Wuhan Unversty of Technology, Wuhan 430070, Chna Abstract Arport runway securty rsk assessment and safety
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 informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationR 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 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 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 Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
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 informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationStudy on Properties of Traffic Flow on Bus Transport Networks
Study on Propertes of Traffc Flow on Bus Transport Networks XU-HUA YANG, JIU-QIANG ZHAO, GUANG CHEN, AND YOU-YU DONG College of Computer Scence and Technology Zhejang Unversty of Technology Hangzhou, 310023,
More informationAPPLICATION 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 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 informationS.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?
S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert
More informationTopological Analysis of Urban Street Networks
NOT FOR CITATION, TO BE PUBLISHED IN ENVIRONMENT AND PLANNING B Topologcal Analyss of Urban Street Networks B. Jang () and C. Claramunt (2) () Dvson of Geomatcs, Dept. of Technology and Bult Envronment
More informationIrregular Cellular Learning Automata and Its Application to Clustering in Sensor Networks
Irregular Cellular Learnng Automata and Its Applcaton to Clusterng n Sensor Networks M. Esnaashar 1, M. R. Meybod 1,2 1 Soft Computng Laboratory, Computer Engneerng and Informaton Technology Department
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 informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
More informationDYNAMIC NETWORK OF CONCEPTS FROM WEB-PUBLICATIONS
DYNAMIC NETWORK OF CONCEPTS FROM WEB-PUBLICATIONS Lande D.V. (dwl@vst.net), IC «ELVISTI», NTUU «KPI» Snarsk A.A. (asnarsk@gmal.com), NTUU «KPI» The network, the nodes of whch are concepts (people's names,
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationXV International PhD Workshop OWD 2013, October Machine Learning for the Efficient Control of a Multi-Wheeled Mobile Robot
XV Internatonal PhD Workshop OWD 203, 9 22 October 203 Machne Learnng for the Effcent Control of a Mult-Wheeled Moble Robot Uladzmr Dzomn, Brest State Techncal Unversty (prof. Vladmr Golovko, Brest State
More information