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

Size: px
Start display at page:

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

Transcription

1 Advaces i Computer, Sigals ad Systems (2018) 2: Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao a, Cuqu Fa b, *, Mayu Li, Lizi Xie, Xi Zhag Natioal Satellite Meteorological Cetre, Beijig, Chia a xgzhao@cma.gov.c, b facq@cma.gov.c *correspodig author Keywords: meteorological satellite; server resource; cosumptio aalysis; cotour curve Abstract: I order to effectively aalyze the system server resource cosumptio, this paper proposed a server resource cosumptio aalysis method based cotour curve. Firstly, the defiitio of resource cosumptio aalysis was give, ad the several aalysis methods of resource cosumptio were give, icludig: applicatio resource cosumptio profile, applicatio resource cosumptio profile stadard deviatio, applicatio resource cosumptio frequecy, applicatio resource cosumptio mootoicity ad so o. Fially, based o this, the total cosumptio, cosumptio mea, kurtosis, skewess, reload, resource load ad so o were aalyzed. The method proposed i this paper ca effectively aalyze the server resource cosumptio i depth, improve the server resource utilizatio ad reduce the server hardware loss to a certai extet. 1. Itroductio Meteorological satellite groud applicatio system has a large amout of data traffic. The groud system is maily resposible for receivig, processig ad trasmittig data. This requires a large amout of server resources to support. Due to limited server resources, how to properly aalyze the cosumptio of server resources will be further optimizatio of server resources has a critical impact. Therefore, this paper studies the aalysis of server resource cosumptio. Some research has bee doe o the aalysis of server resource cosumptio. Paper [1] proposed a liear regressio method ad a maximum likelihood techique for estimatig the service demads of requests based o measuremet of their respose times istead of their CPU utilizatio. The paper [2] aims to address this problem by combiig kowledge of database query processig with statistical models. Paper [3] experimetally ivestigates the relatioship betwee the power cosumptio ad resource utilizatio of a multimedia server cluster whe differet load balacig policies are used to distribute a workload. I paper [4], they study the problem of idetifyig a assigmet scheme betwee the iteractig compoets of a applicatio, such as processes ad virtual machies, ad the computig odes of a cloud system, such that the total amout of resources cosumed by the respective applicatio is miimized. The paper [5] tries to establish 19

2 relatio betwee the power usage ad software agig. Paper [6] give a experimetal case study about resource cosumptio parameters ad workload parameters i a Iteret Iformatio Services. They use fitted resource cosumptio parameter to lear the relatioship betwee workload parameters ad resource cosumptio parameters through visual observatio ad calculatio. 2. Related Defiitio Resource cosumptio aalysis is to extract valuable statistical features ad quatitative idicators for importat parameters of each type of resources (CPU/memory/IO/etwork/NFS) of a applicatio through a certai statistical method, so as to preset the overall Apply a statistical patter of behaviour durig the ru. Each type of resource cotais a variety of parameters. If you aalyze each parameter, it will actually brig a higher amout of calculatio, ad i fact, some parameters are ot meaigful eve if they are aalyzed. After aalysis ad screeig, the applicatio resource cosumptio aalysis uses the followig importat parameter sets to collaborate o the aalysis object: a) CPU parameters: CPU_All_Sys, CPU_All_User, CPU_All_Idle, all i percetage. b) Memory parameters: Mem_All_MemRatio, Mem_All_SwapRatio, all i percetage. c) IO parameters: Disk_All_Read, Disk_All_Write, Disk_All_Svctm, i bytes (Bytes). d) Network parameters: Net_All_Recv, Net_All_Sed, i bytes (Bytes). e) NFS parameters: NFS_All_Read, NFS_All_Write, i bytes (Bytes). 3. The Method of Resource Cosumptio Aalysis 3.1 Applicatio Resource Cosumptio Profile The resource cosumptio profile is used to collectively show the overall level of occupyig a resource whe the target applicatio is scheduled multiple times. For example, for a CPU resource cosumptio profile curve, the legth of the curve represets the average time that the applicatio rus whe it is scheduled multiple times, ad the poit o the curve represets the mea value of CPU resources occupied by the applicatio i the case of multiple schedulig at the curret time poit. For the resource S of the target applicatio X, whe the applicatio is scheduled N times, ad the schedulig time of the i-th time is T i, the total legth of the resource cosumptio cotour correspodig to the resource S is defied as T=mi(T 1, T 2,, T N ), ad the resource cosumptio cotour value of the j-th poit. X + X + + X Yj = N 1j 2 j Nj Where X ij represets the value of the S resource parameter of the target applicatio X at the j-th time poit of the i-th schedulig. For CPU resources, this parameter is the CPU active total CPU_All_Active = CPU_All_Sys + CPU_All_User; for memory resources, physical memory footprit Mem_All_MemRatio ad swap area memory footprit Mem_All_SwapRatio will calculate the resource cosumptio profile; for IO, Parameters such as etwork ad NFS are calculated by usig the correspodig data read/write or etwork trasmissio ad receptio. (1) 20

