THE DYNAMICS OF LINK FORMATION IN PATENT INNOVATOR NETWORKS

Size: px
Start display at page:

Download "THE DYNAMICS OF LINK FORMATION IN PATENT INNOVATOR NETWORKS"

Transcription

1 Perspectves of Innovatons, Economcs & Busness, Volume 4, Issue 1, 2010 wwwpebcz THE DYNAMICS OF LINK FORMATION IN PATENT INNOVATOR NETWORKS JEL Classfcatons: O31 TAMAS SEBESTYEN, ANDREA PARAG Faculty of Busness and Economcs Unversty of Pecs, Hungary Key words: Innovaton, network evoluton, knowledge-transfer, cluster Abstract: The paper presents a smple extenson of the Barabas-Albert model of network evoluton Ths model s based upon the assumpton that new lnks are formed not only accordng to the centralty of other nodes n a network but geodetc dstance s also mportant n lnk formaton Smulaton results show that f lnk formaton s based on dstance then the resultng network s more clustered than n the case of centralty beng the domnant factor n lnk formaton Our emprcal results show that n European regonal patent nventor networks dstance s a consderably more mportant factor n lnk formaton than network centralty ISSN: (onlne) (prnt) PP21-25 Introducton Networks have attracted consderable attenton n the last decades Works from a broad spectrum of scentfc research have revealed that networks n qute dverse areas of lfe (eg the lvng cells, the World Wde Web, socal relatonshp networks, etc), although dfferent at the frst sght, share some basc common propertes, among whch the most strkng s ther nvarant scale-free characterstcs (Barabas and Albert, 1999, Barabas, 2003) At the same tme the lterature on nnovaton has focused on learnng and nnovaton networks, e networks of frms, researchers, specalzed nsttutons etc It s now clear that nnovaton can be regarded as an nteractve process whch requres relatonshps between dfferent agents of the process (nnovators, frms, unverstes, venture captal, etc) In ths context one can see for example Bathelt et al, 2004; Nonaka, 1994; Lundvall and Johnson, 1994 The nteracton among networks and regonal development s also an emergent feld of research through the noton of regonal clusters whch are meant to be the drvers of nnovatveness and therefore regonal economc success (for a general overvew see eg Karlsson, 2008) These two lnes of research have been synthetsed n the area of nnovaton networks whch tres to reveal the characterstcs and dynamc patterns of such networks The work n ths feld has proceeded along two dfferent methodologcal avenues Frst, emprcal studes made consderable efforts to gan nsght nto the characterstcs of real nnovaton networks These studes however, manly due to the lack of adequate data, grasp only a statc vew of the networks n queston, ther structural characterstcs and the relatonshp between these characterstcs and ther performance (Varga and Parag, 2009; Ozman, 2006) Whle nventor networks are wdely thought to enhance regonal nnovatve capablty, there exst few longtudnal studes of formaton and evoluton over tme (Flemng at al, 2007; Ter Wall, 2008) Some focus on examnng knowledge transfer from academy to ndustry showng academc nventors to be more central and better connected than nonacademc ones (Balcon at al, 2004) Others nvestgate the separate effects of nventor agglomeraton on metropoltan patentng and the structure of socal networks lnkng nventors wthn and across metropoltan areas They fnd that the structural features of the nventve networks are less mportant agglomeratve features of metropoltan areas than agglomeraton (Lobo and Strumsky; 2008) The paper of Ejermo and Karlsson (2006) explores the structure and the strength of nterregonal nventor networks as measured by the affnty between nventors to be co-authors n patents across regons It fnds that affntes extend more often to regons whch have hgh patentng, when they have hgh R&D levels, and to those wth more unversty R&D In ths paper we focus on the lnk formaton process n evolvng networks To ths end we present a smple model settng based on the model of Barabas and Albert (1999), then we use a newly bult database n order to capture basc characterstcs of lnk formaton n evolvng patent nnovaton networks Our database covers patent statstcs of European countres through the perod between 1978 and 2005 Ths longtudnal span offers us the possblty to analyse lnk formaton processes The paper proceeds as follows Frst, we present an extended verson of the Barabas-Albert model of network evoluton and analyse some of ts man mplcatons Then we brefly descrbe our database whch gves the bass of our followng emprcal analyss A smple, but extended model of network evoluton Our baselne model, to be extended afterwards, s the model of Barabas and Albert (1999) Ths model starts from an ntal random network and adds a new node to the network n each step and a new node forms a gven number of lnks to the already exstng nodes Lnk formaton s based on the so called preferental attachment whch assures that a new node forms a lnk wth a gven node wth hgher probablty f that gven node have more lnks, e f t occupes a more central poston n the network In the termnology of network 21 Internatonal Cross-Industry Journal

