On the Network Partitioning of Large Urban Transportation Networks
|
|
- Laureen Collins
- 5 years ago
- Views:
Transcription
1 On the etwor Parttonng of Large Urban Transportaton etwors Hamdeh Etemadna and Khaled Abdelghany Abstract Ths paper ams at developng a traffc networ parttonng mechansm for dstrbuted traffc management applcatons. The mechansm can be used to partton a typcal urban transportaton networ such that: a) the nter-flow among the resultng subnetwors s mnmzed; b) the subnetwors are balanced n terms of ther szes/flow actvtes; and c) each subnetwor s connected. Two heurstcs are presented. The frst heurstc adopts a recursve teratve procedure to determne the networ s sparsest cuts that mantan the balance and connectvty requrements. The second heurstc adopts a greedy recursve networ coarsenng technque to determne the most flowndependent subnetwors. Parttonng result of these two heurstcs s evaluated usng hypothetcal networs wth dfferent confguratons. Keywords Dstrbuted Traffc Management, Parttonng, etwor Coarsenng, Sparsest Cut. etwor I. ITRODUCTIO RAFFIC management n large congested urban areas s Tconsderably challengng. It requres the development of traffc management capabltes that effectvely allevate recurrent and non-recurrent congeston. The evoluton of Advanced Traffc Management Systems (ATMS) over the last two decades has brought consderable attenton to the development of real-tme traffc management systems for congested urban networs. The goal s to provde roadway networ managers wth the capablty to develop effcent real-tme traffc management strateges to allevate recurrent and non-recurrent congeston stuatons. Consderable research effort has been devoted over the last two decades to study the problem of real-tme traffc networ management. A holstc approach to develop realtme management capabltes would follow a centralzed archtecture through whch the entre traffc networ s managed usng one central controller. However, the large networ szes mae t algorthmcally dffcult to develop a global optmal traffc management scheme, especally f ths scheme needs to be generated n real-tme []. In contrast to the centralzed archtecture, an alternatve approach s to adopt decentralzed traffc management archtecture [-6]. The qualty of a traffc management Hamdeh. Etemadna s wth the Penn State Unversty,Unversty Par, PA, 68 USA (correspondng author; phone: ; e- mal:hze@psu.edu ). Khaled. Abdelghany, s a Assocate Professor at Southern Methodst Unversty, Dalals TX 76 USA. He s the char of the Cvl and Envronmental Engneerng Department (e-mal: haled@psu.edu). scheme usng a dstrbuted archtecture manly depends on the boundares of the local subnetwors and ther nterfaces wth the man traffc movements n the networ. Most of the exstng research assumng that the boundares of the local subnetwors are predefned. In ths paper, we nvestgate the problem of networ parttonng to defne the optmal (near-optmal) boundares for subnetwors n dstrbuted traffc management applcatons. The paper s organzed as follows. A lterature revew of the networ partton problem s presented n the next secton. A mathematcal defnton of the networ parttonng problem s then presented n secton III. Secton IV descrbes two heurstcs that are developed to solve ths problem. The results of a set of experments and performance of the heurstcs are also presented n secton V. Fnally, summary and research extensons are dscussed n secton VI. II. LITERATURE REVIEW etwor parttonng problem has been studed over the past few decades n the graph theory lterature [7]. For example, the mnmum multcut problem, the sparsest cut problem, the α- balanced cut problem, and the bsecton cut problem are dfferent versons of the networ parttonng problem. The networ parttonng problem has been proven to be P-hard [8] and [9]. Therefore, an approxmate soluton that s based on solvng an approxmaton of the problem s proposed [8,,, ]. For example, the dual of the lnear approxmaton of the sparsest cut problem s the maxmum concurrent flow (MCF) problem []. Another approach that adopts a multlevel recursve heurstc s proposed by Hauc and Borrello [], Wchlund and Enar [4] and Karyps and Kumar [7]. The heurstc recursvely creates a coarser verson of the networ through combnng ts nodes to reduce the networ sze. A refnng strategy s then used to modfy the boundares obtaned from the coarsenng step []. Addtonal networ parttonng methodologes developed to target the data clusterng problem can be found n Asano et al. [6], Xu et al. [7], Jan and Dubes [8], Gersho and Gray [9], and Inaba et al. []. Based on ths bref survey, we cannot drectly apply the exstng approaches for the problem consdered n ths paper. III. THE MULTI-WAY BALACED ETWORK PARTITIOIG PROBLEM Gven a hghway networ G(, A), s the set of nodes and A s the set of lns. The networ s assumed to be managed by a set of dstrbuted controllers C. Each controller c C manages the traffc n a subnetwor 4
2 G c ( c, A c ), where c s the set of nodes and A c s the set of lns n ths subnetwor. Defne f j as the vehcular flow durng the horzon of nterest for ln (, j). We defne the bnary decson varable x c whch s equal to one f ntersecton belongs to subnetwor G c ( c ), and zero otherwse. Also, we defne the bnary decson varable y jc whch s equal to one f ln (, j) belongs to subnetwor G c and zero otherwse. The problem s to determne the optmal parttonng of the networ nto a predefned number of subnetwors such that the subnetwors are flowndependent. In other words, the partton mnmzes nterflow among adjacent subnetwors n order to reduce the need for traffc management schemes that requre ntensve communcaton/coordnaton among adjacent controllers. In addton, the networ parttonng should mantan a balance n terms of the amount of traffc management actvtes requred by each local controller. For nstance, the parttonng should be conducted such that the subnetwors are relatvely close n sze (spatal balance), and/or they are smlar n terms of the amount of served traffc wthn ther boundares (flow balance). The balance crteron would lely enable the decentralzed archtecture to acheve the real-tme computatonal requrement as t dstrbutes the computatonal effort, assocated wth developng the traffc management actvtes, equally among controllers. The mathematcal program gven below s used to formulate ths problem. The objectve functon mnmzes the flow on the cut lns as llustrated n (). The nteger decson varable z j defnes the assgnment of the lns to the dfferent subnetwors. It s equal to one for non-cut lns where both ntersectons and j belong to the same subnetwor ( c and j c ), and s equal to two f a ln s a cut ln ( c and j c where c c ). Constrants n () ensure that each ntersecton belongs to only one subnetwor. Constrants n () and (4) relate the decson varables X, Y, and Z. In (), the constrant ensures the connectvty of each subnetwor. We defne the parameter b mj whch s equal to one f ntersecton m falls n the magnary rectangle where ntersectons and j are two corners along ts dagonal, and m s connected to any of the ntersectons n the subnetwor that contans and j. Constrants n (6) and (7) mantan the spatal and flow balance requrements, respectvely. The parameter δ and γ defne the maxmum acceptable dfference n the szes and served flows of the resultng subnetwors. Constrants n (8) and (9) state the bnary condtons of the decson varables x c and y jc, respectvely. The decson varable z j s {, } nteger as shown n constrans (. Mnmze f j (z j ) Subject to: j j () z j = c y jc (, j) c, j, c C (4) x mc b mj x c + x jc (m,, j) c, j, c C δ x c j j f j γ j () + δ c C (6) j f j. y jc c C j j f j + γ y jc (,) (, j), j, c C (8) x c (,), c C (9) z j {, } (, j), j () IV. SOLUTIO APPROACH In ths secton, we present two heurstcs to effcently solve ths problem. We consder the case n whch the networ s requred to be parttoned nto -spatally balanced subnetwors wth a balance rato α =. Fgure llustrates the man steps of the frst heurstc (sparsest cut heurstc), whch conssts of two man teratve loops. The outer loop recursvely solves the balanced cut problem for dfferent values of the balance rato α, whle the nner loop apples a greedy procedure to obtan the balanced cut for a specfc value of α. The cut resultng from the frst teraton of the outer loop dvdes the networ nto two components wth balance rato, where the smaller component s one of the requred parttons. In the next teraton, the remanng part of the networ s parttoned usng a value of α that s equal to (. e., α = ). The process s recursvely appled untl the remanng part of the networ s dvded nto two components (α =.), mplyng that all parttons are obtaned. The nner loop s based on the wor descrbed n [7], whch mplements an teratve greedy procedure to obtan the balanced cut for a gven α. In each teraton, the all pars unt-demand sparsest cut problem s solved to determne the mnmum densty cut (.e., two components wth mnmum flow nterface) []. Comparng the szes of the resultng components, f the αbalance rato s satsfed, the smaller component s reported as one partton, and the outer loop s agan actvated to partton the remanng part of the networ wth an updated value of α. (7) c x c =, c C () y jc x c + x jc (, j) c, j, c C () 4
3 = α = α tr = = = & S = all pars unt-demand sparsest cut S, S etwor : G(, A). of Parttons : S = S S = α Partton = G, A) = G( S S, A ) ( tr tr Fgure The α-balanced mult-way parttonng The second heurstc adopts a networ coarsenng approach smlar to the one presented n []. However, the new heurstc ams at mantanng the balanced requrements for any number of parttons. It also smultaneously generates all subnetwors rather than solvng a networ bsecton problem at each teraton. The coarsenng heurstc starts by determnng a centrod node for each partton. Dfferent strateges could be used to select the centrod nodes. A search process could be actvated to dentfy nodes wth the hghest flows, and spatally dstrbuted n the networ. Startng from a centrod node and adoptng a greedy heavy ln matchng strategy, the adjacent node wth the maxmum ln flow s combned wth the centrod formng a coarser node. The networ s then updated to provde the next-level coarser networ, as llustrated n Fgure. To mantan the balance among the parttons, ths process s sequentally rotated among all centrods. The heurstcs termnates when every node n the orgnal networ s combned wth a centrod node resultng n the fnal coarsened networ. In the fnal coarsened networ each node represents a partton. Ths coarsened node s refned bac to retreve ts related subnetwor of nodes and lns. de A Centrod Before combnng node A All parttons are generated Greedy Procedure for the α- Balanced Cut + = S S = S S S > α Fgure Example of the heavy ln matchng strategy + = S After combnng node A V. RESULTS AD AALYSIS A set of experments are conducted to compare the performance of the two developed heurstcs. Table llustrates the networ parttonng results usng the two heurstcs. A hypothetcal networ wth radal topology and symmetrc flow patterns are assumed. Two dfferent ln flow patterns are consdered. The frst pattern represents the case n whch the domnant flows are along the radal corrdors n the networ, whle the second pattern consders a case n whch the domnant flows are along the networ s rng corrdors. In both cases, the domnant flow value s assumed to be fve tmes that of the flow value assgned to all other lns. The flow assgned to each ln s ndcated by ts thcness as llustrated n the gven networ setches. Total ntra-flow and nter-flow as percentages of the total ln flows are recorded. The coeffcent of varaton (CoV) wth respect to the number of nodes n the dfferent subnetwors s recorded to measure the spatal balance. Smlarly, the CoV of the subnetwors ln flows s recorded to measure ther flow balance. As shown n the table, the sparsest cut heurstc provdes the optmal parttonng pattern for all cases where the networ s symmetrcally parttoned (e.g., two, four, eght, and sxteen parttons). For the coarsenng heurstc, centrods are selected manually consderng the networ s symmetrc flow pattern. For example, n the radal flow pattern wth two parttons case, the centrods are selected on two opposte radal corrdors. As llustrated, the coarsenng heurstc s able to provde the optmal soluton for some of the tested cases. It obtans the optmal parttons for the crcular flow pattern wth two, fve, ten, and twenty parttons. However, t fals to provde the optmal soluton for some other tested cases. For example, n the case of radal flow pattern wth two parttons, whle both heurstcs acheve perfect balance, the total ntra-flow of the coarsenng heurstc s recorded to be 87.% compared to 97.% that s obtaned by the sparsest cut heurstc. The dfference n the two solutons s explaned by ther underlyng approaches. The sparsest cut heurstc prmarly searches for the mnmum cuts n the networ, whle the coarsenng heurstc searches for components wth runnng tme, the coarsenng heurstc sgnfcantly outperforms the sparsest cut heurstc n all tested cases. For nstance, n the crcular flow case wth parttons, an executon tme of.4 seconds s recorded for the maxmum flows. As shown n the twopartton case, the cut obtaned by the coarsenng heurstc s not the mnmum cut as obtaned by the sparsest cut heurstc. However, the coarsenng heurstc sgnfcantly outperforms the sparsest cut heurstc n all tested cases n runnng tme. For nstance the executon tme n the crcular flow wth parttons recorded to be.4 and.7 seconds for the coarsenng heurstc and sparsest cut heurstc, respectvely. VI. SUMMARY Ths paper presents a methodology for parttonng urban transportaton networs for dstrbuted traffc management applcatons. The methodology parttons the networ such that: a) the nter-flow among the resultng networ components s mnmzed, b) these networ components are balanced n terms of ther szes and/or traffc flows wthn ther boundares, and c) each networ component s connected. Two heurstcs 44
4 are developed. The frst heurstc adopts a recursve approach n whch the networ s parttoned along ts sparsest cuts tll the balance condton s acheved. The second heurstc adopts a greedy-based networ coarsenng methodology. The results show that both heurstcs provde optmal/near-optmal soluton qualty. Several extensons are consdered for ths research wor. For example, we wll examne the effect of adoptng the presented heurstcs on the performance of the real world transportaton networs. We wll also examne the performance of the traffc management schemes usng a dstrbuted archtecture. Fnally, we wll consder mplementng a heurstc approach that combnes the coarsenng and sparsest cut technques. The trade-off between the level of coarsenng and the qualty of the soluton wll be nvestgated. VII. REFERECES [] Peeta, S. and A. Zlasopoulos. Foundatons of Dynamc Traffc Assgnment: The Past, the Present and the Future, etwors and Spatal Economcs, Vol.,, pp. -6. [] Cuena, J., J. Hernandez, and M. Molna. Knowledge-Based Models for Adaptve Traffc Management Systems, Transportaton Research Part C: Emergng Technologes, Vol.,., 99, pp [] Hawas, Y. and H. Mahmassan. A decentralzed scheme for real-tme route gudance n congested vehcular networs, Yoohama, Japan, Proceedngs of the Second World Congress on Intellgent Transport Systems, 99. [4] Pavls, Y. and M. Papageorgou. Smple decentralzed feedbac strateges for route gudance n traffc networs, Transportaton Scence, Vol., 999, pp [] Log, F., and S. G. Rtche. A mult-agent archtecture for cooperatve nter-jursdctonal traffc congeston management, Transportaton Research C, Vol...,, pp [6] Hernandez, J., S. Ossows, and A. Garca-Serrano. Multagent archtectures for ntellgent traffc management systems, Transport Research Part C: Emergng Technologes, Vol.,, pp [7] Shmoys, D. B. Cut problems and ther applcaton to dvdeand-conquer. In Dort S. Hochbaum, Approxmaton Algorthms for P-hard Problems, 997, pp. 9. [8] Matula, D. W. and F. Shahroh. Sparsest cuts and bottlenecs n graphs. Journal of Dscrete Appled Mathematcs, Vol. 7, 99, pp. -. [9] Garey, M.R. and D.S. Johnson. Computers and Intractablty: A Gude to the Theory of P-Completeness, W. H. Freeman & Co., ew Yor, Y, 979. [] Lnal,., E. London, and Y. Rabnovch. The geometry f graphs and some of ts algorthmc applcatons. Combnatorca, Vol., 99, pp [] Garg., V. V. Vazran, and M. Yannaas. Approxmate max-flow mn-(mult)cut theorems and ther applcatons. SIAM J. Comput., : 994, pp. -. [] Rao, S. Fndng near optmal separators n planar graphs. In Proceedngs of the 8 th Annual IEEE Symposum on Foundaton of Computer Scence, 987, pp. -7. [] Hauc, S. and G. Borrello. An evaluaton of bparttonng technque. In: Proc. Chapel Hll Conference on Advanced Research n VLSI, 99. [4] Wchlund, S. and J. A. Enar. On Multlevel Crcut Parttonng. In: Intl. Conference on Computer Aded Desgn, 998. [] Karyps, G. and V. Kumar. Multlevel -way hypergraph parttonng, VLSI Desgn, Vol...,, pp.8-. [6] Asano, T., B. Bhattacharya, M. Kel, and F. Yao. Clusterng algorthms based on mnmum and maxmum spannng trees. In Proceedngs of the 4th Annual Symposum on Computatonal Geometry, 988, pp. 7. [7] Xu, Y., V. Olman, and D. Xu. Mnmum spannng trees for gene expresson data clusterng. Genome Informatcs, Vol.,, pp. 4. [8] Jan A. K. and R. C. Dubes. Algorthms for Clusterng Data. Prentce Hall, Englewood Clffs,.J., 988. [9] Gersho, A. and R.M. Gray. Vector Quantzaton and Sgnal Compresson. Kluwer Academc, Boston,99. [] Inaba, M.,. Katoh, and H. Ima. Applcatons of Weghted Vorono Dagrams and Randomzaton to Varance-Based - clusterng, Proc. th Ann. ACM Symp. Computatonal Geometry, June 994, pp. -9. [] Matula, D. W. Concurrent flow and concurrent connectvty n graphs. In: Alav, Y., et al (Ends), Graph Theory and ts Applcaton to Algorthm and Computer Scence. Wley ew Yor, Y, 98, pp
5 Table etwor Parttonng for a Radal etwor wth Two Dfferent Flow Patterns Radal Flow Pattern Coarsenng Heurstc. of Parttons: de Balance: Runnng Tme (Sec): Sparsest Cut Heurstc. of Parttons: de Balance: Runnng Tme (Sec): Crcular Flow Pattern Coarsenng Heurstc. of Parttons: de Balance: Runnng Tme (Sec): Sparsest Cut Heurstc. of Parttons: de Balance: Runnng Tme (Sec):
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 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 informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More 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 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 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 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 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 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More 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 informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More 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 informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
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 informationA 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 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 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 informationOPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET
OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor
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 informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationNeeded Information to do Allocation
Complexty n the Database Allocaton Desgn Must tae relatonshp between fragments nto account Cost of ntegrty enforcements Constrants on response-tme, storage, and processng capablty Needed Informaton to
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 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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More 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 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 informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
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 informationATYPICAL SDN consists of a logical controller in the
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 6, DECEMBER 2017 3587 Mnmzng Flow Statstcs Collecton Cost Usng Wldcard-Based Requests n SDNs Hongl Xu, Member, IEEE, Zhuolong Yu, Chen Qan, Member, IEEE,
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 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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationAn Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
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 informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationDynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution
Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan
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 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 informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More 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 informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More 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 informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
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 information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
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 informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationAn 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 informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationEfficient 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 informationDecision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing
Decson Support for the Dynamc Reconfguraton of Machne Layout and Part Routng n Cellular Manufacturng Hao W. Ln and Tomohro Murata Abstract A mathematcal based approach s presented to evaluate the dynamc
More informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationWishing 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 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 informationUC Berkeley Working Papers
UC Berkeley Workng Papers Ttle Dscretzaton and Valdaton of the Contnuum Approxmaton Scheme for Termnal System Desgn Permalnk https://escholarshp.org/uc/tem/9dm7v0cn Authors Ouyang, Yanfeng Daganzo, Carlos
More informationTwo-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture
Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software
More informationPreconditioning Parallel Sparse Iterative Solvers for Circuit Simulation
Precondtonng Parallel Sparse Iteratve Solvers for Crcut Smulaton A. Basermann, U. Jaekel, and K. Hachya 1 Introducton One mportant mathematcal problem n smulaton of large electrcal crcuts s the soluton
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More 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 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 informationUB 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 informationA SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationMultiblock method for database generation in finite element programs
Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs
More 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 informationHybrid Heuristics for the Maximum Diversity Problem
Hybrd Heurstcs for the Maxmum Dversty Problem MICAEL GALLEGO Departamento de Informátca, Estadístca y Telemátca, Unversdad Rey Juan Carlos, Span. Mcael.Gallego@urjc.es ABRAHAM DUARTE Departamento de Informátca,
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More 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 informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More information