3 3.2 Applicatio Resource Cosumptio Profile Stadard Deviatio The stadard deviatio of the applicatio resource cosumptio profile is used to show the fluctuatio of the correspodig resources occupied by the target applicatio at each time poit durig multiple schedulig. For a certai poit i time, if the applicatio is scheduled N times, whe the stadard deviatio of the cosumptio profile correspodig to the time poit is large, it idicates that the amout of the specified resource occupied by the N times of the applicatio at the time poit is discrete. The distributio may be due to ustable applicatio implemetatio ad large data chages. For the resource parameter S of the target applicatio X, whe the applicatio is scheduled N times, ad the i-th schedulig time is T i, the total legth of the resource cosumptio profile is defied as T=mi(T 1, T 2,..., T N ), ad the j poit resource cosumptio profile stadard deviatio. Y= DX (, X,, X ) (2) j 1j 2 j Nj Where X ij represets the value of the resource parameter S of the target applicatio X at the j-th time poit of the i-th schedulig, ad D(X 1, X 2,...) represets the stadard deviatio of the data. 3.3 Applicatio Resource Cosumptio Frequecy The frequecy of applicatio resource cosumptio is based o the resource cosumptio profile, ad aalyzes the fluctuatio patter of the applicatio resource cosumptio profile curve. By performig frequecy domai aalysis o the resource cosumptio profile curve, iformatio such as the fluctuatio amplitude ad phase of the cotour curve cosumed at each frequecy ca be obtaied. Whe the cosumptio profile curve has a small fluctuatio amplitude at all frequecies, it idicates that the hardware resources occupied by the target applicatio durig the etire workflow flow show a stable tred, which may be that the resource is occupied or occupied for a log time; The fluctuatio amplitude o the frequecy is much larger tha other frequecies, idicatig that the target applicatio occupies a ustable state of resources. For the target applicatio X, if the resource cosumptio profile curve of the correspodig resource S is Y, the frequecy of cosumptio of the resource S is rfft(y), where rfft is a real sequece fast Fourier trasform. 3.4 Applicatio Resource Cosumptio Mootoicity The CPU resource cosumptio mootoicity curve is similar to the CPU resource cosumptio profile stadard deviatio. It is also a measure of the CPU resources occupied by the target applicatio whe it is scheduled multiple times at a certai poit i time. Each poit o the mootoic curve idicates whether the CPU usage of the target applicatio presets a mootoous tred durig multiple schedulig at that poit i time. I theory, i the case of multiple schedulig, the CPU usage at each poit i time should preset a discrete radom distributio, ad should ot exhibit sigificat mootoicity. If the CPU usage of the multiple schedulig at a certai poit i time is obviously mootoous, there may be problems, such as busy garbage collectio tasks ad more space allocatio. For the target applicatio X, whe the applicatio is scheduled N times ad the i-th schedulig time is T i, the total legth of the CPU resource cosumptio profile is defied as T=mi(T 1, T 2,..., T N ), ad the j-th poit The value of the CPU resource cosumptio mootoicity curve Y j =MK(X 1j, X 2j,..., X Nj ), where X ij represets the value of the CPU occupacy of the target applicatio X at the j-th time poit of the i-th schedulig, MK(X, Y,...) represets the mootoic tred of discrete sequeces calculated usig the Ma-Kedall algorithm. 21