2 Perspectves of Innovatons, Economcs & Busness, Volume 4, Issue 1, 2010 wwwpebcz theory the number of lnks of a gven node s called the degree of that node, so we wll refer to ths knd of preferental attachment as drven by the degree dstrbuton of the network Let us denote the degree of node n the network as D In the model of Barabs and Albert (1999) the probablty of establshng a lnk wth (already exstng) node s smply P = D D Gven ths smple rule, we can buld networks where popular nodes (e those nodes whch have more lnks) become more popular as tme passes by However, there are two mportant consderatons to be mentoned wth regards to the model above, whch lead us to the extenson of the Barabas-Albert model Frst, preferental attachment s present n the Barabas- Albert model n the formaton of the frst lnk of a new node, e ts ntal attachment to the network as a whole However, t s ambguous to what extent new nodes are nformed about the degree dstrbuton of a network In some cases t mght be a reasonable assumpton, but n other cases do not Second, gven that a node has at least one lnk, t s stll questonable f t has perfect nformaton on the degree dstrbuton of the whole network If nformaton s not perfect, t s reasonable to assume that nformaton s more profound about that local subnetwork whch surrounds the gven node Ths leads us to the concluson that n addton to the centralty of nodes, ther dstance n the network (e geodetc dstance) s an mportant factor of lnk formaton as well Based upon these consderatons we extend the Barabas- Albert model n two aspects Frst, the ntal attachment of a gven node to the network s totally random, e the frst lnk can be establshed wth any of the exstng nodes wth equal probablty All other lnks are then formed upon consderng both the centralty (degree) and (geodetc) dstance of exstng nodes We defne the attractveness of node as D N L A = α + β N 1 N 1 where D s the degree of node, L s the geodetc dstance of node from the gven (newly added) node, N s the number of nodes (the sze of the network), whereas α and β are parameters defnng the weght of degree and dstance n lnk formaton Gven the defnton of attractveness above, the probablty of establshng a lnk wth node s for the frst lnk and P 1 P = N = A A for the second and further lnks of a node In order to evaluate the dfference between the standard preferental attachment model of Barabas and Albert (1999) and the extended verson gven above, we run some benchmark smulatons and evaluated two dfferent output measures referrng to dfferent characterstcs of the emergng network, namely clusterng and entropy Clusterng coeffcent Wth a verbal defnton we can thnk of the clusterng coeffcent as a measure of how much one s frends are frends of each other (Cowan, 2005) In other words, the clusterng coeffcent s able to capture local structures n a network: hgh clusterng means dense local structures n a network The clusterng coeffcent s calculated bascally for one specfc node of the network Let s denote the neghbourhood of node by Γ In ths case the cardnalty of ths set, denoted by Γ measures the number of neghbours node has In ths neghbourhood Γ ( Γ 1) / 2 lnks can be formed at most If the number of lnks n ths neghbourhood s the hghest possble, then the clusterng coeffcent s one If there s no lnks among s neghbours, the clusterng coeffcent s zero Let I ( j, = 1 f node j n the neghbourhood of l Γ s a neghbour of tself, and I ( j, = 0 f ths s not true Ths way the clusterng coeffcent of node can be wrtten as C = I ( j, ( Γ 1) j, l Γ Γ / 2 In order to gan an aggregate measure on the level of the network, we compute the average clusterng coeffcent, whch averages C over nodes: C C = N Entropy Usng statstcal entropy we can measure to what extent a gven network s charactersed by scale-free propertes, e to what extent ts degree dstrbuton s exponental meanng that few nodes have lot of lnks whle lot of nodes have few lnks In ths paper we use the specfc relatve entropy measure descrbed by Wu et al (2007) Frst defne I as the relatve degree frequency of node : D I = D Gven ths, the absolute entropy of the gven network s E = I ln I 22 Internatonal Cross-Industry Journal

3 Perspectves of Innovatons, Economcs & Busness, Volume 4, Issue 1, 2010 wwwpebcz However, there s a maxmum and a mnmum for ths expresson Its value s maxmal when all nodes have the same number of lnks In ths case I = 1/ N for all, thus Emax = ln N The value of entropy s mnmal when the network s totally centralsed, e one node has N 1 lnks and the other nodes have only one lnk In ths case E mn = ln(4( N 1)) / 2 The value of normalsed entropy s gven by: NE max = E E max E E The value of NE s 0 when statstcal entropy s maxmal, e when the network s not centralsed (all nodes have the same number of lnks) and ts value s 1 f the entropy s mnmal, e n the case of a totally centralsed network mn Smulaton results As mentoned above, we run some benchmark smulatons wth the models above More specfcally, we run two smulatons One n whch only the degree of other nodes are consdered when establshng a new lnk (e α = 1 and β = 0 n the equaton for attractveness), and one n whch only dstance was consdered ( α = 0 and β = 1 ) The results show two mportant nsghts Frst, t becomes clear that the preferental attachment based on centralty alone s not a necessary condton for the emergence of scale-free networks A growng network n tself can be a suffcent condton leadng to scale-free networks as older nodes per defnton posess more lnks even f lnk formaton s totally random Second, and more nterestng s the result for the two output measures Our smulatons show that hgher role for degree n lnk formaton leads to less clustered networks whle the role for dstance results n more clustered networks That s, the underlyng lnk formaton process has mportant effects on the structure of the emergng network In what follows, we present an emprcal analyss of lnk formaton processes wth regards to the role of degree and dstance n patent nventor networks The database From the data of the European Patent Offce (EPO) we bult up networks of patent nventors across European regons The patent data of the EPO contan nformaton about the address of the nventors and obvously the sector to whch the gven patent belongs We took ths data from 1978 to 2005 and from ths nformaton we extracted co-nventorshps n the case of each patent and bult up the network of patent nventors In the next step ths network was aggregated nto European NUTS2 regons That s, we do not consder network of ndvduals but network of regons, however behnd ths network les the network of ndvduals Further, the network among regons s a weghted one, meanng that an edge between two dfferent regons has a weght referrng to the number of patents on whch nventors of the two regons had worked together 1 Thus we have a network of regons n whch the ntensty of nterregonal relatonshps s reflected by the number of co-nvented patents, nevertheless, the networks are constructed for every year n the perod between 1978 and 2005 The database covers the hgh-tech sector as used by the Eurostat methodology In ths classfcaton the hgh-tech sector covers three subsectors as follows: (1) avaton; (2) computer and automated busness equpment; (3) communcaton technology; (4) lasers; (5) mcro-organsms and genetc engneerng; (6) sem-conductors 2 The database s beng constructed for all European countres, however only part of the countres statstcs s already avalable thus we restrcted our analyss to the three major countres actve n the patent feld Accordng to the patent statstcs of the Eurostat, these countres are Germany, France and the Unted Kngdom, wth reference to the total number of patent applcatons to the EPO Lnk formaton n European co-nventorshp networks In order to carry out ths analyss we bult up a secondary database from the network data Every tme a new lnk was formed n the networks, two records were taken, accordng to the two nodes whch had a new lnk We put the degree of the partner and ther geodetc dstance nto each record Then, n order to yeld comparable results we calculated the rato of the degree measures to the hghest n the actual network and took the nverse of the geodetc dstance Ths way f we have a value of 1 for degree, ths means that the actual node chose the most central node n the network as partner, e the one wth the most lnks A close to zero value, n contrast, shows that a perpheral node was chosen as partner Smlarly n the case of dstance, a value of one represents the closest nodes and a close-to-zero value means a far-away node as partners 3 In our frst analyss we smply cumulated the lnks year after year, so we dsregarded those lnks whch were abandoned (n other words the network of 2005 contans all lnks formed snce 1978) In addton, we consdered the choce of only those nodes whch were not new n the networks, e they had possessed at least one lnk n the prevous year Table 1 contans our man results regardng the calculatons descrbed above The table gves the weghts of 1 Note that the weght of an edge between two regons refers not to the number of personal contacts but the number of co-nvented patents between the two regons 2 The assocated IPC codes are: (1) [B64B, B64C, B64D, B64F, B64G]; (2) [B41J, G06C, G06D, G06E, G06F, G06G, G06J, G06K, G06M, G06N, G06T, G11C]; (3) [H04B, H04H, H04J, H04K, H04L, H04M, H04N, H04Q, H04R, H04S]; (4) [H01S]; (5) [C12M, C12N, C12P, C12Q]; (6) [H01L] 3 It s mportant to note that n ordnary networks the value of 1 n the case of geodetc dstance s meanngless, because these are the neghbours of a node, thus there s no reason to make a new lnk between them In our case, however, lnks are weghted accordng to the number of cooperatons n patent-nventorshp Thus a new lnk among neghbours s acceptable and nterpreted as a more dense cooperaton between two regons 23 Internatonal Cross-Industry Journal

4 Perspectves of Innovatons, Economcs & Busness, Volume 4, Issue 1, 2010 wwwpebcz degree and dstance n new lnk formaton, accordng to the schemes gven above We can not observe substantal dfferences among the dfferent subsectors, however there s a sgnfcant dfference between the weghts of degree and dstance, showng that dstance s a more mportant decson varable than degree Ths fndng supports our remark about the mportance of dstance The overall pcture shows that geodetc dstance s the most mportant factor n lnk formaton whle degree s less mportant, although not nsgnfcant TABLE 1 THE WEIGHT OF DEGREE AND DISTANCE IN LINK FORMATION ON 1 YEAR BASE, DISREGARDING DISSOLVING LINKS Degree Dstance Avaton Computer Communcaton Laser Semconductors Mcro-Genetcs Hgh-tech In order to gve a benchmark to the fndngs above we calculated the same measures but now takng nto account dssolvng lnks as well (see Table 2) The basc dfference here s that the degree of a node can decrease over tme, whle the dstance between two nodes can ncrease due to dssolvng lnks However, the pcture s qualtatvely the same as before wth a slghtly hgher varance n the data Dfferences among subsectors are not sgnfcant and dstance seems to be the mportant choce varable As a fnal queston, t would be nterestng to see f the mportance of these decson varables changed over the years In order to tackle ths ssue, we calculated these measures for every year The basc pcture s smlar to that of presented n Tables 1 and 2, so we only nsert here the overall values for the whole hgh-tech sector TABLE 2 THE WEIGHT OF DEGREE AND DISTANCE IN LINK FORMATION ON 4 YEARS BASE, WITH DISSOLVING LINKS Degree Dstance Avaton Computer Communcaton Laser Semconductors Mcro-Genetcs Hgh-tech As t s clear from Fgure 1, dstance s nvarably the more mportant decson factor durng the years wthout remarkable trend To conclude, we observe that n our sample of nterregonal patent nventor networks geodetc dstance rather than degree seems to be the most mportant decson factor when choosng a partner, and ths pattern of lnk formaton does not change over our examnaton perod Conclusons and further avenues for research In ths paper we presented a straghtforward extenson of the Barabas-Albert model of network evoluton emphaszng the role of geodetc dstance n lnk formaton Our smulaton results show that there are ndeed mportant dfferences n the resultng network structure dependng on the lnk formaton process If dstance s more mportant n lnk formaton, the emergng networks are more clustered, whle f degree s more mportant, the resultng networks are relatvely more centralzed, e they are charactersed by more sgnfcant scale-free propertes FIGURE 1 THE EVOLUTION OF WEIGHTS FOR DEGREE AND DISTANCE IN LINK FORMATION 24 Internatonal Cross-Industry Journal

5 Perspectves of Innovatons, Economcs & Busness, Volume 4, Issue 1, 2010 wwwpebcz Our emprcal results, on the other hand, show that n the case of European patent nventor networks dstance seems to be the mportant decson varable n lnk formaton as opposed to centralty However, there are two mportant remarks Frst, these results do not state that geodetc dstance s the domnant factor n lnk formaton n all networks: n other networks dfferent factors may be mportant Second, as our database gves regonal networks of nventors, the queston arses, to what extent geography are present n our model Although geodetc and geographc dstance are not the same, they are obvously nterrelated One of the possble tasks for future research s to specfy to what extent lnk formaton depends on geographc and not geodetc dstance A straghtforward way would be to measure how much geodetc and geographc dstances are correlated However, the queston remans that whch s the cause and whch s the effect Varga, A, Parag, A, 2009 Academc knowledge transfers and the structure of nternatonal research networks, n: Attla Varga (ed), Unversty knowledge transfers and regonal development: Geography, entrepreneurshp and polcy, Edward Elgar Publshers, pp Wu, J, Tan Y-J, Deng, H-Z and Zhu, D-Z, 2007 Normalzed entropy of rank dstrbuton: A novel measure of heterogenety of complex networks, Chnese Physcs, 16, pp References Balcon, M, Bresch, S, Lsson, F, 2004 Networks of nventors and the role of academa: An exploraton of Italan patent data, Research Polcy 33, pp Barabás, A, 2003 Lnked: How everythng s connected to everythng else what t means for busness, Scence and Everyday Lfe, Pengung Group, USA Barabás, A, Albert, R, 1999 Emergence of scalng n random networks, Scence 286, pp Barabás, A, Albert, R, Jeong, H, 2000 Scale-free characterstcs of random networks: The topology of the world wde web, Physca A 281, pp Bathelt, H, Malmberg, A, Maskell, P, 2002 Clusters and knowledge: Local buzz, global ppelnes and the process of knowledge creaton, DRUID Workng Papers 02-12, DRUID, Copenhagen Busness School, Department of Industral Economcs and Strategy/Aalborg Unversty, Department of Busness Studes Ejermo, O, Karlsson, C, 2006 Interregonal nventor networks as studed by patent conventorshps, Research Polcy, Elsever, vol 35(3), pp Karlsson, C, 2008 Handbook of research on cluster theory, Edward Elgar, Chelthenham, UK Lobo, J, Strumsky, D, 2007 Metropoltan patentng, nventor agglomeraton and socal networks: A tale of two effects, Journal of Urban Economcs 63, pp Lundvall, B, Johnson, B, 1994 The learnng economy, ndustry & nnovaton, , Vol 1, Issue 1, pp Nonaka, I, 1994 A Dynamc theory of organzatonal knowledge creaton, Organzaton Scence, Vol 5, No 1, pp Ozman, M, 2006 Networks and nnovaton : A survey of emprcal lterature, Workng Papers of BETA , Bureau d'econome Théorque et Applquée, ULP, Strasbourg Ter Wal, A, 2008 Cluster emergence and network evoluton: a longtudnal analyss of the nventor network n Sopha- Antpols, Papers n Evolutonary Economc Geography, Internatonal Cross-Industry Journal

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

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

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

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

Structure Formation of Social Network

Structure Formation of Social Network 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,

More information

DYNAMIC NETWORK OF CONCEPTS FROM WEB-PUBLICATIONS

DYNAMIC 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 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

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

Load Balancing for Hex-Cell Interconnection Network

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

More information

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

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

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

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

More information

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

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

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

More information

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

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 Growing Network Model with High Hub Connectivity and Tunable Clustering Coefficient

A 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 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

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

Growth model for complex networks with hierarchical and modular structures

Growth 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 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

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User 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 information

Network Topologies: Analysis And Simulations

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 information

A NOTE ON FUZZY CLOSURE OF A FUZZY SET

A NOTE ON FUZZY CLOSURE OF A FUZZY SET (JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,

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

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. 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 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

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

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

Machine Learning: Algorithms and Applications

Machine 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 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

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

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

arxiv: v3 [physics.soc-ph] 14 Mar 2014

arxiv: v3 [physics.soc-ph] 14 Mar 2014 Structural measures for multplex networks arxv:1308.3182v3 [physcs.soc-ph] 14 Mar 2014 Federco Battston, 1 Vncenzo Ncosa, 1, 2 1, 2, 3 and Vto Latora 1 School of Mathematcal Scences, Queen Mary Unversty

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

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

Hierarchical clustering for gene expression data analysis

Hierarchical 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 information

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

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

More information

Load-Balanced Anycast Routing

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

More information

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

Signature and Lexicon Pruning Techniques

Signature and Lexicon Pruning Techniques Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

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

More information

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

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

Module Management Tool in Software Development Organizations

Module 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 information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation 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 information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A 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 information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

A Topology-aware Random Walk

A 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 information

CMPS 10 Introduction to Computer Science Lecture Notes

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

More information

Professional competences training path for an e-commerce major, based on the ISM method

Professional competences training path for an e-commerce major, based on the ISM method World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng

More information

Report on On-line Graph Coloring

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

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua 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 information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts

More information

Modelling a Queuing System for a Virtual Agricultural Call Center

Modelling a Queuing System for a Virtual Agricultural Call Center 25-28 July 2005, Vla Real, Portugal Modellng a Queung System for a Vrtual Agrcultural Call Center İnc Şentarlı, a, Arf Orçun Sakarya b a, Çankaya Unversty, Department of Management,06550, Balgat, Ankara,

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

UB at GeoCLEF Department of Geography Abstract

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

More information

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

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

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

Measuring Integration in the Network Structure: Some Suggestions on the Connectivity Index

Measuring Integration in the Network Structure: Some Suggestions on the Connectivity Index Measurng Integraton n the Network Structure: Some Suggestons on the Connectvty Inde 1. Measures of Connectvty The connectvty can be dvded nto two levels, one s domestc connectvty, n the case of the physcal

More information

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

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

More information

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

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

More information

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

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

Machine Learning. Topic 6: Clustering

Machine 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 information

EXTENDED BIC CRITERION FOR MODEL SELECTION

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

More information

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

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

A Clustering Algorithm for Chinese Adjectives and Nouns 1

A Clustering Algorithm for Chinese Adjectives and Nouns 1 Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

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

More information

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

Hermite Splines in Lie Groups as Products of Geodesics

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

More information

Machine Learning 9. week

Machine 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 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

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Study on Properties of Traffic Flow on Bus Transport Networks

Study 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 information

Dependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples

Dependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples Australan Journal of Basc and Appled Scences, 4(10): 4609-4613, 2010 ISSN 1991-8178 Dependence of the Color Renderng Index on the Lumnance of Lght Sources and Munsell Samples 1 A. EL-Bally (Physcs Department),

More information

A fair buffer allocation scheme

A fair buffer allocation scheme A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres

More information

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

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

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

On the Virtues of Parameterized Uniform Crossover

On the Virtues of Parameterized Uniform Crossover On the Vrtues of Parameterzed Unform Crossover Wllam M. Spears Naval Research aboratory Washngton, D.C. 20375 USA spears@ac.nrl.navy.ml Kenneth A. De Jong George Mason Unversty Farfax, VA 22030 USA kdejong@ac.gmu.edu

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

This module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics

This module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics Ths module s part of the Memobust Handbook on Methodology of Modern Busness Statstcs 26 March 2014 Theme: Donor Imputaton Contents General secton... 3 1. Summary... 3 2. General descrpton... 3 2.1 Introducton

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

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite 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 information

AADL : about scheduling analysis

AADL : 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 information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP 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 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

Future Generation Computer Systems

Future Generation Computer Systems Future Generaton Computer Systems 29 (2013) 1631 1644 Contents lsts avalable at ScVerse ScenceDrect Future Generaton Computer Systems journal homepage: www.elsever.com/locate/fgcs Gosspng for resource

More information

PRÉSENTATIONS DE PROJETS

PRÉSENTATIONS DE PROJETS PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng

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

Modular PCA Face Recognition Based on Weighted Average

Modular PCA Face Recognition Based on Weighted Average odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

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

Available online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )

Available 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 information

Topological Analysis of Urban Street Networks

Topological 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 information

Adjustment methods for differential measurement errors in multimode surveys

Adjustment methods for differential measurement errors in multimode surveys Adjustment methods for dfferental measurement errors n multmode surveys Salah Merad UK Offce for Natonal Statstcs ESSnet MM DCSS, Fnal Meetng Wesbaden, Germany, 4-5 September 2014 Outlne Introducton Stablsng

More information