UrbaWind, a Computational Fluid Dynamics tool to predict wind resource in urban area
|
|
- Morgan Farmer
- 5 years ago
- Views:
Transcription
1 UrbaWnd, a Computatonal Flud Dynamcs tool to predct wnd resource n urban area Karm FAHSSIS a, Gullaume DUPONT a, Perre LEYRONNAS a a Meteodyn, Nantes, France Presentng Author: Karm.fahsss@meteodyn.com, Tel: Correspondng Author: Gullaume.dupont@meteodyn.com, Tel: Abstract: Computatonal Flud Dynamcs (CFD) s already a necessary tool for modelng the wnd over complex rural terrans. In order to maxmze energetc yeld and optmze the costs, before nstallng the wnd energy systems, a good knowledge of wnd characterstcs on ste s requred. Meteodyn has developed UrbaWnd, whch s an automatc CFD software for computng the wnd n urban envronment for small wnd turbnes. Compared to rural open spaces, the geometry n urban areas s more complex and unforeseeable. The effects created by the buldngs, such as vortexes at the feet of the towers, Ventur effect or Wse effect, make the modelng of urban flows more dffcult. The model used n UrbaWnd allows to take these effects nto account by solvng the equatons of Flud Mechancs wth a specfc model that can represent the turbulence and the wakes around buldngs as well as the porosty of the trees and the effects of the ground roughness (asphalt, water or grass). In order to valdate UrbaWnd s results, dfferent study cases proposed by the Archtectural Insttute of Japan have been set up. The three selected cases have an ascendng complexty, from the smple block to the complete rebuldng of a quarter of the Japanese cty of Ngata. The results valdate UrbaWnd as well for theoretcal cases as for real cases by offerng a mnor error margn on the wnd speed predcton. Keywords: Wnd modelng, CFD, urban wnd energy 1.1 INTRODUCTION In order to valdate UrbaWnd s results, dfferent study cases based on practcal uses proposed by the Archtectural Insttute of Japan [1] have been set up. The three selected cases have an ascendng complexty, from the smple block to the complete rebuldng of a quarter of the Japanese cty of Ngata. These publshed cases allowed to compare the computatons results of UrbaWnd wth the measurements of the AIJ. Therefore, the stes have been recreated n a fle format that can be used by UrbaWnd and the condtons taken for the CFD computatons are as smlar as possble to the experments condtons. The values obtaned by the computatons are then compared wth the measured values. At frst a graphcal comparson s done by placng the ponts n a graph wth the computed values n ordnate and the measured values n abscse (regresson lne). Statstcal ndcators of the results accuracy are proposed as followed: 1
2 The error, calculated by the formula: The determnaton coeffcent R², whch corresponds to the square of the Pearson product-moment correlaton coeffcent : Ths last value s the square of the covarance of the reduced centered varables. Its value s between 0 and 1. The value 0 means a total ndependence between both varables. In these equatons as well as n the whole document, y corresponds to the computed values and x to the measured values, both normalzed. In every case, results are consdered for all ponts n a frst tme and only for consstent ponts n a second tme. For the consstent ponts, we exclude all the very low speed ponts, whch lead to the bggest error and for whch a great accuracy s not requred when consderng the nstallaton of wnd turbnes. The dfference between the results obtaned for both all ponts and consstent ponts s summarzed n a table n the concluson. 1.2 DESCRIPTION OF THE CFD CODE URBAWIND The Equatons UrbaWnd solves the equatons of Flud Mechancs,.e. the averaged equatons of mass and momentum conservatons (Naver-Stokes equatons). When the flow s steady and the flud ncompressble, those equatons become: u x u u x 0 P x x u x u x u' ' u F 0 (1) (2) The turbulent fluxes are parameterzed by usng the so-called turbulent vscosty. The turbulent vscosty µ s consdered as the product of a length scale by a speed scale whch are both characterstc lengths of the turbulent fluctuatons. The speed scale s gven as the square root of the turbulent knetc energy multpled by the densty. The turbulent knetc energy s solved usng the transport equaton by ncludng the producton and dsspaton terms of the turbulence where the turbulent length scale L T vares lnearly wth the dstance at the nearest wall (ground and buldngs). Boundary condtons are automatcally generated. The vertcal profle of the mean wnd speed at the computaton doman nlet s gven by the logarthmc law n the surface layer, and by the Ekman functon [2]. A Blasus -type ground law s mplemented to model frctons (velocty components and turbulent knetc energy) at the surfaces (ground and buldngs). 2
3 The effect of porous obstacles s modeled by ntroducng a snk term n the cells lyng nsde the obstacle: F V. Cd. U. U (3) Mesh generaton Ths meshng s generated by followng the computed wnd drecton. The sze of the computaton doman s automatcally generated so that the mnmum dstance between a buldng and a boundary condton s equal to 6 tmes the heght of the hghest buldng of the smulaton. The generated meshng s Cartesan and unstructured (usng of overlapped meshng), wth automatc refnement near the ground, obstacles and of course at result ponts locatons. For ths study, the vertcal mesh dmenson around the blocks n the two frst cases (smple block and group of blocks) has been taken equal to 20 cm. The mesh dmenson for the case of Cty of Ngata was 50cm n the horzontal and vertcal drectons for the refned cells around the buldngs MIGAL-UNS Solver DESCRIPTION The MIGAL-UNS solver has been regularly used for some years now, and has already been fully valdated on number of academc cases [3]. MIGAL s an teratve lnear equatons solver whch updates smultaneously the wnd speed components as well as the pressure on the whole computatonal doman, so-called coupled resoluton. Ths method demands more storage capacty, but t has the advantage to dramatcally ncreasng the convergence process. The dscretzed equatons lnear system, s transformed va an ncomplete LU decomposton ILU(0) [4]. A precondtoner of type GMRES s used n order to ncrease the terms n the man dagonal so that the solvng robustness s mproved. Moreover, MIGAL uses a mult-grd procedure whch conssts n solvng successvely the equatons on dfferent grd levels (from the fner one to the coarser one). Ths method accelerates the convergence of the low frequency errors, whch are known to be the lmtng factor n the convergence process. For the type of problem solved here, dfferent tests have shown a better convergence for the V cycles method than for the W cycles method. The number of grd levels s automatcally computed by MIGAL REFINEMENT STRATEGY: ALGORITHM OF AGGLOMERATION For the mult-grd computaton, MIGAL-UNS uses an agglomeraton method whch ons together and agglomerates control volumes near the fne grd. Ths process s executed recursvely untl havng generated a whole sequence of coarse meshes. Once the grd herarchy s defned, one stll has to determne how the equatons are created on the coarse meshes and how ther solutons wll be used n order to decrease the errors of long wavelengths on the fnest grds. 3
4 MIGAL employs a Galerkn s proecton method for generatng the equatons on the coarse grd. Ths technque, so-called "Addtve Correcton Mult-grd" conssts n generatng the equaton of the coarse mesh as the sum of the equatons of each correspondng fne cell. Once the soluton s obtaned on the coarse grd, t s ntroduced by correctng the values calculated prevously on the fne grd wth the calculated error. 1.3 THEORETICAL CASES: SIMPLE BLOCK AND GROUP OF BLOCKS Descrpton The frst study has been done on a square tower of 20 m hgh wth a base of 10 m by 10 m. A wnd wth a drecton of 270 s appled and the computatons are done on the result ponts spread n two plans: a vertcal plan located on x=0, whch cut a tower on ts mddle. The second studed ste s bult up of 8 blocks of 20 m of edge and an empty space n the center. The computatons are done wth a wnd comng from the West (blue arrow) and the result ponts are located around the central empty space at two meters hgh, lke shown n the fgure Results SIMPLE BLOCK Fgure 1 : Results ponts, z=2m The speed-up coeffcents of the computaton have been compared to the coeffcents obtaned by the expermental measurements. In the followng fgure 2, the computed values functons of the measured values for consstent ponts have been represented. Table 1: Comparson Computatons vs. Measurements for the smple block Frst case Smple Block Error R 2 For all ponts 5.5% 0.92 For the consstent ponts 4.9%
5 Computed speed-up factor Computed speed-up factor 1 0,9 0,8 0,7 0,6 0,5 0,4 0,3 0,2 0, ,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 Measured speed-up factor Err = 4,9% R² = 0, GROUP OF BLOCKS Fgure 2: Frst case, horzontal at z=1,25m, consstent ponts The speed-up factors of the computaton have been compared wth the speed-up factors obtaned by the expermental measures. In the followng fgure 3, the computed values functons of the measured values for consstent ponts have been represented. Table 2: Comparson Computatons vs. Measurements for the group of blocks Frst case Group of Blocks Error R 2 For all ponts 8.5% 0.70 For the consstent ponts 5.8% ,9 0,8 0,7 0,6 0,5 0,4 0,3 0,2 0,1 0 Err= 5,8% R² =0,71 0 0,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 Measured speed-up factor Dscusson Fgure 3: Second case, group of blocks, consstent ponts The error (5.5% n average for all ponts and 4.9% when selectng only the consstent ponts) and the determnaton coeffcent allow to confrm the accuracy of UrbaWnd s results for ths frst case. We can observe that the results provded by the software UrbaWnd are very good 5
6 for most of the ponts. Only a few ponts are far from the lnear regresson curve. These dfferences have several explanatons. At frst most of the ponts correspond to low wnd speeds. The dfferences of values are thus proportonally bgger than for hgher wnd speeds. Furthermore, by vsualzng these ponts, we can notce that these ponts are n general near the walls n areas where bg speed dfference can exst between ponts that are very near. Ths explans that the computaton results can be dfferent wthout necessarly castng doubt on the general aspect of the smulaton. A 2D map of the mean acceleraton around the structure has been represented n the fgure 4. The worst ponts are ndcated n red n the fgure. Fgure 4: Second case, vsualzaton We can notce that the less consstent ponts are the ponts located n the areas where the mean acceleraton s near zero. As all the CFD models, t s n the area near the onng dstance that the results are the most dffcult to reproduce. Thus, for both theoretcal cases, the underestmaton of these low values does not cast doubt on the relevance of the computaton. Moreover one can observe a value of the error whch s equal to 4.9% for the frst case and 5.8% for the second case when selectng only the consstent ponts, whch valdates partly the results provded by UrbaWnd n both cases. 1.4 PRACTICAL CASE: QUARTER OF NIIGATA (JAPAN) Descrpton The last study has been done n the quarter of the Japanese cty of Ngata. The wnd s comng n the drecton of 225 (blue arrow) and results ponts are placed n several random locatons as ndcated n the fgure 5, at two meters hgh. 6
7 Computed speed-up factor Results Fgure 5: Thrd case, result ponts, z=2m The speed-up factors of the computaton have been compared to the speed-up factors obtaned by the expermental measurements. In the followng fgure 6, the computed values functons of the measured values for consstent ponts have been represented. Table 3: Comparson Computatons vs. Measurements for the cty of Ngata Thrd case Cty of Ngata Error R 2 For all ponts 5.9% 0.75 For the consstent ponts 5.4% ,9 0,8 0,7 0,6 0,5 0,4 0,3 0,2 0,1 0 Err= 5,4% R² = 0,79 0 0,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 Measured speed-up factor Fgure 6: Thrd case, quarter of Ngata, consstent ponts 7
8 1.4.3 Dscusson Lke n the prevous cases, the ponts where the computed value of the speed-up factor s far from the measured value are represented n the software UrbaWnd. Fgure 7: Thrd case, quarter of Ngata, vsualzaton The stuaton s smlar to the cases 1 and 2. Indeed, one can observe n the fgure 7 that the worst ponts correspond ether to low-speed areas, or to areas where a small change of locaton can lead to an mportant speed varaton. Moreover, the error and the determnaton coeffcent allow agan to valdate the results of UrbaWnd. Indeed 90% of the ponts have an error value lower than 12% and the mean error s lower than 5.9% for all ponts and 5.4% when selectng only the consstent ponts. 1.5 CONCLUSION Fnally, the table 1 shows that the results provded by UrbaWnd are much closed to the results of the expermental measurements of the Archtectural Insttute of Japan. Indeed the typcal error of the computatons when consderng all ponts s at most 8.5% and even decrease to 5.5% n the frst case. Table 4: Summary table of the comparson Computatons vs. Measurements Error for all Error for the ponts consstent ponts R² Frst case Smple Block 5.5% 4.9% 0.93 Second case Group of Blocks 8.5% 5.8% 0.71 Thrd case Cty of Ngata 5.9% 5.4% 0.79 To conclude, ths study allows valdatng the software UrbaWnd as well for theoretcal cases (frst and second cases) as for real cases (quarter of Ngata) by offerng a mnor error margn. 8
9 Abbrevatons: u : Components of the mean wnd vector n a Cartesan frame u' : Components of the turbulent fluctuatons P : Mean pressure value : Ar dynamc vscosty : Ar densty C d : Volume coeffcent of frctons, whch s proportonal to the porous obstacle densty V : Volume of the consdered cell. References: [1] Archtectural Insttute of Japan, 2008, Gudebook for Practcal Applcatons of CFD to Pedestran Wnd Envronment around Buldngs. ( [2] Garratt J.R., 1992, The atmospherc boundary layer, Cambrdge Atmospherc and space scences seres. [3] Ferry M., 2000, The MIGAL solver, Proc. Of the Phoencs Users Int. Conf., Luxembourg, 2000 [4] Ferry M., 2002, New features of the MIGAL solver, Proc. Of the Phoencs Users Int. Conf., Moscow, Sept
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 informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More 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 informationModeling of Airfoil Trailing Edge Flap with Immersed Boundary Method
Downloaded from orbt.dtu.dk on: Sep 27, 2018 Modelng of Arfol Tralng Edge Flap wth Immersed Boundary Method Zhu, We Jun; Shen, Wen Zhong; Sørensen, Jens Nørkær Publshed n: ICOWEOE-2011 Publcaton date:
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 informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationS.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?
S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert
More 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 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 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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More 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 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 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 informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More 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 informationSTUDY OF WAKE REGION BEHIND OF ISOLATED CUBIC BUILDING.PART II: NUMERICAL SIMULATIONS
Proceedngs of ENCIT 2012 Copyrght 2012 by ABCM 14 th Brazlan Congress of Thermal Scences and Engneerng November 18-22, 2012, Ro de Janero, RJ, Brazl STUDY OF WAKE REGION BEHIND OF ISOLATED CUBIC BUILDING.PART
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 informationStorm Surge and Tsunami Simulator in Oceans and Coastal Areas
Proc. Int. Conf. on Montorng, Predcton and Mtgaton of Water-Related Dsasters, Dsaster Preventon Research Insttute, Kyoto Unv. (2005) Storm Surge and Tsunam Smulator n Oceans and Coastal Areas Taro Kaknuma
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
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 informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
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 informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More 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 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 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 informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More 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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More 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 informationLobachevsky 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 informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationAMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain
AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references
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 informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
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 informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationVery simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)
Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes
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 informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationUniversität Stuttgart Direkte numerische Simulation von Strömungslärm in komplexen Geometrien
Unverstät Stuttgart Drekte numersche Smulaton von Strömungslärm n komplexen Geometren Claus-Deter Munz Gregor Gassner, Floran Hndenlang, Andreas Brkefeld, Andrea Beck, Marc Staudenmaer, Thomas Bolemann,
More informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More 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 informationPHOTOGRAMMETRIC ANALYSIS OF ASYNCHRONOUSLY ACQUIRED IMAGE SEQUENCES
PHOTOGRAMMETRIC ANALYSIS OF ASYNCHRONOUSLY ACQUIRED IMAGE SEQUENCES Karsten Raguse 1, Chrstan Hepke 2 1 Volkswagen AG, Research & Development, Dept. EZTV, Letter Box 1788, 38436 Wolfsburg, Germany Emal:
More informationDiscontinuous Galerkin methods for flow and transport problems in porous media
T COMMUNICATIONS IN NUMERICA METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2; :1 6 [Verson: 2/3/22 v1.] Dscontnuous Galerkn methods for flow and transport problems n porous meda Béatrve Rvère and Mary
More informationFlow over Broad Crested Weirs: Comparison of 2D and 3D Models
Journal of Cvl Engneerng and Archtecture 11 (2017) 769-779 do: 10.17265/1934-7359/2017.08.005 D DAVID PUBLISHING Flow over Broad Crested Wers: Comparson of 2D and 3D Models Shaymaa A. M. Al-Hashm 1, Huda
More informationWhy visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information
Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data
More information3D 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 informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationAn inverse problem solution for post-processing of PIV data
An nverse problem soluton for post-processng of PIV data Wt Strycznewcz 1,* 1 Appled Aerodynamcs Laboratory, Insttute of Avaton, Warsaw, Poland *correspondng author: wt.strycznewcz@lot.edu.pl Abstract
More informationSURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB
SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationImmersed Boundary Method for the Solution of 2D Inviscid Compressible Flow Using Finite Volume Approach on Moving Cartesian Grid
Journal of Appled Flud Mechancs, Vol. 4, No. 2, Specal Issue, pp. 27-36, 2011. Avalable onlne at www.jafmonlne.net, ISSN 1735-3572, EISSN 1735-3645. Immersed Boundary Method for the Soluton of 2D Invscd
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 informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More information3D numerical simulation of tsunami runup onto a complex beach
Proc. Int. Symp. on Fluval and Coastal Dsasters -Copng wth Extreme Events and Regonal Dversty-, Dsaster Preventon Research Insttute, Kyoto Unv. (2005), pp. 221-228 3D numercal smulaton of tsunam runup
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 informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationSimulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method
Smulaton of a Shp wth Partally Flled Tanks Rollng n Waves by Applyng Movng Partcle Sem-Implct Method Jen-Shang Kouh Department of Engneerng Scence and Ocean Engneerng, Natonal Tawan Unversty, Tape, Tawan,
More informationData Mining For Multi-Criteria Energy Predictions
Data Mnng For Mult-Crtera Energy Predctons Kashf Gll and Denns Moon Abstract We present a data mnng technque for mult-crtera predctons of wnd energy. A mult-crtera (MC) evolutonary computng method has
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More 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 informationAn accelerated value/policy iteration scheme for the solution of DP equations
An accelerated value/polcy teraton scheme for the soluton of DP equatons Alessandro Alla 1, Maurzo Falcone 2, and Dante Kalse 3 1 SAPIENZA - Unversty of Rome, Ple. Aldo Moro 2, Rome, Italy alla@mat.unroma1.t
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationA Semi-parametric Regression Model to Estimate Variability of NO 2
Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz
More informationObstacle-Aware Routing Problem in. a Rectangular Mesh Network
Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationProceedings of BS2015: 14th Conference of International Building Performance Simulation Association, Hyderabad, India, Dec. 7-9, 2015.
WIND ASSESSMENT IN URBAN AREA WITH CFD TOOLS APPLICATION TO NATURAL VENTILATION POTENTIAL AND OUTDOOR PEDESTRIAN COMFORT Stéphane Sanquer, Gullaume Canot, Sachn Bandhare Meteodyn, Nantes, France ABSTRACT
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
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 informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationKiran Joy, International Journal of Advanced Engineering Technology E-ISSN
Kran oy, nternatonal ournal of Advanced Engneerng Technology E-SS 0976-3945 nt Adv Engg Tech/Vol. V/ssue /Aprl-une,04/9-95 Research Paper DETERMATO O RADATVE VEW ACTOR WTOUT COSDERG TE SADOWG EECT Kran
More informationAir 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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More 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 informationVibration Characteristic Analysis of Axial Fan Shell Based on ANSYS Workbench
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 2015) Vbraton Characterstc Analyss of Axal Fan Shell Based on ANSYS Workbench Lchun Gu College of Mechancal and Electrcal
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 informationVISCOELASTIC SIMULATION OF BI-LAYER COEXTRUSION IN A SQUARE DIE: AN ANALYSIS OF VISCOUS ENCAPSULATION
VISCOELASTIC SIMULATION OF BI-LAYER COEXTRUSION IN A SQUARE DIE: AN ANALYSIS OF VISCOUS ENCAPSULATION Mahesh Gupta Mchgan Technologcal Unversty Plastc Flow, LLC Houghton, MI 49931 Hancock, MI 49930 Abstract
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 informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More 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 informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More 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 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 informationDesign for Reliability: Case Studies in Manufacturing Process Synthesis
Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More 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 information