4 The Ma-Kedall algorithm is described i detail as follows. (1) For time series X = ( X1, X2, X ), the statistics for the test are as follows. 1 S( X)= sg( xj xk) (3) k= 1 j= k+ 1 1, x > 0 Where sg( x)= 0, x= 0. 1, x < 0 (2) Whe is large eough, it ca be proved that S(X) obeys a ormal distributio with a mea of 0 ad a variace of. Whe >10, the stadard ormal system variable calculatio expressio is as follows. S 1, S > 0 var ( S ) Z= 0, S = 0 S + 1, S < 0 var ( S ) The positive or egative of Z idicates that the origial time series is i a mootoous icreasig tred or a mootoous decreasig tred; the size of Z represets the credibility of the mootoic tred. Whe Z >0.8, the reliability of the mootoic tred of the origial time series is 80%, ad the origial data is cosidered to be mootoous. 4. Resource Type Profilig The resource type profile, which is a further statistical aalysis based o the cosumptio profile curve of a resource, is a overview. For each type of resource, the calculated statistical characteristics iclude total resource cosumptio, mea, peak, cocetratio, reload, resource cosumptio load, etc., ad specific statistical characteristics, such as throughput, for certai resources, occupacy, etc. Resource type profiles iclude total cosumptio, cosumptio mea, kurtosis, skewess, reload, resource load, ad so o. 4.1 Total Resource Cosumptio For the cosumptio profile X of a resource, the total cosumptio S is S=SUM(X 1, X 2,..., X ). 4.2 Mea Value of Resource Cosumptio For the cosumptio profile X of a resource, the cosumptio mea E is E=AVE(X 1, X 2,..., X ), ad AVE is a average fuctio. 4.3 Resource Cosumptio Kurtosis Kurtosis is also kow as the kurtosis coefficiet. Characterizatio of the peak height of the probability desity distributio curve at the mea. Cosiderig the resource cosumptio profile as (4) 22

5 a distributio i probability space, with the ormal distributio as the referece, the kurtosis ca represet the cocetratio of the resource cosumptio distributio i a short time; uder the same stadard deviatio, the greater the kurtosis coefficiet The distributio has more extreme values, the the rest of the values must be more cocetrated aroud the mode, ad its distributio is boud to be steeper, that is, there is a situatio i which the resource cosumptio is excessively cocetrated i a short period of time. For the cosumptio profile X of a resource, the cosumptio kurtosis is as follows. 1 4 ( x ) 1 i u i= K= 1 ( i 1 ( xi u = )) Where u is the mea of resource cosumptio ad is the legth of the cosumptio profile X. 4.4 Resource Cosumptio Skewess The skewess coefficiet is a feature umber that describes the degree to which the distributio deviates from the symmetry. The resource cosumptio profile is regarded as a distributio o the probability space, with the ormal distributio as the referece. Whe the distributio is bilaterally symmetric, the skewess coefficiet is 0. Whe the skewess coefficiet is greater tha 0, that is, whe the heavy tail is o the right side, the distributio is right-biased. Whe the skewess coefficiet is less tha 0, that is, whe the heavy tail is o the left side, the distributio is left-biased. Ituitively, whe the skewess coefficiet is less tha 0, the heavy tail is o the left side, idicatig that the overall resource cosumptio is i the form of quick ad slow ; whe the skewess is greater tha 0, the heavy tail is o the right, idicatig that the overall resource cosumptio is preseted. The form of "slow first ad the urget". For a cosumptio profile X of a resource, the resource cosumptio skewess is as follows x u W= ( ) (5) i 3 (6) i= 1 σ Where u is the mea of resource cosumptio, σ is the stadard deviatio of the cosumptio profile X, ad is the legth of the cosumptio profile X. 4.5 Resource Cosumptio Cocetratio ad Reload The cocetratio of resource cosumptio idicates the proportio of time occupied by the high cosumptio of resources i the overall time; the resource cosumptio overload degree is similar to the cocetratio degree, which is the total cosumptio of resources i the overall time. For a class of resources, whe the job is ruig i the whole process, it is i a high-occupacy ad high-cosumptio mode. This idicates that the correspodig hardware resources are uder great pressure, ad whe the time is too log, there may be a risk of dowtime. For the cosumptio profile curve X of a resource, the resource cosumptio overload degree is as follows. H= xi I{ xi Th} (7) i= 1 The resource cosumptio cocetratio is as follows. 23

