A SOFT COMPUTING METHOD FOR EFFICIENT MODELLING OF SMART CITIES NOISE POLLUTION
|
|
- Everett Cunningham
- 5 years ago
- Views:
Transcription
1 Iterdiscipliary Descriptio of Complex Systems 16(3-A), , 2018 A SOFT COMPUTING METHOD FOR EFFICIENT MODELLING OF SMART CITIES NOISE POLLUTION Attila Nemes 1, *, Gyula Mester 1 ad Tibor Mester 2 1 Óbuda Uiversity, Doctoral School o Safety ad Security Scieces 1 Budapest, Hugary 2 Geomat-Algotech 2 Budapest, Hugary DOI: /idecs Regular article Received: 23 rd Jauary Accepted: 31 st August ABSTRACT Noise pollutio is oe of the most relevat problems i urba area. The mai source of oise pollutio is the umber ad type of motor vehicles, but other parameters depedig o street cofiguratio yield to a system hardly to be exactly modelled by classical mathematical methods. Smart cities are expected to dyamically cotrol the urba traffic to reduce ot just traffic jams, but also to esure a comfortable oise level for ihabitats. This article gives a desig method for efficiet geetic fuzzy modellig of traffic geerated smart cities oise pollutio based o fuzzy logic, multi objective geetic algorithm, gradiet descet optimisatio ad sigular value decompositio i the MATLAB eviromet. Geetic algorithms with objectives to miimise the maximum absolute idetificatio error, the root mea square of the idetificatio error, reduce model complexity ad esure maximal umerical robustess are applied to Zadeh type fuzzy partitio membership fuctio parameters prelimiary idetificatio, ad the gradiet descet method is used for their fie-tuig optimizatio, while the fuzzy rule cosequece liear parameters are calculated by sigular value decompositio method to fid the least squares optimal traiig data fittig of the model. The traiig data set is built from measured data, combied with carefully selected simulatio data to esure the completeess of the model ad its umerical robustess. Detailed aalysis of the method ad results by computer simulatio of the idetificatio process show the validity of the proposed method. KEY WORDS oise pollutio, mathematical modellig, fuzzy logic, sigular value decompositio, geetic algorithm CLASSIFICATION JEL: Q53, R41 *Correspodig author, : Mr.Attila.Nemes@gmail.com; ; *
2 A soft computig method for efficiet modellig of smart cities oise pollutio INTRODUCTION Noise pollutio is a ucomfortable soud level obstructig the quality of life, typical to idustrial road side areas with high traffic. Traffic jams ad heavy traffic are highly aoyig ad obstructig ot just because of time loss ad icreased egie exhaust air pollutio effects, but also because of oise pollutio. Itelliget, flexible traffic cotrol is oe of the popular subjects of smart city research. Solutios takig care of the life quality of residet people alog roads do cosider the oise levels. There are may passive costructio desig solutios to reduce the traffic oise startig from buildig protective walls, chagig the road surface or platig appropriate vegetatio betwee the road ad houses [1]. The bottom lie is that the traffic ose primarily depeds o two hard to chage factors the street width ad the house heights defiig the geometry, the air volume which is subject to the third obvious factor, the oise source level itself, which is produced by the umber passig vehicles. So a smart city traffic cotrol system balacig the ose pollutio has to primarily relay o balacig the umber of vehicles passig by each fixed cofiguratio street. The oise level depeds ot oly o the umber of vehicles, but also o their type. There are multiple levels of differetiatios; the most basic is: cars, motorcycles ad heavy vehicles [2]. This paper presets a desig method for efficiet geetic fuzzy modellig of the traffic geerated urba oise pollutio. Fuzzy systems are kow to be traiable for uiversal oliear fuctio approximatios eve for as complex problems as multi-rotor copter flight dyamics modellig [3]. By usig Zadeh-type fuzzy partitios for the atecedet part we ca guaratee the cotiuity of the fuzzy system output for the complete iput space [4]. Geetic algorithms are kow powerful tools for global oliear search, thus suitable for efficiet prelimiary idetificatio of fuzzy membership parameters [5] ad also capable of fuzzy structure optimisatio [6]. We use a alterative multi-objective vector compariso i a domiace based rakig method scheme [7], sice the two essetial quality idicators of ay fuctio approximatio the maximum absolute error ad the root mea square error are idepedet properties usually competig with the model complexity, while all are to be simultaeously miimised. Oce the proximity of the global optimum of membership parameters is foud, we ca rely o fast gradiet descet methods to pipoit the exact optimal values of membership parameters that miimise the approximatio error. Usig a appropriate represetatio of the Takagi-Sugeo-Kag type fuzzy logic system the calculatio of fuzzy rule cosequet liear free parameters becomes a high dimesioal, but still a mere liear equatio solvig problem, which we ca solve by a umerically robust, least square error optimal sigular value decompositio method [8]. Aalysig the sigular values of fuzzy rule parameters we ca also evaluate the quality of the used traiig data relative to the plaed atecedet membership fuctio fuzzy-cluster complexity, more eve we ca use this iformatio to select oly importat samples from the traiig data, thus reducig its size, while maitaiig the umerical quality of the solutio [9]. As the (for us) available measured data is by far isufficiet for creatig a uiversal oise level model [10], we iclude to our traiig set results by other models to obtai a well-defied robust complete fuzzy system of cotiuous output, o worse tha the curret kow models, a also havig the potetial for seamless further quality improvemets by traiig for ay further real life measured data or ay ew model data. NOISE POLLUTION MODELLING Noise pollutio soud pressure systems have very complex structure ad therefore it is very hard to idetify. Previous efforts [1, 2] have bee devoted to determiig liear 303
3 A. Nemes, Gy. Mester ad T. Mester represetatios ad liear combiatios of the system parameter logarithmic values i the followig geeral form: L AeqT = α 0 + α 1 eq + α 2 X, (1) where L AeqT is the equivalet cotiuous soud level i decibel (db), α i deotes idetificatio parameters, eq is the umber of or the logarithm of the umber of equivalet vehicles per hour, X is a fuctio of the observer distace from the oise source or W that is either the width or the logarithm of the width of the road, advaced models also accout for H, the average height or the logarithm of the height of buildigs i the cosidered road sectio, which is resposible for the sheer air volume where the oise is distributed, ad also the refractio surface, further o some models also iclude dampeig ad amplifyig modifiers as the road surface quality, the elevatio of the road, distace from juctios ad other vehicle velocity factors. The equivalet umber of vehicles eq, the most importat factor for the oise level ca be i geeral defied as: eq = c + β 1 mc + β 2 hv, (2) where c is the umber of passig cars, mc of motorcycles, hv of heavy vehicles, ad c i are multiplicatio coefficiets usually β 1 is betwee 2 ad 4, β 2 is betwee 8 ad 16. Such liear models are ofte used because they are easy to implemet, albeit they allow oly a approximate modellig of the real urba traffic oise pollutio. For more accurate results i modellig real oliear systems it is advised to use oliear models [11-13]. NOISE MEASUREMENT The set of measuremets is performed o various street roads of a typical medium-size orther Serbia tow of Subotica. The suitable method for determiig the oise pollutio is the measuremet of the effective equivalet A-weighted eergy-average soud pressure level, with the followig approximatio: T L AeqT = 10log ( 1 T 10L i/10 i=1 ), (3) where T is the observatio time, the umber of soud level samples to be accumulated, L i is the A-weighted soud level i db(a), defied i the soud level meter stadards IEC 60651, IEC 60804, IEC 61672, ANSI S1.4. The umber of cars, motorcycles ad heavy vehicles per miute was visually moitored i perso, ad maually couted. FUNCTION IDENTIFICATION BY ZADEH-TYPE FUZZY PARTITIONS For the oise pollutio model idetificatio method we use fuzzy logic systems (FLSs) with Zadeh-formed membership fuctios (MFs). More exactly we use Takagi-Sugeo-Kag (TSK) type FLSs havig =3 iputs ad 1 output. These FLSs ca be expressed as: M M f(x) = l=1 ω l (x) y l (x) / l=1 ω l (x), (4) where M is the umber of fuzzy rules, x is the vector of iput variables, y l is a scalar fuctio of iput variables, ad y is a liear fuctio of iputs for the first order TSKs. Thus y l is defied by + 1 parameters, respectively. The atecedet, the premise part of a fuzzy rule is defied by MFs as: ω l (x) = i=1 μ Fl (i)(x i ), (5) where μ Fl (i)(x i ) is the membership fuctio of the i th iput variable i the l th rule that defies the liguistic value F l(i). The huma readable, ituitive liguistic form of the l th rule from the previously described first order TSK FLS is [14]: 304
4 A soft computig method for efficiet modellig of smart cities oise pollutio IF (x 1 is F l(1) ) AND (x 2 is F l(2) ) AND (x is F l() ) THEN y l = j=1 c l(j) x j + c l(0). (6) We ca use fuzzy partitios defied by Zadeh-formed MFs. For b parameters b 1 b 2 b 3 b 4 defiig the MFs, which are o-liear secod order polyomial, so called Z-, S-, ad π-fuctios, amed after their shape, defied respectively as: 1 x b 1 mfz(x, b 1, b 2 ) = 1 2((x b 1 )/(b 2 b 1 )) 2 b 1 < x ½(b 2 + b 1 ) 2((b 2 x)/(b 2 b 1 )) 2 ½(b 2 + b 1 ) < x b 2 { 0 x > b 2 mfs(x, b 1, b 2 ) = 1 mfz(x, b 1, b 2 ) mfπ(x, b 1, b 2, b 3, b 4 ) = { mfs(x, b 1, b 2 ) 1 x b 2 b 2 < x b 3 mfz(x, b 3, b 4 ) x > b 3. For setups whe more tha oe value x exists, such that the degree of membership of x is equal to oe, the iterval where the μ k (x, b) = 1 (the iterval [b 2, b 3 ] for mfπ type μ k ) is the so-called plateau of the μ k MF. Whe havig for example three aturally ordered liguistic values l {α, β, γ} (for example α = low, β = medium, γ = large ) there are hard costraits o b i parameters to preserve the atural liguistic orderig: b a1 < b b1 < b c1 b a2 b a3 < b b2 b b3 < b c2 b c3 b a4 < b b4 < b c4. Whe a liguistic variable ca be assiged K differet liguistic values, each described by a MF μ k (x, b) such that for every iput x it holds that K k=1 μ (x, b) = 1, the MFs are said to k form a fuzzy-partitio. By imposig restrictios (8) o all liguistic variables of the FLS, ad assumig the rule base is complete it covers the whole iput domai it follows that the TSK model structure (4) for a multi-iput x vector simplifies to [15]: f(x) = M l=1 ω l (x, b l ) y l (x, c l ) = W(x, b) c, (9) where c is the compoud vector of all the so called liear c l ad b is the compoud vector of o-liear b l parameters (parameters defiig the liear ad o-liear sub-fuctios) of the fuzzy system ad W is the appropriate compoud coefficiet matrix such that equatio (9) holds. This way the resultig formula is simple, still guaratyig uiform iput coverage ad cotiuous system output TSK FLSs of fuzzy partitios ca eve be made periodic [3, 18]. MULTI-OBJECTIVE GENETIC ALGORITHMS A geetic algorithm (GA) is costructed o bases of imitatig atural biological processes ad atural Darwiia evolutio. GAs are widely used as a search ad optimisatio tool [16]. Real-life optimisatio problems ofte have multiple objectives. The compariso of two vectors i this case is ot trivial. Multiobjective optimisatio ca be defied as the problem of fidig a vector of decisio variables which satisfies costraits ad optimises a vector fuctio whose elemets represet the objective fuctios. These fuctios form a mathematical descriptio of performace criteria that are usually i coflict with each other. Hece, the term optimise meas fidig such a solutio that would give the values of all the objective fuctios acceptable to the desiger [17]. Itroduced i [5] ad elaborated i [18] the idea behid the defiitio of a ew vector compariso algorithm, amed quality-domiace is to exted the Pareto-domiace relatio i a way that a domiatio decisio could be also made for vectors, which are ot comparable (7) (8) 305
5 A. Nemes, Gy. Mester ad T. Mester by Pareto domiace, while a huma heuristic would ame a clear preferece. Defiig a domiace relatio < q (r, s) (or briefly g < q s) betwee two vectors of elemets r = (r i ) ad s = (s i ), for i=1.., N +, where each i th elemet type has a well-defied scalar < (less tha) strict partial order biary edorelatio ad also the equivalece relatio = is defied. Defiig a helper fuctio # q< (r, s), which for vectors r ad s defies two values (g r, l r ) = # q< (r, s), where g r, l r N 0 ad g r is equal to the cardiality of set G rs ={ r i s i < r i }, i=1..; ad l r is equal to the cardiality of set L rs ={ r j r j < s j }, j=1... For a miimisatio problem vector r quality-domiates vector s, or briefly: r < q s if g r < l r or i case of g r = l r r qualitydomiates vector s if i (r i s i ) < j (s j r j ), where i is such that r i G rs ad j is such that r j L rs. I [5] a measuremet value for < q (r, s) is defied as d <q (r, s) = { (s j r j ) j l r g r, for g r < l r, where i is such that r i G rs ad j is such that r j L rs. (r i s i ) l i, for g r g r = l r, r We use the domiace measuremet based rakig method [18]. At geeratio t the domiace measuremet based rak of the i th t idividual r i i a GA populatio, which domiates all s t j idividuals i the curret populatio is the i th idividual curret positio, the idividual s rak is defied as: rak i (r i t ) is the sum of the domiated compariso measuremets for every other s j t idividual of geeratio t i correlatio to the i th idividual. rak(r t i ) = j=1 d < (r t i, s t j ), where * ca stad for ay compariso method (the classical Pareto vector-, the ew quality vector-, or the simple weighted sum scalar-compariso) [18]. The key questio for a GA is the codig of possible solutios, which will evolve through several geeratios. Fudametal schemata theory suggests that small alphabets are good, because they maximise the umber of schema available for geetic processig, so biary codig is implemeted [16]. To avoid Hammig cliffs Gray codig is used. Low probability (1 %) mutatio is a importat part of every GA. The chromosomes are simply the cocateated bit strigs of all the parameters with fixed positio for every gee, high probability (0.8) simple two poit crossover will esure low disruptiveess ad high rate of iheritace durig the reproductive phase. Stochastic uiversal samplig havig miimal spread ad zero bias is used for selectio with a rather low (1.2) selectio pressure. Cotiuous exploratio of the search space is achieved together with cosistet covergece by the combiatio of geetic operators i this maer [3-5, 7-9, 18]. SINGULAR VALUE DECOMPOSITION AND GRADIENT DESCENT BASED FUZZY MODELLING We use the miimal uiversal represetatio of Zadeh partitios, by which it ca be easily optimised without ay costraits, the method as itroduced i [3, 4] ad elaborated i [18]. To represet a fuzzy partitio of K membership fuctios we take K pieces of ratioal, positive or zero parameters a κ R 0 +, κ = 1,, K ad form the b k oliear parameters of the Zadeh-type MFs formig fuzzy-partitios as: k (10) b k = j=1 a j / K κ=1 a κ. (11) For cases whe a a κ = 0 we obtai b k = 0, thus the fuzzy partitio structure complexity is reduced by oe MF, thus the complete fuzzy system structure complexity, the umber of rules are sigificatly reduced. I cases whe there remais oly a sigle a κ > 0 the fuzzy system 306
6 A soft computig method for efficiet modellig of smart cities oise pollutio rule degrades to a simple liear equatio. Fially, i the case whe all K pieces of a κ = 0 the fuzzy partitio ad the whole fuzzy cosequet degrades to a costat, ad the fuzzy system becomes idifferet to the reduced iput chael; it becomes idepedet of the correspodig iput variable. These a κ parameters are suitable for efficiet stochastic global search as by GAs, ad ca be freely fie-tued with ay gradiet descet-based method [3-5, 8, 18]; also the Jacobia of the FLS ca be calculated with regards to a κ for advaced oliear least squares data fittig methods. The proposed fuzzy-partitio represetatio has bee used i a multi-objective geetic algorithm [5, 18]. Oe chromosome cosists of the umber of MFs for every iput ad the correspodig parameters as i equatio (11) for every possible MF partitio of each iput. The populatio size is selected to be 50 times the umber of parameters. For parameter codig we use 16 bit biary Grey-coded chromosomes. The objective fuctios we have used are: maxe the maximum absolute error of the idetificatio, MSE the mea squared error of the idetificatio, RuleN the umber of used fuzzy rules for the idetificatio divided by the maximum possible umber of rules for the selected desig, RakW is calculated from the matrix rak of W(x, b) of equatio (9), which is ormed to the theoretically maximal possible rak of the same FLS structure. Based o the trasformatio of the TSK FLS equatio (9) to the f(x) = W(x, b) c format, we split the idetificatio ito two problems: First part is the oliear problem of fidig optimal W(x, b(a κ )) values, which are defied as a fuctio of system iput vector x ad the oliear MF b k parameters of equatio (7). By represetig b k as a fuctio of a κ via equatio (11) ay umerical oliear ucostraied optimisatio ca be applied to a κ parameters. The secod part, whe W(x, b) is fixed (by selected optimal, or cadidates for optimal b parameters) to costat values, of the problem is a simple solutio to a liear equatio system, which is best solved for a give traiig data set of {iput, output} sample vectors of { x traiig, f traiig } time series i a error square optimal maer by the umerically robust, geeral SVD decompositio method as: c = VS 1 U T f traiig for the SVD decompositio of W traiig (x traiig, a κ ) = USV T. I the applied GA chromosomes are evaluated through the followig eight steps. 1.) For each i of iputs: K i, umber of MFs of the i th iput is decoded from the chromosome. 2.) For each K i : correspodig a κ parameters are decoded from the chromosome. 3.) All required parameters b of Zadeh-formed MFs of equatio (7) that form fuzzy partitios are calculated as proposed i (11). 4.) Usig traiig iputs x traiig, all possible traiig atecedets ω l (x traiig ) are formed from are evaluated as i equatio (5) to get W traiig (x traiig, a κ ) of equatio (9). 5.) y l (x traiig ), the correspodig fuzzy rule traiig cosequet parts for all traiig umerical iputs are evaluated by SVD based LS method as: c = VS 1 U T f traiig, (12) by the SVD of the compoud atecedet matrix of USV T = W traiig (x traiig, a κ ) ad f traiig is the measured traiig oise level. 6.) parameters a κ of step 2.) are further optimised by a gradiet decet based method for o more tha i=1 K i steps, where is the dimesio of the iput space ad K i is the umber of used MFs. For every gradiet descet iteratio step 4.) ad 5.) are repeated. 307
7 A. Nemes, Gy. Mester ad T. Mester 7.) The resultat fuzzy system f(x) is evaluated by equatio (9) for the test data set, which is disjuct to the traiig data set separated radomly from available samples before the idetificatio process starts ad its cardiality is 10% of the traiig data set. 8.) For the test data set the maxe, MSE, RuleN/maxRuleN, RakW/maxRakW of the idetificatio is calculated, where maxrulen =, ad maxrakw = (+1) maxrulen. i=1 K i To icrease the efficiecy of the GA after each evaluatio the iitial chromosome defiig a fuzzy system used i step 1.) ad 2.) is updated with its optimised MF parameter values resultig from step 6.). FUZZY SYSTEMS TRAINING DATA SET QUALITY ANALYSIS AND REDUCTION Traiig data set, a prerequisite for system idetificatio is a set of measuremets of system resposes, outputs to be modelled f traiig while the system is beig drive alog a predefied trajectory of iputs x traiig. As this iput traiig path must be sufficietly exitig so that all system output characteristics ca be observed, it is atural that for a good quality idetificatio we must operate with very large iput-output traiig data sets. Evaluatig models, iteratively optimisig parameters alog large traiig sets ad especially performig SVD of large matrices is extremely time cosumig. Thus, it is always a challege for idetificatio tasks to fid sufficietly excitig, but ot a oversized traiig data set. I case of modellig complex systems filterig out uecessary samples, while still leavig all the ecessary data for good quality idetificatio is ot a trivial strait forward process. I case of every idetificatio problem, specific approaches are used whe deemed ecessary. The coditio umber of a matrix i our case the compoud atecedet data set USV T = W traiig which defies a liear system of equatios i our case equatio (9) is called the coditio umber of the equatio; it is the ratio of the largest ad the smallest sigular value i our case for S = [s ij ] it is cod(w traiig ) = max(s ii ) / mi(s ii ). The higher the coditio umber, the more ucertai the solutio is; the more chaotic, the more sesitive the solutio is to small disturbaces of system parameters. The atural goal for a good quality, robust liear system solutio is to have as small a coditio umber as possible. A very well-coditioed liear system of equatios has a coditio umber of three orders of magitude less tha the reciprocal of the umerical precisio of our calculatios. I case of double precisio floatig poit digital computer calculous we ca rely o a umerical precisio of at least ~10-16, which meas that ay coditio umber < will already result i a sufficiet precisio of up to six decimal places, but of course a < 10 3 coditio umber will be preferred. Rak deficiecy of W traiig is obviously out of questio whe the goal is to get a complete fuzzy system with o udefied rules o udefied outputs for ay iput regio. For a idetificatio error least squares (LS) optimal c vector oe ca use the SVD trasformatio property as i equatio (12) c = VS 1 U T f traiig.full for the SVD decompositio of W traiig.full = [W(x traiig.full, b)] = USV T, where f traiig.full is the vector of all available traiig data, for the iput traiig series [x traiig.i ], i = 1,.., N; where N is the umber of all available traiig data iputs. As itroduced i [9] ad elaborated i [18] we apply a greedy selectio algorithm to [x traiig.i ] ad thus to the correspodig f traiig.i traiig data set, such that we ca determie a arbitrary quality per size balaced, but reduced traiig data set x traiig.reduced = [x traiig.j ] ad a correspodig f traiig.reduced for FLS based fuctio idetificatios. The objective of the 308
8 A soft computig method for efficiet modellig of smart cities oise pollutio greedy search is to select iput-output traiig data pairs ([x traiig.j ], f traiig.j ), such that they maximise the coditio umber decrease of the W traiig.reduced = [W(x traiig.j, b)] of the FLS atecedet matrix [18]. Cosiderig the proof of the uiversal fuzzy approximatio theorem, for a geeral case we caot boudlessly geeralise our fuzzy model, we caot reduce the umber of MFs ad by this the required rak of W to a arbitrary low level, sice by this we lose the uiversal fuctio approximatio quality of our FLS. O the other had if we go for a too complex fuzzy structure, however large the measured traiig data set we capture, there is a poit after which there will be o idepedet samples (rows of W will ot be liearly idepedet), the traiig path is called isufficietly excitig, the traiig data is ot fit for defiig a complete TSK FLS based o fuzzy partitio atecedets, the matrix rak of W of equatio (9) will ot be complete, it will be rak(w) < ( + 1) K i, where is the dimesio of the iput space ad K i is the umber of used MFs. Cosequeces of such a idetificatio attempt is popularly called idetificatio overfittig, where the model ca oly precisely match the traiig data, while it performs poorly o disjuct test data sets, which did ot take part i the idetificatio process. The approach take i this paper is to exted the real measured traiig data set of 120 samples (Figure 1.) with a carefully reduced set of 800 simulatio values based o equatios (1) ad (2) of [1, 2]. The same approach ca be take for ay further ew measuremet data or ay further ew reliable models, which we wat to merge i, thus to re-trai our model for a higher precisio or eve to iclude ew iput regios. i=1 a) b) c) Figure 1. Traiig data set measured system iputs of a) average buildig heights (m), b) average Street width (m) ad c) umber of equivalet vehicles per secod. IDENTIFICATION RESULTS The GA process covergece is preseted alog the idetificatio error objective chages through 50 geeratios of evolutio i Figure 2. The selected o-domiated idetificatio solutio has 48 rules defied for [4, 3, 4] MFs correspodig to iputs [ eq, W, H]. The a κ parameters are [291, 25068, 43316; 30436, 29813, 0; 29442, 26577, 56388]. The correspodig b parameters are [0, , , 1; 0, , 1; 0, , , 1]. The fuzzy partitios are graphically preseted i Figure 3. The traiig data had bee exteded to result i system output as preseted o Figure 4., which also presets the overlappig output of a selected o-domiated solutio ad separately the correspodig traiig data idetificatio error. The expected system output, the system idetificatio output, ad the idetificatio error alog radomly selected test samples, which did ot take part i the traiig process, are preseted i Figure
9 A. Nemes, Gy. Mester ad T. Mester Figure 2. GA covergece a) maximal absolute error evolutio, b) mea square error evolutio. Figure 3. Zadeh type fuzzy partitios for the premise part of iputs [ eq, W, H]. Figure 4. Traiig data set outputs a) desired ad idetified output (dba), b) traiig error (dba). 310
10 A soft computig method for efficiet modellig of smart cities oise pollutio Figure 5. System idetificatio test results: expected ad idetified output, dba (left), idetificatio error, dba (right). CONCLUSIONS The preseted idetificatio method is capable of sufficietly precise modellig of real measured systems (which data has oise ad measuremet error) ad approximatig simulated system (o oise, o measuremet error) models to a extreme precisio. The defiitio of fuzzy partitios provides a guaratee that the resultig FLS uiformly covers the complete defied iput space, more eve the FLS structure guaraties its output is cotiuous for the complete iput space. By extedig the measured traiig data set with simulated values, we have esured that our model output is owhere sigificatly worse tha a selected mathematical model, while it precisely approximates the measured data of the real system for all iputs that are i the appropriate rage of the provided measured traiig data set. By extedig the traiig data set ad repeatig the idetificatio process our model is easily fie-tued to match further real data. This robust oise pollutio model ca be used for makig traffic cotrol decisios where the iduced oise levels have to be cofied. The cotrolled street cofiguratio must be defied by the street width ad average buildig height, the cotrol iput is the equivalet car umber ad the system model output is the resultig oise level. REFERENCES [1] Gulliver, J. et al.: Developmet of a ope-source road traffic oise model for exposure assessmet. Evirometal Modellig ad Software 74, , 2015, [2] Vicezo, B.; Crocco, F. ad Mogelli, D.W.E.: A mathematical model for traffic oise predictio i a urba area. I: Mastorakis, N., et al., eds.: Recet Advaces i Mechaics. Proceedigs of the 4th WSEAS Iteratioal Coferece o Urba Plaig ad Trasportatio. WSEAS Press, Corfu, pp , 2011, [3] Nemes, A.: Cotiuous Periodic Fuzzy Logic Systems ad Smooth Trajectory Plaig for Multi-Rotor Dyamic Modelig. Acta Polytechica Hugarica 13(6), , 2016, [4] Nemes, A.: Fuctio Idetificatio by Ucostraied Tuig of Zadeh-type Fuzzy Partitios. 2d Iteratioal Symposium of Hugaria Researchers o Computatioal Itelligece. Budapest, 2001, [5] Nemes, A.: System Idetificatio Based o Multi-Objective Optimisatio ad Ucostraied Tuig of Zadeh-type Fuzzy Partitios. 2d IEEE Iteratioal Symposium o Itelliget Systems ad Iformatics, Subotica, 2003, 311
11 A. Nemes, Gy. Mester ad T. Mester [6] Mester, G.; Pletl, S.; Nemes, A. ad Mester, T.: Structure optimizatio of fuzzy cotrol systems by multi-populatio geetic algorithm. 6th Europea Cogress o Itelliget Techiques ad Soft Computig. EUFIT 98, 1, pp , 1998, [7] Nemes, A.: New Geetic Algorithms for Multi-objective Optimisatio. 1st Iteratioal Symposium of Hugaria Researchers o Computatioal Itelligece, Budapest, 2000, [8] Nemes, A. ad Mester, G.: Ucostraied Evolutioary ad Gradiet Descet-Based Tuig of Fuzzy partitios for UAV Dyamic Modelig. FME Trasactios 45(1), 1-8, 2017, [9] Nemes, A. ad Latos, B.: Traiig Data Reductio for Optimisatio of Fuzzy Logic Systems for Dyamic Modellig of Robot Maipulators by Geetic Algorithms. IEEE Istrumetatio ad Measuremet Techology Coferece, IMTC 2001, Budapest, 2001, [10] Mester, G.; Nemes, A.; Pletl, S. ad Mester, T.: Soft Computimg metoda za optimalo modeliraje buke. 5 th Symposium o Computer Scieces ad Iformatio Techologies, YUINFO '99, Kopaoik, pp.1-5, 1999, [11] Rodic, A.; Mester, G. ad Stojkovic, I.: Qualitative Evaluatio of Flight Cotroller Performaces for Autoomous Quadrotors. I: Pap, E., ed.: Itelliget Systems: Models ad Applicatios. Topics i Itelliget Egieerig ad Iformatics 3. Spriger-Verlag, Berli & Heidelberg, pp , 2013, [12] Mester, G.; Pletl, S.; Pajor, G. ad Rudas, I.: Adaptive Cotrol of Robot Maipulators with Fuzzy Supervisor Usig Geetic Algorithms. I: Kayak, O., ed.: Iteratioal Coferece o Recet Advaces i Mechatroics, ICRAM 95. 2, Istabul, pp , 1995, [13] Mester, G.; Pletl, S.; Pajor, G. ad Jeges, Z.: Flexible Plaetary Gear Drives i Robotics Iteratioal Coferece o Idustrial Electroics, Cotrol, Istrumetatio ad Automatio Robotics, CIM ad Automatio, Emergig Techologies, IEEE IECON '92, 2, pp , Sa Diego, 1992, [14] Wag, L.: Adaptive Fuzzy Systems ad Cotrol: Desig ad Stability Aalysis. Pretice Hall, Eglewood Cliffs, 1994, [15] Helledoor, H. ad Driakov D., eds.: Fuzzy Model Idetificatio, Selected approaches. Spriger-Verlag, Berli & Heidelberg, 1997, [16] Goldberg, D.E.: Geetic Algorithms i Search, Optimizatio ad Machie Learig. Addiso-Wesley Logma Publishig Co. Ic., Bosto, 1989, [17] Osyczka, A.: Multicriteria optimisatio for egieerig desig. I: Gero, J.S., ed.: Desig Optimisatio. Academic Press, pp , 1985, [18] Nemes, A.: Tools for Efficiet Soft Computig Modellig ad Feasible Optimal Cotrol of Complex Dyamic Systems. Ph.D. Thesis. Óbuda Uivesity, Budapest,
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 informationPattern 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 informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationA 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 informationCubic 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 informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationA 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 informationCounting 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 informationDynamic 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 informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More information3D 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 informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationA 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 informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationNew 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 informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationLecture 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 informationANN 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 informationEvaluation 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 informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationBig-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 informationFuzzy Linear Regression Analysis
12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical
More informationImproving 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 informationCopyright 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 informationAn 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 informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationAdaptive 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 informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationImage 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 informationNew 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 informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationFilter 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 informationAn 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 informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationAssignment 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 informationProbabilistic 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 informationFast 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 informationBig-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 informationThe 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 informationData 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 informationMining from Quantitative Data with Linguistic Minimum Supports and Confidences
Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.
More informationPython 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. 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 information2D Isogeometric Shape Optimization considering both control point positions and weights as design variables
1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul
More informationLecture 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 informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
More informationUsing a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations
Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationImprovement 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 informationRedundancy 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 informationPseudocode ( 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 informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationOptimal 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 information1 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 informationWhat 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 informationBASED 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 informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationEM375 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 informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationA Comparative Study on Modeling Methods for Switched Reluctance Machines
Computer ad Iformatio Sciece Vol. 3, No. 2; May 21 A Comparative Study o Modelig Methods for Switched Reluctace Machies Shouju Sog & Weiguo iu School of Automatio, Northwester Polytechical Uiversity PO
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationare 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 informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationConvex hull ( 凸殻 ) property
Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull
More informationNON-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 informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationMulti Attributes Approach for Tourist Trips Design
Multi Attributes Approach for Tourist Trips Desig Ilaria Baffo 1, Pasquale Caroteuto 2, Atoella Petrillo 3, Fabio De Felice 4 1 Idustrial Egieerig School (DEIM) - Uiversity of Tuscia, Italy ilaria.baffo@uitus.it
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationEvaluation 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 informationChapter 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 information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationSorting 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 informationAnalysis 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 information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationA 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 informationRunning 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( 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 informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationIdentification 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 informationAnalysis 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 informationOptimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm
Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.
More informationOptimal Tolerance Allocation Based on Fuzzy Comprehensive Evaluation and Genetic Algorithm
It J Adv Mauf Techol (2000) 16:461 468 2000 Spriger-Verlag Lodo Limited Optimal Tolerace Allocatio Based o Fuzzy Comprehesive Evaluatio ad Geetic Algorithm S. Ji, X. Li, Y. Ma ad H. Cai The Advaced Machiig
More informationA General Framework for Accurate Statistical Timing Analysis Considering Correlations
A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of
More informationGoals of this Lecture Activity Diagram Example
Goals of this Lecture Activity Diagram Example Object-Orieted Aalysis ad Desig - Fall 998 Preset a example activity diagram Ð Relate to requiremets, use cases, ad class diagrams Also, respod to a questio
More informationDETECTION 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 informationArithmetic 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 informationAdministrative 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