Method to match waves of ray-tracing simulations with 3- D high-resolution propagation measurements Guo, P.; van Dommele, A.R.; Herben, M.H.A.J.

Size: px
Start display at page:

Download "Method to match waves of ray-tracing simulations with 3- D high-resolution propagation measurements Guo, P.; van Dommele, A.R.; Herben, M.H.A.J."

Transcription

1 Method to match waves of ray-tracig simulatios with 3- D high-resolutio propagatio measuremets Guo, P.; va Dommele, A.R.; Herbe, M.H.A.J. Published i: Proceedigs of the 6th Europea Coferece o Ateas ad Propagatio (EUCAP202, March 202, Prague, Czech Republic Published: 0/0/202 Documet Versio Publisher s PDF, also kow as Versio of Record (icludes fial page, issue ad volume umbers Please check the documet versio of this publicatio: A submitted mauscript is the author's versio of the article upo submissio ad before peer-review. There ca be importat differeces betwee the submitted versio ad the official published versio of record. People iterested i the research are advised to cotact the author for the fial versio of the publicatio, or visit the DOI to the publisher's website. The fial author versio ad the galley proof are versios of the publicatio after peer review. The fial published versio features the fial layout of the paper icludig the volume, issue ad page umbers. Lik to publicatio Geeral rights Copyright ad moral rights for the publicatios made accessible i the public portal are retaied by the authors ad/or other copyright owers ad it is a coditio of accessig publicatios that users recogise ad abide by the legal requiremets associated with these rights. Users may dowload ad prit oe copy of ay publicatio from the public portal for the purpose of private study or research. You may ot further distribute the material or use it for ay profit-makig activity or commercial gai You may freely distribute the URL idetifyig the publicatio i the public portal? Take dow policy If you believe that this documet breaches copyright please cotact us providig details, ad we will remove access to the work immediately ad ivestigate your claim. Dowload date: 5. Jul. 208

2 Method to Match Waves of Ray-Tracig Simulatios with 3-D High-Resolutio Propagatio Measuremets Peg Guo, A. Raiier va Dommele, Matti H.A.J. Herbe Departmet of Electrical Egieerig Eidhove Uiversity of Techology Eidhove, the Netherlads Abstract High-resolutio propagatio measuremets were carried out to verify the agular ad delay dispersio predicted by ray-tracig models. To do the compariso betwee the measured ad simulated results, the correspodig waves should first be idetified. This paper itroduces a method to fid the correspodig relatioship of waves automatically. The results show that the algorithm ca successfully fid the matchig simulated ad measured waves. It also provides the iformatio to fid ad further ivestigate the most domiat propagatio mechaisms. Keywords- agular dispersio; agular spread; delay spread; agle of arrival; determiistic chael modellig I. INTRODUCTION For 4G wireless commuicatio systems, the covetioal semi-empirical or stochastic propagatio predictio models are isufficiet for etwork plaig []. Time dispersio ad agular dispersio i a radio chael are importat for the performace of the 4G etwork. Orthogoal-Frequecy Divisio Multiplexig (OFDM is applied for modulatio i the LTE system. The badwidth of sub-carriers of the OFDM system is determied by the kowledge of time dispersio i the radio chael. Moreover, smart ateas are used for the 4G etworks. These ateas are adaptive arrays or Multiple Iput Multiple Output (MIMO ateas. Agular dispersio due to multipath propagatio affects the spatial filter characteristics of the smart ateas. For adaptive atea arrays, agular dispersio degrades the performace of adaptive beam formig. While for MIMO a wide agular spread of the multipath waves produces a large de-correlatio of the spatial chaels ad hece icreases diversity performace. The iformatio of spread i agular domai ad time domai caot be predicted with the covetioal empirical propagatio models. Istead determiistic predictio models become more iterestig to predict the propagatio chaels for 4G etworks. The ray tracig (RT model is oe of the popular determiistic models owadays. It uses physical models of radio propagatio mechaisms, such as reflectio ad diffractio, ad detailed iformatio of the eviromet to provide deep isight ito the propagatio chaels [][2]. This RT model with a detailed buildig database results i excessive computatioal complexity, which limits the use by the mobile system operators. Most of the curret research i the area of determiistic propagatio modellig deals with reducig the computatioal complexity without losig the predictio accuracy. The accuracy of determiistic chael modellig is the object of debate ad there is still a wide margi for improvemets ad extesios. The commercially available RT-model has bee evaluated through compariso with measuremet results. I [3], the results of measuremets which were carried out i Rotterdam, the Netherlads are compared with the predictio results based o a RT-model with a maximum of two reflectios ad oe diffractio cotributio. The compariso results show that the agular spread ad delay spread are ot predicted accurate eough by the RT model. The mea error of agular spread predictio is 2 degrees, while the stadard deviatio of the error is aroud 6 degrees. I order to do a more detailed compariso of RT-predictios with measuremets, the correspodig propagatig electromagetic waves should be idetified firstly. This paper presets a method to fid the correspodig waves betwee measuremets ad simulatios. The compariso is achieved by usig the images of measuremet ad simulatio plots i time ad space domais, so that a matchig method ca be desiged based o patter recogitio as used i the image processig field. II. MEASUREMENTS AND SIMULATIONS The measuremet data used for compariso is obtaied from outdoor experimets performed with the 3-D high resolutio chael souder developed at TU/e [4]. This system is capable of characterizig the delay ad agular properties of mobile radio chaels with a resolutio better tha 5 degrees i both azimuth ad elevatio domai without ambiguities ad while movig through the eviromet at moderate urba speeds. The time resolutio is 20s with a uambiguous rage of 5.μs. The ray-tracig simulatio results i this paper are obtaied with the software package CRC-RayPredict [5]. A top-view of the measuremet sceario is show i Fig.. The dyamic measuremet ad simulatio results are plotted i the time ad agular domais as a fuctio of sapshot set show i Fig. 2 ad Fig. 3 respectively. The sapshot set umber is related to the time elapsed whe the vehicle is movig. The vertical oise bad i Fig. 2(a

3 betwee sapshot set k=3700 ad k=4000 is caused by the saturatio of the measuremet system. The most importat differece betwee the simulatio ad measuremet plots is the agular spread due to buildig surface roughess. I the simulatio, oly specular reflectio happes, resultig i clear lies i the plots alog the trajectory. I the measuremet, the rough surfaces of the buildigs itroduce scatterig, which cotributes to the agular dispersio aroud the specular reflectio waves alog the trajectory. (a Fig. Top-view of measuremet sceario at TU/e-campus ( Google Maps. (b (c (a (b Fig. 3 The simulated multipath compoets at the receiver i (a time domai (b elevatio domai (c azimuth domai alog the trajectory. III. DESCRIPTION OF THE COMPARISON METHOD The procedure to fid the correspodig waves betwee the simulatio ad measuremet results is based o patter recogitio [6]. This procedure cosists of the followig steps: clusterig, calibratio, feature geeratio, template matchig ad evaluatio, which are show i Fig. 4. (c Fig. 2 The measured multipath compoets at the receiver i (a time domai, (b elevatio domai (c azimuth domai alog the trajectory. Fig. 4 Procedure to fid the correspodig waves i the simulatio ad measuremet results.

4 A. Clusterig A hierarchical clusterig algorithm of the Nearest Neighbourhood is used to cluster the measuremet data. The purpose of clusterig is to group the measured waves with similar time delay ad Agle-of-Arrival (AoA together [4]. I this way, the specular reflectio ad the surroudig scattered rays, due to for istace surface roughess, are grouped together. The first 50 measuremet clusters with the largest average power are preseted i Fig. 5. Differet colours idicate differet clusters. Due to the limited umber of colours, some of them are used repeatedly. Clusterig the simulatio results ca either be doe with the same algorithm or by usig the iformatio of iteractio poits of the rays with the reflectig or diffractig objects from the simulator. The simulatio results with maximum two reflectios are clustered usig the same algorithm as that for the measuremet, which are show i Fig. 6. Fig. 5 The first 50 measuremet clusters with the largest average power plotted i time, elevatio ad azimuth domais. reflectio loss ad ca be idetified easily. The calibrated measured ad simulated delay profiles are show i Fig. 7. Fig. 7 Simulated delay profile (upper plot ad calibrated measured delay profile (lower plot. C. Feature Geeratio Features of each measured cluster are geerated afterwards to elimiate the scatterig effect due to surface roughess, so that further compariso is feasible. I this algorithm mea time delay, mea azimuth agle ad mea elevatio agle are chose as the features. The values of the features for each measuremet cluster at each sapshot set are calculated by Eq. [3]. τ i Pi τ = P i φ = jφ e i Pi Pi where represets the umber of Multipath Compoets (MPCs withi oe cluster at oe sapshot set. τ i, θ i, ϕ i ad P i represet the time delay, elevatio agle, azimuth agle ad received power of the ith MPC out of MPCs withi oe cluster at oe sapshot set. deotes takig the agle of the complex umber. The plots of the first 50 highest average power clusters with feature values i time ad agular domais are show i Fig. 8. It ca be see that the features of the measuremet clusters are represeted by lies that later o are compared with the lies of the simulatios. ( Fig. 6 Clustered simulatio results with maximum two reflectios plotted i time, elevatio ad azimuth domais. B. Calibratio Calibratio is ecessarily applied to elimiate for istace the time delay offset i the measuremets. The start poit of time delay i the measuremet is chose arbitrary, because the receiver does ot kow whe the waves depart from the trasmitter. The measured time delay is modified based o the theoretical time delay of Lie of Sight (LOS ray that has o Fig. 8 The mea time delay, mea elevatio agle ad mea azimuth agle, of the measuremet clusters show i Fig. 5.

5 D. Template Matchig The procedure of template matchig is show i Fig. 9 to fid which oe of the simulated clusters (template matches the measured cluster by usig feature values. Assume there are m clusters i the measuremet, clusters i the simulatio ad k sapshot sets alog the trajectory. First choose the objective measuremet cluster, e.g. m i. The the Euclidea distace is used to measure the differece betwee the selected measuremet cluster ad all simulatio clusters i time ad agular domais. The smaller the Euclidea distace is, the better the selected measuremet ad chose simulatio cluster match. The Euclidea distace value at each sapshot set is calculated by: 2 2 ( D j k = ( α j k + ( λ( τ j k (2 where (D j k is the Euclidea distace, (Δα j k is the agular differece ad (Δτ j k is the time delay differece betwee the feature value of measuremet cluster m i ad simulatio clusters at each sapshot set k. λ is chose as the ratio of maximum agle differece value 2π ad the maximum time delay differece value 5.μs to make the ifluece of them equal o the Euclidea distace. The agle differece (Δα j k betwee objective measuremet cluster m i ad idividual simulatio cluster j ca be calculated by Eq. 3 [7], usig the feature azimuth ad elevatio agle of objective measuremet cluster m i ad the agle values of the idividual cluster i the simulatio results. i = i + i = Choose measuremet cluster m i Geerate Euclidea distace (D j k i time ad agle domais at each sapshot set k betwee measuremet cluster m i ad simulatio clusters ( α j k cosφ ik cosθik cosφ jk cosθ jk (3 = cos siφik cosθik siφ jk cosθ jk siθik siθ jk After that, the Euclidea distace values are averaged over k sapshot sets to fid the differece i a dyamic situatio. I the ext step, the simulatio clusters, which are far from the objective measuremet cluster, are filtered out whe the agular ad time delay differece are larger tha a threshold that is based o the measuremet resolutio. Accordig to the measuremet system, the threshold of time delay differece Δτ equals 20s ad agle differece Δα equals 5º. I this way, the oise clusters i the measuremet (see Fig. 2(a ca be removed, because there are o simulatio clusters earby. Fially, the simulated cluster j with the smallest value of mea Euclidea distace is cosidered to match the objective measuremet cluster m i. The same procedure is repeated util all the measuremet clusters are examied. IV. MATCHING RESULTS Based o the method explaied i part III, the matchig results for this sceario are listed i Table I. TABLE I. MATCHING RESULTS INDICATED BY CLUSTER NUMBER Measuremet cluster umber Matchig simulatio cluster umber Iteractio poits provided by simulator LOS 2 2 Reflectio o Traverse buildig 98,59,03 3 Reflectio o IPO buildig 43,49,99,5, 88,90 4 First reflectio o IPO buildig Secod reflectio o Traverse buildig 22,28,57,25 5 First reflectio o Traverse buildig Secod reflectio o Sports Ceter buildig 33 9 First reflectio o Traverse buildig Secod reflectio o Sports Ceter buildig Geerate mea Euclidea distace D j over k sapshot sets betwee measuremet cluster m i ad simulatio clusters Filter out far-away simulatio clusters from measuremet cluster m i Fid correspodig simulatio cluster j with smallest mea Euclidea distace matchig with measuremet cluster m i Fig. 9 Procedure of template matchig by calculatig Euclidea distace. Accordig to the umber of matchig measuremet clusters, the results ca be divided ito three categories. First, oe measuremet cluster ca fid oly oe matchig simulatio cluster, e.g. measuremet cluster o. ad o. 2. From the iteractio poits provided by the simulator, it is idetified that measuremet cluster o. is the LOS wave ad cluster o. 2 is the wave with reflectio poit o the Traverse buildig. Fig. 0 ad Fig. show the plots of measuremet ad the correspodig simulatio clusters, demostratig the reliability of the matchig results. The secod category is that several measuremet clusters match with the same simulatio cluster. For example, there are six measuremet clusters that match with simulatio cluster o. 4, show i Fig. 2. This happes whe objects exist which are blockig the propagatio path for certai parts of the trajectory. Based o the cluster algorithm, the discoected measuremet clusters are regarded as differet clusters. Fig. 2 proves the matchig results for this situatio are also reliable. The last category is that some measuremet

6 clusters have o matchig simulatio cluster. By checkig the plots, it ca be foud that the oise clusters i the measuremet do ot match ay simulated cluster, as expected. It is also foud that some measuremet clusters with o matchig simulatio clusters are formed due to lamppost reflectios. For example, by checkig the AoA of MPCs superimposed o the video data, the reflectio iteractio poits are the lampposts poited by the red circles i Fig. 3. This ivestigatio idicates that lamppost reflectio plays a importat role i a real situatio. Therefore, the simulatio eviromet should iclude the positio of lampposts. Fig. 0 Feature values of measuremet cluster o. ad matchig simulatio cluster o.. Fig. Feature values of measuremet cluster o. 2 ad matchig simulatio cluster o. 2. Fig. 3 Agle-of-arrival of multipath compoets superimposed o omidirectioal video data showig lamppost reflectios. Fially, the matchig results for the strogest simulated MPCs usig the iteractio poits from Table I are verified with the correspodig video frames at various sapshot sets k. This is the evaluatio step of the matchig procedure (Fig. 4. V. CONCLUSIONS I this paper, the correspodig multipath waves betwee the simulatio ad measuremet results are successfully foud by the desiged algorithm which cosists of five steps: clusterig, calibratio, feature geeratio, template matchig ad evaluatio. The Nearest Neighbourhood clusterig algorithm ca successfully separate the multipath waves related to the physical iteractig objects i the measuremet. Based o the LOS wave, the time delay offset i measuremet results is removed i the calibratio step. By geeratig feature values of measuremet clusters, the agular dispersio due to surface roughess i measuremets ca be elimiated, so that the compariso betwee the simulatio ad measuremet results ca be coducted. The matchig plots ad the evaluatio results prove that the matchig results are reliable. It was foud that, i additio to LOS ad buildigs, lampposts play a importat role i a urba eviromet for the agular dispersio of radio waves. REFERENCES [] M.F. Iskader ad Z. Yu, Propagatio predictio models for wireless commuicatio system, IEEE Trasactios o Microwave Theory ad Techiques, Vol. 50, No. 3, Mar [2] L.M. Correia (ed., Mobile broadbad multimedia etworks: techiques, models ad tools for 4G, ISBN , May [3] O. Matel, A. Bokiye, A.R. va Dommele ad M.R.J.A.E. Kwakkeraat, Measuremet-based verificatio of delay ad agular spread ray-tracig predictios for use i urba mobile etwork plaig, COST 200 TD(09 94, Viea, Austria, Sept [4] M.R.J.A.E. Kwakkeraat, Agular dispersio of radio waves i mobile chaels, PhD thesis, Eidhove Uiversity of Techology, the Netherlads, 2008, [5] The software package CRC-RayPredict was developed by Y.L.C. de Jog at the Commuicatios Research Cetre Caada. [6] S. Theodoris ad K. Koutroumbas, Patter recogitio, Chapter 8, ISBN , [7] B. H. Fleury, First-ad secod-order characterizatio of directio dispersio ad space selectivity i the radio chael, IEEE Trasactios o iformatio Theory, Vol. 46, No. 6, Sept Fig. 2 Feature values of measuremet clusters o. 43, 49, 99,5,88,90 ad matchig simulatio cluster o. 4.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P. Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Coherent effects of flow- and pressure hull of a generic submarine on target scattering in an active sonar performance model

Coherent effects of flow- and pressure hull of a generic submarine on target scattering in an active sonar performance model Coheret effects of flow- ad pressure hull of a geeric submarie o target scatterig i a active soar performace model P. Schippers TNO-D&V-Uderwater Techology, Oude Waalsdorperweg 63, Post Box 96864, 2509

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Implementation of 3-D Ray Tracing Propagation Model for Indoor Wireless Communication

Implementation of 3-D Ray Tracing Propagation Model for Indoor Wireless Communication Iteratioal Joural of Electroics Egieerig, 4 (), 0, pp. 43 47 Serials Publicatios, ISSN : 0973-7383 Implemetatio of 3-D Ray Tracig Propagatio Model for Idoor Wireless Commuicatio Satvir Sigh Sidhu, Aru

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

27 Refraction, Dispersion, Internal Reflection

27 Refraction, Dispersion, Internal Reflection Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

Apparent Depth. B' l'

Apparent Depth. B' l' REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE 14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal

More information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

BAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8

BAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8 BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Optimized Aperiodic Concentric Ring Arrays

Optimized Aperiodic Concentric Ring Arrays 24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity

More information

APPLICATION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICAL NEAR-FIELD ANTENNA MEASUREMENTS

APPLICATION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICAL NEAR-FIELD ANTENNA MEASUREMENTS PPLICTION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICL NER-FIELD NTENN MESUREMENTS lle C. Newell*, David Lee** *Nearfield Systems Ic. 133 East 3 rd St., Bldg. 54 Carso, C 9745 **David Florida Laboratory,

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

More information

Real-time Path Prediction and Grid-based Path Modeling Method Using GPS

Real-time Path Prediction and Grid-based Path Modeling Method Using GPS Iteratioal Joural of Applied Egieerig Research ISSN 0973-4562 Volume 12, Number 20 (2017) pp. 9997-10001 Research Idia Publicatios. http://www.ripublicatio.com Real-time Path Predictio ad Grid-based Path

More information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING

VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING Yasufumi Suzuki ad Tadashi Shibata Departmet of Frotier Iformatics, School of

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

More information

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

EE 435. Lecture 26. Data Converters. Architectures. Characterization

EE 435. Lecture 26. Data Converters. Architectures. Characterization EE 435 Lecture 26 Data Coverters Architectures Characterizatio . Review from last lecture. Data Coverters Types: A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts

More information

Lighting and Shading. Outline. Raytracing Example. Global Illumination. Local Illumination. Radiosity Example

Lighting and Shading. Outline. Raytracing Example. Global Illumination. Local Illumination. Radiosity Example CSCI 480 Computer Graphics Lecture 9 Lightig ad Shadig Light Sources Phog Illumiatio Model Normal Vectors [Agel Ch. 6.1-6.4] February 13, 2013 Jerej Barbic Uiversity of Souther Califoria http://www-bcf.usc.edu/~jbarbic/cs480-s13/

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL Iteratioal Joural of Iformatio Techology ad Kowledge Maagemet July-December 2012, Volume 5, No. 2, pp. 371-375 EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

More information

Physics 11b Lecture #19

Physics 11b Lecture #19 Physics b Lecture #9 Geometrical Optics S&J Chapter 34, 35 What We Did Last Time Itesity (power/area) of EM waves is give by the Poytig vector See slide #5 of Lecture #8 for a summary EM waves are produced

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

More information

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity.

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity. 7 IEEE. Persoal use of this material is permitted. Permissio from IEEE must be obtaied for all other uses, i ay curret or future media, icludig repritig/republishig this material for advertisig or promotioal

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI) 1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES Thomas Läbe, Timo Dickscheid ad Wolfgag Förster Istitute of Geodesy ad Geoiformatio, Departmet of Photogrammetry, Uiversity of Bo laebe@ipb.ui-bo.de,

More information

4. Levelset or Geometric Active Contour

4. Levelset or Geometric Active Contour 32 4. Levelset or Geometric Active Cotour The sake algorithm is a heavily ivestigated segmetatio method, but there are some limitatios: it is difficult to let the active cotour adapt to the topology. This

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

3D MODELING OF STRUCTURES USING BREAK-LINES AND CORNERS IN 3D POINT CLOWD DATA

3D MODELING OF STRUCTURES USING BREAK-LINES AND CORNERS IN 3D POINT CLOWD DATA 3D MODELING OF STRUCTURES USING BREAK-LINES AND CORNERS IN 3D POINT CLOWD DATA Hiroshi YOKOYAMA a, Hirofumi CHIKATSU a a Tokyo Deki Uiv., Dept. of Civil Eg., Hatoyama, Saitama, 350-0394 JAPAN - yokoyama@chikatsulab.g.dedai.ac.jp,

More information

Probability of collisions in Soft Input Decryption

Probability of collisions in Soft Input Decryption Issue 1, Volume 1, 007 1 Probability of collisios i Soft Iput Decryptio Nataša Živić, Christoph Rulad Abstract I this work, probability of collisio i Soft Iput Decryptio has bee aalyzed ad calculated.

More information

are two specific neighboring points, F( x, y)

are two specific neighboring points, F( x, y) $33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 14, No 4 Sofia 2014 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI: 10.1515/cait-2014-0008 Evaluatio of the Software Idustry

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Searching a Russian Document Collection Using English, Chinese and Japanese Queries

Searching a Russian Document Collection Using English, Chinese and Japanese Queries Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.

More information

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh

More information

Roughness parameters

Roughness parameters Joural of Materials Processig Techology 123 2002) 133±145 Roughess parameters E.S. Gadelmawla a, M.M. Koura b, T.M.A. Maksoud c,*, I.M. Elewa a, H.H. Solima d a Productio Egieerig ad Mechaical Desig Departmet,

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information