6 1 C= I{ xi Th} (8) i = 1 Where is the legth of the cosumptio profile X ad I{} is the sig fuctio. 1, f = true I{} = 0, f = false Th is a threshold, meaig that whe the occupacy rate of the resource parameter is higher tha the threshold, it is cosidered to be high occupacy; whe the resource rate of the resource parameter is lower tha the threshold, it is ot cosidered to be high occupacy. The curretly set threshold Th = 80%, called 80% time cocetratio C 80%. I geeral, the value of the threshold Th ca be set to correspod to differet time cocetratios. 4.6 Resource Load The resource cosumptio load is a idicator that quatifies the resource occupacy curve ad measures the load of a resource per uit time durig the ruig of the target job. For the occupacy curve of a certai type of resources, the resource cosumptio load aalyzes the value of the curve at each time poit. Based o the cosideratio of reducig the overall system load, the high occupacy is give a higher weight, ad the lower occupacy is give a lower value. The weight value, such that the value calculated i the form of a weighted average is called the resource cosumptio load. For the cosumptio profile curve X of a resource, ad T is the legth of the curve X, the detailed algorithm for applyig the resource cosumptio load is as follows. (1) Set the upper boud, lower boud ad icremet times of the algorithm accordig to the rage of values of the resource parameters. For a percetage parameter such as CPU_All_Idle, Mem_All_MemRatio, the upper limit is geerally set to 100, the lower boud is 0, ad the icremet is set to 100. For a parameter with a relatively large value of Net_All_Recv, the logarithm of the parameter value is geerally first, ad the The upper boud is 32, the lower boud is 0, ad the icremet is set to 100. (2) Accordig to the umber of icremets, the lower boud of the algorithm is uiformly icreased to the upper boud of the algorithm. For each icremet, the icremetal threshold is calculated, ad how may parameter values i the time period are higher tha the curret threshold. For example, if the curret threshold is 50, you eed to cout the percetage of the parameter value greater tha 50 i the curret time period as a percetage of the total time. This percetage is the weight correspodig to the threshold. The weight is the threshold obtaied i step (2), ad the icremetal threshold is weighted. If the parameter value higher tha 50 accouts for 20% of the total time, ad the parameter value higher tha 60 accouts for 10% of the total time, the weighted sum is 20%*50+10%*60=16, which is the resource load value. The resource cosumptio aalysis is cetered o the resource cosumptio profile curve, ad the correspodig statistical features are added. The job is cosidered to be relatively ormal whe the cotour curve exhibits the followig patter. 1) The CPU resource cosumptio profile average is less tha 60%, the CPU load is less tha 2000; the memory resource cosumptio profile average is less tha 75%, ad the memory load is less tha ) The CPU/memory cotour stadard deviatio curve mea value is 0, idicatig that the resource cosumptio occupied by each schedulig of the job is cosistet. (9) 24

