THE FAULT LOCATION ALGORITHM BASED ON TWO CIRCUIT FUNCTIONS
|
|
- Colleen Edwards
- 5 years ago
- Views:
Transcription
1 U THE FAULT LOCATION ALGORITHM BASED ON TWO CIRCUIT FUNCTIONS Z. Czaa Char of Electronc Measurement, Faculty of Electroncs, Telecommuncatons an Informatcs, Techncal Unversty of Gañsk, Polan The paper presents an algorthm for etecton an locaton sngle parametrc faults n analogue electronc crcuts base on makng use of nput-output measurements. It utlses two crcut functons (for nstance: voltage transmttance K U an nput opene amttance Y n measure on the same frequency for the fault locaton. Each of crcut functons s regare as blnear transformaton. When we put together these transformatons nto a three-mensonal space (for nstance: Re(K U, Im(K U, Y n t s wreste a famly of curves representng the changes of respectve elements' values. Ths composton causes ncreasng selectvty of the fault locaton, because the curves o not cut themselves an furthermore they are more separate, than t has place n classcal applcatons of blnear transformaton. The algorthm conssts of two parts. Frst part s ame at etermnaton of the optmum measurng frequency for a smultaneous measurement of two crcut functons. Secon part acheves the fault locaton. It was chosen 3-orer low-pass Butterwoth Flter to verfy the algorthm. Keywors: Blnear transformaton, Detecton sngle parametrc faults INTRODUCTION For many electronc crcuts as well as electrc moels representng techncal, physcochemcal an bologcal obects, there s no possblty of access to the nteror of crcut. Therefore agnostc base on nput-output measurements has growng mportance. One of the methos for ths agnostc s blnear transformaton [][]. It s use for locaton of the parametrc faults n not very complex two -, an four termnal networks RC. Geometrc nterpretaton of blnear transformaton F(p, where p- element's value, s complex plane, on whch we raw up famly of arcs representng changes of nvual elements' values (Fg.. The locaton of the sngle fault conssts n measurng of functon F(p an plottng the measurement pont on plane []. If the measurement pont les of one of these arcs, than the fault element s the one, for whch curve has been mae [][3]. From Fg. showng the famly of arcs rawn up for 3-orer low-pass Butterwoth Flter (Fg. we see, that the curves are near each other, an n some places they are crss-crosse, makng mpossble n ths way unambguous R C R R3 C C3 + _ U locaton of the sngle fault. Atonally, locaton of the fault element wll be more ffcult, because measurements are burene wth errors, whch make, that the measurement result oes not necessary nee to le on the curve representng the fault element (Fg.. Fgure. 3-Orer Low-Pass Butterwoth Flter uner nvestgaton (DUT, where: R=R=R3=0kΩ, C=4.3nF, C=3nF, C3=0nF. In ths artcle we propose an algorthm that solves scusse problem. In our conseratons we assume followng presumptons: - Dagnose crcut s lnear. - There can be only one parametrc fault n crcut. - We know crcut typology an nomnal values of all elements.
2 - We make test at only one measurement frequency. - There s a measurement error of crcut functons parameters. The works that have been mae so far, analyse problem on complex plane, usng for t measurement of one crcut functon [][][3][4]. In ths artcle we propose smultaneous measurement of two crcut functons: F(p - voltage transmttance an G(p - nput amttance. Usng both crcut functons, we take moellng of changes of elements' values from plane to three-mensonal space. Pcture 3 shows n 3D space the famly of threemensonal curves representng changes of elements' values of flters presente on pcture. As we can see on pcture, we result wth lack of crss-crossng of curves representng changes of elements' values an ncrease of stance between them. It has mae the fault locaton more unambguous (selectve what wll be presente n chapter 3. Analyse was mae wth program Matlab. Fgure. The graphc representaton of the bllnear transformaton F(p - the arc famles. Fgure 3. The graphc representaton of the composton of two crcut functons F(p an G(p - the curve famles.
3 . AN ALGORITHM FOR DETECTION OF THE SINGLE FAULTS Locaton of the sngle parametrc fault s base on the followng thess: The fault element s the one for whch three-mensonal curve s the nearest to the measurement pont. The algorthm s compose wth two parts. The task for frst pre-testng component s to etermne optmal frequency wth whch there are the best crcumstances for smultaneous measurement of two crcut functons an etecton of the sngle faults. After choosng proper frequency, there s atabase generate contanng value of optmal measurement frequency an co-ornates of the nomnal pont. Secon component of the algorthm localses the fault element by choosng curve n space, whch s the nearest (accorng to etermne crtera to the measurement pont. In three-mensonal space each curve can be escrbe by parametrc equaton. For analyse case form of mensonal curve corresponng wth changes of value of -th element s gven analytcally n the followng way: x y z = Re( F ( p = G ( p ( where: =,...N, N - number of elements n crcut (For DUT N=6, F- the transmttance voltage, G - the nput amttance of crcut Both algorthms pre-testng an testng use propose escrpton of curve.. Determnng of optmal measurement frequency The man pre-teste problem s etermnng optmal measurement frequency wth whch take place suffcent senstvty of both crcut functons n epenence on all elements of teste crcut. For etermnng of optmal measurement frequency we assume crtera escrbe n [4]. Because t has concerne only case on plane, we have ntrouce changes connecte wth transton to threemensonal space. The algorthm s followng. On the begnnng we set startng frequency, frequency step f step an number of steps S. Next, for each frequency f=f step s, where s=,...,s we make the followng actons: - Calculaton of co-ornates of the nomnal pont (x nom,y nom,z nom, where all curves (escrbe by equaton ( representng changes of each elements' values crss-cross. - Calculaton of co-ornates of the fnals of these curves (x,y,z (x,y,z, where =,..,N, - Determnng of a stance between the nomnal pont an each of the fnals of curves: - stance from the frst, +N - stance of the secon fnal of three-mensonal curve from the nomnal pont = ( ( x xnom + ( y ynom + ( z z nom = N ( x xnom ( y ynom ( z z nom (3 - Determnng of evaton coeffcent length between curves á(s [4]. Next, we etermne á mn as mnmal value among calculate set of á: mn{ ( s} α = α. On ths bases we can efne optmal measurement frequency for whch wll be mae measurements of crcut functons, whle testng of the crcut. For teste crcut t amounts to f opt =700Hz. Locaton of the sngle fault n the crcut The am of algorthm s locaton of the sngle faults n the crcut. An algorthm s lookng for curve, whch s the nearest to the measurement pont plotte n three-mensonal space. An algorthm s compose of the followng steps:. From the pre-testng algorthm we take the optmal measurement frequency f opt (for the teste crcut f opt =700Hz an co-ornates of the nomnal pont (x nom,y nom,z nom. We etermne set of ponts, represente by three vectors of co-ornates x, y, z for -th curve. mn s
4 3. We calculate mnmal stance of the measurement pont P m wth co-ornates (x m,y m,z m from -th curve calle a coeffcent of nearness â(. 4. Steps an 4 are mae for N curves. 5. From the set of calculate coeffcents of nearness {â(}, =,..,N we etermne mnmal value â mn On the bases of t we etermne whch curve s the nearest to the measurement pont, an n ths way, whch element s fault. The key element n ths algorthm s step 3. From the earler calculatons each curve s represente by three vectors of co-ornates x, y, z. We can also escrbe each of them by equaton (. It s theoretcally possble to etermne each equaton escrbng epenence on change of each coornate gven curve, by blnear transformaton. But the forms of result functons are very complex (the level of complexty rse wth amount of elements, an beses ths, each functon we shoul etermne analytcally for each element separately. There are 8 equatons for teste crcut. Secon, very mportant savantage of ths approach s lack of unversalty. The etermne set of functon fts only to one crcut typology, therefore propose algorthm woul be not unversal. We ece to use algorthm searchng for mnmal stance of the measurement pont from gven curve - escrbe below. The ponts representng the curve are place wth uneven ensty. Therefore for ncreasng precson of etermnng coeffcent of nearness â, we ece to use parabolc nterpolaton, mae for three of curve's ponts whch are the nearest to the measurement pont, an next we etermne mnmal stance between curve (4 an the measurement pont:. We search for a pont P (x,y,z from the set of co-ornates x, y, z representng gven curve, the pont, whch s the nearest to the measurement pont P p an two ponts P k (x k,y k,z k P l (x l,y l,z l surrounng pont P, where pont P k s nearer to the measurement pont P p than pont P l, where k,l=±.. We make parabolc nterpolaton for range (P, P k on the bases of ponts P, P k, P l an we result wth the followng escrpton of curve [5]: x = x y = Ax + Bx + C z = Dx + Ex + F (4 Ths approxmaton s suffcent, because from the property of testng algorthm follows, that for locaton of faults t s enough, that the measurement pont s nearer to gven curve than other curves, an moreover, the shape of curves s smlar to parabolc (Fg Next, we etermne absolute error Ä that woul be mae by mpeance meter HP 49A at measurement of the value corresponng wth pont P (n verfcaton of ths metho use of the meter HP 49A s planne. 4. On the bases of Ä we etermne amount of ponts approxmate curve (4, lyng between P a P k, accorng to formula: m = ( x x k + ( y y k + ( z z k M (5 where: M=0 coeffcent of ecreasng approxmaton error n relaton to the measurement error. 5. At the last stage on the bases of (4 we etermne co-ornates of ponts lyng between P a P k an stances between these ponts an the measurement pont. Next, from the set of calculate stances we fn mnmal value, whch s coeffcent of nearness â for gven curve. 3 AN INFLUENCE OF ADDITIONAL DIMENSION ON QUALITY OF THE SINGLE FAULTS LOCATION By connecton of two blnear transformaton F(p an G(p n one, represente by threemensonal space (Fg. 3 we get ncrease stance between curves representng changes of nvual elements' values (curves are more separate each from other. In ths way we acheve fact, that the locaton of sngle faults n crcut s more unambguous. Atonally, we elmnate possble crss-crossng of curves (Fg., what make unambguous etermnng of the fault element mpossble.
5 Here we ntrouce the proof that by escrbe metho we acheve fact, that locaton of the sngle faults s more unambguous than n methos base on blnear transformaton [][3] analysng only on plane.. Fact, that locaton of the sngle faults s more unambguous s connecte wth ncrease stance between curves (between any ponts on any two curves.. Let be gven two blnear functons: F A p + B ( p = (6a C p + D G E p + F ( p = (6b H p + K where: A, B, C, D, E, F, H, K complex coeffcents for functons mae for -th element, where =,..,N, N number of elements n crcut. In the same way we can escrbe functon for -th element, where, =,..,N. 3. Because each from complex coeffcents for functons rawn up for -th an -th element has the followng form: that A A, B B etc. From that, we get functon n form: an A = A ( p,.., p A = A ( p,.., p F (p, p +, p,.., p + F (p N,.., p N where: (7 (8 G (p G (p (9 4. We can wrte parametrc equatons for curves on plane, representng changes of value of -th element an -th element n the followng way: [4] x y = Re( F ( p (0a x y = Re( F ( p (0b From ths, we can efne square of stance between any pont lyng on curve rawn up for -th element, an any pont lyng on curve rawn up for -th element: l = ( x x + ( y y ( 5. In 3D space we get followng parametrc equaton of curves representng -th an -th element: x y z = Re( F ( p = G ( p (a x y z = Re( F ( p = Im( F ( p = G ( p (b From ths we can wrte square of stance between two any ponts lyng on nvual curves representng -th an -th element n ths way: = ( x x + ( y y + ( z z (3 6. Usng formula: ( an (3 we can wrte n form: = l + ( z z (4
6 Because from the formula (9 an ( we can wrte, that An n ths way from (4 an (5 follows, that: (z z 0 z z so from ths: (5 l (6 So stance between the same ponts n three-mensonal space s always larger than ther stance n two-mensonal space. These stances are equal only for the nomnal pont, what means lack of faults n crcut, an n ths case amounts to 0. 4 CONCLUSSION Presente algorthm for locaton of the sngle faults n teste crcut DUT, base on smultaneous measurement of two crcut functons solves the problem of locaton of faults n case, when the measurement pont oes not le on any of curves. It s characterse by smplcty of work an n ths way spee of work an s easly mplemente n programmng envronment. Moreover, ntroucton of 3D menson makes locaton of sngle faults n crcut more unambguous (even a few ozen tmes (Fg. 4. It s the next step [4] for mplementng presente metho n practce, because all measurements are buren wth errors an the elements n teste crcuts have tolerance. Of course escrbe algorthm wll be evelope further, because t oes not stll concern all possble cases that can occur whle testng crcuts, for example: when all elements are n lmts of tolerance. Introuce algorthm wll be base for methos an algorthms for etecton of the sngle faults wth measurements at one frequency. The am of these methos s to be mplemente n algorthms for multfrequency measurements makng possble etecton any amount of faults n teste crcuts. Fgure 4. Dstance between ponts lyng on curves R an R as well as R an C3, an equally stant from the nomnal pont, n functon of stance from the nomnal pont R. Where: - stance n three-mensonal space, I - stance n plane REFERENCES [] MARTENS. G. Fault entyfcaton n electronc crcut wth the a of blnear transformaton, IEEE Trans. On Relablty, No, May 97, pp [] CATELANI M., FEDI G.,A fully automate measurent system for fault agnoss of analog electronc crcuts, XIV IMEKO Worl Congress, Tampere, Fnlan, June , Topc 0,CD- ROM [3] CZAJA Z., ROBOTYCKI A.,Dagnoss of lnear electronc systems usng neural network an blnear transformaton, IMEKO TC-4, Naples, Italy, September , Vol., pp [4] CZAJA Z. The parametrc fault etecton algorthm n electronc crcuts base on blnear transformaton, IMEKO TC-0, Wroc³aw, -4 September 999, pp [5] STARK M. Geometra analtyczna z wstepem o geometr welowymarowe, PWN Warszawa 974 AUTHOR: Char of Electronc Measurement, Faculty of Electroncs Telecommuncatons an Informatcs, Techncal Unversty of Gansk, ul. G. Narutowcza /, Gansk, Polan, Phone: Int , Fax Int , E-mal: zbczaa@pg.ga.pl
The Objective Function Value Optimization of Cloud Computing Resources Security
Open Journal of Optmzaton, 2015, 4, 40-46 Publshe Onlne June 2015 n ScRes. http://www.scrp.org/journal/ojop http://x.o.org/10.4236/ojop.2015.42005 The Objectve Functon Value Optmzaton of Clou Computng
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationAN APPLICATION OF THE TCRBF NEURAL NETWORK IN MULTI-NODE FAULT DIAGNOSIS METHOD
XIX IMEKO World Congress Fundamental and Appled Metrology September 6 11, 2009, Lsbon, Portugal AN APPLICATION OF THE TCRBF NEURAL NETWORK IN MULTI-NODE FAULT DIAGNOSIS METHOD Zbgnew Czaja 1, Mchał Kowalewsk
More informationLearning Depth from Single Still Images: Approximate Inference 1
Learnng Depth from Sngle Stll Images: Approxmate Inference 1 MS&E 211 course project Ashutosh Saxena, Ilya O. Ryzhov Channng Wong, Janln Wang June 7th, 2006 1 In ths report, Saxena, et. al. [1] somethng
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationProgramming Assignment Six. Semester Calendar. 1D Excel Worksheet Arrays. Review VBA Arrays from Excel. Programming Assignment Six May 2, 2017
Programmng Assgnment Sx, 07 Programmng Assgnment Sx Larry Caretto Mechancal Engneerng 09 Computer Programmng for Mechancal Engneers Outlne Practce quz for actual quz on Thursday Revew approach dscussed
More informationDistance based similarity measures of fuzzy sets
Johanyák, Z. C., Kovács S.: Dstance based smlarty measures of fuzzy sets, SAMI 2005, 3 rd Slovakan-Hungaran Jont Symposum on Appled Machne Intellgence, Herl'any, Slovaka, January 2-22 2005, ISBN 963 75
More informationDependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples
Australan Journal of Basc and Appled Scences, 4(10): 4609-4613, 2010 ISSN 1991-8178 Dependence of the Color Renderng Index on the Lumnance of Lght Sources and Munsell Samples 1 A. EL-Bally (Physcs Department),
More informationResearch Paper A UNIFIED FRAMEWORK FOR MULTI-OBJECTIVE TEST CASE PRIORITIZATION IN REGRESSION TESTING Lilly Raamesh
Research Paper A UNIFIED FRAMEWORK FOR MULTI-OBJECTIVE TEST CASE PRIORITIZATION IN REGRESSION TESTING Llly Raamesh Aress for Corresponence Department of I.T, St. Joseph s College of Engneerng, Ol Mamallapuram
More informationReversible Digital Watermarking
Reversble Dgtal Watermarkng Chang-Tsun L Department of Computer Scence Unversty of Warwck Multmea Securty an Forenscs 1 Reversble Watermarkng Base on Dfference Expanson (DE) In some mecal, legal an mltary
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationHarvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)
Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationK-means Clustering Algorithm in Projected Spaces
K-means Clusterng Algorthm n Projecte paces Alssar NAER, Dens HAMAD.A.. -U..C.O 50 rue F. Busson, BP 699, 68 Calas, France Emal: nasser@lasl.unv-lttoral.fr Chaban NAR ebanese Unversty E.F Rue Al-Arz, rpol
More informationSix-Band HDTV Camera System for Color Reproduction Based on Spectral Information
IS&T's 23 PICS Conference Sx-Band HDTV Camera System for Color Reproducton Based on Spectral Informaton Kenro Ohsawa )4), Hroyuk Fukuda ), Takeyuk Ajto 2),Yasuhro Komya 2), Hdeak Hanesh 3), Masahro Yamaguch
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationEXTENDED BIC CRITERION FOR MODEL SELECTION
IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7
More informationDESIGN OF VERTICAL ALIGNMET
DESIN OF VERTICAL ALINMET Longtudnal gradent : max 0,5% (max see the assgnment paper) Markng of longtudnal gradent n drecton of chanage: + [%].. ascent n the drecton of chanage [%].. descent n the drecton
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationA Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves
A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationSEMANTIC REGION LABELLING USING A POINT PATTERN ANALYSIS
6th European Sgnal Processng Conference (EUSIPCO 008), Lausanne, Swtzerlan, ugust 5-9, 008, copyrght by EURSIP SEMTIC REGIO LBELLIG USIG POIT PTTER LYSIS Sahb Bahroun, Za Belha, ozha Bouemaa École Supéreure
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationAn Economic Based-Approach for Library System Selection
An Economc Base-Approach for Lbrary System Selecton Yaha Zare Mehrjer Department of Inustral Engneerng, Yaz Unversty, Yaz, Iran ABSTRACT Purpose of ths paper: There are ways to rank compettve alternatves
More informationInvariant Shape Object Recognition Using B-Spline, Cardinal Spline, and Genetic Algorithm
Proceedngs of the 5th WSEAS Int. Conf. on Sgnal Processng, Robotcs and Automaton, Madrd, Span, February 5-7, 6 (pp4-45) Invarant Shape Obect Recognton Usng B-Splne, Cardnal Splne, and Genetc Algorthm PISIT
More informationToday Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints
Fourer Motzkn Elmnaton Logstcs HW10 due Frday Aprl 27 th Today Usng Fourer-Motzkn elmnaton for code generaton Usng Fourer-Motzkn elmnaton for determnng schedule constrants Unversty Fourer-Motzkn Elmnaton
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationSegmentation of 3D outdoor scenes using hierarchical clustering structure and perceptual grouping laws
Segmentaton of 3D outoor scenes usng herarchcal clusterng structure an perceptual groupng laws Yusheng Xu, Sebastan Tuttas, an Uwe Stlla Photogrammetry an Remote Sensng Technsche Unverstät München 80333
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationSegmentation in Echocardiographic Sequences Using Shape-Based Snake Model
Segmentaton n chocarographc Sequences Usng Shape-Base Snake Moel Chen Sheng 1, Yang Xn 1, Yao Lpng 2, an Sun Kun 2 1 Insttuton of Image Processng an Pattern Recognton, Shangha Jaotong Unversty, Shangha,
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationUnsupervised Classification Using Immune Algorithm
Internatonal Journal of Computer Applcatons (975 8887) Volume 2 o.7, June 2 Unsupervse Classfcaton Usng Immune Algorthm M.T. Al-Muallm Department of Computer Engneerng & Automaton, Faculty of Mechancal
More informationA new paradigm of fuzzy control point in space curve
MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr
More informationCorrelative features for the classification of textural images
Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationSimple March Tests for PSF Detection in RAM
Smple March Tests for PSF Detecton n RAM Ireneusz Mroze Balysto Techncal Unversty Computer Scence Department Wejsa 45A, 5-35 Balysto POLAND mroze@.pb.balysto.pl Eugena Buslowsa Balysto Techncal Unversty
More informationA comparative study of groundwater evapotranspiration functions
A comparatve stuy of grounwater evapotranspraton functons Y. F. Luo, S. Z. Peng, S. Khan, Y. L. Cu 3, Y. Wang, an Y. H. Feng 4 State Key Laboratory of Hyrology-Water Resources an Hyraulc Engneerng, Hoha
More informationLine Clipping by Convex and Nonconvex Polyhedra in E 3
Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More information5.0 Quality Assurance
5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationTwo Dimensional Projective Point Matching
Two Dmensonal Projectve Pont Matchng Jason Denton & J. Ross Beverdge Colorado State Unversty Computer Scence Department Ft. Collns, CO 80523 denton@cs.colostate.edu Abstract Pont matchng s the task of
More informationTWO-STEP CAMERA CALIBRATION METHOD DEVELOPED FOR MICRO UAV'S
The Internatonal Archves of the Photograetry, Remote Sensng an Spatal Informaton Scences, Volume XLI-B1, 16 XXIII ISPRS Congress, 1 19 July 16, Prague, Czech Republc TWO-STEP CAMERA CALIBRATION METHOD
More informationCOLOR HISTOGRAM SIMILARITY FOR ROBOT-ARM GUIDING
COLOR HITOGRAM IMILARITY FOR ROBOT-ARM GUIDING J.L. BUELER, J.P. URBAN, G. HERMANN, H. KIHL MIP, Unversté e Haute Alsace 68093 Mulhouse, France ABTRACT Ths paper evaluates the potental of color hstogram
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationA Multi-step Strategy for Shape Similarity Search In Kamon Image Database
A Mult-step Strategy for Shape Smlarty Search In Kamon Image Database Paul W.H. Kwan, Kazuo Torach 2, Kesuke Kameyama 2, Junbn Gao 3, Nobuyuk Otsu 4 School of Mathematcs, Statstcs and Computer Scence,
More informationFPGA-based implementation of circular interpolation
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 04, 6(7):585-593 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 FPGA-based mplementaton of crcular nterpolaton Mngyu Gao,
More informationForm-factors Josef Pelikán CGG MFF UK Praha.
Form-factors 1996-2016 Josef Pelkán CGG MFF UK Praha pepca@cgg.mff.cun.cz http://cgg.mff.cun.cz/~pepca/ FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 1 / 23 Form-factor F It ndcates the proporton
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationAn Efficient Scanning Pattern for Layered Manufacturing Processes
Proceengs of the 2 IEEE Internatonal Conference on Robotcs & Automaton Seoul, Korea May 2-26, 2 An Effcent Scannng Pattern for Layere Manufacturng Processes Y.Yang, J.Y.H Fuh 2, H.T.Loh 2 Department of
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationA Software Tool to Teach the Performance of Fuzzy IR Systems based on Weighted Queries
A Software Tool to Teach the Performance of Fuzzy IR Systems base on Weghte Queres Enrque Herrera-Vema 1, Sergo Alonso 1, Francsco J. Cabrerzo 1, Antono G. Lopez-Herrera 2, Carlos Porcel 3 1 Dept. of Computer
More informationCOMPUTER AIDED DIAGNOSIS IN MAMMOGRAPHY BASED ON FRACTAL ANALYSIS
Proc. of the 5th WSEAS Int. Conf. on Non-Lnear Analyss, Non-Lnear Systems an Chaos, Bucharest, Romana, October 16-18, 2006 39 COMPUTER AIDED DIAGNOSIS IN MAMMOGRAPHY BASED ON FRACTAL ANALYSIS DAN POPESCU,
More informationTopic 13: Radiometry. The Basic Light Transport Path
Topc 3: Raometry The bg pcture Measurng lght comng from a lght source Measurng lght fallng onto a patch: Irraance Measurng lght leavng a patch: Raance The Lght Transport Cycle The BrecAonal Reflectance
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationSliding-Windows Algorithm for B-spline Multiplication
Slng-Wnows Algorthm for B-splne Multplcaton Xanmng Chen School of Computng Unversty of Utah xchen@cs.utah.eu Rchar F. Resenfel School of Computng Unversty of Utah rfr@cs.utah.eu Elane Cohen School of Computng
More information