7 3) CPU/memory/IO resource cosumptio cocetratio is less tha 70% 5. Coclusios I order to aalyze the server resource cosumptio of satellite groud applicatio system, this paper proposes a server resource cosumptio aalysis method based o cotour curve. Through the defiitio of resource cosumptio aalysis, several aalysis methods of resource cosumptio are give, icludig: applicatio resource cosumptio profile, applicatio resource cosumptio profile stadard deviatio, applicatio resource cosumptio frequecy, applicatio resource cosumptio mootoicity ad so o. O this basis, the total cosumptio, cosumptio mea, kurtosis, skewess, reload, resource load, etc. are aalyzed. The method proposed i this paper ca effectively aalyze the server resource cosumptio i depth, thereby improvig server resource utilizatio ad reducig server hardware loss to a certai extet. Ackowledgemets The work preseted i this study is supported by Natioal Key R&D Program of Chia (2018YFB ), Natioal Key R&D Program of Chia (2018YFB ), The Upgrade Program of New Satellite Data Receivig ad Processig System (201601JJ01). Refereces [1] Dawso S, Dawso S, Dawso S, et al. Estimatig service resource cosumptio from respose time measuremets[c]. Iteratioal ICST Coferece o PERFORMANCE Evaluatio Methodologies ad TOOLS. ICST (Istitute for Computer Scieces, Social-Iformatics ad Telecommuicatios Egieerig), 2009:48. [2] Li J, Narasayya V, Chaudhuri S. Robust estimatio of resource cosumptio for SQL queries usig statistical techiques[j]. Proceedigs of the Vldb Edowmet, 2012, 5(11): [3] Dargie W, Schill A. Aalysis of the Power ad Hardware Resource Cosumptio of Servers uder Differet Load Balacig Policies[C]. IEEE, Iteratioal Coferece o Cloud Computig. 2012: [4] Tziritas N, Kha S U, Xu C Z, et al. O miimizig the resource cosumptio of cloud applicatios usig process migratios[j]. Joural of Parallel & Distributed Computig, 2013, 73(12): [5] Moha B R, Reddy G R M. Resource Cosumptio Aalysis Usig ARIMA-ARCH ad ARIMA-GARCH Models for Virtualized Server Cosolidatio System[J]. Iteratioal Joural of Software Egieerig & Its Applicatios, 2017, 11(6):1-14. [6] Ya Y, Guo P, Cheg B, et al. A experimetal case study o the relatioship betwee workload ad resource cosumptio i a commercial web server[j]. Joural of Computatioal Sciece, 2018, 25(03):

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

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

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

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

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

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

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:

More information

Random Graphs and Complex Networks T

Random Graphs and Complex Networks T Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities

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

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

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

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

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

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

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

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

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

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

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

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

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

The measurement of overhead conductor s sag with DLT method

The measurement of overhead conductor s sag with DLT method Advaces i Egieerig Research (AER), volume 7 2d Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 206) he measuremet of overhead coductor s sag with DL method Fag Ye,

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

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Revisiting the performance of mixtures of software reliability growth models

Revisiting the performance of mixtures of software reliability growth models Revisitig the performace of mixtures of software reliability growth models Peter A. Keiller 1, Charles J. Kim 1, Joh Trimble 1, ad Marlo Mejias 2 1 Departmet of Systems ad Computer Sciece 2 Departmet of

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

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

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

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

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

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

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

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of

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

The identification of key quality characteristics based on FAHP

The identification of key quality characteristics based on FAHP Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

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

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

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

Study on effective detection method for specific data of large database LI Jin-feng

Study on effective detection method for specific data of large database LI Jin-feng Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog

More information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

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

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

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

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

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

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

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c Advaced Materials Research Olie: 2013-01-25 IN: 1662-8985, Vol. 659, pp 196-201 doi:10.4028/www.scietific.et/amr.659.196 2013 Tras Tech Publicatios, witzerlad Aalysis of Class Desig Couplig Based o Iformatio

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Statistical Analysis of a Nonstationary Fatigue Data Using the ARIMA Approach

Statistical Analysis of a Nonstationary Fatigue Data Using the ARIMA Approach Statistical Aalysis of a Nostatioary Fatigue Data Usig the ARIMA Approach S. ABDULLAH, M. D. IBRAHIM, A. ZAHARIM AND Z. MOHD NOPIAH Egieerig Faculty, Uiversiti Kebagsaa Malaysia 43600 UKM Bagi, Selagor,

More information

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

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

A Method of Malicious Application Detection

A Method of Malicious Application Detection 5th Iteratioal Coferece o Educatio, Maagemet, Iformatio ad Medicie (EMIM 2015) A Method of Malicious Applicatio Detectio Xiao Cheg 1,a, Ya Hui Guo 2,b, Qi Li 3,c 1 Xiao Cheg, Beijig Uiv Posts & Telecommu,

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

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

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

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

EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS

EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &

More information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

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

A Hierarchical Load Balanced Fault tolerant Grid Scheduling Algorithm with User Satisfaction

A Hierarchical Load Balanced Fault tolerant Grid Scheduling Algorithm with User Satisfaction A Hierarchical Load Balaced Fault tolerat Grid Schedulig Algorithm with User Satisfactio 1 KEERTHIKA P, 2 SURESH P Assistat Professor (Seior Grade), Departmet o Computer Sciece ad Egieerig Assistat Professor

More information

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree 1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:

More information

Bayesian Network Structure Learning from Attribute Uncertain Data

Bayesian Network Structure Learning from Attribute Uncertain Data Bayesia Network Structure Learig from Attribute Ucertai Data Wetig Sog 1,2, Jeffrey Xu Yu 3, Hog Cheg 3, Hogya Liu 4, Ju He 1,2,*, ad Xiaoyog Du 1,2 1 Key Labs of Data Egieerig ad Kowledge Egieerig, Miistry

More information

Anti-addiction System Development Based on Android Smartphone. Xiafu Pan

Anti-addiction System Development Based on Android Smartphone. Xiafu Pan 3rd Iteratioal Coferece o Materials Egieerig, Maufacturig Techology ad Cotrol (ICMEMTC 2016) Ati-addictio System Developmet Based o Adroid Smartphoe Xiafu Pa Haia Vocatioal College of Political Sciece

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

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

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

Spectral leakage and windowing

Spectral leakage and windowing EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

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

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree Available olie at www.ijpe-olie.com vol. 13, o. 7, November 017, pp. 1159-1164 DOI: 10.3940/ijpe.17.07.p19.11591164 Text Feature Selectio based o Feature Dispersio Degree ad Feature Cocetratio Degree Zhifeg

More information

Analysis of Algorithms

Analysis of Algorithms Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

More information

GPUMP: a Multiple-Precision Integer Library for GPUs

GPUMP: a Multiple-Precision Integer Library for GPUs GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract

More information

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas

More information

A DIGITAL WATERMARKING SCHEME BASED ON ICA DETECTION

A DIGITAL WATERMARKING SCHEME BASED ON ICA DETECTION A DIGITAL WATERMARKING SCHEME BASED ON ICA DETECTION Ju Liu,, Xigag Zhag, Jiade Su ad Miguel Agel Laguas, 3 School of Iformatio Sciece ad Egieerig, Shadog Uiversity, Jia 5, Chia Telecommuicatios Techological

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

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Descriptive Data Mining Modeling in Telecom Systems

Descriptive Data Mining Modeling in Telecom Systems Descriptive Data Miig Modelig i Telecom Systems Ivo Pejaović, Zora Sočir, Damir Medved 2 Faculty of Electrical Egieerig ad Computig, Uiversity of Zagreb Usa 3, HR-0000 Zagreb, Croatia Tel: +385 629 763;

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

UNIVERSITY OF MORATUWA

UNIVERSITY OF MORATUWA UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

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

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1 Ozea Joural of Applied Scieces (), 009 Ozea Joural of Applied Scieces (), 009 ISSN 943-49 009 Ozea Publicatio Kerel Smoothig Fuctio ad Choosig Badwidth for No-Parametric Regressio Methods Murat Kayri ad

More information

Cache-Optimal Methods for Bit-Reversals

Cache-Optimal Methods for Bit-Reversals Proceedigs of the ACM/IEEE Supercomputig Coferece, November 1999, Portlad, Orego, U.S.A. Cache-Optimal Methods for Bit-Reversals Zhao Zhag ad Xiaodog Zhag Departmet of Computer Sciece College of William

More information